Uri Zwick
Uri Zwick is an Israeli computer scientist and mathematician known for his work on
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
- )
- 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
- Home page
- Uri Zwick publications indexed by Google Scholar
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
