Linear probing with constant independence

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 318-327

  Pagh, Anna ^a   Pagh, Rasmus ^a   Ruzic, Milan ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Hashing; Linear probing

Indexed keywords

HASHING; LINEAR PROBING; LOGARITHMIC COSTS;

ALGORITHMS; COMPUTATIONAL METHODS; RANDOM PROCESSES;

LINEAR PROGRAMMING;

EID: 35448970585     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250839     Document Type: Conference Paper

References (15)

1. J. R. Black, C. U. Martel, and H. Qi. Graph and hashing algorithms for modern architectures: Design and performance. In Proceedings of 2nd International Workshop on Algorithm Engineering (WAE '92), pages 37-48. Max-Planck-Institut für Informatik, 1998.
2. J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. System Sci., 18(2):143-154, 1979.
3. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23(4):493-507, 1952.
4. M. Dietzfelbinger and C Weidling. Balanced allocation and dictionaries with tightly packed constant size bins. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP '05), volume 3580 of Lecture Notes in Computer Science, pages 166-178. Springer, 2005.
5. G. L. Heileman and W. Luo. How caching affects hashing. In Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX '05), pages 141-154. SlAM, 2005.
6. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
7. D. E. Knuth. Notes on "open" addressing, July 22 1963. Unpublished memorandum. Available at http://citeseer.ist.psu.edu/knuth63notes. html.
8. C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71(1):95-132, Mar. 1990.
9. R. Pagh and F. F. Rodler. Cuckoo hashing. Journal of Algorithms, 51:122-144, 2004.
10. H. Prodinger and W. Szpankowski (eds.). Special issue on average case analysis of algorithms. Algorithmica, 22(4), 1998. Preface.
11. J. P. Schmidt and A. Siegel. The analysis of closed hashing under limited randomness (extended abstract). In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC '90), pages 224-234. ACM Press, 1990.
12. A. Siegel. On universal classes of extremely random constant-time hash functions. SIAM J. Comput., 33(3):505-543, 2004.
13. A. Siegel and J. Schmidt. Closed hashing is computable and optimally randomizable with universal hash functions. Technical Report TR1995-687, New York University, Apr., 1995.
14. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '04), pages 615-624, 2004.
15. M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. J. Comput. System Sci., 22(3):265-279, 1981.