Halfplanar range search in linear space and O(n0.695) query time
Information Processing Letters
Filtering search: a new approach to query answering
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Space searching for intersecting objects
Journal of Algorithms
Partitioning space for range queries
SIAM Journal on Computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Good splitters for counting points in triangles
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Ray shooting and other applications of spanning trees with low stabbing number
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Intersection queries in sets of disks
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
| Hi-index | 0.00 |