Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Prodinger, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partial match queries in relaxed multidimensional search trees
C. MartÃnez
,
A. Panholzer
,
H. Prodinger
Algorithmica
29
(1-2), 2001, pp. 181-204
A
q
-analogue of the path length of binary search trees
H. Prodinger
Algorithmica
31
(3), 2001, pp. 433-441
Average-case analysis of priority trees: A structure for priority queue administration
A. Panholzer
,
H. Prodinger
Algorithmica
22
(4), 1998, pp. 600-630
Philippe Flajolet's research in analysis of algorithms and combinatorics
H. Prodinger
,
W. Szpankowski
Algorithmica
22
(4), 1998, pp. 366-387
Bottom-up mergesort - A detailed analysis
W. Panny
,
H. Prodinger
Algorithmica
14
, 1995, pp. 340-354
Do we really need to balance Patricia tries
P. Kirschenhofer
,
H. Prodinger
,
W. Szpankowski
Lecture Notes in Computer Science
317
, 1988, pp. 302-316
Spanning tree formulas and Chebyshev polynomials
F.T. Boesch
,
H. Prodinger
Graphs and Combinatorics
2
, 1986, pp. 191-200
Register allocation for unary-binary trees
P. Flajolet
,
H. Prodinger
SIAM Journal on Computing
15
(3), 1986, August, pp. 629-640
Two selection problems revisited
P. Kirschenhofer
,
H. Prodinger
Journal of Combinatorial Theory Series A
42
, 1986, pp. 310-316
Recursion depth analysis for special tree traversal algorithms
P. Kirschenhofer
,
H. Prodinger
Lecture Notes in Computer Science
172
, 1984, pp. 303-311
On the interpolation of DOL-sequences
H. Prodinger
Theoretical Computer Science
10
(1), 1980, pp. 107-108
On the height of derivation trees
W. Kuich
,
H. Prodinger
,
F.J. Urbanek
Lecture Notes in Computer Science
71
, 1979, pp. 370-384
Language operators related to Init
H. Prodinger
,
F.J. Urbanek
Theoretical Computer Science
8
(2), 1979, pp. 161-175