According to our database1, Peter Kirschenhofer authored at least 31 papers between 1982 and 2004.
Legend:Book In proceedings Article PhD thesis Other
Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields.
J. Symb. Comput., 2004
Diophantine equations between polynomials obeying second order recurrences.
Periodica Mathematica Hungarica, 2003
Combinatorial and Arithmetical Properties of Linear Numeration Systems.
Comparisons in Hoare's Find Algorithm.
Combinatorics, Probability & Computing, 1998
Analysis of Hoare's FIND algorithm with Median-of-three partition.
Random Struct. Algorithms, 1997
Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms, 1996
A note on alternating sums.
Electr. J. Comb., 1996
Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci., 1995
Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci., 1994
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput., 1994
Multidimensional Digital Searching-Alternative Data Structures.
Random Struct. Algorithms, 1994
The Path Length of Random Skip Lists.
Acta Inf., 1994
Multidimensional Digital Searching and Some New Parameters in Tries.
Int. J. Found. Comput. Sci., 1993
A result in order statistics related to probabilistic counting.
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.
Theor. Comput. Sci., 1992
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
On Generalized Independent Subsets of Trees.
Random Struct. Algorithms, 1991
Approximate counting: an alternative approach.
On the Balance Property of Patricia Tries: External Path Length Viewpoint.
Theor. Comput. Sci., 1989
On the variance of the external path length in a symmetric digital trie.
Discrete Applied Mathematics, 1989
Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress, 1989
Further Results on Digital Search Trees.
Theor. Comput. Sci., 1988
Do We Really Need to Balance Patricia Trees? (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
On the Recursive Depth of Special Tree Traversal Algorithms
Inf. Comput., July, 1987
Two selection problems revisited.
J. Comb. Theory, Ser. A, 1986
Some Further Results on Digital Search Trees.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986
A short proof for a partition identity of Hwang and Wei.
Discrete Mathematics, 1984
On the average shape of monotonically labelled tree structures.
Discrete Applied Mathematics, 1984
Recursion Depth Analysis for Specail Tree Traversal Algorithms.
Proceedings of the Automata, 1984
On the average shape of simply generated families of trees.
Journal of Graph Theory, 1983
On the average hyperoscillations of planted plane trees.