Publications
Export 566 results:
Author Title Type [ Year] Filters: First Letter Of Last Name is V [Clear All Filters]
1993. Two dimensional pattern matching in a digitized image. Combinatorial Pattern Matching. :134-151.
1992. Biconnectivity Approximations and Graph Carvings. Proceedings of the Twenty-fourth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, May 4-6, 1992. :759-759.
1992. copia-like retrotransposons are ubiquitous among plants. Proc Natl Acad Sci USA. 89(15):7124-7128.
1992. An environment projection approach to radiosity for meshconnected computers. Third Eurographics Workshop on Rendering. :271-281.
1992. Methods in parallel algorithmics and who may need to know them? Algorithms and Computation. :1-4.
1992. Modeling of a Grasp for Handwriting. Proceedings of the Twenty-Third Annual Modeling and Simulation Conference. :2133-2140.
1992. A parallel blocking flow algorithm for acyclic networks. Journal of Algorithms. 13(3):489-501.
1992. Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
1992. Randomized range-maxima in nearly-constant parallel time. Computational Complexity. 2(4):350-373.
1992. Real-time procedural textures. Proceedings of the 1992 symposium on Interactive 3D graphics. :95-100.
1992. Simulating Pressure Variations in Handwriting. Proceedings of the Twenty-Third Annual Modeling and Simulation Conference. :2141-2148.
1991. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms. Information and Computation. 92(1):1-47.
1991. Can parallel algorithms enhance serial implementation? Parallel Processing Symposium, 1994. Proceedings., Eighth International. :376-385.
1991. Converting high probability into nearly-constant time—with applications to parallel hashing. Proceedings of the twenty-third annual ACM symposium on Theory of computing. :307-316.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.