Two new schemes in the bitprobe model

DOI10.1007/978-3-319-75172-6_7MaRDI QIDQ1641098zbMATH OpenOpenAlexFDO

Authors Mirza Galib Anwarul Husain Baig, Deepanjan Kesh

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-75172-6_7

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Two improved schemes in the bitprobe model
• Revisiting explicit adaptive two-probe schemes
• An improved scheme in the two query adaptive bitprobe model
• On adaptive bitprobe schemes for storing two elements
• Improved explicit data structures in the bitprobe model

Cited in

(8)

• Revisiting explicit adaptive two-probe schemes
• Storing four elements in the two query bitprobe model
• Lower bounds for restricted schemes in the two-adaptive bitprobe model
• Two improved schemes in the bitprobe model
• An improved scheme in the two query adaptive bitprobe model
• On the power of two, three and four probes
• 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: Two new schemes in the bitprobe model

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