Arya, S., T. Malamatos and D. M. Mount: A simple entropy-based algorithm for planar point location. In: ACM Transactions on Algorithms 3, 2, Seq. No.: 17 (2007).
localid: C12573CC004A8E26-79E8D6DBF10CC718C1257393004DDEE4-Malamatos2007b
Arya, S., T. Malamatos, D.M. Mount and K.C. Wong: Optimal expected-case planar point location. In: SIAM Journal on Computing 37, 2, 584-610 (2007).
doi: 10.1137/S0097539704446724
localid: C12573CC004A8E26-42963F5202A944F1C1257393004D12BE-Malamatos2007a
Arya, S., T. Malamatos and D.M. Mount: On the Importance of Idempotence. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06 ACM, New York, USA (2006) 564-573.
localid: C1256428004B93B8-1BF1CFF369CE953CC125721B00694225-AMM2006a
Arya, S., T. Malamatos and D.M. Mount: The Effect of Corners on the Complexity of Approximate Range Searching. In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06 ACM, New York, USA (2006) 11-20.
localid: C1256428004B93B8-9AFFDC095356AB50C125721B006A3640-AMM2006b
Arya, S., T. Malamatos and D.M. Mount: Space-Time Tradeoffs for Approximate Spherical Range Counting. In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05) SIAM, Philadelphia, USA (2005) 535-544.
localid: C1256428004B93B8-9D8C2AD6A052BC81C1256FA9005819A7-AMM2005
Arya, S. and D.M. Mount: Approximate range searching. In: Computational Geometry 17, 3/4, 135-152 (2000).
localid: C1256428004B93B8-53155C4513FDF272C1256A0F0050D185-AryaMount2000
Kumar, V. S. A., S. Arya and R. Hariharan: Hardness of Set Cover with Intersection 1. In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), (Eds.) Montanari, Ugo; Rolim, José D. P.; Welzl, Emo. Lecture Notes in Computer Science. Springer, Berlin, Germany (2000) 624-635.
localid: C1256428004B93B8-93D64C1F0FB48843C1256A0000527E39-Kumar2000
Arya, S., M.J. Golin and K. Mehlhorn: On the Expected Depth of Random Circuits. In: Combinatorics, Probability and Computing 8, 209-228 (1999).
localid: C1256428004B93B8-CBF5E4FADC0F4CBDC12571D80047CDEE-mehlhorn99
Arya, S. and M. Smid: Efficient construction of a bounded degree spanner with low weight. In: Algorithmica 17, 1, 33-54 (1997).
localid: C1256428004B93B8-A7CCDC304E2A29B0C1256484004F38B4-Arya-Smid96
Arya, S., D.M. Mount and O. Narayan: Accounting for boundary effects in nearest neighbor searching. In: Discrete & Computational Geometry 16, 2, 155-176 (1996).
localid: C1256428004B93B8-2E0C4C041AEA4170C1256484004F03DD-Arya-Mount-Narayan96
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.