Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions (0)

Cached

Download Links

by Alan Siegel , Jeanette P. Schmidt
Citations:6 - 1 self

Documents Related by Co-Citation

17 The analysis of closed hashing under limited randomness (extended abstract – Jeanette P Schmidt, Alan Siegel - 1990
12 Graph and Hashing Algorithms for Modern Architectures: Design and Performance – John R. Black, Jr., Charles U. Martel, Hongbin Qi - 1998
10 How caching affects hashing – G L Heileman, W Luo - 2005
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
669 Universal classes of hash functions – L Carter, M Wegman - 1979
331 New Hash Functions and Their Use in Authentication and Set Equality – M N Wegman, J L Carter - 1981
39 Universal hashing and k-wise independent random variables via integer arithmetic without primes – Martin Dietzfelbinger - 1996
3 Special issue on average case analysis of algorithms – H Prodinger, W S - 1998
6 Notes On "Open" Addressing – Don Knuth - 1963
25 On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff – Alan Siegel
104 Chernoff-Hoeffding Bounds for Applications with Limited Independence – Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan - 1993
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
59 A reliable randomized algorithm for the closest-pair problem – M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen - 1993
12 Strongly history-independent hashing with applications – Guy E. Blelloch - 2007
83 A Complexity Theory of Efficient Parallel Algorithms – C P Kruskal, L Rudolph, M Snir - 1990
94 Sorting and Searching – D E Knuth - 1998
29 Balanced allocation and dictionaries with tightly packed constant size bins – Martin Dietzfelbinger, et al. - 2007
8 String hashing for linear probing – Mikkel Thorup - 2009