Rainer Kemp

According to our database1, Rainer Kemp
  • authored at least 41 papers between 1972 and 2003.
  • has a "Dijkstra number"2 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2003
On the representation of simply generated trees by leftist trees.
Eur. J. Comb., 2003

2001
On the Expected Number of Leftist Nodes in Simply Generated Trees.
Journal of Automata, Languages and Combinatorics, 2001

1999
On Leftist Simply Generated Trees.
Journal of Automata, Languages and Combinatorics, 1999

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

1998
On the joint distribution of the nodes in uniform multidimensional binary trees.
Random Struct. Algorithms, 1998

Generating Words Lexicographically: An Average-Case Analysis.
Acta Inf., 1998

On the Expected Number of Nodes at Level k in 0-balanced Trees.
Proceedings of the STACS 98, 1998

1996
Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities.
Theor. Comput. Sci., 1996

On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem.
Journal of Automata, Languages and Combinatorics, 1996

On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage.
ITA, 1996

1995
On the Inner Structure of Multidimensional Simply Generated Trees.
Random Struct. Algorithms, 1995

Uniformly Growing Backtrack Trees.
ITA, 1995

1994
Balanced Ordered Trees.
Random Struct. Algorithms, 1994

1993
A Note on Two Classes of t-ary Trees.
Elektronische Informationsverarbeitung und Kybernetik, 1993

Random Multidimensional Binary Trees.
Elektronische Informationsverarbeitung und Kybernetik, 1993

Monotonically Labelled Ordered Trees and Multidimensional Binary Trees.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior.
Ann. Math. Artif. Intell., 1992

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

Binary Search Trees for d-dimensional Keys.
Elektronische Informationsverarbeitung und Kybernetik, 1989

The Expected Additive Weight of Trees.
Acta Inf., 1989

On the Average Time Complexity of Set Partitioning.
Proceedings of the CSL '89, 1989

1988
A Note on Precedence Analysis.
Elektronische Informationsverarbeitung und Kybernetik, 1988

1987
A Note on the Number of Leftist Trees.
Inf. Process. Lett., 1987

The Analysis of an Additive Weight of Random Trees.
Elektronische Informationsverarbeitung und Kybernetik, 1987

1985
Free cost measures of trees.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
On a Decidability and Translation Result Concerning LR(0) Grammars.
Elektronische Informationsverarbeitung und Kybernetik, 1984

On a General Weight of Trees.
Proceedings of the STACS 84, 1984

Fundamentals of the average case analysis of particular algorithms.
Wiley-Teubner series in computer science, Teubner, ISBN: 0471903221, 1984

1983
The Reduction of Binary Trees by Means of an Input-Restricted Deque.
ITA, 1983

1981
LR (0) Grammars Generated by LR (0) Parsers.
Acta Inf., 1981

1980
The average height of r-typly rooted planted plane trees.
Computing, 1980

A Note on the Stack Size of Regularly Distributed Binary Trees.
BIT, 1980

A Note on the Density of Inherently Ambiguous Context-free Languages.
Acta Inf., 1980

1979
The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar
Information and Control, May, 1979

The Average Number of Registers Needed to Evaluate a Binary Tree Optimally.
Acta Inf., 1979

On the Average Stack Size of Regularly Distributed Binary Trees.
Proceedings of the Automata, 1979

The average depth of a prefix of the Dycklanguage D$.
FCT, 1979

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

1974
Mehrdeutigkeiten Kontextfreier Grammatiken.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

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

Die Grösse des minimalen Analysators einer kontextfreien Grammatik.
Proceedings of the Gesellschaft für Informatik e.V., 1972


  Loading...