|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 chairing the committee to select invited presentations at the “Theory Fest” at STOC 2017. 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 awards CCF 1565264 and CNS 1618026. 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.
Here are some surveys and essays I wrote, see here for all my non-technical writing:
The Complexity of Public-Key Cryptography - survey/tutorial on the computational assumptions landscape of cryptogrpahy. Written in honor of Oded Goldreich’s 60th birthday.
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):
Harvard CS229r / MIT 6.S898: Proofs, beliefs and algorithms through the lens of Sum of Squares - Fall 2016 - graduate course/seminar on the Sum of Squares algorithm.
Winter school on the Sum of Squares algorithm - January 2017, San Diego.
Addis Coder 2016 -summer course on algorithms and coding for high school students in Ethiopia, August 2016, co taught with Timnit Gebru, Jelani Nelson and a wonderful team of TA’s.
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: On sabbatical in the Spring of 2017.|
|Address: Boaz Barak, Harvard SEAS: Maxwell-Dworkin 329, 33 Oxford Street, Cambridge, MA 02138.|
|Administrator: Kevin Doyle, Pierce building, room 318 ,|