Patricia Tries Again Revisited

Journal of the ACM (JACM)

Volumn 37, Issue 4, 1990, Pages 691-711

  Szpankowski, Wojciech ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

PATRICIA TRIES; SEARCH ALGORITHMS; TRIES;

DATA PROCESSING;

EID: 0025497209     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/96559.214080     Document Type: Article

References (25)

1. ABRAMOWITZ, M., AND STEGUN, I. Handbook of Mathematical Functions. Wiley, New York, 1972.
2. AHO, A., HOPCROFT, J., AND ULLMAN, J. Data Structures and Algorithms. Addison-Wesley, Reading, Mass., 1983.
3. BERNDT, B. Ramanujan'n Notebooks. Springer-Verlag, New York, 1985.
4. ERDELYI, A. Higher Transcendental Functions. McGraw-Hill, New York, 1953.
5. FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONG, H. Extendible hashing: A fast access method for dynamic files. ACM Trans. Datab. Syst. 4 (1979), 315-344.
6. FLAJOLET, PH. On the performance evaluation of extendible hashing and trie searching. Acta Inf. 20 (1983), 345-369.
7. FLAJOLET, PH., AND SAHEB, N. The complexity of generating an exponentially distributed variate. J. Algorithms 7 (1986), 463-488.
8. FLAJOLET, PH., AND SEDGEWICK, R. Digital search trees revisited. SIAM J. Comput. 15 (1986), 748-767.
9. GALLAGER, R. Conflict resolution in random access broadcast networks. In Proceedings of the AFOSR Workshop in Communication Theory and Applications. Provincetown, Mass., 1978, pp. 74-76.
10. GONNET, G. Handbook of Algorithms and Data Structures. Addison-Wesley, Reading, Mass., 1984.
11. HENRICI, P. Applied and Computational Complex Analysis. Wiley, New York, 1977.
12. JACQUET, PH., AND REGNIER, M. Limiting distributions for trie parameters. In Lecture Notes in Computer Science, vol. 214. Springer-Verlag, New York, 1986, pp. 196-210.
13. KIRSCHENHOFER, P., AND PRODINGER, H. Some further results on digital trees. In Lecture Notes in Computer Science, vol. 226. Springer-Verlag, New York, 1986, pp. 177-185.
14. KNUTH, D. The Art of Computer Programming. Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.
15. NÖRLUND, N. E. Memoire sur les polynomes de Bernoulli. Acta Math. 43 (1923), 124-196.
16. PAIGE, R., AND TARJAN, R. Three efficient algorithms based on partition refinements, preprint.
17. PITTEL, B. Asymptotical growth of a class of random trees. Ann. Prob. 13 (1985), 414-427.
18. RIORDAN, J. Combinatorial Identities. Wiley, New York, 1968.
19. SEDGEWICK, R. Algorithms. Addison-Wesley, Reading, Mass., 1983.
20. SZPANKOWSKI, W. Patricia tries again revisited. Tech. Rep. CSD-TR 625. Dept. Comput. Sci., Purdue Univ., West Lafayette, Ind., 1986.
21. SZPANKOWSKI, W. On the recurrence equation arising in the analysis of conflict resolution algorithms. Stochastic Models 3 (1987), 89-114.
22. SZPANKOWSKI, W. Solution of a linear recurrence equation arising in the analysis of some algorithms. SIAM J. Alg. and Discr. Meth. 8 (1987), 233-250.
23. SZPANKOWSKI, W. The evaluation of an alternative sum with applications to the analysis of some data structures. Inf Proc. Lett. 28 (1988), 13-19.
24. SZPANKOWSKI, W. Some results in V-ary asymmetric tries. J. Alg. 9 (1988), 224-244.
25. WHITTAKER, E., AND WATSON, G. A Course of Modern Analysis. Cambridge Press, London, 1935.