Cache-oblivious dictionaries and multimaps with negligible failure probability

DOI10.1007/978-3-642-34862-4_15MaRDI QIDQ4916042zbMATH OpenOpenAlexFDO

Authors Justin Thaler, Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher

Publication date 19 April 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34862-4_15

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A locality-preserving cache-oblivious dynamic dictionary
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Deterministic dictionaries

Cited in

(6)

• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• Oblivious parallel RAM: improved efficiency and generic constructions
• A Cache-Oblivious Implicit Dictionary with the Working Set Property
• scientific article; zbMATH DE number 2038720 (Why is no real title available?)
• scientific article; zbMATH DE number 6297800 (Why is no real title available?)
• Iceberg hashing: optimizing many hash-table criteria at once

This page was built for publication: Cache-oblivious dictionaries and multimaps with negligible failure probability

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