Helmut Prodinger
Helmut Prodinger
Verified email at sun.ac.za
TitleCited byYear
Fibonacci numbers of graphs
H Prodinger, R Tichy
The Fibonacci Quarterly 20 (1), 16-21, 1982
2661982
Mellin transforms and asymptotics: digital sums
P Flajolet, P Grabner, P Kirschenhofer, H Prodinger, RF Tichy
Theoretical Computer Science 123 (2), 291-314, 1994
1681994
Spanning tree formulas and Chebyshev polynomials
FT Boesch, H Prodinger
Graphs and Combinatorics 2 (1), 191-200, 1986
1021986
How to select a loser
H Prodinger
Discrete Mathematics 120 (1-3), 149-159, 1993
1001993
On Ramanujan's Q-function
P Flajolet, PJ Grabner, P Kirschenhofer, H Prodinger
Journal of Computational and Applied Mathematics 58 (1), 103-116, 1995
951995
Combinatorics of geometrically distributed random variables: Left-to-right maxima
H Prodinger
Discrete Mathematics 153 (1-3), 253-270, 1996
771996
The path length of random skip lists
P Kirschenhofer, H Prodinger
Acta Informatica 31 (8), 775-792, 1994
751994
On the variance of the external path length in a symmetric digital trie
P Kirschenhofer, H Prodinger, W Szpankowski
Discrete Applied Mathematics 25 (1-2), 129-143, 1989
681989
Analysis of Hoare's FIND algorithm with Median‐of‐three partition
P Kirschenhofer, H Prodinger, C Martinez
Random Structures & Algorithms 10 (1‐2), 143-156, 1997
641997
On Carlitz compositions
A Knopfmacher, H Prodinger
European Journal of Combinatorics 19 (5), 579-589, 1998
631998
Level number sequences for trees
P Flajolet, H Prodinger
Discrete mathematics 65 (2), 149-156, 1987
621987
Digital search trees again revisited: The internal path length perspective
P Kirschenhofer, H Prodinger, W Szpankowski
SIAM Journal on Computing 23 (3), 598-616, 1994
551994
The kernel method: a collection of examples
H Prodinger
Sém. Lothar. Combin 50, B50f, 2004
542004
Comparisons in Hoare's Find algorithm
P Kirschenhofer, H Prodinger
Combinatorics, Probability and Computing 7 (1), 111-120, 1998
531998
A result in order statistics related to probabilistic counting
P Kirschenhofer, H Prodinger
Computing 51 (1), 15-27, 1993
511993
On some applications of formulae of Ramanujan in the analysis of algorithms
P Kirschenhofer, H Prodinger
Mathematika 38 (1), 14-33, 1991
511991
Some further results on digital search trees
P Kirschenhofer, H Prodinger
International Colloquium on Automata, Languages, and Programming, 177-185, 1986
511986
Register allocation for unary–binary trees
P Flajolet, H Prodinger
SIAM Journal on Computing 15 (3), 629-640, 1986
501986
A correspondence between ordered trees and noncrossing partitions
H Prodinger
Discrete Mathematics 46 (2), 205-206, 1983
481983
Multiple Quickselect-Hoare's Find Algorithm for Several Elements.
H Prodinger
Inf. Process. Lett. 56 (3), 123-129, 1995
471995
The system can't perform the operation now. Try again later.
Articles 1–20