Lower bounds for restricted schemes in the two-adaptive bitprobe model

DOI10.1007/978-3-031-06678-8_3zbMath1499.68072arXiv2204.03266OpenAlexW4285105320MaRDI QIDQ2169936

Divyam Singal, Sreshth Aggarwal, Deepanjan Kesh

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2204.03266

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Two new schemes in the bitprobe model
• On the bitprobe complexity of two probe adaptive schemes storing two elements
• A Survey of Data Structures in the Bitprobe Model
• Improved Explicit Data Structures in the Bitprobe Model
• Data Structures for Storing Small Sets in the Bitprobe Model
• Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements
• Set membership with a few bit probes
• Improved bounds for two query adaptive bitprobe schemes storing five elements

This page was built for publication: Lower bounds for restricted schemes in the two-adaptive bitprobe model