Iddo Tzameret

My research lies broadly in the theory of computing and I am interested in all aspects of the foundations of computer science: from algorithms and complexity to provability and semantics. The overarching theme of my research is the phenomenon of computational intractability and the ways in which it can be leveraged. I work in computational complexity, with an emphasis on satisfiability, proof complexity, applications of logic in computer science, the interplay between algebra and computation, and the theory (with direct connection to the practice) of SAT-solving. Find out more about my research in my publication page, a recent survey (together with T. Pitassi), and my CV.

Short Bio: Since Fall 2014 I'm a faculty member in the department of computer science at Royal Holloway, University of London. Before coming to Royal Holloway, I've been an assistant professor at Tsinghua University (Beijing) and a research fellow at the academy of sciences (Prague). I completed my PhD from Tel Aviv University in 2008 under the supervision of Ran Raz (Weizmann Institute) and Nachum Dershowitz (Tel Aviv University).