Improved explicit data structures in the bitprobe model

DOI10.1007/978-3-662-44777-2_52MaRDI QIDQ2921449zbMATH OpenOpenAlexFDO

Authors J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman, Moshe Lewenstein

Publication date 8 October 2014

Published in Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44777-2_52

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Two improved schemes in the bitprobe model
• Data structures for storing small sets in the bitprobe model
• Revisiting explicit adaptive two-probe schemes
• Set membership with a few bit probes
• scientific article; zbMATH DE number 1875423

Cited in

(12)

• Two new schemes in the bitprobe model
• Revisiting explicit adaptive two-probe schemes
• Storing four elements in the two query bitprobe model
• On the bitprobe complexity of two probe adaptive schemes
• Lower bounds for restricted schemes in the two-adaptive bitprobe model
• Two improved schemes in the bitprobe model
• A Survey of Data Structures in the Bitprobe Model
• Are Bitvectors Optimal?
• Data structures for storing small sets in the bitprobe model
• scientific article; zbMATH DE number 1875423 (Why is no real title available?)
• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
• Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements

This page was built for publication: Improved explicit data structures in the bitprobe model

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