Loading AI tools
Israeli computer scientist and mathematician From Wikipedia, the free encyclopedia
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]
Uri Zwick | |
---|---|
Alma mater | Technion – Israel Institute of Technology, Tel Aviv University |
Known for | Graph algorithms, Karloff–Zwick algorithm, Color-coding technique, Block-stacking problem |
Awards | David P. Robbins Prize (2011) |
Scientific career | |
Fields | Computer science, Mathematics |
Institutions | Tel Aviv University |
Doctoral advisor | Noga Alon |
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]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.