Pages that link to "Item:Q5204338"
From MaRDI portal
The following pages link to Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338):
Displaying 6 items.
- How hard is half-space range searching? (Q685178) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2875643) (← links)
- (Q4035265) (← links)