Publications
1993. Fast search algorithms with applications to split and multi-stage vector quantization of speech lsp parameters. Speech Coding for Telecommunications, 1993. Proceedings., IEEE Workshop on. :65-66.
1993. Approximate nearest neighbor queries in fixed dimensions. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. :271-280.
2001. Entropy-preserving cuttings and space-efficient planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :256-261.
1996. Accounting for boundary effects in nearest-neighbor searching. Discrete & Computational Geometry. 16(2):155-176.
2008. Space-time tradeoffs for proximity searching in doubling spaces. Algorithms-ESA 2008. :112-123.
1995. M.H.M: Euclidean spanners: short, thin, and lanky. In: 27th ACM Symposium on Theory of Computing. :489-498.
1995. Euclidean spanners: short, thin, and lanky. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :489-498.
1993. Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.
2001. A simple entropy-based algorithm for planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :262-268.
2009. The effect of corners on the complexity of approximate range searching. Discrete & Computational Geometry. 41(3):398-443.
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.
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.
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. Human-Computer Interaction - INTERACT 2005Human-Computer Interaction - INTERACT 2005. 3585:835-846.
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 (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. Automated recovery in a secure bootstrap process. Proceedings of the Symposium on Network and Distributed Systems Security (NDSS’98). :155-167.