Publications

Export 566 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is V  [Clear All Filters]
1993
Berkman O, Vishkin U.  1993.  On parallel integer merging. Information and Computation. 106(2):266-285.
Landau G, Vishkin U.  1993.  Two dimensional pattern matching in a digitized image. Combinatorial Pattern Matching. :134-151.
1992
Vishkin U.  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.
Dorr BJ, Voss C.  1992.  Constraining MT divergences: spatial relations in the lexicon and knowledge base.
Voytas DF, Cummings MP, Koniczny A, Ausubel FM, Rodermel SR.  1992.  copia-like retrotransposons are ubiquitous among plants. Proc Natl Acad Sci USA. 89(15):7124-7128.
Amir A, Landau GM, Vishkin U.  1992.  Efficient pattern matching with scaling. Journal of Algorithms. 13(1):2-32.
Varshney A, Prins JF.  1992.  An environment projection approach to radiosity for meshconnected computers. Third Eurographics Workshop on Rendering. :271-281.
Doermann D, Varma V, Rosenfeld A.  1992.  Instrument Grasp: AModel and its Effects on Handwritten Strokes. CAR-TR-614
Vishkin U.  1992.  Methods in parallel algorithmcs. Mathematical Foundations of Computer Science 1992. :81-81.
Vishkin U.  1992.  Methods in parallel algorithmics and who may need to know them? Algorithms and Computation. :1-4.
Varma V, Doermann D.  1992.  Modeling of a Grasp for Handwriting. Proceedings of the Twenty-Third Annual Modeling and Simulation Conference. :2133-2140.
Vishkin U.  1992.  A parallel blocking flow algorithm for acyclic networks. Journal of Algorithms. 13(3):489-501.
Khuller S, Mitchell SG, Vazirani VV.  1992.  Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
Berkman O, Matias Y, Vishkin U.  1992.  Randomized range-maxima in nearly-constant parallel time. Computational Complexity. 2(4):350-373.
Rhoades J, Turk G, Bell A, State A, Neumann U, Varshney A.  1992.  Real-time procedural textures. Proceedings of the 1992 symposium on Interactive 3D graphics. :95-100.
Doermann D, Varma V.  1992.  Simulating Pressure Variations in Handwriting. Proceedings of the Twenty-Third Annual Modeling and Simulation Conference. :2141-2148.
Brooks FP, Airey J, Alspaugh J, Bell A, Brown R, Hill C, Nimscheck U, Rheingans P, Rohlf J, Smith D et al..  1992.  Six Generations of Building Walkthrough: Final Technical Report to the National Science Foundation.
1991
Cole R, Vishkin U.  1991.  Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms. Information and Computation. 92(1):1-47.
Vishkin U.  1991.  Can parallel algorithms enhance serial implementation? Parallel Processing Symposium, 1994. Proceedings., Eighth International. :376-385.
Matias Y, Vishkin U.  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.
Matias Y, Vishkin U.  1991.  On parallel hashing and integer sorting. Journal of Algorithms. 12(4):573-606.
Varshney A.  1991.  Parallel radiosity techniques for mesh-connected SIMD computers.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Vishkin U.  1991.  Structural parallel algorithmics. Automata, Languages and Programming. :363-380.
Konieczny A, Voytas DF, Cummings MP, Ausubel FM.  1991.  A superfamily of ıt Arabidopsis thaliana retrotransposons. Genetics. 127(4):801-809.

Pages