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 [...]
Don Knuth on General Principles
In the last post (at least for now) of our advice-sharing project, we now share the final installment of Don Knuth’s advice (also see his first and second posts). [...]
LGBTQIA Meeting Eurocrypt
Guest post by Chris Brzuska (also appeared at Luca’s blog) [...]
Creating an Inclusive Classroom
I’ve been asked by a friend to discuss ways of fostering inclusiveness in the classroom. A Stanford colleague of mine, Cynthia Lee, have posted a well thought and [...]
Committee on sexual harassment (II)
Yuval Rabani announced here the formation of an ad-hoc committee on sexual harassment. The committee is up, with a promising set of members, a very important charge and a [...]
