Almost Random Graphs with Simple Hash Functions (2003)

by Martin Dietzfelbinger , Philipp Woelfel
Venue:STOC'03
Citations:21 - 1 self

Active Bibliography

Hash-Based Data Structures for Extreme Conditions – Adam Lavitt Kirsch - 2008
17 Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries – Peter Bro Miltersen - 1997
9 Linear Hash Functions – Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos - 1999
10 De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results – Yuriy Arbitman, Moni Naor, Gil Segev
12 Strongly history-independent hashing with applications – Guy E. Blelloch - 2007
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
9 History-Independent Cuckoo Hashing – Moni Naor, Gil Segev, Udi Wieder
Tabulation Based 5-independent Hashing with Applications to Linear Probing and Second Moment Estimation ∗ – Mikkel Thorup, Yin Zhang
29 Balanced allocation and dictionaries with tightly packed constant size bins – Martin Dietzfelbinger, et al. - 2007
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
8 String hashing for linear probing – Mikkel Thorup - 2009
9 Hash-Based Techniques for High-Speed Packet Processing – Adam Kirsch, Michael Mitzenmacher, George Varghese
4 Simple Fast Parallel Hashing by Oblivious Execution – Joseph Gil, Yossi Matias - 1994
2 Some Open Questions Related to Cuckoo Hashing – Michael Mitzenmacher
1 Static and Dynamic Data Management in Networks – Friedhelm Meyer auf der Heide, Berthold Vöcking - 1997
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
1 Incremental hashing in state space search – Stefan Edelkamp, Tilman Mehler, Baroper Str - 2004
2 Practical perfect hashing in nearly optimal space – Fabiano C. Botelho, Rasmus Pagh C, Nivio Ziviani B
13 Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing – Philipp Woelfel - 2005