On the bitprobe complexity of two probe adaptive schemes storing two elements

DOI10.1007/978-3-030-11509-8_5zbMATH Open1502.68099OpenAlexW2910252852MaRDI QIDQ2326565FDOQ2326565

Authors: Deepanjan Kesh, Vidya Sagar Sharma 

Publication date: 10 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_5

Recommendations

• On adaptive bitprobe schemes for storing two elements
• On the bitprobe complexity of two probe adaptive schemes
• Data structures for storing small sets in the bitprobe model
• Lower bounds for restricted schemes in the two-adaptive bitprobe model
• Revisiting explicit adaptive two-probe schemes

zbMATH Keywords

data structureslower boundadaptive schemebitprobe model

Mathematics Subject Classification ID

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (13)

• Lower bounds for restricted schemes in the two-adaptive bitprobe model
• Determining membership with 2 simultaneous queries
• On the bitprobe complexity of two probe adaptive schemes
• Storing four elements in the two query bitprobe model
• An improved scheme in the two query adaptive bitprobe model
• Set membership with a few bit probes
• Automata, Languages and Programming
• Two improved schemes in the bitprobe model
• Set membership with non-adaptive bit probes
• A two query adaptive bitprobe scheme storing five elements
• On adaptive bitprobe schemes for storing two elements
• Revisiting explicit adaptive two-probe schemes
• Data structures for storing small sets in the bitprobe model

This page was built for publication: On the bitprobe complexity of two probe adaptive schemes storing two elements

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