On the recursion depth of special tree traversal algorithms
Information and Computation
A note on the number of leftist trees
Information Processing Letters
Random walks, Gaussian processes and list structures
Theoretical Computer Science
The analysis of an additive weight of random trees
Journal of Information Processing and Cybernetics
Journal of Information Processing and Cybernetics
A one-to-one correspondence between two classes of ordered trees
Information Processing Letters
The expected additive weight of trees
Acta Informatica
Binary search trees for d-dimensional keys
Journal of Information Processing and Cybernetics
On the number of deepest nodes in ordered trees
Discrete Mathematics
On the average time complexity of set partitioning
CSL '89 Proceedings of the third workshop on Computer science logic
Additive weights of a special class of nonuniformly distributed backtrack trees
Information Processing Letters
The random generation of directed animals
Theoretical Computer Science
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Binary search trees constructed from nondistinct keys with/without specified probabilities
Theoretical Computer Science
On the inner structure of multidimensional simply generated trees
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On the joint distribution of the nodes in uniform multidimensional binary trees
proceedings of the eighth international conference on Random structures and algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On leftist simply generated trees
Journal of Automata, Languages and Combinatorics
On programming of arithmetic operations
Communications of the ACM
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Fundamentals of the Average Case Analysis of Particular Algorithms
Fundamentals of the Average Case Analysis of Particular Algorithms
A generic approach for the unranking of labeled combinatorial classes
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Mehrdeutigkeiten Kontextfreier Grammatiken
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
On the Average Stack Size of Regularly Distributed Binary Trees
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
On the Expected Number of Nodes at Level k in 0-balanced Trees
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Die Größe des zustandsminimalen LR(0)-Analysators
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
FCT '85 Fundamentals of Computation Theory
Monotonically Labelled Ordered Trees and Multidimensional Binary Trees
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
On the representation of simply generated trees by leftist trees
European Journal of Combinatorics
| Hi-index | 5.23 |
This short note presents a summary of the scientific contributions of Rainer Kemp (1949-2004) in the area of discrete mathematics, combinatorial enumeration, and analysis of algorithms. A complete bibliography of Kemp's publications is included.