In 1996, he was inducted as a Fellow of the Association for Computing Machinery, with the following citation: "One of the pioneers of parallel algorithms research, Dr. Vishkin's seminal contributions played a leading role in forming and shaping what thinking in parallel has come to mean in the fundamental theory of Computer Science.
He then spent a year working at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York.
From 1982 to 1984, he worked at the department of computer science at New York University and remained affiliated with it till 1988.
From 1984 until 1997 he worked in the computer science department of Tel Aviv University, serving as its chair from 1987 to 1988.
Since making parallel programming easy is one of the biggest challenges facing computer science today, the demonstration also sought to include teaching the basics of PRAM algorithms and XMTC programming to students ranging from high-school to graduate school.
The best-known example is CPUs coupled with integrated graphics processing units, present in well over a billion devices including desktop and laptop computers built since the 2010s".
The inclusion of the suppressed information is, in fact, guided by the proof of a scheduling theorem due to Brent (1974).
Vishkin (2011) explains the simple connection between the WT framework and the more rudimentary ICE abstraction noted above.
[7] Other contributions by Uzi Vishkin and various co-authors include parallel algorithms for list ranking, lowest common ancestor, spanning trees, and biconnected components.