Publications

Arya S, Malamatos T, Mount D. 2000. Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.

Arya S, Mount D, Xia J. 2010. Tight lower bounds for halfspace range searching. Proceedings of the 2010 annual symposium on Computational geometry. :29-37.

Arya S, Malamatos T, Mount D. 2001. Entropy-preserving cuttings and space-efficient planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :256-261.

Arya S, Fonseca G, Mount D. 2008. Tradeoffs in Approximate Range Searching Made Simpler. Computer Graphics and Image Processing, 2008. SIBGRAPI '08. XXI Brazilian Symposium on. :237-244.

Arya S, Mount D, Netanyahu NS, Silverman R, Wu AY. 1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.

Arya S, Mount D. 1993. Approximate nearest neighbor queries in fixed dimensions. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. :271-280.

Arya S, Mount D, Vigneron A, Xia J. 2008. Space-time tradeoffs for proximity searching in doubling spaces. Algorithms-ESA 2008. :112-123.

Arya S, Phamdo N, Farvardin N, Mount D. 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.

Arya S, Mount D, Smid M. 1994. Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.

Arya S, Malamatos T, Mount D. 2001. A simple entropy-based algorithm for planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :262-268.

Arya S, Mount D, Smid M. 1994. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications. 13:13-91.

Arya S, Malamatos T, Mount D. 2009. Space-time tradeoffs for approximate nearest neighbor searching. Journal of the ACM (JACM). 57(1):1:1–1:54-1:1–1:54.

Arya S, Cheng S-W, Mount D. 1998. Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.

Arya S, Malamatos T, Mount D, Wong KC. 2007. Optimal expected-case planar point location. SIAM Journal on Computing. 37(2):584-584.

Arya S, Mount D, Narayan O. 1996. Accounting for boundary effects in nearest-neighbor searching. Discrete & Computational Geometry. 16(2):155-176.

Arya S, Mount D. 1993. Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.

Arya S, Malamatos T, Mount D. 2002. Space-efficient approximate Voronoi diagrams. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. :721-730.

Arya S, Mount D. 2000. Approximate range searching. Computational Geometry. 17(3–4):135-152.

Armentrout SL, Reggia JA, Weinrich M. 1994. A neural model of cortical map reorganization following a focal lesion. Artificial Intelligence in Medicine. 6(5):383-400.

Arlt S, Banerjee I, Bertolini C, Memon AM, Schäf M. 2012. Grey-box GUI Testing: Efficient Generation of Event Sequences. arXiv:1205.4928.

Arlat DPMCJ, Crouzet Y. 1996. Estimation of time-dependent coverage. 96466

Arkin EM, Khuller S, Mitchell JSB. 1993. Geometric knapsack problems. Algorithmica. 10(5):399-427.

Arkin EM, Belleville P, Mitchell JSB, Mount D, Romanik K, Salzberg S, Souvaine D. 1997. Testing simple polygons. Computational Geometry. 8(2):97-114.

Arkin E, Goodrich M, Mitchell J, Mount D, Piatko C, Skiena S. 1993. Point probe decision trees for geometric concept classes. Algorithms and Data Structures. :95-106.

Pages