Publications
2007. Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions. International Journal of Computational Geometry and Applications. 17(6):595-631.
2004. Empirical-based estimation of the effect on software dependability of a technique for architecture conformance verification. Proceedings of the ICSE 2004 Workshop on Architecting Dependable Systems, Edinburgh, UK.
2004. Challenges in Measuring HPCS Learner Productivity in an Age of Ubiquitous Computing: The HPCS Program. In Proceedings of ICSE Workshop on High Productivity Computing. May 2004.
2005. Generating testable hypotheses from tacit knowledge for high productivity computing. Proceedings of the second international workshop on Software engineering for high performance computing system applications. :17-21.
1995. Visual decision-making: using treemaps for the analytic hierarchy process. Conference companion on Human factors in computing systems. :405-406.
1995. Using Treemaps to Visualize the Analytic Hierarchy Process. Information Systems ResearchInformation Systems Research. 6(4):357-375.
2004. Time and space optimization for processing groups of multi-dimensional scientific queries. Proceedings of the 18th annual international conference on Supercomputing. :95-105.
2006. On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
1993. Algorithms for fast vector quantization. Data Compression Conference, 1993. DCC '93.. :381-390.
2009. Space-time tradeoffs for approximate nearest neighbor searching. Journal of the ACM (JACM). 57(1):1:1–1:54-1:1–1:54.
2012. Polytope approximation and the Mahler volume. Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. :29-42.
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.