|For Harvard related mails, please use|
| Please use
for reference letter or manuscript review requests respectively.
(emails to these addresses are forwarded to my main inbox, but are also tagged appropriately so I don't lose track of them.)
About me: I am a professor of Computer Science at Harvard University, and a member of the Harvard SEAS Theory of Computing group. Previously, I was a principal researcher at Microsoft Research New England, and before that I was an associate professor (with tenure) at Princeton University’s Computer Science department. I hold a Ph.D from the Weizmann Institute of Science, and was a postdoctoral fellow at the Institute for Advanced Study in Princeton.
Current activities: I am on the program committee of the Highlights of Algorithms conference (Paris, summer 2016). I am a trustee of the Computational Complexity Foundation. I am on the editorial board of the Journal of the ACM, the Theory of Computing Journal (ToC) and the Electronic Colloquium of Computational Complexity. I am a member of the Committee for the Advancement of Theoretical Computer Science (CATCS). I am a co organizer of the Harvard/MSR/MIT reading group. See my CV for past activities.
Funding: I am currently supported by NSF award CCF 1565264. I am grateful for past support by the NSF, as well as the Packard and Sloan foundations and the BSF.
I wrote a textbook with Sanjeev Arora: Computational Complexity: A Modern Approach.
In fall 2017 I will be teaching a graduate seminar course with Pablo Parrilo on Proofs, beliefs and algorithms through the lens of Sum of Squares. The course will take place on Fridays 10am till 1pm and rotate between Harvard and MIT.
Lecture notes for my Spring 2016 crypto course are available.
Here are some surveys and essays I wrote, see here for all my non-technical writing:
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.
Advice for the budding theorist, blog post on the Windows on Theory blog, November 2015
Sum-of-squares proofs and the quest toward optimal algorithms with David Steurer. Survey, also appeard 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.
Here are some of the courses / lectures I (co) taught (see here for all courses):
Lecture on the Rossman-Servedio-Tan circuit depth hierarchy for average-case complexity - guest lecture in Dana Moshkovitz’s advanced complexity course, May 12, 2015.
Sum of squares upper bounds, lower bounds, and open questions - seminar series at MIT, Mondays 2pm-5pm.
MIT 6.889 BU CAS CS 937: New Developments in Cryptography - co taught with Shafi Goldwasser, Leo Reyzin, Yael Kalai, and Salil Vadhan
Princeton COS 522 - (graduate) Computational Complexity - Spring 2009
|Email: . For Harvard related mails, please use|
|Please use or for reference letter or manuscript review requests respectively. (emails to these addresses are forwarded to my main inbox, but are also tagged appropriately so I don't lose track of them.)|
|Office hours: TBA|
|Address: Boaz Barak, Harvard SEAS: Maxwell-Dworkin 329, 33 Oxford Street, Cambridge, MA 02138.|
|Administrator: Kevin Doyle, Maxwell-Dworkin, room 119 ,|