My research deals with topics in theoretical computer science. I am particularly interested in computational complexity, specifically the determination or characterization of the inherent computational difficulty of solving certain specific problems - or families of problems - on realistic models of computation.

The problems that I am concerned with are fundamental combinatorial problems (including sorting and a number of basic graph theoretic problems, such as graph matchings and their generalizations) and geometric problems (including convex hulls, Voronoi diagrams, point location, geometric intersection, facility location, and motion planning) that have widespread applications.

While much of my research is based on a standard sequential deterministic model of computation, I am also interested in both parallel and distributed models of computation and the use of probabilistic algorithms.

Selected Publications