Register function, etc.
Abzählprobleme bei Bäumen
H. Prodinger, editors: G.Baron and P. Kirschenhofer,
Publications de l'IRMA (Strassbourg),
pages 167-173, 1983.
Ueber ein zahlentheoretisches Problem aus der Informatik
H. Prodinger and R.F. Tichy,
Sitzungsberichte der Oesterreichischen Akademie der Wissenschaften, Abteilung II,
192:385-396, 1983.
Quelques techniques analytiques pour l'etude asymptotique des parametres dans les arbres
H. Prodinger,
In Sommerschule Ile de R e (Vortragsausarbeitung), English version in EATCS Bulletin,
47 (1992), 180-199, 1983.
Recursion depth analysis for special tree traversal algorithms
P. Kirschenhofer and H. Prodinger, editor: J. Paradaens,
Autmata, Languages and Programming,
volume 172 of
Lecture Notes in Computer Science,
pages 303-311, 1984.
Die Bestimmung gewisser Parameter von binären Bäumen mit Hilfe analytischer Methoden
H. Prodinger, editor: E. Hlawka,
Zahlentheoretische Analysis,
of volume 1114 of
Lecture Notes in Mathematics,
pages 118-133, 1985.
Register allocation for unary-binary trees.
P. Flajolet and H. Prodinger,
SIAM Journal on Computing,
15:629-640, 1986.
Some recent results on the register function of a binary tree,
H. Prodinger,
Annals of Discrete Mathematics,
33:241- 260, 1987.
On the recursion depth of special tree traversal algorithms,
P. Kirschenhofer and H. Prodinger,
Information and Computation,
74:15-32, 1987.
Solution of a problem of Yekutieli and Mandelbrot.
H. Prodinger, editors: R. Baeza, E. Goles and P. V. Poblete,
LATIN 95,
volume 911 of,
Lecture Notes in Computer Science,
pages 461-468, 1995.
On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees.
H. Prodinger,
Theoretical Computer Science (to appear),
1995.
(Back to the Homepage)