Peter Kirschenhofer

32 papers A* 4Journal 27Unranked 1
YearRankTypeTitle / Venue / Authors
2015 J jnl
A Number Theoretic Problem on the Distribution of Polynomials With Bounded Roots.
Integers
Peter Kirschenhofer, Mario Weitzer
2004 J jnl
Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields.
J. Symb. Comput.
Peter Kirschenhofer, Jörg M. Thuswaldner
2003 J jnl
Diophantine equations between polynomials obeying second order recurrences.
Period. Math. Hung.
Peter Kirschenhofer, Oliver Pfeiffer
2002 J jnl
Combinatorial and Arithmetical Properties of Linear Numeration Systems.
Comb.
Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy
1998 J jnl
Comparisons in Hoare's Find Algorithm.
Comb. Probab. Comput.
Peter Kirschenhofer, Helmut Prodinger
1997 J jnl
Analysis of Hoare's FIND algorithm with Median-of-three partition.
Random Struct. Algorithms
Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez
1996 J jnl
A note on alternating sums.
Electron. J. Comb.
Peter Kirschenhofer
1996 J jnl
Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1995 J jnl
Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci.
Peter Kirschenhofer, Conrado Martinez, Helmut Prodinger
1994 J jnl
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1994 J jnl
Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci.
Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy
1994 J jnl
Multidimensional Digital Searching-Alternative Data Structures.
Random Struct. Algorithms
Peter Kirschenhofer, Helmut Prodinger
1994 J jnl
The Path Length of Random Skip Lists.
Acta Informatica
Peter Kirschenhofer, Helmut Prodinger
1993 J jnl
A result in order statistics related to probabilistic counting.
Computing
Peter Kirschenhofer, Helmut Prodinger
1993 J jnl
Multidimensional Digital Searching and Some New Parameters in Tries.
Int. J. Found. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992 A* conf
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.
ICALP
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992 J jnl
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.
Theor. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1991 J jnl
Approximate counting: an alternative approach.
RAIRO Theor. Informatics Appl.
Peter Kirschenhofer, Helmut Prodinger
1991 J jnl
On Generalized Independent Subsets of Trees.
Random Struct. Algorithms
Michael Drmota, Peter Kirschenhofer
1989 — conf
Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989 J jnl
On the Balance Property of Patricia Tries: External Path Length Viewpoint.
Theor. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989 J jnl
On the variance of the external path length in a symmetric digital trie.
Discret. Appl. Math.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1988 A* conf
Do We Really Need to Balance Patricia Trees? (Extended Abstract).
ICALP
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1988 J jnl
Further Results on Digital Search Trees.
Theor. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger
1987 J jnl
On the Recursive Depth of Special Tree Traversal Algorithms
Inf. Comput.
Peter Kirschenhofer, Helmut Prodinger
1986 A* conf
Some Further Results on Digital Search Trees.
ICALP
Peter Kirschenhofer, Helmut Prodinger
1986 J jnl
Two selection problems revisited.
J. Comb. Theory A
Peter Kirschenhofer, Helmut Prodinger
1984 J jnl
A short proof for a partition identity of Hwang and Wei.
Discret. Math.
Peter Kirschenhofer, Helmut Prodinger
1984 J jnl
On the average shape of monotonically labelled tree structures.
Discret. Appl. Math.
Peter Kirschenhofer
1984 A* conf
Recursion Depth Analysis for Specail Tree Traversal Algorithms.
ICALP
Peter Kirschenhofer, Helmut Prodinger
1983 J jnl
On the average shape of simply generated families of trees.
J. Graph Theory
Peter Kirschenhofer
1982 J jnl
On the average hyperoscillations of planted plane trees.
Comb.
Peter Kirschenhofer, Helmut Prodinger