The following pages link to Are Bitvectors Optimal? (Q3149891):
Displaying 12 items.
- Integer representation and counting in the bit probe model (Q848941) (← links)
- Revisiting explicit adaptive two-probe schemes (Q1711411) (← links)
- Determining membership with 2 simultaneous queries (Q2250448) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs (Q2685613) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes (Q5089193) (← links)
- Integer Representation and Counting in the Bit Probe Model (Q5387741) (← links)
