Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. A)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the twenty-sixth annual symposium on Computational geometry
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Improved range searching lower bounds
Proceedings of the twenty-eighth annual symposium on Computational geometry
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |