Pages that link to "Item:Q420572"
From MaRDI portal
The following pages link to Tight lower bounds for halfspace range searching (Q420572):
Displaying 12 items.
- How hard is half-space range searching? (Q685178) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Semi-group range sum revisited: query-space lower bound tightened (Q1751095) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2875643) (← links)
- (Q4234090) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Tight bounds for blind search on the integers (Q4910723) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465845) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
- Economical convex coverings and applications (Q6583674) (← links)