2019 Gödel Prize
If I write a post and the blog aggregator is down, does it still make a sound? The call for nomination for the 2019 Gödel Prize is out and the deadline is February [...]
5th TOCA-SV Coming this Friday
Our first TOCA-SV meeting of the academic year is coming up this Friday. Details are here, please come by if you are around. This time we will feature Shafi Goldwasser for [...]
Simons Cluster on Algorithmic Fairness
Over the summer, the Simons Institute ran a short program (a “cluster”) on Algorithmic Fairness, which I briefly discuss: here. This was only one instance of a [...]
The “Technologists” and Society
Another round of technology leaders testifying in Congress last week brought about another round of complaints about the excessive power that “technologists” wield over [...]
Total search problems workshop at FOCS
Manolis Zampetakis and I are organizing a workshop at FOCS on the complexity of total search problems. Looking for a needle that you know is in the haystack Search [...]
Microaggressions
A reflection piece from Scarlett Sozzani, a member of the community. We will be happy to publish additional posts (anonymously or otherwise) on the subject. By Scarlett [...]
Nevanlinna Prize: Congratulations, Costis!
Costis Daskalakis received the Nevanlinna Prize last week for his groundbreaking results on computational complexity of Nash equilibrium and mechanism design for multi-unit [...]
Approximating Edit Distance
I was excited to see “Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time” by Chakraborty, Das, Goldenberg, Koucky, and Saks in this [...]
FAT*
The societal impact of computation is a topic close to my heart, and I believe it is of critical importance to the future of CS. As such, I believe in the importance of [...]
Will quantum communication make us more cooperative?
In a new paper with Mika Goos, we prove an lower bound on the randomized communication complexity of computing an approximate Nash equilibrium in a two-player game. Then [...]
Theory Dish 