Are Bitvectors Optimal?
From MaRDI portal
Publication:3149891
DOI10.1137/S0097539702405292zbMath1008.68038MaRDI QIDQ3149891
No author found.
Publication date: 29 September 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (12)
Integer representation and counting in the bit probe model ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Nearly Optimal Static Las Vegas Succinct Dictionary ⋮ An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs ⋮ Expander graphs and their applications ⋮ Revisiting explicit adaptive two-probe schemes ⋮ Integer Representation and Counting in the Bit Probe Model ⋮ Lower bounds for predecessor searching in the cell probe model ⋮ Determining membership with 2 simultaneous queries ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes ⋮ A Survey of Data Structures in the Bitprobe Model
This page was built for publication: Are Bitvectors Optimal?
