Rainer Kemp

41 papers A* 3A 2B 4Journal 28Unranked 2
YearRankTypeTitle / Venue / Authors
2003 J jnl
On the representation of simply generated trees by leftist trees.
Eur. J. Comb.
Rainer Kemp
2001 J jnl
On the Expected Number of Leftist Nodes in Simply Generated Trees.
J. Autom. Lang. Comb.
Rainer Kemp
1999 J jnl
A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees.
Inf. Process. Lett.
Rainer Kemp
1999 J jnl
On Leftist Simply Generated Trees.
J. Autom. Lang. Comb.
Rainer Kemp
1998 J jnl
Generating Words Lexicographically: An Average-Case Analysis.
Acta Informatica
Rainer Kemp
1998 A conf
On the Expected Number of Nodes at Level k in 0-balanced Trees.
STACS
Rainer Kemp
1998 J jnl
On the joint distribution of the nodes in uniform multidimensional binary trees.
Random Struct. Algorithms
Rainer Kemp
1996 J jnl
Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities.
Theor. Comput. Sci.
Rainer Kemp
1996 J jnl
On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem.
J. Autom. Lang. Comb.
Rainer Kemp
1996 J jnl
On the Average Minimal Prefix-Length of the Generalized Semi-Dycklanguage.
RAIRO Theor. Informatics Appl.
Rainer Kemp
1995 J jnl
On the Inner Structure of Multidimensional Simply Generated Trees.
Random Struct. Algorithms
Rainer Kemp
1995 J jnl
Uniformly Growing Backtrack Trees.
RAIRO Theor. Informatics Appl.
Rainer Kemp
1994 J jnl
Balanced Ordered Trees.
Random Struct. Algorithms
Rainer Kemp
1993 J jnl
A Note on Two Classes of t-ary Trees.
J. Inf. Process. Cybern.
Rainer Kemp
1993 B conf
Monotonically Labelled Ordered Trees and Multidimensional Binary Trees.
FCT
Rainer Kemp
1993 J jnl
Random Multidimensional Binary Trees.
J. Inf. Process. Cybern.
Rainer Kemp
1992 J jnl
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior.
Ann. Math. Artif. Intell.
John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp
1992 — ch.
On the Stack Size of a Class of Backtrack Trees.
Informatik
Rainer Kemp
1989 J jnl
A One-to-One Correspondence between two Classes of Ordered Trees.
Inf. Process. Lett.
Rainer Kemp
1989 J jnl
Binary Search Trees for d-dimensional Keys.
J. Inf. Process. Cybern.
Rainer Kemp
1989 B conf
On the Average Time Complexity of Set Partitioning.
CSL
Ewald Speckenmeyer, Rainer Kemp
1989 J jnl
The Expected Additive Weight of Trees.
Acta Informatica
Rainer Kemp
1988 J jnl
A Note on Precedence Analysis.
J. Inf. Process. Cybern.
Rainer Kemp
1987 J jnl
A Note on the Number of Leftist Trees.
Inf. Process. Lett.
Rainer Kemp
1987 J jnl
The Analysis of an Additive Weight of Random Trees.
J. Inf. Process. Cybern.
Rainer Kemp
1985 B conf
Free cost measures of trees.
FCT
Rainer Kemp
1984 — book
Fundamentals of the average case analysis of particular algorithms.
Rainer Kemp
1984 J jnl
On a Decidability and Translation Result Concerning LR(0) Grammars.
J. Inf. Process. Cybern.
Rainer Kemp
1984 A conf
On a General Weight of Trees.
STACS
Rainer Kemp
1983 J jnl
The Reduction of Binary Trees by Means of an Input-Restricted Deque.
RAIRO Theor. Informatics Appl.
Rainer Kemp
1980 J jnl
A Note on the Density of Inherently Ambiguous Context-free Languages.
Acta Informatica
Rainer Kemp
1980 J jnl
A Note on the Stack Size of Regularly Distributed Binary Trees.
BIT
Rainer Kemp
1980 J jnl
The average height of r-typly rooted planted plane trees.
Computing
Rainer Kemp
1979 A* conf
On the Average Stack Size of Regularly Distributed Binary Trees.
ICALP
Rainer Kemp
1979 J jnl
The Average Number of Registers Needed to Evaluate a Binary Tree Optimally.
Acta Informatica
Rainer Kemp
1979 J jnl
The Average Stack Size of a Derivation Tree Generated by a Linear Context-Free Grammar
Inf. Control.
Rainer Kemp
1979 B conf
The average depth of a prefix of the Dycklanguage D$.
FCT
Rainer Kemp
1975 — conf
Die Größe des zustandsminimalen LR(0)-Analysators.
Automata Theory and Formal Languages
Rainer Kemp
1974 A* conf
Mehrdeutigkeiten Kontextfreier Grammatiken.
ICALP
Rainer Kemp
1972 A* conf
An Estimation of the Set of States of the Minimal LR(0)-Acceptor.
ICALP
Rainer Kemp
1972 — conf
Die Grösse des minimalen Analysators einer kontextfreien Grammatik.
GI Jahrestagung
Rainer Kemp