Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements

DOI10.4230/LIPIcs.FSTTCS.2018.12OpenAlexW2907381788MaRDI QIDQ5090947

Deepanjan Kesh

Publication date: 21 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.12

zbMATH Keywords

data structureslower boundbitprobe modelset membership problem

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (4)

Storing four elements in the two query bitprobe model ⋮ 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

Cites Work

• Two new schemes in the bitprobe model
• Improved Explicit Data Structures in the Bitprobe Model
• Data Structures for Storing Small Sets in the Bitprobe Model
• Set membership with a few bit probes
• Unnamed Item
• Unnamed Item

This page was built for publication: Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements