Compositions and Patricia tries: No fluctuations in the variance!

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2004, Pages 211-215

  Prodinger, Helmut ^a  

^a UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; PARAMETER ESTIMATION; PROBABILITY;

PATH LENGTHS; PATRICIA TRIES;

MATHEMATICAL PROGRAMMING;

EID: 8344263101     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. M. Archibald, A. Knopfmacher, and H. Prodinger. The number of distinct values in a geometrically distributed sample. In preparation, 2003.
2. P. Hitczenko and G. Louchard. Distinctness of compositions of an integer: A probabilistic analysis. Random Structures & Algorithms, 19:407-437, 2001.
3. P. Kirschenhofer, H. Prodinger, and J. Schoißengeier. Zur Auswertung gewisser numerischer Reihen mit Hilfe modularer Funktionen. In E. Hlawka, editor, Zahlentheoretische Analysis II, volume 1262 of Lecture Notes in Mathematics, pages 108-110, 1987.
4. P. Kirschenhofer, H. Prodinger, and W. Szpankowski. On the variance of the external path length in a symmetric digital trie. Discrete Applied Mathematics, 25:129-143, 1989.
5. P. Kirschenhofer, H. Prodinger, and W. Szpankowski. Digital search trees again revisited: The internal path length perspective. SIAM Journal on Computing, 23:598-616, 1994.
6. P. Kirschenhofer and H. Prodinger. Asymptotische Untersuchungen über charakteristische Parameter von Suchbäumen. In E. Hlawka, editor, Zahlentheoretische Analysis II, volume 1262 of Lecture Notes in Mathematics, pages 93-107, 1987.
7. P. Kirschenhofer and H. Prodinger. Further results on digital search trees. Theoret. Comput. Sci., 58:143-154, 1988.
8. P. Kirschenhofer and H. Prodinger. On some applications of formulæ of Ramanujan in the analysis of algorithms. Mathematika, 38:14-33, 1991.
9. P. Kirschenhofer and H. Prodinger. A result in order statistics related to probabilistic counting. Computing, 51:15-27, 1993.
10. P. Kirschenhofer, H. Prodinger, and W. Szpankowski. On the balance property of Patricia tries: external path length viewpoint. Theoret. Comput. Sci., 68:1-17, 1989.
11. D. E. Knuth. The Art of Computer Programming, volume 1: Fundamental Algorithms. Addison-Wesley, 1973. Third edition, 1997.
12. D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973. Second edition, 1998.
13. G. Longo, editor. Multi-User Communication Systems, volume 265 of CISM Courses and Lecture Notes. Springer Verlag, 1981.
14. H. M. Mahmoud. Evolution of Random Search Trees. John Wiley, New York, 1992.
15. J. Massey, editor. Random Access Communication. I.E.E.E Press, 1985.
16. R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, 1996.
17. W. Szpankowski. Patricia tries again revisited. J. Assoc. Comput. Mach., 37:691-711, 1990.
18. W. Szpankowski. Average case analysis of algorithms on sequences. Wiley-Interscience, New York, 2001.
19. E. T. Whittaker and G. N. Watson. A Course of Modem Analysis. Cambridge University Press, fourth edition, 1927. Reprinted 1973.