Uzi Vishkin

Professor

5216 Iribe Center

(301) 405-6763

Academic Web Page

Education:

D.Sc., Technion - Israel Institute of Technology (Computer Science)

Special Awards/Honors:

ACM Fellow

Biography:

Uzi Vishkin is a professor of electrical and computer engineering with an appointment in the University of Maryland Institute for Advanced Computer Studies.

His research focuses on aligning the theory of parallel algorithms, parallel programming, and many-core hardware into a cohesive computing stack for future processors. Vishkin has developed a unique approach that enables single-threaded programming for parallelism to achieve competitive many-core performance, directly harnessing the theory of parallel algorithms.

Go here to view Vishkin's academic publications on Google Scholar.

Publications

1984

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.

Atallah M, Vishkin U. 1984. Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.

1983

Vishkin U, Wigderson A. 1983. Dynamic parallel memories. Information and control. 56(3):174-182.

Vishkin U. 1983. Implementation of simultaneous memory address access in models that forbid it. Journal of algorithms. 4(1):45-50.

Vishkin U. 1983. Efficient distributed orientation algorithm.. IEEE TRANS. INFO. THEORY.. 29(4):624-628.

Paul W, Vishkin U, Wagener H. 1983. Parallel dictionaries on 2–3 trees. Automata, Languages and Programming. :597-609.

Paul W, Vishkin U, Wagener H. 1983. Parallel computation on 2-3-trees. RAIRO Informatique théorique. 17(4):397-404.

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.

1982

Shiloach Y, Vishkin U, An O. 1982. parallel MAX-FLOW algorithm. Journal of Algorithms. 3:128-146.

Shiloach Y, Vishkin U. 1982. An O (n2log n) parallel max-flow algorithm. Journal of Algorithms. 3(2):128-146.

Shiloach Y, Vishkin U. 1982. An O (logn) parallel connectivity algorithm. Journal of Algorithms. 3(1):57-67.

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.

Bar-Yehuda R, Vishkin U. 1982. Complexity of finding k-path-free dominating sets in graphs. INFO. PROC. LETT.. 14(5):228-232.

1981

Shiloach Y, Vishkin U. 1981. Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.