Tries, Patricia Tries, Digital Search Trees

Some further results on digital search trees, P. Kirschenhofer and H. Prodinger, Automata, Languages and Programming, volume 229 of Lecture Notes in Computer Science, pages 177-185, 1986.
On the recursion depth of special tree traversal algorithms, P. Kirschenhofer and H. Prodinger, Information and Computation, 74:15-32, 1987.
Asymptotische Untersuchungen über charakteristische Parameter von Suchbäumen, P. Kirschenhofer and H. Prodinger, editor: Hlawka, editor, Zahlentheoretische Analysis II, volume 1262 of Lecture Notes in Mathematics, pages 93-107, 1987.
Zur Auswertung gewisser numerischer Reihen mit Hilfe modularer Funktionen. P. Kirschenhofer, H. Prodinger und J. Schoissengeier, editor: E. Hlawka, Zahlentheoretische Analysis II, volume 1262 of Lecture Notes in Mathematics, pages 108-110, 1987.
Further results on digital search trees. P. Kirschenhofer and H. Prodinger, Theoretical Computer Science, 58:143-154, 1988.
Do we really need to balance Patricia tries? P. Kirschenhofer, H. Prodinger and W. Szpankowski, Lecture Notes in Computer Science, volume 317 of Automata, Languages and Programming, pages 302-316, 1988.
b-tries: a paradigm for the application of numbertheoretic methods in the analysis of algorithms. P. Kirschenhofer and H. Prodinger In Contributions to General Algebra, volume 6, pages 141-153. Hoelder-Pichler-Tempsky-Teubner, 1988.
Eine Anwendung der Theorie der Modulfunktionen in der Informatik. P. Kirschenhofer and H. Prodinger. Sitzungsberichte der Oesterreichischen Akademie der Wissenschaften, 197:339-366, 1988.
On the balance property of patricia tries: External path length view. P. Kirschenhofer, H. Prodinger and W. Szpankowski, Theoretical Computer Science, 68:1-17, 1989.
Digital search trees - further results on a fundamental data structure. P. Kirschenhofer, H. Prodinger and W. Szpankowski, editor: G.X. Ritter, Information Processing 89, pages 443-447, 1989.
On the variance of the external path length in a symmetric digital trie. P. Kirschenhofer, H. Prodinger and W. Szpankowski, Discrete Applied Mathematics, 25:129-143, 1989.
On some applications of formulae of Ramanujan in the analysis of algorithms. P. Kirschenhofer and H. Prodinger, Mathematika, 38:14-33, 1991.
Hypothetic analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet. H. Prodinger, Theoretical Computer Science, 100:243-251, 1992.
External internal nodes in digital search trees via Mellin transforms. H. Prodinger, SIAM Journal on Computing, 21:1180-1183, 1992.
Multidimensional digital searching and some new parameters in tries. P. Kirschenhofer, H. Prodinger and W. Szpankowski, International Journal of Foundations of Computer Science, 4:69-84, 1993.
How to select a loser H. Prodinger, Discrete Mathematics, 120:149-159, 1993.
How to advance on a stairway by coin flippings. H. Prodinger, Proceedings "Applications of Fibonacci Numbers", volume 5, pages 473-479. Kluwer, 1993.
Asymptotic analysis of a class of functional equations and applications. P. Grabner, H. Prodinger and R.F. Tichy, Journal de Theorie des Nombres de Bordeaux, 5:365-381, 1993.
Digital search trees again revisited: The internal path length perspective. P. Kirschenhofer, H. Prodinger and W. Szpankowski, SIAM Journal on Computing, 23:598-616, 1994.
Multidimensional searching - alternative data structures, P. Kirschenhofer and H. Prodinger, Random Structures and Algorithms, 5:123-134, 1994.
Digital search trees and basic hypergeometric functions. H. Prodinger, EATCS Bulletin, 56:112-115, 1995.
Bucket trees revisited. F. Hubalek, W. Lew, H. Mahmoud and H. Prodinger, In preparation, 1995.

(Back to the Homepage)