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

26 On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff
62 Tabulation based 4-universal hashing with applications to second moment estimation – - 2004
14 Linear probing with constant independence – - 2007
103 Chernoff-Hoeffding Bounds for Applications with Limited Independence – - 1993
332 New hash functions and their use in authentication and set equality. Journal of computer and system sciences, 22(3):265–279 – - 1981
8 String hashing for linear probing – - 2009
674 Universal Classes of Hash Functions – - 1979
32 Lower bounds for accessing binary search trees with rotations – - 1989
8 Key independent optimality – - 2002
15 Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time – - 1990
3 Bounds on the independence required for cuckoo hashing – - 2009
5 Deterministic Sorting in O(n log log n – - 2004
6 Upper Bounds for Sorting – - 1984
6 Mihai Pǎtra¸scu. Dynamic optimality — almost
61 Two simplified algorithms for maintaining order in a list – - 2002
29 Integer sorting in O(n √ log log n) expected time and linear space – - 2002
64 Cache-oblivious priority queue and graph algorithm applications – - 2002
32 A density control algorithm for doing insertions and deletions in a sequentially ordered in good worst-case time – - 1992
112 Emde Boas. Preserving order in a forest in less than logarithmic time and linear space – - 1978