Uri Zwick (Hebrew: אורי צוויק) is an Israeli computer scientist and mathematician known for his work on graph algorithms, in particular on distances in graphs and on the color-coding technique for subgraph isomorphism.
[1] With Howard Karloff, he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability.
[2] He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem.
[3] Zwick earned a bachelor's degree from the Technion – Israel Institute of Technology,[3] and completed his doctorate at Tel Aviv University in 1989 under the supervision of Noga Alon.
[4] He is currently a professor of computer science at Tel Aviv University.