Digital data structures and order statistics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 382 LNCS, Issue , 1989, Pages 206-217

  Szpankowski, Wojciech ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY;

FINITE ALPHABET; INDEPENDENT MODEL; ORDER STATISTICS; POISSON MODEL; PROBABILISTIC FRAMEWORK; PROBABILISTIC MODELING; RANDOM NUMBERS; RANDOM SEQUENCE;

MATRIX ALGEBRA;

EID: 84990646587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51542-9_18     Document Type: Conference Paper

References (25)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).
2. D. Knuth, The Art of Computer Programming. Sorting and Searching, vol. 3, Addison-Wesley (1973).
3. A. Apostolico, “The Myriad Virtues of Suffix Trees”, Combinatorial Algorithms on Words, 85–96, Springer-Verlag, ASI F12 (1985).
4. R. Fagin, J. Nievergelt, N. Pippenger and H. Strong, “Extendible Hashing: A Fast Access Method for Dynamic Files”, ACM TODS, 4, 315–344 (1979).
5. P. Flajolet, “On the Performance Evaluation of Extendible Hashing and Trie Searching”, Acta Informatica, 20, 345–369 (1983).
6. R. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York (1968).
7. J. Capetanakis, “Tree Algorithms for Packet Broadcast Channels”, IEEE Trans. on Information Theory, IT-25, 505–525 (1979).
8. IEEE Transaction on Information Theory, IT-31, 2 (1985).
9. Ph. Jacquet and M. Regnier, “Trie Partitioning Process: Limiting Distributions”, in Lecture Notes in Computer Science, vol. 214, pp. 196–210, Springer Verlag, New York 1986.
10. L. Devroye, “A Probabilistic Analysis of the Height of Tries and of the Complexity of Trie Sort”, Acta Informatica, 21, 229–232 (1984).
11. B. Pittel, “Asymptotic Growth of a Class of Random Trees”, The Annalus of Probability, 13, 414–427 (1985).
12. B. Pittel, “Path in a Random Digital Tree: Limiting Distributions”, Adv. Appl. Probl., 18, 139–155 (1986).
13. M. Regnier, “On the Average Height of Trees in Digital Searching and Dynamic Hashing”, Inform. Processing Letters, 13, 64–66 (1981).
14. A. Yao, “A Note on the Analysis of Extendible Hashing”, Inform. Processing Letters, 11, 84–86 (1980).
15. W. Szpankowski, “On the Analysis of the Average Height of a Digital Trie: Another Approach”, Purdue University CSD TR-646 (1986); revision TR-816 (1988).
16. A. Apostolico and W. Szpankowski, “Self-Alignments in Words and Their Applications”, Purdue University CSD TR-732 (1987), submitted to a journal.
17. W. Szpankowski, “Some Results on V-ary Asymmetric Tries”, Journal of Algorithms, 9, 224–244 (1988).
18. P. Kirschenhofer, H. Prodinger and W. Szpankowski, “On the Variance of the External Path Length in a Symmetric Digital Trie”, Discrete Applied Mathematics, to appear.
19. H. David, Order Statistics, John Wiley & Sons, New York (1980).
20. J. Galambos, The Asymptotic Theory of Extreme Order Statistics, John Wiley & Sons, New York (1978).
21. T. Lai and H. Robbins, “A Class of Dependent Random Variables and Their Maxima”, Z. Wahrscheinlichkeitscheorie, 42, 89–111 (1978).
22. P. Billingsley, Probability and Measures, John Wiley & Sons, New York (1986).
23. W. Szpankowski, “(Probably) Optimal Solutions to Some Problems NOT Only on Graphs”, Purdue University CSD TR 780. 1988; revision 1989.
24. B. Silverman and T.C. Brown, “Short distances, flat triangles and Poisson limits”, J. Appl. Probab., 15, 815–825 (1978).
25. D. Aldous, Probability Approximations via the Poisson Clumping Heuristic, Springer Verlag, New York 1989.