Yuriy Arbitman, Moni Naor, Gil Segev. Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 787-796, IEEE Computer Society, 2010. [doi]
@inproceedings{ArbitmanNS10,
title = {Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation},
author = {Yuriy Arbitman and Moni Naor and Gil Segev},
year = {2010},
doi = {10.1109/FOCS.2010.80},
url = {http://dx.doi.org/10.1109/FOCS.2010.80},
researchr = {https://researchr.org/publication/ArbitmanNS10},
cites = {0},
citedby = {0},
pages = {787-796},
booktitle = {51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-4244-7},
}