Cache-oblivious dictionaries and multimaps with negligible failure probability

DOI10.1007/978-3-642-34862-4_15zbMATH Open1383.68028OpenAlexW188489805MaRDI QIDQ4916042FDOQ4916042

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

Recommendations

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

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (5)

• Oblivious network RAM and leveraging parallelism to achieve obliviousness
• A Cache-Oblivious Implicit Dictionary with the Working Set Property
• Title not available (Why is that?)
• Oblivious parallel RAM: improved efficiency and generic constructions
• Title not available (Why is that?)

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)