Publications

Export 566 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is V  [Clear All Filters]
1991
Gil J, Matias Y, Vishkin U.  1991.  Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.
1990
Landau GM, Vishkin U, Nussinov R.  1990.  [31] Fast alignment of DNA and protein sequences. Methods in Enzymology. 183:487-502.
Vishkin U.  1990.  Deterministic sampling—a new technique for fast pattern matching. Proceedings of the twenty-second annual ACM symposium on Theory of computing. :170-180.
Landau GM, Vishkin U, Nussinov R.  1990.  Fast alignment of DNA and protein sequences. Methods in enzymology. 183:487-502.
Schieber B, Vishkin U.  1990.  Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
Khuller S, Mitchell SG, Vazirani VV.  1990.  On-line algorithms for weighted matching and stable marriages. TR90-1143
Voytas DF, Konieczny A, Cummings MP, Ausubel FM.  1990.  The structure, distribution and evolution of the ıt Ta1 retrotransposable element family of ıt Arabidopsis thaliana. Genetics. 126(3):713-721.
1989
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
Cole R, Vishkin U.  1989.  Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
1988
Cole R, Vishkin U.  1988.  The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica. 3(1):329-346.
Cole R, Vishkin U.  1988.  Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing. 17:128-128.
Ramachandran V, Vishkin U.  1988.  Efficient parallel triconnectivity in logarithmic time. VLSI Algorithms and Architectures. :33-42.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences.. J. COMP. SYST. SCI.. 37(1):63-78.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
Megiddo N, Vishkin U.  1988.  On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
Schieber B, Vishkin U.  1988.  On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
Landau GM, Vishkin U, Nussinov R.  1988.  Locating alignments with k differences for nucleotide and amino acid sequences. Computer applications in the biosciences: CABIOS. 4(1):19-19.
Eilam-Tzoreff T, Vishkin U.  1988.  Matching patterns in strings subject to multi-linear transformations. Theoretical Computer Science. 60(3):231-254.
Cole R, Vishkin U.  1988.  Optimal parallel algorithms for expression tree evaluation and list ranking. VLSI Algorithms and Architectures. :91-100.
Apostolico A, Iliopoulos C, Landau GM, Schieber B, Vishkin U.  1988.  Parallel construction of a suffix tree with applications. Algorithmica. 3(1):347-365.
Vishkin U.  1988.  PRAM algorithms: teach and preach. collection of position papers, IBM-NSF Workshop on$\textbackslashbackslash$ Opportunities and Constraints of Parallel Computing", IBM Almaden.
1987
Kozen D, Teitelbaum T, Chen WZ, Field JH, Pugh W, Vander Zanden BT.  1987.  ALEX-an Alexical Programming Language. TR87-835
Landau GM, Vishkin U, Nussinov R.  1987.  An efficient string matching algorithm with K substitutions for nucleotide and amino acid sequences*. Journal of theoretical biology. 126(4):483-490.
O'Leary DP.  1987.  Fine and Medium Grained Parallel Algorithms for Matrix QR Factorization. Algorithms and Applications on Vector and Parallel ComputersAlgorithms and Applications on Vector and Parallel Computers. :347-349.
Vishkin U.  1987.  An optimal parallel algorithm for selection. Parallel and Distributed Computing. 4:79-86.

Pages