Improved bounds for two query adaptive bitprobe schemes storing five elements

DOI10.1007/978-3-030-36412-0_2zbMath1434.68118arXiv1910.03651OpenAlexW3194085352MaRDI QIDQ5918817

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh

Publication date: 13 May 2020

Published in: Theoretical Computer Science, Combinatorial Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

data structuresadaptive schemedata structurebitprobe modelset-membership problemset membership problem

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Lower bounds for restricted schemes in the two-adaptive bitprobe model ⋮ Improved bounds for two query adaptive bitprobe schemes storing five elements

Cites Work

• Unnamed Item
• Unnamed Item
• Two new schemes in the bitprobe model
• On adaptive bitprobe schemes for storing two elements
• An improved scheme in the two query adaptive bitprobe model
• Improved Explicit Data Structures in the Bitprobe Model
• Are bitvectors optimal?
• 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
• Improved bounds for two query adaptive bitprobe schemes storing five elements

This page was built for publication: Improved bounds for two query adaptive bitprobe schemes storing five elements