Space Efficient Hash Tables With Worst Case Constant Access Time (2003)

by Dimitris Fotakis , Rasmus Pagh , Peter Sanders , Paul Spirakis
Venue:In STACS
Citations:47 - 4 self

Active Bibliography

17 Cuckoo hashing: Further analysis – Luc Devroye, Pat Morin, Communicated F. Dehne - 2003
7 Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation – Yuriy Arbitman, Moni Naor, Gil Segev - 2010
5 Compact Dictionaries for Variable-Length Keys and Data, with Applications – Daniel K. Blandford, Guy E. Blelloch - 2007
9 History-Independent Cuckoo Hashing – Moni Naor, Gil Segev, Udi Wieder
4 Compact Data Structures with Fast Queries – Daniel K. Blandford, Christos Faloutsos, Danny Sleator - 2005
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
On Worst Case Robin-Hood Hashing – Luc Devroye, Pat Morin, Alfredo Viola - 2004
1 Incremental hashing in state space search – Stefan Edelkamp, Tilman Mehler, Baroper Str - 2004
12 Strongly history-independent hashing with applications – Guy E. Blelloch - 2007
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
29 Balanced allocation and dictionaries with tightly packed constant size bins – Martin Dietzfelbinger, et al. - 2007
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
Succincter – Mihai Patrascu
Some Experimental Results on Data Structure Compression – n.n.
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
3 Dispersing Hash Functions – Rasmus Pagh - 2000
20 Monotone Minimal Perfect Hashing: Searching a Sorted Table with O(1) Accesses – Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna
7 A Trade-Off For Worst-Case Efficient Dictionaries – Rasmus Pagh
2 Practical perfect hashing in nearly optimal space – Fabiano C. Botelho, Rasmus Pagh C, Nivio Ziviani B