String hashing for linear probing (2009)

Cached

Download Links

by Mikkel Thorup
Venue:In Proc. 20th SODA
Citations:8 - 3 self

Active Bibliography

1 LINEAR PROBING WITH 5-WISE INDEPENDENCE ∗ – Anna Pagh, Rasmus Pagh, Milan, Ru Zi Ć
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
Tabulation Based 5-independent Hashing with Applications to Linear Probing and Second Moment Estimation ∗ – Mikkel Thorup, Yin Zhang
3 Tabulation Based 5-Universal Hashing and Linear Probing – Mikkel Thorup, Yin Zhang
5 On the k-independence required by linear probing and minwise independence – Mikkel Thorup - 2010
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
TABULATION BASED 5-INDEPENDENTHASHINGWITH APPLICATIONS TO LINEAR PROBINGANDSECOND MOMENT ESTIMATION ∗ – Mikkel Thorup, Yin Zhang
9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
The Power of Simple Tabulation Hashing Mihai Pǎtras¸cu AT&T Labs – Mikkel Thorup - 2011
1 Cache-Oblivious Hashing – Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang - 2010
On the construction of digest functions for manual authentication protocols – n.n.
1 Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms – Charles E. Leiserson, Tao B. Schardl, Jim Sukha
Effect of cache lines in array-based hashing algorithms – Ákos Dudás, Sándor Kolumbán, Tamás Schrádi
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
Balls and Bins: Smaller Hash Families and Faster Evaluation – L. Elisa, Celis Omer, Reingold Gil, Segev Udi Wieder - 2012
12 Uniform Hashing in Constant Time and Linear Space – Anna Östlin, Rasmus Pagh - 2003
3 Improved Data Structures for Predecessor Queries in Integer Sets – Rajeev Raman - 1996