On adaptive bitprobe schemes for storing two elements

DOI10.1007/978-3-319-71150-8_39MaRDI QIDQ1699819zbMATH OpenOpenAlexFDO

Authors Deepanjan Kesh

Publication date 26 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71150-8_39

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• On the bitprobe complexity of two probe adaptive schemes storing two elements
• A two query adaptive bitprobe scheme storing five elements
• Two improved schemes in the bitprobe model
• An improved scheme in the two query adaptive bitprobe model
• Revisiting explicit adaptive two-probe schemes

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
• Determining membership with 2 simultaneous queries
• Two improved schemes in the bitprobe model
• An improved scheme in the two query adaptive bitprobe model
• On the bitprobe complexity of two probe adaptive schemes storing two elements
• Data structures for storing small sets in the bitprobe model
• Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements
• A two query adaptive bitprobe scheme storing five elements

This page was built for publication: On adaptive bitprobe schemes for storing two elements

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