Export 325 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is A  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Ateniese G, Kamara S, Katz J.  2009.  Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
Atallah GC, Ball MO, Baras JS, Goli SK, Karne RK, Kelley S, Kumar HP, Plaisant C, Roussopoulos N, Shneiderman B et al..  1994.  Next Generation Network Management Technology. Institute for Systems Research Technical Reports.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Atalay FB, Mount D, Mitchell J.  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.
Atalay FB, Mount D.  2003.  Interpolation over light fields with applications in computer graphics. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments. :56-68.
Atalay FB, Mount D.  2002.  Ray interpolants for fast raytracing reflections and refractions. Journal of WSCG (Proc. International Conf. in Central Europe on Comp. Graph., Visualization and Comp. Vision). 10(3):1-8.
Atalay F, Mount D.  2006.  The cost of compatible refinement of simplex decomposition trees. Proceedings of the 15th International Meshing Roundtable. :57-69.
Asgari S, Basili VR, Costa P, Donzelli P, Hochstein L, Lindvall M, Rus I, Shull F, Tvedt R, Zelkowitz MV.  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.
Asgari S, Hochstein L, Basili VR, Zelkowitz MV, Hollingsworth J, Carver J, Shull F.  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.
Asgari S, Basili VR, Carver J, Hochstein L, Hollingsworth J, Zelkowitz MV.  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.
Asahi T, Turo D, Shneiderman B.  1995.  Visual decision-making: using treemaps for the analytic hierarchy process. Conference companion on Human factors in computing systems. :405-406.
Asahi T, Turo D, Shneiderman B.  1995.  Using Treemaps to Visualize the Analytic Hierarchy Process. Information Systems ResearchInformation Systems Research. 6(4):357-375.
Aryangat S, Andrade H, Sussman A.  2004.  Time and space optimization for processing groups of multi-dimensional scientific queries. Proceedings of the 18th annual international conference on Supercomputing. :95-105.
Arya S, da Fonseca GD, Mount D.  2012.  Polytope approximation and the Mahler volume. Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. :29-42.
Arya S, Cheng SW, Mount D, Ramesh H.  2000.  Efficient expected-case algorithms for planar point location. Algorithm Theory-SWAT 2000. :537-543.
Arya S, Malamatos T, Mount D.  2009.  The effect of corners on the complexity of approximate range searching. Discrete & Computational Geometry. 41(3):398-443.
Arya S, da Fonseca GD, Mount D.  2011.  Approximate polytope membership queries. Proceedings of 43rd Annual ACM Symposium on Theory of Computing. :579-586.
Arya S, Malamatos T, Mount D.  2006.  On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
Arya S, Dast G, Mount D, Salowe JS, Smid M.  1995.  M.H.M: Euclidean spanners: short, thin, and lanky. In: 27th ACM Symposium on Theory of Computing. :489-498.
Arya S, Mount D.  1995.  Approximate range searching. Proceedings of the eleventh annual symposium on Computational geometry. :172-181.
Arya S, Das G, Mount D, Salowe JS, Smid M.  1995.  Euclidean spanners: short, thin, and lanky. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :489-498.
Arya S, Malamatos T, Mount D.  2007.  A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
Arya S, Mount D.  1993.  Algorithms for fast vector quantization. Data Compression Conference, 1993. DCC '93.. :381-390.
Arya S, Malamatos T, Mount D.  2005.  Space-time tradeoffs for approximate spherical range counting. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. :535-544.
Arya S, da Fonseca G, Mount D.  2010.  A unified approach to approximate proximity searching. Algorithms–ESA 2010. :374-385.