1/3 Fine-Grained Complexity Fest at DIMACS this July! Three back-to-back workshops on Algebraic Techniques, String Algorithms, and Graph Algorithms in fine-grained complexity, with a terrific speaker lineup. Organized by
@jalman.bsky.social , Elazar Goldenberg, and
@eigx.bsky.social.
17.02.2026 04:42
π 6
π 2
π¬ 1
π 0
ACM SIGACT - Trevisan Award
New SIGACT award expository work, created in memory of Luca Trevisan: "intended to promote and recognize high-impact work expositing ideas and results from the Theory of Computation."
A wonderful initiativeβconsider nominating people!
β° Nomination deadline: April 10
sigact.org/prizes/trevi...
06.02.2026 00:31
π 27
π 11
π¬ 1
π 0
Stanford AI Club: AI and the Future of Education
YouTube video by Stanford AI Club
Given AIs, I am still not sure how to teach algorithm classes today and in the future.
This discussion is quite nice, though.
www.youtube.com/watch?v=Vnz8...
26.01.2026 03:22
π 5
π 0
π¬ 0
π 0
#FOCS2025
This is one of the best FOCS conferences I have attended.
16.12.2025 11:17
π 11
π 0
π¬ 1
π 0
Frontiers of Graph Algorithms | Day 1 | 8th Dec 2025
YouTube video by CSAChannel IISc
I just gave a tutorial on Design Templates for Dynamic Graph Algorithms at IISc in Bangalore.
The kindest words I received were "best tutorial I have listened to in the last 10 years." Hope it interests you.
Video: www.youtube.com/live/L8ev24g...
Slides: tinyurl.com/yetx3vxu
09.12.2025 21:00
π 16
π 3
π¬ 0
π 0
Junior Theorists Workshop 2025 | Northwestern CS Theory Group
Synopsis: The Chicago Junior Theorists Workshop 2025 is being held jointly by Northwestern University and Toyota Technological Institute at Chicago on ...
The 2025 Chicago Junior Theorists Workshop is December 8-9, hosted jointly by Northwestern and TTIC. Monday Dec 8 will be at TTIC and Tuesday Dec 9 will be at Northwestern (in the SkAI/NITMB in the Hancock tower in downtown Chicago). Register in advance.
theory.cs.northwestern.edu/2025/11/14/j...
24.11.2025 19:49
π 4
π 2
π¬ 0
π 0
SODA/SOSA 2026 Schedule
I used AI to create an easier-to-navigate schedule for SODA and SOSA 26 here:
soda26.netlify.app
The original one is hard to see the overview. meetings.siam.org/program.cfm?...
21.11.2025 04:42
π 4
π 3
π¬ 0
π 0
What Is Understanding? β Geoffreyβ―Hinton | IASEAI 2025
YouTube video by International Association for Safe & Ethical AI
This talk is really illuminating to me (especially around minute 7 to 11).
Clearly, I intuitively know what understanding is, but his explanation makes it much more explicit and makes sense.
youtu.be/6fvXWG9Auyg?...
09.11.2025 02:43
π 4
π 0
π¬ 0
π 0
Announcing the 7th Learning Theory Alliance mentoring workshop on November 20. Fully free & virtual!
Theme: Harnessing AI for Research, Learning, and Communicating
Ft @aaroth.bsky.social @andrejristeski.bsky.social @profericwong.bsky.social @ktalwar.bsky.social &more
07.11.2025 16:34
π 14
π 10
π¬ 1
π 3
Congratulations to Venkat Guruswami, new director of the Simons Institute for the Theory of Computing (@simonsinstitute.bsky.social)! And congrats to us, the Theoretical CS community, for having someone as good, dedicated, and wonderful as him at the helm of a place so important to us! #TCSSky
30.10.2025 20:18
π 37
π 3
π¬ 2
π 1
I hope this is a good step towards "clarity", an essential goal in science.
This is a joint work with the fantastic team: Aaron Bernstein, Joakim Blikstad, Jason Li, and Ta-Wei Tu.
Joakim and Ta-wei coded up the algorithm.
3/3
23.10.2025 04:47
π 8
π 2
π¬ 0
π 0
Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
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...
Can a max flow algorithm be both near-optimal and simple enough to teach?
Last year, we showed that the classical and intuitive augmenting-path approach can indeed be almost optimal for dense graphs.
arxiv.org/abs/2406.03648
But the result was not actually satisfying!
1/3
23.10.2025 04:47
π 18
π 1
π¬ 1
π 0
TCS+ RSVP: Ian Mertz (2025/22/08)
Title: A Random Walk Down Full Memory Lane
π’ Our second TCS+ talk of the season will be Wednesday, Oct 22 (10amPT, 1pm ET, 19:00 CEST): Ian Mertz, from Charles University, will give guide us through "A Random Walk Down Full Memory Lane"!
RSVP to receive the link (available one day prior to the talk): forms.gle/495UjiLmQkkD...
17.10.2025 19:47
π 4
π 3
π¬ 1
π 1
Interview with Steven Strogatz
YouTube video by Math-life balance
It was such a pleasure being a guest on "Math-Life Balance", a podcast devoted to interviews with mathematicians. Mura Yakerson is a fantastic interviewer! Check out our chat at www.youtube.com/watch?v=Gx8F... #mathsky
22.08.2025 20:32
π 34
π 12
π¬ 3
π 3
Lecture 4.1: Amortized Analysis: Bank account method, Binomial heaps, Hollow heaps
YouTube video by Thatchaphol Saranurak
This lecture provides a gentle introduction to amortized analysis.
For experts: At the end, I explained Hollow Heaps, an optimal heap like Fibonacci heaps, but simpler! Surprisingly, I have not seen video lectures on this before.
www.youtube.com/watch?v=8mHa...
18.07.2025 16:32
π 5
π 2
π¬ 1
π 0
Lecture 0: Introduction
YouTube video by Thatchaphol Saranurak
Math vs. Cooking:
What does it mean to do math/theory?
Here, I presented an analogy to cooking.
The goal was to help students understand how to effectively learn in theory classes.
www.youtube.com/watch?v=8Fz2...
(The discussion at 59:38)
I am curious to know if you think this makes sense.
18.07.2025 14:26
π 9
π 0
π¬ 1
π 0
Accepted Papers β FOCS 2025
The list of accepted papers at #FOCS2025 is up!
focs.computer.org/2025/accepte...
13.07.2025 22:59
π 37
π 15
π¬ 0
π 0
LEADERSHIP LAB: The Craft of Writing Effectively
YouTube video by UChicago Social Sciences
Wow, this might be the best lecture on academic writing I've ever watched!
www.youtube.com/watch?v=vtIz...
If any of you have suggestions for good materials related to grant writing and/or mathematical writing, I would be interested :)
06.07.2025 21:22
π 13
π 0
π¬ 1
π 0
Professor Sepehr Assadi stands by a bench in Waterloo's Peter Russell Rock Garden.
Professor Sepehr Assadi has won the 2025 Presburger Award, a prestigious honour recognizing his exceptional contributions to theoretical computer science, in particular his pioneering work on establishing lower bounds for multi-pass streaming algorithms.
cs.uwaterloo.ca/news/sepehr-...
02.07.2025 14:28
π 23
π 3
π¬ 0
π 0
Omg
24.06.2025 23:31
π 0
π 0
π¬ 1
π 0
TCS for All
Theoretical Computer Science without Barriers
This year TCS for All Inspiration talk will be given by Sofya Raskhodnikova, Boston University on June 27th at our STOC 2025 TCS for All Meeting. Join us. We are relocating the TCS for All Rising Star Workshop to FOCS 2025 this year. Stay tuned. SIGACT.org/tcsforall/
#stoc2025 @ccanonne.github.io
18.06.2025 02:33
π 18
π 7
π¬ 0
π 1
I also enjoy expositions (like some nice papers, surveys, and short textbooks).
But in my case, I put Schrijver's and Frank's combinatorial optimization books into NotebookLM. Honestly, I have only used them by looking up and never tried to read them for fun. Now, I can interact more with them.
07.06.2025 20:34
π 0
π 0
π¬ 1
π 0
3. editgpt.app has an excellent interface for polishing papers.
4. I failed to use AIs to help me solve any open problems (and even got tricked by their answers once). Have you succeeded? I am interested to hear.
3/3
07.06.2025 02:48
π 0
π 0
π¬ 0
π 0
1. For the literature search, I enjoy using the Deep Research of both ChatGPT and Gemini. (I still often go through the rabbit hole in Google Scholar.)
2. I upload many textbooks on the same topic to NotebookLM and ask questions. It is a fun way to learn and look up.
2/3
07.06.2025 02:48
π 0
π 0
π¬ 2
π 0
How do you use AI to help you do research?
I'd love to learn!
I'll share how to use them below.
1/3
07.06.2025 02:48
π 8
π 0
π¬ 4
π 0