Publications
2000. Efficient expected-case algorithms for planar point location. Algorithm Theory-SWAT 2000. :537-543.
2000. Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.
2007. A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
2011. Approximate polytope membership queries. Proceedings of 43rd Annual ACM Symposium on Theory of Computing. :579-586.
1994. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications. 13:13-91.
1998. Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.
2002. Space-efficient approximate Voronoi diagrams. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. :721-730.
1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.
1994. Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.
2010. Tight lower bounds for halfspace range searching. Proceedings of the 2010 annual symposium on Computational geometry. :29-37.
1995. Approximate range searching. Proceedings of the eleventh annual symposium on Computational geometry. :172-181.
1994. A neural model of cortical map reorganization following a focal lesion. Artificial Intelligence in Medicine. 6(5):383-400.
1993. Point probe decision trees for geometric concept classes. Algorithms and Data Structures. :95-106.
2009. Visual overviews for discovering key papers and influences across research fronts. Journal of the American Society for Information Science and Technology. 60(11):2219-2228.
2008. A Node Aggregation Strategy to Reduce Complexity of Network Visualization using Semantic Substrates.
2005. Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration. Human-Computer Interaction - INTERACT 2005Human-Computer Interaction - INTERACT 2005. 3585:835-846.
2007. Designing Semantic Substrates for Visual Network Exploration. Information VisualizationInformation Visualization. 6(4):281-300.
2005. Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration (2005). Institute for Systems Research Technical Reports.
2009. Improved approximation algorithms for prize-collecting Steiner tree and TSP. 2009 50th Annual IEEE Symposium on Foundations of Computer Science. :427-436.
1998. DHCP++: Applying an efficient implementation method for fail-stop cryptographic protocols. Proceedings of Global Internet (GlobeCom)’98. :59-65.