Peter Kirschenhofer

Publication Activity (10 Years)

Years Active: 1982-2015
Publications (10 Years): 1

Top Topics

Spatial Distribution

Top Venues

Publications

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