The following pages link to Sunil Arya (Q293202):
Displayed 46 items.
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- Tight lower bounds for halfspace range searching (Q420572) (← links)
- The effect of corners on the complexity of approximate range searching (Q1014333) (← links)
- Approximate range searching (Q1595401) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (Q1807649) (← links)
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs. (Q1853137) (← links)
- Efficient construction of a bounded-degree spanner with low weight (Q2365175) (← links)
- (Q2721994) (← links)
- (Q2754182) (← links)
- (Q2768303) (← links)
- (Q2768304) (← links)
- Optimal area-sensitive bounds for polytope approximation (Q2874597) (← links)
- (Q2921710) (← links)
- On the importance of idempotence (Q2931419) (← links)
- A simple entropy-based algorithm for planar point location (Q2944554) (← links)
- (Q3128920) (← links)
- (Q3132844) (← links)
- (Q3140429) (← links)
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions (Q3158524) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- Space-time tradeoffs for approximate nearest neighbor searching (Q3578185) (← links)
- Space-efficient approximate Voronoi diagrams (Q3579252) (← links)
- A Unified Approach to Approximate Proximity Searching (Q3586478) (← links)
- (Q3601516) (← links)
- (Q4234097) (← links)
- On the Expected Depth of Random Circuits (Q4256686) (← links)
- A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees (Q4575666) (← links)
- Optimal Approximate Polytope Membership (Q4575755) (← links)
- (Q4580082) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels (Q4635566) (← links)
- (Q4643896) (← links)
- APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING (Q4682171) (← links)
- Expected-Case Complexity of Approximate Nearest Neighbor Searching (Q4706232) (← links)
- (Q4828927) (← links)
- (Q4952641) (← links)
- (Q5009560) (← links)
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (Q5146818) (← links)
- Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances (Q5236204) (← links)
- Approximate geometric MST range queries (Q5368728) (← links)
- Optimal Expected-Case Planar Point Location (Q5386214) (← links)
- Tight lower bounds for halfspace range searching (Q5405859) (← links)
- Approximate polytope membership queries (Q5419128) (← links)
- (Q5743375) (← links)
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes (Q6058263) (← links)