Peter Kirschenhofer

Mario Weitzer

Integers, 2015

2004

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

[BibT_eX]

[DOI]

Jörg M. Thuswaldner

J. Symb. Comput., 2004

2003

Diophantine equations between polynomials obeying second order recurrences.

[BibT_eX]

[DOI]

Oliver Pfeiffer

Period. Math. Hung., 2003

2002

Combinatorial and Arithmetical Properties of Linear Numeration Systems.

[BibT_eX]

[DOI]

Peter J. Grabner

Robert F. Tichy

Comb., 2002

1998

Comparisons in Hoare's Find Algorithm.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

1997

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

[BibT_eX]

[DOI]

Conrado Martinez

Random Struct. Algorithms, 1997

1996

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

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

A note on alternating sums.

[BibT_eX]

[DOI]

Electron. J. Comb., 1996

1995

Analysis of an Optimized Search Algorithm for Skip Lists.

[BibT_eX]

[DOI]

Conrado Martinez

Theor. Comput. Sci., 1995

1994

Mellin Transforms and Asymptotics: Digital Sums.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Digital Search Trees Again Revisited: The Internal Path Length Perspective.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Multidimensional Digital Searching-Alternative Data Structures.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

The Path Length of Random Skip Lists.

[BibT_eX]

[DOI]

Acta Informatica, 1994

1993

Multidimensional Digital Searching and Some New Parameters in Tries.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

A result in order statistics related to probabilistic counting.

[BibT_eX]

[DOI]

Computing, 1993

1992

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

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

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

On Generalized Independent Subsets of Trees.

[BibT_eX]

[DOI]

Michael Drmota

Random Struct. Algorithms, 1991

Approximate counting: an alternative approach.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1991

1989

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

Digital Search Trees - Further Results on a Fundamental Data Structure.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Further Results on Digital Search Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

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

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

On the Recursive Depth of Special Tree Traversal Algorithms

[BibT_eX]

[DOI]

Inf. Comput., July, 1987

1986

Two selection problems revisited.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

Some Further Results on Digital Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984

A short proof for a partition identity of Hwang and Wei.

[BibT_eX]

[DOI]

Discret. Math., 1984

On the average shape of monotonically labelled tree structures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

Recursion Depth Analysis for Specail Tree Traversal Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

On the average shape of simply generated families of trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

1982

On the average hyperoscillations of planted plane trees.

[BibT_eX]

[DOI]