Bayesianism, frequentism, and the planted clique, or do algorithms believe in unicorns?, April 2016. See also blog post on windows of theory blog and video of a talk at Northwestern.
The iPhones of Terrorists. Blog post on the Windows on Theory blog, March 2016.
The mother of all inequalities, blog post on the Windows on Theory blog, November 2015.
Advice for the budding theorist, blog post on the Windows on Theory blog, November 2015
A different type of pseudo, blog post on the Windows on Theory blog, October 2015
Is computational hardness the rule or the exception?, blog post on Windows on Theory blog, September 2015
Tips for future FOCS/STOC program chairs, blog post on Windows on Theory blog, March 2015
Erdős’s Book and the Asymptotic Religion, blog post on Windows on Theory blog, January 2015
Sum-of-squares proofs and the quest toward optimal algorithms with David Steurer. Survey, also appeared in proceedings of ICM 2014. See also my seminar on this topic, as well as a video of a related talk at Harvard.
Structure vs Combinatorics in Computational Complexity, Windows on Theory blog, October 2013. See also adapted version in the bulletin of the European Association for Theoretical Computer Science.
Truth vs. Proof - the Unique Games Conjecture and Feige’s Hypothesis, Windows on Theory blog, July 2012`. See also adapted version in logic in computer science column of the bulletin of the European Association for Theoretical Computer Science.
Frequently Asked Questions on the paper Computational Complexity and Information Asymmetry in Financial Products by Arora, Barak, Brunnermeier, and Ge (ITCS 2010).
Barriers in Cryptography and Complexity Theory - PowerPoint Presentation, 2009.
Opening the Black-Box: New Techniques in Cryptography. My 2004 Princeton “job-talk” in Powerpoint XP format
Can We Obfuscate Programs? - What do the results of Barak et al (CRYPTO’ 01) mean? (Note that there have been many new developments in this area since this was written)