Peter Kirschenhofer

发表

Comparisons in Hoare's Find Algorithm

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1998, Combinatorics, Probability and Computing.

Analysis of an Optimized Search Algorithm for Skip Lists

Helmut Prodinger, Conrado Martínez, Peter Kirschenhofer, 1995, Theor. Comput. Sci..

Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1992, Theor. Comput. Sci..

Combinatorial and Arithmetical Properties of Linear Numeration Systems

Robert F. Tichy, Peter J. Grabner, Peter Kirschenhofer, 2002, Comb..

Average Case Analysis of Algorithms - Some Examples

Peter Kirschenhofer, 1998 .

Do We Really Need to Balance Patricia Trees? (Extended Abstract)

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1988, International Colloquium on Automata, Languages and Programming.

On Generalized Independent Subsets of Trees

Michael Drmota, Peter Kirschenhofer, M. Drmota, 2007, Random Struct. Algorithms.

Analysis of a splitting process arising in probabilistic counting and other related algorithms

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1996, Random Struct. Algorithms.

Approximate counting: an alternative approach

Helmut Prodinger, Peter Kirschenhofer, 1991, RAIRO Theor. Informatics Appl..

Digital Search Trees Again Revisited: The Internal Path Length Perspective

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1994, SIAM J. Comput..

A result in order statistics related to probabilistic counting

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1993, Computing.

A Number Theoretic Problem on the Distribution of Polynomials With Bounded Roots

Peter Kirschenhofer, Mario Weitzer, 2015, Integers.

On the variance of the external path length in a symmetric digital trie

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989, Discret. Appl. Math..

On the Recursive Depth of Special Tree Traversal Algorithms

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1987, Inf. Comput..

A short proof for a partition identity of Hwang and Wei

Helmut Prodinger, Peter Kirschenhofer, 1984, Discret. Math..

Some Further Results on Digital Search Trees

Helmut Prodinger, Peter Kirschenhofer, 1986, ICALP.

Mellin Transforms and Asymptotics: Digital Sums

Helmut Prodinger, Philippe Flajolet, Robert F. Tichy, 1994, Theor. Comput. Sci..

Analysis of Hoare's FIND algorithm with Median-of-three partition

Helmut Prodinger, Conrado Martínez, Peter Kirschenhofer, 1997, Random Struct. Algorithms.

Einführung in die Mathematik für Informatiker

Peter Kirschenhofer, Gerd Baron, 1989 .

Digital Search Trees - Further Results on a Fundamental Data Structure

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989, IFIP Congress.

Multidimensional Digital Searching and Some New Parameters in Tries

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1993, Int. J. Found. Comput. Sci..

The path length of random skip lists

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1994, Acta Informatica.

Multidimensional Digital Searching-Alternative Data Structures

Helmut Prodinger, Peter Kirschenhofer, 1994, Random Struct. Algorithms.

Diophantine equations between polynomials obeying second order recurrences

Peter Kirschenhofer, Oliver Pfeiffer, P. Kirschenhofer, 2003, Period. Math. Hung..

On the Balance Property of Patricia Tries: External Path Length Viewpoint

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989, Theor. Comput. Sci..

Two selection problems revisited

Helmut Prodinger, Peter Kirschenhofer, 1986, J. Comb. Theory, Ser. A.

Further Results on Digital Search Trees

Helmut Prodinger, Peter Kirschenhofer, 1988, Theor. Comput. Sci..

Recursion Depth Analysis for Specail Tree Traversal Algorithms

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1984, ICALP.

On the analysis of probabilistic counting

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1990 .

On the average hyperoscillations of planted plane trees

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1982, Comb..

Generalized Catalan sequences originating from the analysis of special data structures

Johann Blieberger, Peter Kirschenhofer, P. Kirschenhofer, 2014 .

Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields

Jörg M. Thuswaldner, Peter Kirschenhofer, 2004, J. Symb. Comput..

ONTHEVARIANCEOFTHEEXTERNALPATHLENGTHIN A SYMMETRIC DIGITAL TRlE

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989 .

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1992, ICALP.

On the average shape of monotonically labelled tree structures

Peter Kirschenhofer, P. Kirschenhofer, 1984, Discret. Appl. Math..

A note on alternating sums

Peter Kirschenhofer, P. Kirschenhofer, 1995, Electron. J. Comb..

On the average shape of simply generated families of trees

Peter Kirschenhofer, 1983, J. Graph Theory.

Do we really need to balance patricia tries

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1988 .

Analysis of a splitting process arising in probabilistic counting and other related algorithms

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1996 .

On the Variance of the External Path Length in a Binary Digital Trie

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1987 .

Diophantine Equations and Bernoulli Polynomials

Robert F. Tichy, Peter Kirschenhofer, Andrzej Schinzel, 2002, Compositio Mathematica.

THE HIGHER MOMENTS OF THE NUMBER OF RETURNS OF A SIMPLE RANDOM WALK

Helmut Prodinger, Peter Kirschenhofer, 1994 .

Shift radix systems for Gaussian integers and Pethó's Loudspeaker

Jörg M. Thuswaldner, Peter Kirschenhofer, Horst Brunotte, 2011 .

Deviations from uniformity in random strings

Philippe Flajolet, Robert F. Tichy, Peter Kirschenhofer, 1988 .

FIBONACCI NUMBERS OF GRAPHS: II

Helmut Prodinger, Robert F. Tichy, Peter Kirschenhofer, 1983 .

Subblock Occurrences in Positional Number Systems and Gray code Representation

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1984 .

Fibonacci Numbers of Graphs III: Planted Plane Trees

Helmut Prodinger, Robert F. Tichy, Peter Kirschenhofer, 1986 .

A coin tossing algorithm for counting large numbers of events

Helmut Prodinger, Peter Kirschenhofer, 1992 .

Subblock Occurrences in the q-Ary Representation of n

Peter Kirschenhofer, 1983 .