Uri Zwick
Uri Zwick 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. With Howard Karloff, he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability. He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem.

Zwick earned a bachelor's degree from the Technion – Israel Institute of Technology, and completed his doctorate at Tel Aviv University in 1989 under the supervision of Noga Alon. He is currently a professor of computer science at Tel Aviv University.
Q1514868
graph algorithm
UNK
Q5148529
color-coding
UNK
Q2528185
subgraph isomorphism
Concept
None
Howard Karloff
UNK
Q6372543
Karloff–Zwick algorithm
UNK
Q17080570
MAX-3SAT
UNK
Q875276
Boolean satisfiability
Concept
Q2674007
David P. Robbins Prize
MEDIA
Q16843263
block-stacking problem
UNK
Q333705
Technion – Israel Institute of Technology
ORG
Q319239
Tel Aviv University
LOC
Q92927
Noga Alon
PER
Q30726757
Uri Zwick
PER
2011-01-01T00:00:00Z^^http://www.w3.org/2001/XMLSchema#dateTime
2011
DATE
1989-01-01T00:00:00Z^^http://www.w3.org/2001/XMLSchema#dateTime
1989
DATE
-3^^http://www.w3.org/2001/XMLSchema#decimal
-3
NUMBER
award received
educated at
doctoral advisor