We give the first polynomial improvements over the textbook algorithms for $3$SUM and All-Pairs Shortest Paths (APSP): we show how to deterministically solve $3$SUM on $n$ integers of polynomial size ...

DIMACS Workshop on Fine-Grained Complexity of Graph Problems Start Date: July 27, 2026 End Date: July 31, 2026 Organizers: Zihan Tan | Thatchaphol Saranurak ...

We show that the balancing weights technique of Li (2026) actually produces an approximate *pseudo-circulation* of a directed, capacitated graph in $m^{1+o(1)}$ time. Together with standard flow techn...

We prove that no single-pass semi-streaming algorithm (deterministic or randomized) can achieve a better-than-half approximation to the maximum matching problem. This implies the optimality of the nai...

Sleator and Tarjan [JACM, 1985] conjectured that splay trees are dynamically optimal -- that on every access sequence, they perform within a constant factor of the optimal offline dynamic binary searc...

We consider the single-source shortest paths problem on a directed graph with real-valued (possibly negative) edge weights and solve this problem in $m^{1+o(1)}$ time.

We present the first polynomial-time algorithm for computing a near-optimal \emph{flow}-expander decomposition. Given a graph $G$ and a parameter $ϕ$, our algorithm removes at most a $ϕ\log^{1+o(1)}n$...

YouTube video by Thatchaphol Saranurak

📅 July 22—24, 2026 🌏 Sydney (Australia)

Some of the discussion online has been about how not to use AI in making academic talks (see, e.g., this post by Jessica Hullman). A junior researcher asked my opinion on using AI to help make slid…

European Association for Theoretical Computer Science

What is this course about? This course studies modern graph algorithms through the lens of graph decomposition. Over the last two decades, expander decompositions and hierarchies have become some of ...

YouTube video by Stanford AI Club

Practice answering typical interview questions you might be asked during faculty job interviews in Computer Science

YouTube video by CSAChannel IISc

Synopsis: The Chicago Junior Theorists Workshop 2025 is being held jointly by Northwestern University and Toyota Technological Institute at Chicago on ...

Descriptive set theorists study the niche mathematics of infinity. Now, they’ve shown that their problems can be rewritten in the concrete language of algorithms.

YouTube video by International Association for Safe & Ethical AI

We seek nominations of outstanding final-year Ph.D. students and postdocs to attend and present their recent research at the 2025 Chicago Junior Theoris...

We give a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $\tilde{O}(n^{2}\log U)$ time, which is near-optima...

We present a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $n^{2+o(1)}\log U$ time, which is almost optimal...

Title: A Random Walk Down Full Memory Lane

YouTube video by Math-life balance

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

YouTube video by Thatchaphol Saranurak

YouTube video by Thatchaphol Saranurak