Die Grösse des minimalen Analysators einer kontextfreien Grammatik. - Rainer Kemp (GI Jahrestagung, 1972)

An Estimation of the Set of States of the Minimal LR(0)-Acceptor. - Rainer Kemp (ICALP, 1972)

Mehrdeutigkeiten Kontextfreier Grammatiken. - Rainer Kemp (ICALP, 1974)

Die Größe des zustandsminimalen LR(0)-Analysators. - Rainer Kemp (Automata Theory and Formal Languages, 1975)

The average depth of a prefix of the Dycklanguage D$. - Rainer Kemp (FCT, 1979)

On the Average Stack Size of Regularly Distributed Binary Trees. - Rainer Kemp (ICALP, 1979)

The Average Number of Registers Needed to Evaluate a Binary Tree Optimally. - Rainer Kemp (Acta Informatica, 1979)

The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar - Rainer Kemp (Inf. Control., 1979)

A Note on the Density of Inherently Ambiguous Context-free Languages. - Rainer Kemp (Acta Informatica, 1980)

A Note on the Stack Size of Regularly Distributed Binary Trees. - Rainer Kemp (BIT, 1980)

The average height of r-typly rooted planted plane trees. - Rainer Kemp (Computing, 1980)

LR (0) Grammars Generated by LR (0) Parsers. - Rainer Kemp (Acta Informatica, 1981)

The Reduction of Binary Trees by Means of an Input-Restricted Deque. - Rainer Kemp (RAIRO Theor. Informatics Appl., 1983)

Fundamentals of the average case analysis of particular algorithms. - Rainer Kemp (Teubner, 1984)

On a General Weight of Trees. - Rainer Kemp (STACS, 1984)

On a Decidability and Translation Result Concerning LR(0) Grammars. - Rainer Kemp (J. Inf. Process. Cybern., 1984)

Free cost measures of trees. - Rainer Kemp (FCT, 1985)

The Analysis of an Additive Weight of Random Trees. - Rainer Kemp (J. Inf. Process. Cybern., 1987)

A Note on the Number of Leftist Trees. - Rainer Kemp (Inf. Process. Lett., 1987)

A Note on Precedence Analysis. - Rainer Kemp (J. Inf. Process. Cybern., 1988)

On the Average Time Complexity of Set Partitioning. - Ewald Speckenmeyer; Rainer Kemp (CSL, 1989)

The Expected Additive Weight of Trees. - Rainer Kemp (Acta Informatica, 1989)

Binary Search Trees for d-dimensional Keys. - Rainer Kemp (J. Inf. Process. Cybern., 1989)

A One-to-One Correspondence between two Classes of Ordered Trees. - Rainer Kemp (Inf. Process. Lett., 1989)

On the Stack Size of a Class of Backtrack Trees. - Rainer Kemp (Informatik, 1992)

Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. - John W. Rosenthal; Ewald Speckenmeyer; Rainer Kemp (Ann. Math. Artif. Intell., 1992)

Monotonically Labelled Ordered Trees and Multidimensional Binary Trees. - Rainer Kemp (FCT, 1993)

Random Multidimensional Binary Trees. - Rainer Kemp (J. Inf. Process. Cybern., 1993)

A Note on Two Classes of t-ary Trees. - Rainer Kemp (J. Inf. Process. Cybern., 1993)

Balanced Ordered Trees. - Rainer Kemp (Random Struct. Algorithms, 1994)

Uniformly Growing Backtrack Trees. - Rainer Kemp (RAIRO Theor. Informatics Appl., 1995)

On the Inner Structure of Multidimensional Simply Generated Trees. - Rainer Kemp (Random Struct. Algorithms, 1995)

On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage. - Rainer Kemp (RAIRO Theor. Informatics Appl., 1996)

On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem. - Rainer Kemp (J. Autom. Lang. Comb., 1996)

Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities. - Rainer Kemp (Theor. Comput. Sci., 1996)

On the Expected Number of Nodes at Level k in 0-balanced Trees. - Rainer Kemp (STACS, 1998)

Generating Words Lexicographically: An Average-Case Analysis. - Rainer Kemp (Acta Informatica, 1998)

On the joint distribution of the nodes in uniform multidimensional binary trees. - Rainer Kemp (Random Struct. Algorithms, 1998)

A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees. - Rainer Kemp (Inf. Process. Lett., 1999)

On Leftist Simply Generated Trees. - Rainer Kemp (J. Autom. Lang. Comb., 1999)

On the Expected Number of Leftist Nodes in Simply Generated Trees. - Rainer Kemp (J. Autom. Lang. Comb., 2001)

On the representation of simply generated trees by leftist trees. - Rainer Kemp (Eur. J. Comb., 2003)