Publications
Export 325 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is A [Clear All Filters]
2009. Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
1994. Next Generation Network Management Technology. Institute for Systems Research Technical Reports.
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.
2003. Interpolation over light fields with applications in computer graphics. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments. :56-68.
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.
2006. The cost of compatible refinement of simplex decomposition trees. Proceedings of the 15th International Meshing Roundtable. :57-69.
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.
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.
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.
2009. Space-time tradeoffs for approximate nearest neighbor searching. Journal of the ACM (JACM). 57(1):1:1–1:54-1:1–1:54.
1998. Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.
1996. Accounting for boundary effects in nearest-neighbor searching. Discrete & Computational Geometry. 16(2):155-176.
1993. Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.
2002. Space-efficient approximate Voronoi diagrams. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. :721-730.
2012. Polytope approximation and the Mahler volume. Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. :29-42.
2000. Efficient expected-case algorithms for planar point location. Algorithm Theory-SWAT 2000. :537-543.
2009. The effect of corners on the complexity of approximate range searching. Discrete & Computational Geometry. 41(3):398-443.
2011. Approximate polytope membership queries. Proceedings of 43rd Annual ACM Symposium on Theory of Computing. :579-586.
2006. On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.