Thatchaphol Saranurak
@eig
Followers
2K
Following
2K
Media
231
Statuses
8K
Assistant Professor at @UMichCSE. I design fast graph algorithms in dynamic/distributed/local settings.
Ann Arbor, USA
Joined March 2008
I used ChatGPT Agent to create an easier-to-navigate schedule for SODA and SOSA 26 https://t.co/pSY0YO4hgJ The original one is hard to see the overview.
0
1
5
🎉 Congrats to Prof. @ChrisPeikert and co-authors on receiving the Distinguished Paper Award at CCS 2025 for groundbreaking work in secure threshold decryption for fully homomorphic encryption! 👏 🔗 https://t.co/6Vw1SzwcA9
#UMCSE #UMich #Cryptography #Cybersecurity #CCS2025
cse.engin.umich.edu
He and his coauthors were recognized for their work on high-throughput, secure threshold decryption for fully homomorphic encryption.
5
20
92
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
0
0
1
Both low-level implementation and analysis were previously very involved. But our new paper simplifies both significantly. Now - Pretty readable for non-experts. - Simple enough to code up fully in C++ - I am trying to teach it this semester https://t.co/YB8soDYiDv 2/3
arxiv.org
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...
2
0
8
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. https://t.co/0oF8IVmQng But the result was not actually satisfying! 1/3
arxiv.org
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...
1
1
12
Opportunities for Computer Science undergrad at Max Planck Institutes in Summer 2026: 1. Paid internship: - Apply here: https://t.co/jL4liDIQz5 - Deadline: November 1 (!) 2. ADFOCS summer school ( https://t.co/nbIqHgLjEI). Topic: TBA 3. CMMRS Pre-doctoral Research ... (1/2)
2
11
37
The Swiss Winter School in TCS 2026 will take place January 25-30, featuring amazing speakers Ankur Moitra (MIT), Avishay Tal (UC Berkeley), and Vera Traub (ETHZ). Application deadline: October 24 More information:
0
8
28
One of the best
0
2
15
How did I end up a Mathematician? (long story) As a child, my dad said to me "our family isn't good in math" and I, preferring soccer and dating to anything involving brain work, accepted this as truth. As an undergrad I studied Biology and CS, to go into Neuroscience (I ended
29
47
326
Published in International Teletraffic Congress in 1973 and introducing expander graphs for the first time, is this research, engineering, or engineering research?
1
2
12
Applications are invited for postdoc positions in my group @TelAvivUni. The selected candidates will confront challenging problems in graph algorithms (dynamic, distributed, geometric). A "remote" option may also be possible. Help me spread the word!
1
4
17
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. https://t.co/QHhhYt3QZF
0
1
12
Math vs. Cooking: What does it mean to do math/theory? Here, I presented an analogy to cooking inspired by @davidbessis's book. The goal is to help students understand how to effectively learn in theory classes. https://t.co/HQe4X9ExeR (at 59:38) Do you think this makes sense?
2
5
23
Wow, this might be the best lecture on academic writing I've ever watched! https://t.co/vpRlTq09hf If any of you have suggestions for good materials related to grant writing and/or mathematical writing, I would be interested :)
1
0
17
For those that couldn't make it, we've uploaded our full STOC workshop on High Dimensional Expanders to Youtube! Hopefully a useful resource for learning the basics of HDX and how they're applied in TCS. Talk 1: An introduction to HDX https://t.co/IaVj4M4yok
2
25
93
3. https://t.co/Ar8P5A230v 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
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
1
0
2