Urmăriți
Helmut Prodinger
Helmut Prodinger
Adresă de e-mail confirmată pe sun.ac.za
Titlu
Citat de
Citat de
Anul
Fibonacci numbers of graphs
H Prodinger, R Tichy
The Fibonacci Quarterly 20 (1), 16-21, 1982
3401982
Mellin transforms and asymptotics: digital sums
P Flajolet, P Grabner, P Kirschenhofer, H Prodinger, RF Tichy
Theoretical Computer Science 123 (2), 291-314, 1994
1881994
Spanning tree formulas and Chebyshev polynomials
FT Boesch, H Prodinger
Graphs and Combinatorics 2 (1), 191-200, 1986
1271986
The kernel method: a collection of examples
H Prodinger
Sém. Lothar. Combin 50, B50f, 2004
1212004
On Ramanujan's Q-function
P Flajolet, PJ Grabner, P Kirschenhofer, H Prodinger
Journal of computational and applied mathematics 58 (1), 103-116, 1995
1171995
How to select a loser
H Prodinger
Discrete Mathematics 120 (1-3), 149-159, 1993
1051993
Some information about the binomial transform
H Proctinger
CiteSeerX, 1993
1001993
The path length of random skip lists
P Kirschenhofer, H Prodinger
Acta Informatica 31, 775-792, 1994
871994
Combinatorics of geometrically distributed random variables: Left-to-right maxima
H Prodinger
Discrete Mathematics 153 (1-3), 253-270, 1996
811996
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
761989
Level of nodes in increasing trees revisited
A Panholzer, H Prodinger
Random Structures & Algorithms 31 (2), 203-226, 2007
722007
Level number sequences for trees
P Flajolet, H Prodinger
Discrete mathematics 65 (2), 149-156, 1987
721987
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
691997
On Carlitz compositions
A Knopfmacher, H Prodinger
European Journal of Combinatorics 19 (5), 579-589, 1998
631998
Register allocation for unary–binary trees
P Flajolet, H Prodinger
SIAM Journal on Computing 15 (3), 629-640, 1986
611986
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
571994
On some applications of formulae of Ramanujan in the analysis of algorithms
P Kirschenhofer, H Prodinger
Mathematika 38 (1), 14-33, 1991
561991
Some further results on digital search trees
P Kirschenhofer, H Prodinger
Automata, Languages and Programming: 13th International Colloquium Rennes …, 1986
551986
A result in order statistics related to probabilistic counting
P Kirschenhofer, H Prodinger
Computing 51 (1), 15-27, 1993
531993
Partial match queries in relaxed multidimensional search trees
C Martinez, A Panholzer, H Prodinger
Algorithmica 29 (1), 181-204, 2001
522001
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20