Within the last two months I had the privilege of teaching a week-long Analysis of Boolean Functions course at two different summer schools.
In July I was at the (First Annual?) Swedish Summer School in Computer Science. This was wonderfully organized by KTH faculty Per Austrin, Johan Håstad, and Jakob Nordström, and took place [...]
I’m currently in Seoul for the 2014 ICM, where I’ll be giving a talk on — what else? — analysis of Boolean functions. I’ve written an accompanying article for the proceedings, Social choice, computational complexity, Gaussian geometry, and Boolean functions, the abstract of which follows:
We describe a web of connections between the following [...]
Another big thank-you to all the heroes who have found, and who continue to find, typos and mistakes in the book! Please keep them coming!
One small note: In the relatively near future I will post here an electronic version of the book. It will actually be version 1.01, with version 1.00 being the [...]
The last post concluded the serialization of the book. Cambridge University Press has also just finished the full print run. You can peruse a physical copy of the book if you happen to go to STOC (look for the Cambridge table staffed by Lauren Cowles). The book will be shipping from, e.g., Amazon starting some [...]
I’m happy to announce that the book is very nearly completed. In fact, you can pre-order a copy now, either directly from Cambridge University Press, or from Amazon (currently with a 10% discount). If all goes well, the book will become physically available at the end of May. Fairly soon thereafter I will also make [...]
The last video lecture for my CMU course on Analysis of Boolean Functions has just been posted. Except for responding to comments, the blog will be going on hiatus for a little while. Next semester I’ll post the final chapters of the book; there will be between 4 and 7 of them, depending on how [...]
The following message is from Elchanan Mossel at the Simons Institute:
The Simons Institute for Theory of computing will run a program on Real Analysis in Computer Science during the fall semester of 2013.
Could you help spreading the word around, in particular to young scientists who may be interested to participate in [...]
Some announcements: First, the book serialization will start back up again on Monday; stay tuned. Second, 22 videos from the Simons Symposium are now available. Third, there will be a special issue of Theory of Computing devoted to analysis of Boolean functions (see below announcement); please submit your good papers!
The journal Theory [...]
This blog will go on hiatus for the summer (except for responding to comments). See you in September.
Russell Impagliazzo, Cris Moore, and Alex Russell just posted their new proof of the sharp form of the “Level 1 Inequality” (AKA Talagrand’s Lemma, AKA Chang’s Lemma). It’s completely beautiful, and basically 3 lines long. What’s doubly cool is that they pretty much came up with it on the spot during a lecture on the [...]