Iddo Tzameret

I have a broad interest in the theory of computing. This includes computational complexity and applications of logic to computer science. My primary focus is the limits of efficient algorithms (that is, the quest for lower bounds on computational models), satisfiability, proof complexity, algebra and computation, logical methods in complexity, and foundations of SAT-solving (e.g., CDCL solvers).
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).