2 papers
cs.DS2009
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
Yuriy Arbitman, Moni Naor, Gil Segev
The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known construct…
cs.DS2009
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
Yuriy Arbitman, Moni Naor, Gil Segev
Cuckoo hashing is a highly practical dynamic dictionary: it provides amortized constant insertion time, worst case constant deletion time and lookup time, and good memory utilizati…