Pages that link to "Item:Q696979"
From MaRDI portal
The following pages link to Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979):
Displaying 8 items.
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- A cell probe lower bound for dynamic nearest-neighbour searching (Q2768380) (← links)
- A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (Q2819559) (← links)
- Lower bounds for high dimensional nearest neighbor search and related problems (Q2819560) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Tight Cell-Probe Bounds for Online Hamming Distance Computation (Q5741756) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
