Set membership with a few bit probes
From MaRDI portal
Publication:5363093
DOI10.1137/1.9781611973730.53zbMath1372.68123arXiv1504.02035OpenAlexW2952523897MaRDI QIDQ5363093
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02035
Related Items (6)
Storing four elements in the two query bitprobe model ⋮ Lower bounds for restricted schemes in the two-adaptive bitprobe model ⋮ Revisiting explicit adaptive two-probe schemes ⋮ Two improved schemes in the bitprobe model ⋮ 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: Set membership with a few bit probes
