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
2611982
Mellin transforms and asymptotics: digital sums
P Flajolet, P Grabner, P Kirschenhofer, H Prodinger, RF Tichy
Theoretical Computer Science 123 (2), 291-314, 1994
1691994
A Tutte polynomial for signed graphs
LH Kauffman
Discrete Applied Mathematics 25 (1-2), 105-127, 1989
1471989
Spanning tree formulas and Chebyshev polynomials
FT Boesch, H Prodinger
Graphs and Combinatorics 2 (1), 191-200, 1986
1031986
How to select a loser
H Prodinger
Discrete Mathematics 120 (1-3), 149-159, 1993
981993
On Ramanujan's Q-function
P Flajolet, PJ Grabner, P Kirschenhofer, H Prodinger
Journal of Computational and Applied Mathematics 58 (1), 103-116, 1995
941995
Combinatorics of geometrically distributed random variables: Left-to-right maxima
H Prodinger
Discrete Mathematics 153 (1-3), 253-270, 1996
781996
The path length of random skip lists
P Kirschenhofer, H Prodinger
Acta Informatica 31 (8), 775-792, 1994
771994
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
631997
Level number sequences for trees
P Flajolet, H Prodinger
Discrete mathematics 65 (2), 149-156, 1987
631987
On Carlitz compositions
A Knopfmacher, H Prodinger
European Journal of Combinatorics 19 (5), 579-589, 1998
621998
The kernel method: a collection of examples
H Prodinger
Sém. Lothar. Combin 50, B50f, 2004
552004
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
541994
A result in order statistics related to probabilistic counting
P Kirschenhofer, H Prodinger
Computing 51 (1), 15-27, 1993
531993
Register allocation for unary–binary trees
P Flajolet, H Prodinger
SIAM Journal on Computing 15 (3), 629-640, 1986
531986
On some applications of formulae of Ramanujan in the analysis of algorithms
P Kirschenhofer, H Prodinger
Mathematika 38 (1), 14-33, 1991
521991
Comparisons in Hoare's Find algorithm
P Kirschenhofer, H Prodinger
Combinatorics, Probability and Computing 7 (1), 111-120, 1998
511998
Some information about the binomial transform
H Prodinger
Fibonacci Quarterly 32 (5), 412-415, 1994
511994
Level of nodes in increasing trees revisited
A Panholzer, H Prodinger
Random Structures & Algorithms 31 (2), 203-226, 2007
492007
The system can't perform the operation now. Try again later.
Articles 1–20