Two improved schemes in the bitprobe model

DOI10.1016/J.TCS.2019.08.033zbMATH Open1436.68080OpenAlexW2970227615MaRDI QIDQ2285152FDOQ2285152

Authors: Mirza Galib Anwarul Husain Baig, Deepanjan Kesh 

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.033

Recommendations

• Two new schemes in the bitprobe model
• An improved scheme in the two query adaptive bitprobe model
• Improved explicit data structures in the bitprobe model
• On the bitprobe complexity of two probe adaptive schemes
• On adaptive bitprobe schemes for storing two elements
• On the bitprobe complexity of two probe adaptive schemes storing two elements
• Improved versions of Tardos' fingerprinting scheme
• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes

zbMATH Keywords

data structuresbitprobe modelset membership problem

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Two new schemes in the bitprobe model
• On adaptive bitprobe schemes for storing two elements
• A Survey of Data Structures in the Bitprobe Model
• On the power of two, three and four probes
• Set membership with a few bit probes

Cited In (8)

• Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
• Two new schemes in the bitprobe model
• Improved explicit data structures in the bitprobe model
• Storing four elements in the two query bitprobe model
• An improved scheme in the two query adaptive bitprobe model
• On adaptive bitprobe schemes for storing two elements
• Revisiting explicit adaptive two-probe schemes
• On the power of two, three and four probes

This page was built for publication: Two improved schemes in the bitprobe model

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