Pages that link to "Item:Q4910576"
From MaRDI portal
The following pages link to Bit-Probe Lower Bounds for Succinct Data Structures (Q4910576):
Displayed 5 items.
- On the bitprobe complexity of two probe adaptive schemes (Q2161242) (← links)
- Determining membership with 2 simultaneous queries (Q2250448) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)