Uri Zwick

Uri Zwick
Alma materTechnion – Israel Institute of Technology, Tel Aviv University
Known forGraph algorithms, Karloff–Zwick algorithm, Color-coding technique, Block-stacking problem
AwardsDavid P. Robbins Prize (2011)
Scientific career
FieldsComputer science, Mathematics
InstitutionsTel Aviv University
Doctoral advisorNoga Alon

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.[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.[5]

  1. ^ Cite error: The named reference param was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference williams was invoked but never defined (see the help page).
  3. ^ a b Cite error: The named reference robbins was invoked but never defined (see the help page).
  4. ^ Cite error: The named reference mgp was invoked but never defined (see the help page).
  5. ^ Cite error: The named reference blav was invoked but never defined (see the help page).