On the k-independence required by linear probing and minwise independence (2010)

Cached

Download Links

by Mikkel Thorup
Venue:In Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP
Citations:5 - 1 self

Documents Related by Co-Citation

61 Tabulation based 4-universal hashing with applications to second moment estimation – M Thorup, Y Zhang - 2004
25 On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff – Alan Siegel
14 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
102 Chernoff-Hoeffding Bounds for Applications with Limited Independence – Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan - 1993
329 New hash functions and their use in authentication and set equality – M Wegman, L Carter - 1981
8 String hashing for linear probing – Mikkel Thorup - 2009
667 Universal Classes of Hash Functions – J L Carter, M N Wegman - 1979
32 Lower bounds for accessing binary search trees with rotations – Robert Wilber - 1989
8 Key independent optimality – John Iacono - 2002
15 Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time – Martin Dietzfelbinger - 1990
6 Torben Hagerup: Improved Parallel Integer Sorting without Concurrent – Susanne Albers - 1997
3 Bounds on the independence required for cuckoo hashing – Jeffrey S Cohen, Daniel M Kane - 2009
5 Deterministic Sorting in O(n log log n – Y Han - 2004
12 The power of simple tabulation hashing – M Pǎtra¸scu, M Thorup - 2012
6 Upper Bounds for Sorting – D G Kirkpatrick, S Reisch - 1984
6 Mihai Pǎtra¸scu. Dynamic optimality — almost – Erik D Demaine, Dion Harmon, John Iacono
16 Flemming Friche Rodler. Cuckoo hashing – Rasmus Pagh - 2001
39 János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time – Michael L Fredman - 1984
8 Torben Hagerup, Jyrki Katajainen, and Martti Penttonen. A reliable randomized algorithm for the closest-pair problem – Martin Dietzfelbinger - 1997