We stand with Ukraine  

Rainer Kemp

According to our database1, Rainer Kemp authored at least 42 papers between 1972 and 2003.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
On the representation of simply generated trees by leftist trees.
[BibTeX]
[DOI]
Rainer Kemp
Eur. J. Comb., 2003

2001
On the Expected Number of Leftist Nodes in Simply Generated Trees.
[BibTeX]
[DOI]
Rainer Kemp
J. Autom. Lang. Comb., 2001

1999
On Leftist Simply Generated Trees.
[BibTeX]
[DOI]
Rainer Kemp
J. Autom. Lang. Comb., 1999

A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees.
[BibTeX]
[DOI]
Rainer Kemp
Inf. Process. Lett., 1999

1998
On the joint distribution of the nodes in uniform multidimensional binary trees.
[BibTeX]
[DOI]
Rainer Kemp
Random Struct. Algorithms, 1998

Generating Words Lexicographically: An Average-Case Analysis.
[BibTeX]
[DOI]
Rainer Kemp
Acta Informatica, 1998

On the Expected Number of Nodes at Level k in 0-balanced Trees.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the STACS 98, 1998

1996
Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities.
[BibTeX]
[DOI]
Rainer Kemp
Theor. Comput. Sci., 1996

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

On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage.
[BibTeX]
[DOI]
Rainer Kemp
RAIRO Theor. Informatics Appl., 1996

1995
On the Inner Structure of Multidimensional Simply Generated Trees.
[BibTeX]
[DOI]
Rainer Kemp
Random Struct. Algorithms, 1995

Uniformly Growing Backtrack Trees.
[BibTeX]
[DOI]
Rainer Kemp
RAIRO Theor. Informatics Appl., 1995

1994
Balanced Ordered Trees.
[BibTeX]
[DOI]
Rainer Kemp
Random Struct. Algorithms, 1994

1993
A Note on Two Classes of t-ary Trees.
[BibTeX]
Rainer Kemp
J. Inf. Process. Cybern., 1993

Random Multidimensional Binary Trees.
[BibTeX]
Rainer Kemp
J. Inf. Process. Cybern., 1993

Monotonically Labelled Ordered Trees and Multidimensional Binary Trees.
[BibTeX]
[DOI]
Rainer Kemp
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.
[BibTeX]
[DOI]
John W. Rosenthal
,
Ewald Speckenmeyer
,
Rainer Kemp
Ann. Math. Artif. Intell., 1992

On the Stack Size of a Class of Backtrack Trees.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1989
A One-to-One Correspondence between two Classes of Ordered Trees.
[BibTeX]
[DOI]
Rainer Kemp
Inf. Process. Lett., 1989

Binary Search Trees for d-dimensional Keys.
[BibTeX]
Rainer Kemp
J. Inf. Process. Cybern., 1989

The Expected Additive Weight of Trees.
[BibTeX]
[DOI]
Rainer Kemp
Acta Informatica, 1989

On the Average Time Complexity of Set Partitioning.
[BibTeX]
[DOI]
Ewald Speckenmeyer
,
Rainer Kemp
Proceedings of the CSL '89, 1989

1988
A Note on Precedence Analysis.
[BibTeX]
Rainer Kemp
J. Inf. Process. Cybern., 1988

1987
A Note on the Number of Leftist Trees.
[BibTeX]
[DOI]
Rainer Kemp
Inf. Process. Lett., 1987

The Analysis of an Additive Weight of Random Trees.
[BibTeX]
Rainer Kemp
J. Inf. Process. Cybern., 1987

1985
Free cost measures of trees.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the Fundamentals of Computation Theory, 1985

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

On a General Weight of Trees.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the STACS 84, 1984

Fundamentals of the average case analysis of particular algorithms.
[BibTeX]
[DOI]
Rainer Kemp
Wiley-Teubner series in computer science, Teubner, ISBN: 0471903221, 1984

1983
The Reduction of Binary Trees by Means of an Input-Restricted Deque.
[BibTeX]
[DOI]
Rainer Kemp
RAIRO Theor. Informatics Appl., 1983

1981
<i> LR </i> (0) Grammars Generated by <i> LR </i> (0) Parsers.
[BibTeX]
[DOI]
Rainer Kemp
Acta Informatica, 1981

1980
The average height of r-typly rooted planted plane trees.
[BibTeX]
[DOI]
Rainer Kemp
Computing, 1980

A Note on the Stack Size of Regularly Distributed Binary Trees.
[BibTeX]
[DOI]
Rainer Kemp
BIT, 1980

A Note on the Density of Inherently Ambiguous Context-free Languages.
[BibTeX]
[DOI]
Rainer Kemp
Acta Informatica, 1980

1979
The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar
[BibTeX]
[DOI]
Rainer Kemp
Inf. Control., May, 1979

The Average Number of Registers Needed to Evaluate a Binary Tree Optimally.
[BibTeX]
[DOI]
Rainer Kemp
Acta Informatica, 1979

On the Average Stack Size of Regularly Distributed Binary Trees.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the Automata, 1979

The average depth of a prefix of the Dycklanguage D$.
[BibTeX]
Rainer Kemp
Proceedings of the Fundamentals of Computation Theory, 1979

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

1974
Mehrdeutigkeiten Kontextfreier Grammatiken.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1972
An Estimation of the Set of States of the Minimal LR(0)-Acceptor.
[BibTeX]
Rainer Kemp
Proceedings of the Automata, 1972

Die Grösse des minimalen Analysators einer kontextfreien Grammatik.
[BibTeX]
[DOI]
Rainer Kemp
Proceedings of the Gesellschaft für Informatik e.V., 1972


  Loading...