Backyard cuckoo hashing: constant worst-case operations with a succinct representation

DOI10.1109/FOCS.2010.80MaRDI QIDQ6990270zbMATH OpenFDO

Authors Gil Segev, Moni Naor, Yuriy Arbitman

Publication date 29 April 2025

Full work available at URL https://doi.org/10.1109/FOCS.2010.80

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(9)

• Sparse suffix and LCP array: simple, direct, small, and fast
• Iceberg hashing: optimizing many hash-table criteria at once
• Ribbon: fast succinct static retrieval and approximate membership
• Succinct filters for sets of unknown sizes
• Online sorting and online TSP: Randomized, stochastic, and high-dimensional
• Are your keys protected? Time will tell
• Tiny pointers
• Daisy Bloom filters
• Dynamic filter and retrieval with one access to modifiable memory

This page was built for publication: Backyard cuckoo hashing: constant worst-case operations with a succinct representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6990270)