Uri Zwick

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]

References[edit]

  1. ^ Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Saket, Michałand Saurabh (2015), Parameterized Algorithms, Springer, p. 127, doi:10.1007/978-3-319-21275-3, ISBN 978-3-319-21274-6, MR 3380745
  2. ^ Williams, Ryan (November 2008), "Applying Practice to Theory", SIGACT News, 39 (4): 37–52, arXiv:0811.1305, doi:10.1145/1466390.1466401
  3. ^ a b Uri Zwick Receives The David P. Robbins Prize from Mathematical Association of America (PDF), Mathematical Association of America, 2011
  4. ^ Uri Zwick at the Mathematics Genealogy Project
  5. ^ Faculty members, The Blavatnik School of Computer Science, Tel Aviv University, retrieved 2017-07-05

External links[edit]