Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Arya, Sunil - Department of Computer Science, Hong Kong University of Science and Technology
Optimal Expected-Case Planar Point Location Theocharis Malamatos
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Expected-Case Complexity of Approximate Nearest Neighbor Ho-Yam Addy Fu
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
Binary Space Partitions for Axis-Parallel Line Segments: Size-Height Tradeoffs
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
The Effect of Corners on the Complexity of Approximate Range Theocharis Malamatos
Space-Time Tradeoffs for Approximate Spherical Range Counting Theocharis Malamatos
International Journal of Computational Geometry & Applications c World Scientific Publishing Company
On the Importance of Idempotence Department of Computer
A Simple Entropy-Based Algorithm for Planar Point Location Theocharis Malamatos
Tight Lower Bounds for Halfspace Range Searching [Extended Abstract]
Approximate Polytope Membership Queries Department of Computer Science and Engineering
Tradeoffs in Approximate Range Searching Made Simpler Sunil Arya
A Unified Approach to Approximate Proximity Searching Department of Computer Science
Space-Efficient Approximate Voronoi Diagrams Department of Computer
Linear-Size Approximate Voronoi Diagrams Theocharis Malamatos
Euclidean Spanners: Short, Thin, and Lanky Sunil Arya Gautam Dasy David M. Mountz Je rey S. Salowex Michiel Smid
Randomized and deterministic algorithms for geometric spanners of small diameter
On the Expected Depth of Random Circuits Mordecai J. Golin
Accounting for Boundary Effects in Nearest Neighbor David M. Mount
Approximate Nearest Neighbor Queries in Fixed Dimensions David M. Mount
A 2.5 Factor Approximation Algorithm for the k-MST The k-MST problem requires finding that subset of at least k vertices of a given
Space-Time Tradeoffs for Approximate Nearest Neighbor Searching
Efficient Construction of a Bounded Degree Spanner with Low Weight
Approximate Range Searching Department of Computer Science
Efficient Expected-Case Algorithms for Planar Point Location
Algorithms for Fast Vector Quantization Department of Computer Science
Polytope Approximation and the Mahler Volume Department of Computer Science and Engineering