Uri Zwick

Uri Zwick (Hebrew: אורי צוויק) 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. With Howard Karloff, he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability. He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem.

Zwick earned a bachelor's degree from the Technion – Israel Institute of Technology, and completed his doctorate at Tel Aviv University in 1989 under the supervision of Noga Alon. He is currently a professor of computer science at Tel Aviv University. Provided by Wikipedia
Showing 1 - 2 results of 2 for search 'Zwick, Uri', query time: 0.02s Refine Results
  1. 1
    Algorithms - ESA 2003 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings /
    Published 2003
    Other Authors: “…Zwick, Uri…”
    Full Text via HEAL-Link
    Electronic eBook
  2. 2
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006. Proceedings /
    Published 2006
    Other Authors: “…Zwick, Uri…”
    Full Text via HEAL-Link
    Electronic eBook
Search Tools: RSS Feed – Email Search