Height and size of random hash trees and random pebbled hash trees

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1215-1224

  Devroye, Luc ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; TREES (MATHEMATICS);

HASH TABLES; HASHING WITH CHAINING; PROBABILISTIC ANALYSIS; RANDOM HASH TREES; RANDOM PEBBLED HASH TREES;

COMPUTATIONAL METHODS;

EID: 0032660437     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797326174     Document Type: Article

References (16)

1. Y. AZAR, A. Z. BRODER, A. R. KARLIN, AND E. UPFAL (1994), Balanced allocations (extended abstract), in Proc. 26th ACM Symposium on the Theory of Computing, pp. 593-602.
2. E. G. COFFMAN AND J. EVE (1970), File structures using hashing functions, Communications of the ACM, 13, pp. 427-436.
3. L. DEVROYE (1985), The expected length of the longest probe sequence when the distribution is not uniform, J. Algorithms, 6, pp. 1-9.
4. L. DEVROYE (1986), Lecture Notes on Bucket Algorithms, Birkhäuser Verlag, Boston.
5. W. DOBOSIEWICZ (1978), Sorting by distributive partitioning, Inform. Process. Lett., 7, pp. 1-6.
6. G. EHRLICH (1981), Searching and sorting real numbers, J. Algorithms, 2, pp. 1-14.
7. R. FAGIN, J. NIEVERGELT, N. PIPPENGER, AND H. R. STRONG (1979), Extendible hashing - a fast access method for dynamic files, ACM Trans. Database Systems, 4, pp. 315-344.
8. P. FLAJOLET (1983), On the performance evaluation of extendible hashing and trie search, Acta Inform., 20, pp. 345-369.
9. M. L. FREDMAN AND D. E. WILLARD (1990), Blasting through the information theoretic barrier with fusion trees, in Proc. 22nd Symposium on Theory of Computing, ACM Press, pp. 1-7.
10. G. H. GONNET (1981), Expected length of the longest probe sequence in hash code searching, J. Assoc. Comput. Mach., 28, pp. 289-304.
11. G. H. GONNET AND R. BAEZA-YATES (1991), Handbook of Algorithms and Data Structures, Addison-Wesley, Workingham, UK.
12. C. MCDIARMID (1989), On the method of bounded differences, in Surveys in Combinatorics 1989, London Math. Soc. Lecture Note Ser. 141, Cambridge University Press, Cambridge, UK.
13. B. PITTEL (1985), Asymptotical growth of a class of random trees, Ann. Probab., 13, pp. 414-427.
14. M. TAMMINEN (1983), Analysis of N-trees, Inform. Process. Lett., 16, pp. 131-137.
15. M. TAMMINEN (1985), Two levels are as good as any, J. Algorithms, 6, pp. 138-144.
16. J. S. VITTER AND P. FLAJOLET (1990), Average-case analysis of algorithms and data structures, in Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen, ed., MIT Press, Amsterdam, pp. 431-524.