On the k-independence required by linear probing and minwise independence

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 715-726

  Pǎtraşcu, Mihai ^a   Thorup, Mikkel ^a  

^a ATandT Labs   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROBING; UPPER BOUND;

HASH FUNCTIONS; LINGUISTICS; TRANSLATION (LANGUAGES);

TREES (MATHEMATICS);

EID: 77955322325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_60     Document Type: Conference Paper

References (19)

1. Alon, N., Nussboim, A.: k-wise independent random graphs. In: Proc. 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 813-822 (2008)
2. Black, J. R., Martel, C. U., Qi, H.: Graph and hashing algorithms for modern architectures: Design and performance. In: Proc. 2nd International Workshop on Algorithm Engineering (WAE), pp. 37-48 (1998)
3. Broder, A. Z., Charikar, M., Frieze, A. M., Mitzenmacher, M.: Min-wise independent permutations. Journal of Computer and System Sciences 60 (3), 630-659 (2000); See also STOC 1998
4. Broder, A. Z., Glassman, S. C., Manasse, M. S., Zweig, G.: Syntactic clustering of the web. Computer Networks 29, 1157-1166 (1997)
5. Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences 55 (3), 441-453 (1997); See also STOC 1994
6. Dietzfelbinger, M.: Universal hashing and k-wise independent random variables via integer arithmetic without primes. In: Proc. 13th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 569-580 (1996)
7. Heileman, G. L., Luo, W.: How caching affects hashing. In: Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 141-154 (2005)
8. Indyk, P.: A small approximately min-wise independent family of hash functions. Journal of Algorithms 38 (1), 84-90 (2001); See also SODA 1999
9. Knuth, D. E.: Notes on open addressing (1963) (Unpublished memorandum), http://citeseer.ist.psu.edu/knuth63notes.html
10. Pagh, A., Pagh, R., Ružić, M.: Linear probing with constant independence. SIAM Journal on Computing 39 (3), 1107-1120 (2009); See also STOC 2007
11. Pagh, R., Rodler, F. F.: Cuckoo hashing. Journal of Algorithms 51 (2), 122-144 (2004); See also ESA 2001
12. Pǎtraşcu, M., Thorup, M.: The power of simple tabulation-based hashing (2010) (manuscript)
13. Schmidt, J. P., Siegel, A.: The analysis of closed hashing under limited randomness. In: Proc. 22nd ACM Symposium on Theory of Computing (STOC), pp. 224-234 (1990)
14. Schmidt, J. P., Siegel, A., Srinivasan, A.: Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics 8 (2), 223-250 (1995); See also SODA 1993
15. Siegel, A., Schmidt, J. P.: Closed hashing is computable and optimally randomizable with universal hash functions. Technical Report TR1995-687, Currant Institute (1995)
16. Thorup, M.: Even strongly universal hashing is pretty fast. In: Proc. 11th ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 496-497 (2000)
17. Thorup, M., Zhang, Y.: Tabulation based 4-universal hashing with applications to second moment estimation. In: Proc. 15th ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 615-624 (2004)
18. Thorup, M., Zhang, Y.: Tabulation based 5-universal hashing and linear probing. In: Proc. 12th Workshop on Algorithm Engineering and Experiments, ALENEX (2009)
19. Wegman, M. N., Carter, L.: New classes and applications of hash functions. Journal of Computer and System Sciences 22 (3), 265-279 (1981); see also FOCS 1979