Rainer Kemp - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2003

On the representation of simply generated trees by leftist treesRainer Kemp. ejc, 24(5):581-605, 2003. [doi]

2001

On the Expected Number of Leftist Nodes in Simply Generated TreesRainer Kemp. jalc, 6(3):313-343, 2001.

1999

On Leftist Simply Generated TreesRainer Kemp. jalc, 4(4):313-332, 1999.

A One-to-One Correspondence Between a Class of Leftist Trees and Binary TreesRainer Kemp. ipl, 71(3-4):97-105, 1999. [doi]

1998

On the joint distribution of the nodes in uniform multidimensional binary treesRainer Kemp. rsa, 13(3-4):261-283, 1998.

On the Expected Number of Nodes at Level k in 0-balanced TreesRainer Kemp. STACS 1998: 566-576

Generating Words Lexicographically: An Average-Case AnalysisRainer Kemp. ACTA, 35(1):17-89, 1998. [doi]

1996

On the Average Minimal Prefix-Length of the Generalized Semi-DycklanguageRainer Kemp. ita, 30(6):545-561, 1996.

On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership ProblemRainer Kemp. jalc, 1(4):259-304, 1996.

Binary Search Trees Constructed from Nondistinct Keys with/without Specified ProbabilitiesRainer Kemp. TCS, 156(1&2):39-70, 1996. [doi]

1995

On the Inner Structure of Multidimensional Simply Generated TreesRainer Kemp. rsa, 6(2/3):121-146, 1995.

Uniformly Growing Backtrack TreesRainer Kemp. ita, 29(1):45-73, 1995.

1994

Balanced Ordered TreesRainer Kemp. rsa, 5(1):99-122, 1994.

1993

A Note on Two Classes of t-ary TreesRainer Kemp. eik, 29(3):167-174, 1993.

Random Multidimensional Binary TreesRainer Kemp. eik, 29(1):9-36, 1993.

Monotonically Labelled Ordered Trees and Multidimensional Binary TreesRainer Kemp. fct 1993: 329-341

1992

On the Stack Size of a Class of Backtrack TreesRainer Kemp. In Johannes Buchmann 0001, Harald Ganzinger, Wolfgang J. Paul, editors, Informatik, Festschrift zum 60. Geburtstag von Günter Hotz. Volume 1 of Teubner-Texte zur Informatik, pages 269-282, Teubner / Springer, 1992. [doi]

Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case BehaviorJohn W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp. AMAI, 6(1-3):185-200, 1992.

1989

A One-to-One Correspondence between two Classes of Ordered TreesRainer Kemp. ipl, 32(5):229-234, 1989.

The Expected Additive Weight of TreesRainer Kemp. ACTA, 26(8):711-740, 1989.

Binary Search Trees for d-dimensional KeysRainer Kemp. eik, 25(10):513-527, 1989.

On the Average Time Complexity of Set PartitioningEwald Speckenmeyer, Rainer Kemp. csl 1990: 369-381

1988

A Note on Precedence AnalysisRainer Kemp. eik, 24(9):401-413, 1988.

1987

A Note on the Number of Leftist TreesRainer Kemp. ipl, 25(4):227-232, 1987.

The Analysis of an Additive Weight of Random TreesRainer Kemp. eik, 23(10/11):517-528, 1987.

1985

Free cost measures of treesRainer Kemp. fct 1985: 175-190

1984

On a General Weight of TreesRainer Kemp. STACS 1984: 109-120

On a Decidability and Translation Result Concerning LR(0) GrammarsRainer Kemp. eik, 20(12):611-621, 1984.

Fundamentals of the average case analysis of particular algorithmsRainer Kemp. Wiley-Teubner series in computer science, Teubner, 1984. [doi]

1983

The Reduction of Binary Trees by Means of an Input-Restricted DequeRainer Kemp. ita, 17(3):249-284, 1983.

1981

:::: LR :::: (0) Grammars Generated by :::: LR :::: (0) ParsersRainer Kemp. ACTA, 15:265-280, 1981.

1980

A Note on the Stack Size of Regularly Distributed Binary TreesRainer Kemp. bit, 20(2):157-163, 1980.

A Note on the Density of Inherently Ambiguous Context-free LanguagesRainer Kemp. ACTA, 14:295-298, 1980.

The average height of r-typly rooted planted plane treesRainer Kemp. computing, 25(3):209-232, 1980. [doi]

1979

The average depth of a prefix of the Dycklanguage D Rainer Kemp. fct 1979: 230-236

The Average Number of Registers Needed to Evaluate a Binary Tree OptimallyRainer Kemp. ACTA, 11:363-372, 1979.

On the Average Stack Size of Regularly Distributed Binary TreesRainer Kemp. icalp 1979: 340-355

The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free GrammarRainer Kemp. iandc, 42(3):354-365, May 1979.

1975

Die Größe des zustandsminimalen LR(0)-AnalysatorsRainer Kemp. automata 1975: 223-232

1974

Mehrdeutigkeiten Kontextfreier GrammatikenRainer Kemp. icalp 1974: 534-546

1972

An Estimation of the Set of States of the Minimal LR(0)-AcceptorRainer Kemp. icalp 1972: 563-574

Die Grösse des minimalen Analysators einer kontextfreien GrammatikRainer Kemp. gi 1973: 99-106 [doi]

Sign in or sign up to see more results.

runs on WebDSL