The following pages link to Timothy M. Chan (Q293384):
Displaying 50 items.
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming (Q4209278) (← links)
- (Q4252285) (← links)
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions (Q4507364) (← links)
- (Q4536356) (← links)
- Selection and Sorting in the “Restore” Model (Q4554338) (← links)
- Improved Deterministic Algorithms for Linear Programming in Low Dimensions (Q4554358) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Improved Deterministic Algorithms for Linear Programming in Low Dimensions (Q4575665) (← links)
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky (Q4575668) (← links)
- Applications of Chebyshev polynomials to low-dimensional computational geometry (Q4580100) (← links)
- Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back (Q4580101) (← links)
- Dynamic Orthogonal Range Searching on the RAM, Revisited (Q4580102) (← links)
- (Q4607939) (← links)
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges (Q4625119) (← links)
- (Q4626302) (← links)
- All-pairs shortest paths in geometric intersection graphs (Q4626306) (← links)
- (Q4626308) (← links)
- (Q4633820) (← links)
- (Q4633824) (← links)
- Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels (Q4635566) (← links)
- (Q4636506) (← links)
- ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
- Semi-Online Maintenance of Geometric Optima and Measures (Q4706226) (← links)
- Polynomial-time approximation schemes for packing and piercing fat objects (Q4808318) (← links)
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS (Q4818546) (← links)
- (Q4828970) (← links)
- (Q4828971) (← links)
- (Q4886058) (← links)
- Self-approaching Graphs (Q4912208) (← links)
- Adaptive and Approximate Orthogonal Range Counting (Q4962621) (← links)
- More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems (Q4973055) (← links)
- Orthogonal point location and rectangle stabbing queries in 3-d (Q5002701) (← links)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees (Q5014106) (← links)
- Deterministic APSP, Orthogonal Vectors, and More (Q5028339) (← links)
- (Q5057205) (← links)
- (Q5088947) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5088951) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- (Q5091054) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- Subquadratic Encodings for Point Configurations (Q5115787) (← links)
- Tree drawings revisited (Q5115791) (← links)
- (Q5115792) (← links)
- Dynamic planar orthogonal point location in sublogarithmic time (Q5115793) (← links)
- Approximating text-to-pattern Hamming distances (Q5144951) (← links)
- Better Data Structures for Colored Orthogonal Range Reporting (Q5146806) (← links)
- Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions (Q5146807) (← links)
- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM (Q5167732) (← links)
- On Hardness of Jumbled Indexing (Q5167735) (← links)
