Publications

Export 566 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is V  [Clear All Filters]
1985
Vishkin U.  1985.  Optimal parallel pattern matching in strings. Information and Control. 67(1-3):91-113.
Coppersmith D, Vishkin U.  1985.  Solving NP-hard problems in [] almost trees': Vertex cover. Discrete applied mathematics. 10(1):27-45.
1986
Cole R, Vishkin U.  1986.  The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, Ultracomputer Note-108.
Cole R, Vishkin U.  1986.  Approximate and exact parallel scheduling with applications to list, tree and graph problems. 27th Annual Symposium on Foundations of Computer Science. :478-491.
Cole R, Vishkin U.  1986.  Approximate scheduling, exact scheduling, and applications to parallel algorithms. Proceedings Symposium on Foundations of Computer Science. :478-491.
Cole R, Vishkin U.  1986.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. Proceedings of the eighteenth annual ACM symposium on Theory of computing. :206-219.
Cole R, Vishkin U.  1986.  Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control. 70(1):32-53.
Landau GM, Vishkin U.  1986.  Efficient Parallel and Serial String Matching. Computer Science Department Technical Report. 221
Landau GM, Vishkin U, Nussinov R.  1986.  An efficient string matching algorithm with k differences for nudeotide and amino acid sequences. Nucleic acids research. 14(1):31-31.
Landau GM, Vishkin U.  1986.  Efficient string matching with k mismatches. Theoretical Computer Science. 43:239-249.
Landau GM, Vishkin U.  1986.  Introducing efficient parallelism into approximate string matching and a new serial algorithm. Proceedings of the eighteenth annual ACM symposium on Theory of computing. :220-230.
Maon Y, Schieber B, Vishkin U.  1986.  Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoretical Computer Science. 47:277-298.
Alon N, Azar Y, Vishkin U.  1986.  Tight complexity bounds for parallel comparison sorting. 27th Annual Symposium on Foundations of Computer Science. :502-510.
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.
Landau G, Schieber B, Vishkin U.  1987.  Parallel construction of a suffix tree. Automata, Languages and Programming. :314-325.
Vishkin U.  1987.  Randomized parallel speedups for list ranking* 1. Journal of Parallel and Distributed Computing. 4(3):319-333.
Azar Y, Vishkin U.  1987.  Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
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.

Pages