Lightnews — Scholar-powered news

Reposted by Thatchaphol Saranurak

Steven Strogatz @stevenstrogatz.com · Aug 22

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

Interview with Steven Strogatz

YouTube video by Math-life balance

www.youtube.com

3 13 35

Reposted by Thatchaphol Saranurak

Suresh Venkatasubramanian @geomblog.bsky.social · Aug 6

This is very impressive. Breaking the sorting barrier for directed single source shortest paths
search.app/wnEUo

New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine

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.

search.app

1 5 20

Thatchaphol Saranurak @eigx.bsky.social · Jul 18

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

Lecture 4.1: Amortized Analysis: Bank account method, Binomial heaps, Hollow heaps

YouTube video by Thatchaphol Saranurak

www.youtube.com

1 2 4

Thatchaphol Saranurak @eigx.bsky.social · Jul 18

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.

Lecture 0: Introduction

YouTube video by Thatchaphol Saranurak

www.youtube.com

1 8

Reposted by Thatchaphol Saranurak

FOCS 2025 @focs2025.bsky.social · Jul 13

The list of accepted papers at #FOCS2025 is up!

focs.computer.org/2025/accepte...

Accepted Papers – FOCS 2025

focs.computer.org

15 37

Thatchaphol Saranurak @eigx.bsky.social · Jul 6

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 :)

LEADERSHIP LAB: The Craft of Writing Effectively

YouTube video by UChicago Social Sciences

www.youtube.com

1 12

Reposted by Thatchaphol Saranurak

Waterloo’s David R. Cheriton School of Computer Science @uwcheritoncs.bsky.social · Jul 2

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

Professor Sepehr Assadi stands by a bench in Waterloo's Peter Russell Rock Garden.

3 23

Thatchaphol Saranurak @eigx.bsky.social · Jun 24

Omg

Dan Garisto @dangaristo.bsky.social · Jun 24

NEW: NSF will be kicked out of their building. Announcement will be made tomorrow by HUD Sec. and Governor of VA. HUD will take over the NSF building over the next two years.

NSF staffer: "There is no planning for NSF, no identified future location, appropriation for a new building or a move."

1

Reposted by Thatchaphol Saranurak

Barna Saha @barnacs.bsky.social · Jun 18

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

TCS for All

Theoretical Computer Science without Barriers

SIGACT.org

7 18

Thatchaphol Saranurak @eigx.bsky.social · Jun 7

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.

1

Thatchaphol Saranurak @eigx.bsky.social · Jun 7

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

Thatchaphol Saranurak @eigx.bsky.social · Jun 7

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

2

Thatchaphol Saranurak @eigx.bsky.social · Jun 7

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

4 8

Thatchaphol Saranurak @eigx.bsky.social · Jun 4

This is amazing!

1

Reposted by Thatchaphol Saranurak

Clément Canonne @ccanonne.github.io · Jun 3

This graduate-level summer school at the Max Planck Institute (Aug 18–22) on "Graph Decompositions and Efficient Algorithms" looks pretty good! Ft. Maria Chudnovsky, Michał Pilipczuk, and Thatchaphol Saranurak (@eigx.bsky.social)

Travel grant applications: June 30
www.mpi-inf.mpg.de/departments/...

Welcome - Max Planck Institute for Informatics

www.mpi-inf.mpg.de

4 15

Reposted by Thatchaphol Saranurak

Lance Fortnow @lance.fortnow.com · May 31

Tracy Kimbrel, former National Science Foundation program director extraordinaire, will receive the 2025 ACM SIGACT Distinguished Service Award. He spearheaded programs such as TRIPODS (foundations of data science) and AitF (Algorithms in the Field).
1/2

1 4 14

Reposted by Thatchaphol Saranurak

Michael Dinitz @mdinitz.bsky.social · May 31

Incredibly well deserved!!

Clément Canonne @ccanonne.github.io · May 31

Huge congratulations to Tracy Kimbrel, who received the 2025 ACM SIGACT Service Award 🏆 for his time, dedication, and advocacy as Program Director for the Algorithmic Foundations (AF) program at the NSF!
sigact.org/prizes/servi... #TCSSky

2025 ACM-SIGACT Distinguished Service Award

sigact.org

2 6

Reposted by Thatchaphol Saranurak

Ryan O'Donnell @booleananalysis.bsky.social · May 17

This!

I like to say,

"Let p|A denote distribution p conditioned on event A.

Imagine a world where the laws of probability are the same, except (p|A)|B need not equal (p|B)|A.

Except you don't have to imagine, because it's literally our world!

Now explore probabilistic algorithms in this world."

1 4 32

Reposted by Thatchaphol Saranurak

Kasper Green Larsen @kasperglarsen.bsky.social · Apr 30

Accepted papers for ICALP'25 is now online! Please register for amazing program and come visit us here in Aarhus!
conferences.au.dk/icalp2025/ac...

Accepted Papers

conferences.au.dk

3 8

Reposted by Thatchaphol Saranurak

arxiv cs.DS @arxiv-cs-ds.bsky.social · Apr 4

Tuukka Korhonen
Dynamic Treewidth in Logarithmic Time
https://arxiv.org/abs/2504.02790

3 4

Reposted by Thatchaphol Saranurak

Samson Zhou @szhoucs.bsky.social · Apr 4

Taking a break from the submission season? Swing by the Workshop on Algorithms for Large Data (Online), WALDO 2025 🗓️ April 14—16: waldo-workshop.github.io/2025.html
Registration is free! (but necessary by April 7)

Workshop on Algorithms for Large Data (Online) 2025

waldo-workshop.github.io

4 4

Thatchaphol Saranurak @eigx.bsky.social · Apr 3

An alternative name for log* that I quite like

Neeldhara Misra @neeldhara.bsky.social · Apr 3

Logging depth?

1

Reposted by Thatchaphol Saranurak

Tom Gur @tomgur.bsky.social · Mar 17

I am very much looking forward to giving this talk at TCS+, which is one of my favourite seminars. Thanks for inviting me!

Clément Canonne @ccanonne.github.io · Mar 13

I am very excited about this talk: First, Zero-Knowledge proofs are basically magic. Second, PCPs are nothing short of sorcery. Third, Tom is too good at everything not to secretly be a wizard.

It's going to be awesome!
forms.gle/Zwyn13NkKNSr...

2 6

Reposted by Thatchaphol Saranurak

Clément Canonne @ccanonne.github.io · Mar 17

An announcement: the Workshop on Algorithms for Large Data (Online) 2025 will take place 🗓️ April 14—16.
waldo-workshop.github.io/2025.html

Goal: "to generate new collaborations through an emphasis on big data algorithms, broadly defined"

Register (free) by ⏰ April 7 to access the virtual platform

Workshop on Algorithms for Large Data (Online) 2025

waldo-workshop.github.io

1 8 21

Thatchaphol Saranurak @eigx.bsky.social · Mar 10

This new sorting algorithm is so simple and beautiful!
I hope there is an easy analysis for this.
arxiv.org/abs/2502.05082

A Randomised Approach to Distributed Sorting

We introduce and analyse a new, extremely simple, randomised sorting algorithm: - choose a pair of indices $\{i, j\}$ according to some distribution $q$; - sort the elements in positions $i$ and $...

arxiv.org

13