Cuckoo hashing: Further analysis

[1]  Ali Esmaili,et al.  Probability and Random Processes , 2005, Technometrics.

[2]  Timothy J. Purcell.  Sorting and searching , 2005, SIGGRAPH Courses.

[3]  Andrei Z. Broder,et al.  Using multiple hash functions to improve IP lookups , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Ron Goldman,et al.  Poisson approximation , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[5]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[6]  Michael Mitzenmacher,et al.  Studying Balanced Allocations with Differential Equations , 1999, Combinatorics, Probability and Computing.

[7]  J. Ian Munro,et al.  Membership in Constant Time and Almost-Minimum Space , 1999, SIAM J. Comput..

[8]  Artur Czumaj,et al.  Randomized allocation processes , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[9]  Eli Upfal,et al.  Balanced allocations (extended abstract) , 1994, STOC '94.

[10]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[11]  Yossi Matias,et al.  Polynomial Hash Functions Are Reliable (Extended Abstract) , 1992, ICALP.

[12]  A. Barbour,et al.  Poisson Approximation , 1992 .

[13]  Philippe Flajolet,et al.  Average-Case Analysis of Algorithms and Data Structures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[14]  Friedhelm Meyer auf der Heide,et al.  A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.

[15]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[16]  Luc Devroye,et al.  The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform , 1985, J. Algorithms.

[17]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  Gaston H. Gonnet,et al.  Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.

[19]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[20]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[21]  Ramesh K. Sitaraman,et al.  The power of two random choices: a survey of tech-niques and results , 2001 .

[22]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[23]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[24]  Andrei Z. Broder,et al.  Multilevel adaptive hashing , 1990, SODA '90.

[25]  David S. Johnson,et al.  Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, USA , 1990, SODA.

[26]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[27]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .