Irit Dinur אירית דינור
I am on sabbatical at MSR New England this year.
I am a professor of computer science at the Weizmann Institute of Science. My research is in Foundations of Computer Science and in Combinatorics, especially Probabilistically Checkable Proofs,
hardness of approximation.
[Publications]
Teaching:
Spring 2011: On the Boundary of P and NP
Fall 2010: Complexity Lower bounds
Spring 2009: Coding Theory
Fall 2008: Seminar on PCPs and Hardness of Approximation
Spring 2008: Probabilistically Checkable Proofs
Spring 2007: Data Structures (67109)
Fall 2006: Adv.
topics in theory (67902)
Spring 2006: Computational
Complexity (67802)
Fall 2005: Analytical
Methods in CS and Combinatorics (80630)
Spring 2005: Inapproximability
Seminar (67996)
Fall 2004: PCP (67611)
Professional 'Community' Activities: