Theory Dish

Theory Dish

Stanford's CS Theory Research Blog

  • About

A Friendlier Equilibrium for Sharing Research?

November 18, 2026 // 0 Comments

Yesterday, OpenAI released GPT-6.2 Astra, which appears to be the model that produced the several hundred breakthrough math results released on October 6th. Undoubtedly, many [...]

A Subversive Message of Hope

November 1, 2026 // 5 Comments

In my previous post, I argued that the mathematical community needs to respond actively, continuously and bravely to the changes brought by AI. Here, I would like to take a [...]

Upcoming workshop at Stanford: Recent Advances in Regularity Lemmas

October 22, 2026 // 0 Comments

Please join us for a one-day workshop, “Recent advances in Regularity Lemmas (with and without calibration)”, taking place on Tuesday, November 17 at Stanford [...]

Speeding Up the Process of Mourning

September 29, 2026 // 5 Comments

The world of mathematics, including theoretical computer science, is in turmoil. Even the Millennium Prize Problems, and, worse still, our beloved FOCS/STOC open problems, [...]

Quantum Speedups Require Structure or Depth

September 25, 2026 // 2 Comments

By Guy Blanc, Jordan Docter, Carmen Strassle, and Li-Yang Tan This is the first in a series of blog posts about our paper, Quantum Speedups Require Structure or Depth, which [...]

Condorcet Quintets — A Proof from the Book

September 11, 2026 // 0 Comments

Here’s my favorite problem in voting theory. Suppose we have an election in which voters provide ranked preferences over the candidates. For what kk can we always [...]

STOC 2026 Student Travel Grants

April 30, 2026 // 0 Comments

Hi all! An announcement on behalf of the STOC/TheoryFest organizers: ACM SIGACT is pleased to provide funds to support student attendance at STOC 2026. These travel awards [...]

STOC 2026 Call for Workshops

January 15, 2026 // 0 Comments

TheoryFest 2026 will hold workshops during the STOC 2026 conference week, June 22–26, 2026, in Salt Lake City, Utah, USA. We invite groups of interested researchers to [...]

Quickly approximating Shapley Games

September 15, 2025 // 0 Comments

An example Shapley game
In this blog post, we will talk about some recent advances in algorithms for approximately solving Shapley Games. What is a Shapley Game? At an intuitive level, Shapley games [...]

Choosing the best ring … for MPC!

April 21, 2025 // 0 Comments

In this post, we’ll discuss how Galois rings (a recent algebraic structure) improve the communication complexity of dishonest multiparty computation (MPC) [...]

Posts pagination

1 2 … 12 »
Follow Theory Dish on WordPress.com
  • RSS - Posts
  • RSS - Comments

Recent Comments

SamDigitalNotes's avatarSamDigitalNotes on A Subversive Message of H…
Anonymous's avatarAnonymous on A Subversive Message of H…
Anatol Wegner's avatarAnatol Wegner on A Subversive Message of H…
Omer Reingold's avatarOmer Reingold on A Subversive Message of H…
Anonymous's avatarAnonymous on A Subversive Message of H…
Unknown's avatarA Subversive Message… on Speeding Up the Process of…
Unknown's avatarĐẩy nhanh tiến trình… on Speeding Up the Process of…
Omer Reingold's avatarOmer Reingold on Speeding Up the Process of…
anonymous's avataranonymous on Speeding Up the Process of…
Clément Canonne's avatarClément Canonne on Speeding Up the Process of…

Copyright © 2026 Create a website or blog at WordPress.com

  • Subscribe Subscribed
    Theory Dish
    Join 83 other subscribers

    Have a WordPress.com account? Log in now.

  • Theory Dish
    View site in Reader
    Manage subscriptionsSign upLog in
    Report this content
    Collapse this bar
Loading Comments...