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 [...]
Uncategorized
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 [...]
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 [...]
TCS Women
Barna Saha, Sofya Raskhodnikova and Virgi Vassilevska Williams are organizing a women’s event to take place during STOC this year. It will include a women’s [...]
The Research that Would Frustrate “the Facebooks”
Twice in just a couple of weeks, I heard a reference to Phil Rogaway’s thought-provoking talk: “The Moral Character of Cryptographic Work:” slides, video. I [...]
A Pledge for Inclusiveness in TOC
We (Edith Cohen, Vitaly Feldman, Omer Reingold and Ronitt Rubinfeld) would like to direct your attention to a pledge for inclusiveness in the Theory of Computing Research [...]
Sublinear Algorithms at MIT
From the organizers: ———————— We are organizing a workshop on Sublinear Algorithms at MIT on June 11-13, as part the MIT [...]
