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.[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]
- ^ 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, S2CID 19436693
{{citation}}: CS1 maint: multiple names: authors list (link) - ^ Williams, Ryan (November 2008), "Applying Practice to Theory", SIGACT News, 39 (4): 37–52, arXiv:0811.1305, doi:10.1145/1466390.1466401, S2CID 291154
- ^ a b Uri Zwick Receives The David P. Robbins Prize from Mathematical Association of America (PDF), Mathematical Association of America, 2011
- ^ Uri Zwick at the Mathematics Genealogy Project
- ^ Faculty members, The Blavatnik School of Computer Science, Tel Aviv University, retrieved 2017-07-05
External links[edit]
- Home page
- Uri Zwick publications indexed by Google Scholar
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
