Uzi Vishkin

Professor
5216 Iribe Center
(301) 405-6763
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 and a member of the Maryland Cybersecurity Center.

His research focuses on parallelism in computing, design and analysis of algorithms, and synergy of algorithms.

He started his work on parallel computing in 1979 as a doctoral student at the Technion - Israel Institute of Technology. Vishkin's initial focus was on parallel algorithms and parallel algorithmic thinking. The 1982 Shiloach-Vishkin work-depth methodology for presenting parallel algorithms provided the presentation framework in several parallel algorithm (known as PRAM algorithms) texts, which also include a considerable number of parallel algorithms he co-authored.

This parallel algorithms theory provided the basis for his invention of the PRAM-On-Chip desktop supercomputer framework that scales beyond 1000 processors on chip. He later led its extensive hardware and software prototyping, including a 64-processor computer that has already been programmed by more than 100 middle school and high school students. He was named a Maryland Innovator of the Year for his PRAM-On-Chip venture, whose main patent has been widely cited in patents of the major vendors.

A follow-up proposal, entitled Center for Reinvention of Computing for Parallelism, ranked first among 49 proposals in a University System of Maryland (USM)-wide competition for Maryland Research Centers of Excellence.

In 1996, he was elected an ACM Fellow for, among other things, having "played a leading role in forming and shaping what thinking in parallel has come to mean in the fundamental theory of Computer Science." He is also an ISI-Thompson Highly Cited Researcher.

Before coming to the University of Maryland, Vishkin was affiliated with Tel Aviv University between and 1984 and 1997, and was chair of its computer science department from 1987 to 1988. Vishkin also worked for IBM T.J. Watson and New York University.

He received his doctorate in computer science from Technion - Israel Institute of Technology in 1981.

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

Publications

1984


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.  Trade-offs between depth and width in parallel computation. Foundations of Computer Science, 1983., 24th Annual Symposium on.
:146-153.

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.

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.

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.

1981

Pages