Publications

Export 566 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is V  [Clear All Filters]
1987
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.
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.
1985
Perl Y, Vishkin U.  1985.  Efficient implementation of a shifting algorithm. Discrete applied mathematics. 12(1):71-80.
Tarjan RE, Vishkin U.  1985.  An efficient parallel biconnectivity algorithm. SIAM Journal on Computing. 14:862-862.
Vishkin U.  1985.  On efficient parallel strong orientation. Information Processing Letters. 20(5):235-240.
Landau GM, Vishkin U.  1985.  Efficient string matching in the presence of errors. Foundations of Computer Science, 1985., 26th Annual Symposium on. :126-136.
Bar-On I, Vishkin U.  1985.  Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems (TOPLAS). 7(2):348-357.
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.
1984
Vishkin RETU.  1984.  Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Vishkin U.  1984.  An optimal parallel connectivity algorithm* 1. Discrete applied mathematics. 9(2):197-207.
Vishkin U.  1984.  A parallel-design distributed-implementation (PDDI) general-purpose computer. Theoretical Computer Science. 32(1-2):157-172.

Pages