Dana Moshkovitz [דנה מושקוביץ] I am an assistant professor at the Electrical Engineering and Computer Science department of MIT and a member of CSAIL. I have a broad interest in Theoretical Computer Science, with a focus on Probabilistically Checkable Proofs (PCP), Pseudo-randomness and Coding theory. I graduated from the Weizmann Institute of Science in 2008, where I worked with Ran Raz. In 2009-10 I was a post-doc at Princeton University and the Institute for Advanced Study. Here’s a semi-popular article I wrote about PCP for XRDS; an overview of (some of) my research; my publications.
Contact Info Dana Moshkovitz Office: 32-G606 Phone: +1 (617) 253-1355 Email: dmoshkov at mit.edu	Administrative Assistant Be Blackburn Office: 32-G675A Phone: +1 (617) 253-6098 Email: be at csail.mit.edu
Courses and Seminars Theory of Computation Colloquium, MIT, 2011-2012. 6.046 Design and Analysis of Algorithms, MIT, Spring 2012. 6.440 Essential Coding Theory, MIT, Fall 2011. 6.046 Design and Analysis of Algorithms, MIT, Spring 2011. 6.895 PCP and Hardness of Approximation, MIT, Fall 2010. Mini-course on Projection PCPs, Princeton, Spring 2009. Probabilistically Checkable Proofs, Weizmann, Spring 2008. Students Theory seminar, Weizmann, 2005-2008. Graduate Students Prasant Gopal Henry Yuen Undergrads: Siyao Xu, Adam Yedidia Theoretical Computer Science Material My presentations about Theoretical Computer Science Professional Service Program Committee member of FOCS’10, APPROX’12, CCC’13.
		MIT: MIT News Algorithms & Complexity Seminar Applied Math Colloquium Combinatorics Seminar Probability Seminar LIDS Seminar ORC Seminar Cambridge Area Theory Seminars: Harvard Theory of Computation Seminar MSR Theory Seminar Q&A: Theoretical Computer Science Stack Exchange Math Overflow Archives: ECCC ArXiv Web-Logs: Computational Complexity Blog In Theory (Luca Trevisan's Blog) Shtetl Optimized (Scott Aaronson's Blog)

---