Data Structures for Storing Small Sets in the Bitprobe Model
From MaRDI portal
Publication:3586392
DOI10.1007/978-3-642-15781-3_14zbMath1287.68031OpenAlexW1540102846MaRDI QIDQ3586392
Smit Shah, Jaikumar Radhakrishnan, Saswata Shannigrahi
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_14
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (9)
Storing four elements in the two query bitprobe model ⋮ On the bitprobe complexity of two probe adaptive schemes ⋮ Lower bounds for restricted schemes in the two-adaptive bitprobe model ⋮ Revisiting explicit adaptive two-probe schemes ⋮ Determining membership with 2 simultaneous queries ⋮ Improved bounds for two query adaptive bitprobe schemes storing five elements ⋮ Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes ⋮ Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements ⋮ A Survey of Data Structures in the Bitprobe Model
This page was built for publication: Data Structures for Storing Small Sets in the Bitprobe Model
