Publications

Export 566 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is V  [Clear All Filters]
1979
O'Leary DP, Stewart G.W, Vandergraft JS.  1979.  Estimating the Largest Eigenvalue of a Positive Definite Matrix. Mathematics of Computation. 33:1289-1292.
1981
Shiloach Y, Vishkin U.  1981.  Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
1982
Bar-Yehuda R, Vishkin U.  1982.  Complexity of finding k-path-free dominating sets in graphs. INFO. PROC. LETT.. 14(5):228-232.
Chandra AK, Stockmeyer LJ, Vishkin U.  1982.  A complexity theory for unbounded fan-in parallelism. 23rd Annual Symposium on Foundations of Computer Science. :1-13.
Shiloach Y, Vishkin U.  1982.  An O (logn) parallel connectivity algorithm. Journal of Algorithms. 3(1):57-67.
Shiloach Y, Vishkin U.  1982.  An O (n2log n) parallel max-flow algorithm. Journal of Algorithms. 3(2):128-146.
Shiloach Y, Vishkin U, An O.  1982.  parallel MAX-FLOW algorithm. Journal of Algorithms. 3:128-146.
1983
Vishkin U, Wigderson A.  1983.  Dynamic parallel memories. Information and control. 56(3):174-182.
Vishkin U.  1983.  Efficient distributed orientation algorithm.. IEEE TRANS. INFO. THEORY.. 29(4):624-628.
Vishkin U.  1983.  Implementation of simultaneous memory address access in models that forbid it. Journal of algorithms. 4(1):45-50.
Paul W, Vishkin U, Wagener H.  1983.  Parallel computation on 2-3-trees. RAIRO Informatique théorique. 17(4):397-404.
Paul W, Vishkin U, Wagener H.  1983.  Parallel dictionaries on 2–3 trees. Automata, Languages and Programming. :597-609.
Vishkin U, Wigderson A.  1983.  Trade-offs between depth and width in parallel computation. Foundations of Computer Science, 1983., 24th Annual Symposium on. :146-153.
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.
Mehlhorn K, Vishkin U.  1984.  Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica. 21(4):339-374.
Vishkin U.  1984.  Randomized speed-ups in parallel computation. Proceedings of the sixteenth annual ACM symposium on Theory of computing. :230-239.
Gurevich Y, Stockmeyer L, Vishkin U.  1984.  Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. Journal of the ACM (JACM). 31(3):459-473.
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.

Pages