On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff

Cached

Download Links

by Alan Siegel
Citations:25 - 0 self

Documents Related by Co-Citation

669 Universal classes of hash functions – L Carter, M Wegman - 1979
61 Tabulation based 4-universal hashing with applications to second moment estimation – M Thorup, Y Zhang - 2004
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
331 New Hash Functions and Their Use in Authentication and Set Equality – M N Wegman, J L Carter - 1981
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
39 Universal hashing and k-wise independent random variables via integer arithmetic without primes – Martin Dietzfelbinger - 1996
17 The analysis of closed hashing under limited randomness (extended abstract – Jeanette P Schmidt, Alan Siegel - 1990
104 Chernoff-Hoeffding Bounds for Applications with Limited Independence – Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan - 1993
6 Notes On "Open" Addressing – Don Knuth - 1963
8 String hashing for linear probing – Mikkel Thorup - 2009
10 How caching affects hashing – G L Heileman, W Luo - 2005
17 Uniform hashing in constant time and linear space – Anna Pagh, Rasmus Pagh
59 A reliable randomized algorithm for the closest-pair problem – M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen - 1993
149 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
47 Space Efficient Hash Tables With Worst Case Constant Access Time – Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis - 2003
87 Log-logarithmic worst-case range queries are possible in space Theta(N – D E Willard - 1983
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
375 Data Streams: Algorithms and Applications – S. Muthukrishnan - 2005