PhD in Computer Science
The University of Maryland, 1995
Economical convex coverings and applications
Conference paper
Optimal volume-sensitive bounds for polytope approximation
Conference paper
Optimal bound on the combinatorial complexity of approximating polytopes
Conference paper
Approximate Nearest Neighbor Searching With Non-Euclidean and Weighted Distances
Conference paper
Approximate Polytope Membership Queries
Article
Approximate convex intersection detection with applications to width and Minkowski sums
Conference paper
On the Combinatorial Complexity of Approximating Polytopes
Article
Near-optimal epsilon-kernel construction and related problems
Conference paper
Near-optimal ϵ-kernel Construction and Related Problems
Conference paper
Optimal Approximate Polytope Membership
Conference paper
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
Conference paper
On the Combinatorial Complexity of Approximating Polytopes
Conference paper
Approximate geometric MST range queries
Conference paper
Conference paper
Polytope Approximation and the Mahler Volume
Article
Tight Lower Bounds for Halfspace Range Searching
Article
Optimal area-sensitive bounds for polytope approximation
Conference paper
Approximate Polytope Membership Queries
Article
A unified approach to approximate proximity searching
Conference paper
A unified approach to approximate proximity searching
Conference paper
Tight lower bounds for halfspace range searching
Conference paper
Space-Time Tradeoffs for Approximate Nearest Neighbor Searching
Article
The Effect of Corners on the Complexity of Approximate Range Searching
Article
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Conference paper
Tradeoffs in approximate range searching made simpler
Conference paper
A simple entropy-based algorithm for planar point location
Article
Optimal Expected-case Planar Point Location
Article
On the importance of idempotence
Conference paper
The effect of corners on the complexity of approximate range searching
Conference paper
Article
Computational Geometry: Proximity and Location
Book chapter
Space-time tradeoffs for approximate spherical range counting
Conference paper
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
Article
Linear-size approximate Voronoi diagrams
Conference paper
Space-efficient approximate Voronoi diagrams
Conference paper
Approximation algorithm for multiple-tool milling
Article
A simple entropy-based algorithm for planar point location
Conference paper
Entropy-preserving cuttings and space-efficient planar point location
Conference paper
Article
Efficient Expected-Case Algorithms for Planar Point Location
Article
Hardness of Set Cover with Intersection 1
Article
Expected-case complexity of approximate nearest neighbor searching
Conference paper
Nearly Optimal Expected-Case Planar Point Location
Conference paper
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Article
On the expected depth of random circuits
Article
A 2.5-factor approximation algorithm for the k-MST problem
Article
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
Article
ANN: library for approximate nearest neighbor searching
Article
Approximation algorithms for multiple-tool miling
Conference paper
Accounting for Boundary Effects in Nearest-Neighbor Searching
Article
Nearest neighbor searching and applications
Conference paper
Accounting for boundary effects in nearest neighbor searching
Conference paper
Conference paper
Euclidean spanners: short, thin and lanky
Conference paper
An optimal algorithm for approximate nearest neighbor searching
Conference paper
Efficient construction of a bounded degree spanner with low weight
Conference paper
Randomized and deterministic algorithms for geometric spanners of small diameter
Conference paper
Algorithms for Fast Vector Quantization
Conference paper
Approximate Nearest Neighbor Queries in Fixed Dimensions
Conference paper
Textural Analysis of Range Images
Article
Optimal scheduling of assembly language kernels for vector processors
Conference paper
Optimal bound on the combinatorial complexity of approximating polytopes
Optimal scheduling of assembly language kernels for vector processors
Approximate Polytope Membership Queries
Article
Approximate convex intersection detection with applications to width and Minkowski sums
Conference paper
On the Combinatorial Complexity of Approximating Polytopes
Article
Near-optimal epsilon-kernel construction and related problems
Conference paper
Near-optimal ϵ-kernel Construction and Related Problems
Conference paper
Optimal Approximate Polytope Membership
Conference paper
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
Conference paper
On the Combinatorial Complexity of Approximating Polytopes
Conference paper
Approximate geometric MST range queries
Conference paper
Conference paper
Polytope Approximation and the Mahler Volume
Article
Tight Lower Bounds for Halfspace Range Searching
Article
Optimal area-sensitive bounds for polytope approximation
Conference paper
Approximate Polytope Membership Queries
Article
A unified approach to approximate proximity searching
Conference paper
A unified approach to approximate proximity searching
Conference paper
Tight lower bounds for halfspace range searching
Conference paper
Space-Time Tradeoffs for Approximate Nearest Neighbor Searching
Article
The Effect of Corners on the Complexity of Approximate Range Searching
Article
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Conference paper
Tradeoffs in approximate range searching made simpler
Conference paper
A simple entropy-based algorithm for planar point location
Article
Optimal Expected-case Planar Point Location
Article
On the importance of idempotence
Conference paper
The effect of corners on the complexity of approximate range searching
Conference paper
Article
Computational Geometry: Proximity and Location
Book chapter
Space-time tradeoffs for approximate spherical range counting
Conference paper
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
Article
Linear-size approximate Voronoi diagrams
Conference paper
Space-efficient approximate Voronoi diagrams
Conference paper
Approximation algorithm for multiple-tool milling
Article
A simple entropy-based algorithm for planar point location
Conference paper
Entropy-preserving cuttings and space-efficient planar point location
Conference paper
Article
Efficient Expected-Case Algorithms for Planar Point Location
Article
Hardness of Set Cover with Intersection 1
Article
Expected-case complexity of approximate nearest neighbor searching
Conference paper
Nearly Optimal Expected-Case Planar Point Location
Conference paper
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Article
On the expected depth of random circuits
Article
A 2.5-factor approximation algorithm for the k-MST problem
Article
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
Article
ANN: library for approximate nearest neighbor searching
Article
Approximation algorithms for multiple-tool miling
Conference paper
Accounting for Boundary Effects in Nearest-Neighbor Searching
Article
Nearest neighbor searching and applications
Conference paper
Accounting for boundary effects in nearest neighbor searching
Conference paper
Conference paper
Euclidean spanners: short, thin and lanky
Conference paper
An optimal algorithm for approximate nearest neighbor searching
Conference paper
Efficient construction of a bounded degree spanner with low weight
Conference paper
Randomized and deterministic algorithms for geometric spanners of small diameter
Conference paper
Algorithms for Fast Vector Quantization
Conference paper
Approximate Nearest Neighbor Queries in Fixed Dimensions
Conference paper
Textural Analysis of Range Images
Article
Optimal scheduling of assembly language kernels for vector processors
Conference paper
No Publications |
No Publications |
COMP2711 | Discrete Mathematical Tools for Computer Science |
COMP4981 | Final Year Project |
COMP2711H | Honors Discrete Mathematical Tools for Computer Science |
COMP4981 | Final Year Project |
COMP4981 | Final Year Project |
COMP4981 | Final Year Project |
COMP5712 | Introduction to Combinatorial Optimization |
CPEG4901 | Computer Engineering Final Year Project in COMP |
No Teaching Assignments |
No Teaching Assignments |
Update your browser to view this website correctly. Update your browser now