Improved Explicit Data Structures in the Bitprobe Model

DOI10.1007/978-3-662-44777-2_52zbMath1425.68090OpenAlexW1591623012MaRDI QIDQ2921449

Venkatesh Raman, Patrick K. Nicholson, J. Ian Munro, 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)

Related Items (7)

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 ⋮ Improved bounds for two query adaptive bitprobe schemes storing five elements ⋮ Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes ⋮ Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements ⋮ A Survey of Data Structures in the Bitprobe Model

This page was built for publication: Improved Explicit Data Structures in the Bitprobe Model