Thatchaphol Saranurak

This is very insightful. www.youtube.com/watch?v=TNff...

Some reflections on AI in math. I found it helpful to simply list out the various parts of what a mathematician does, why math is valuable, and where the funding comes from. From there, what happens if AI gets more capable? youtu.be/LKrwhjOI8Nc

And regarding our values as a community, we can discuss there: cstheory.meta.stackexchange.com/q/3130/13319

Details about the STOC'27 video submission are now posted: acm-stoc.org/stoc2027/sto... Our community needs experiments, and this is the one I have been advocating for. We, as a community, will see how it goes and will adapt.

I wrote a blog post on "TCS, AI, and the Adults in the Room," addressed to the senior researchers and established academics in our field: minorfree.github.io/Clement/ Thanks to @hunglv.bsky.social for lending me his blog!

Another very normal day, lol APSP and 3SUM hypotheses are refuted: arxiv.org/abs/2610.067... KLS conjecture is proved: arxiv.org/abs/2610.014...

Registration for #FOCS2026 is now open: focs.computer.org/2026/registr... Early bird deadline: ⏰ October 26, AoE

The new call for Motwani postdocs application is now open! tinyurl.com/4r7etua2 BTW- Not quite ready for a postdoc? We updated the TCS Masters programs spreadsheet: tinyurl.com/493rxwkx Any career stage and in the (SF) Bay Area? Save the date for TOCA-SV on 11/6/2026!

The #STOC2027 CfP has been updated (in light of the recent #arXiv policy change): acm-stoc.org/stoc2027/sto... (see "Public submissions") In addition, a document by the PC Chair explaining the rationale behind the policies is available: acm-stoc.org/stoc2027/sto... [PDF]

Am teaching grad complexity theory at CMU; about 1/3 of the lectures will be new (vs. last time), 'modern' results. Videos are going onto www.youtube.com/@ComplexityT... which will later also feature student videos. We did Williams (/Cook-Mertz/Shalunov) TIME(t) in SPACE(~√t) today.

The videos of DIMACS Workshop on Fine-Grained Complexity of Graph Problems are now uploaded: www.youtube.com/playlist?lis...

"Maximum Flow Without the Outer IPM" in 9 pages. This is fantastic! arxiv.org/abs/2608.17384 Although it assumes dynamic data structures, it still simplifies things a lot!

"We're all worried," as what it means to do research (in my field, Theoretical CS) seems to be shifting, and shifting fast. What to do? Senior researchers must lead by example, knowing that not everything will pan out. What I'm suggesting below may not work everywhere, but here's my own advice: 1/

7/ Bottom line: If I were reviewing this for a top theory-of-CS conference, and the results bear out (as I expect them to), I would champion this for a Best Paper Award. (But I would also request a much more explanatory overview of the novel techniques in the intro...)

Wow, this is insightful. I also admire the way Sophie objectively self-criticizes her own work and her area.

breakthrough in binary search trees!

🚨📣 Clément Canonne and Sasha Rubin are organising a three-day event, "Sydney TCS Winter School 2026: Interactive Proofs and PCP Theorem" on July 22–24, 2026. Open to UG, Masters, and PhD students. Free attendance, but registration required! sites.google.com/view/sydney-...

Good question! Let me try to explain; a short 🧵. Bipartite matching is one of the earliest nontrivial* problems with a poly-time algorithm. But that algorithm - augmenting paths - feels very sequential, hard to parallelize. * I mean something like: not obviously solved by O(1) nested loops 1/8

DIMACS is hosting not one, not two, but three workshops on fine-grained complexity next month, from July 20–31! Registration is free but required. To register, click each relevant workshop page on the DIMACS events page: dimacs.rutgers.edu/events/list Hope to see many of you there!

this is huge! If true.

WACT 2026 in Copenhagen from Jun 2 to Jun 5 (started today!). Webpage: sites.google.com/view/wact202... YouTube channel: www.youtube.com/@WACT2026/pl...

I fully agree with this post by @gautamkamath.com on how preparing talks is one of the best ways to upgrade my own thinking. So, I certainly do not want to waste that opportunity by delegating it to AI. kamathematics.wordpress.com/2026/05/27/m...

The 2026 Presburger Award for Young Scientists goes to Vincent Cohen-Addad and @gautamkamath.com 🥳🎉 You can read the laudatio here:

This is very nice recognition of Hal Gabow! Hal spent his whole career as faculty at CU Boulder, and his legacy looms large for us. (Hal retired in 2008, and I unfortunately have never gotten a chance to meet him.)

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.

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...

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...

It's first round interview season and the most useful thing I can recommend is to spend time on these: csfaculty.github.io

#FOCS2025 This is one of the best FOCS conferences I have attended.

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

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...

The connection between distributed algorithms and descriptive set theory featured in Quanta: www.quantamagazine.org/a-new-bridge...

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?...

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?...

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

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

Nominate your final-year TCS PhD students or postdoc for the 2025 Chicago Junior Theorists Workshop (hosted by Northwestern and TTIC). theory.cs.northwestern.edu/2025/10/30/2...

📢 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...

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