Highly Influenced

8 Excerpts

- Published 2003 in Theory of Computing Systems

We generalize Cuckoo Hashing to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ε)n memory cells, for any constant ε > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d=O (ln (1/ε)) probes and the expected amortized insertion time is constant. This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + ε)n space, and supports satellite information. Experiments indicate that d = 4 probes suffice for ε ≈ 0.03. We also describe variants of the data structure that allow the use of hash functions that can be evaluated in constant time.

Citations per Year

Semantic Scholar estimates that this publication has **167** citations based on the available data.

See our **FAQ** for additional information.

Showing 1-10 of 107 extracted citations

Highly Influenced

8 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

10 Excerpts

@article{Fotakis2003SpaceEH,
title={Space Efficient Hash Tables with Worst Case Constant Access Time},
author={Dimitris Fotakis and Rasmus Pagh and Peter Sanders and Paul G. Spirakis},
journal={Theory of Computing Systems},
year={2003},
volume={38},
pages={229-248}
}