ITCS 2016 will be held in Cambridge January 14-16. As in previous years,  we will have a "graduating bits" session where students graduating this year can present a (very) short talk on their work. This year I am in charge of the graduating bits event, which means that details on how to sign up for it will only appear … Continue reading Graduating bits at ITCS

The deadline to apply for the Rabin postdocs, as well as other postdoc positions, is coming up on December 1st, see my previous post. Don't forget to apply!!  

Theoretical computer scientists love inequalities. After all, a great many of our papers involve showing either an upper bound or a lower bound on some quantity. So I thought I'd share some cool stuff I've learned this Friday in our reading group's talk by Zeev Dvir. This is based on my partial and vague recollection … Continue reading The mother of all inequalities

[I don't have much to add to Luca, Scott, and Lipton/Regan on the exciting announcement by Babai of a quasipolynomial time graph isomorphism algorithm. I can't wait to hear the details! --Boaz] Aided by some very generous gifts, Computer Science is on a growth streak at Harvard, and in particular there are some new opportunities in Theoretical Computer … Continue reading Theoretical CS Opportunities at Harvard

As a Ph.D student, I searched for advice on succeeding in grad school, and often thought that eventually I would repay the favor when I became a professor. I never got around to doing that, but now decided to give it a shot. So, here goes: Tip #1: Don’t get advice from the Internet. Grad … Continue reading Advice for the budding theorist