Sorrachai Yingchareonthawornchai

CSLib: The Lean computer science library. ~ Clark Barrett, Swarat Chaudhuri, Fabrizio Montesi, Jim Grundy, Pushmeet Kohli, Leonardo de Moura, Alexandre Rademaker, Sorrachai Yingchareonthawornchai. arxiv.org/abs/2602.04846… #ITP #LeanProver #CompSci

I wrote a post on how to connect with people (i.e., make friends) at CS conferences. These events can be intimidating so here's some suggestions on how to navigate them I'm late for #ICLR2025 #NAACL2025, but just in time for #AISTATS2025 and timely for #ICML2025 acceptances! 1/4

We are launching an 𝐮𝐧𝐨𝐟𝐟𝐢𝐜𝐢𝐚𝐥 and experimental online parallel event for the conference ITCS25, aimed at everyone who cannot attend the conference in person for whatever reasons. (1/2) sites.google.com/view/itcs2025o… #ITCS25 #ITCS2025 #OnlineParallels

Summer 2025 internship opportunity for TCS students at the Algorithms group at @MSFTResearch. We will consider applications submitted by the end of December. Link to apply: jobs.careers.microsoft.com/global/en/job/…

Cornell, Maryland, Max Planck Pre-doctoral Research School in Computer Science (CMMRS) - opportunities for CS master's and bachelor's students to attend lectures by experts and meet fellow students, with everything funded. (1/2)

Opportunities for Computer Science undergrad at Max Planck Institutes in 2025: 1. Paid internship: - Apply here: cis.mpg.de/internships/ - Deadline: November 1 (!) 2. ADFOCS summer school (conferences.mpi-inf.mpg.de/adfocs/). Small travel support may be awarded to a few applicants. (1/2)

Unbreakable decomposition is a powerful graph decomposition in parameterized algorithms. But it is slow. Here, we give the first algorithm that constructs this decomposition in close-to-linear time. Yay! arxiv.org/abs/2408.09368 Let me explain some nice connections below. 1/

My last name is a bit too long to fit in one line 😅

A classical push-relabel algorithm can compute max flow in almost optimal time in dense graphs :) Just specify how frequently the algorithm is allowed to "touch" each edge. It's also conceptually simple to compute the frequency of each edge (u,v). arxiv.org/abs/2406.03648 1/3

Daniel Dennett (28th March 1942 - 19th April 2024) RIP Dennett on how to criticise wisely

Here is a new hypothesis about "static" problems that explains the hardness of tons of "dynamic" data structure problems (including the OMv conjecture) youtube.com/watch?v=VPTx9Y… A very cool work by Karl Bringmann, Allan Gronlund, Marvin Kuennermann, Kasper Green Larsen.

We are hiring summer interns: aalto.fi/en/aalto-scien…

A new and fundamental instance-optimality result 🤯 (Who knew there was still more to prove about Dijkstra's algorithm?)

Optimization and Algorithm Design (Workshop) Monday, 11/27 – Friday, 12/1 Join us! simons.berkeley.edu/workshops/opti…

Video lectures, CMU 15 850 Advanced Algorithms spring 2023, by Anupam Gupta cs.cmu.edu/~15850/ #folderID=%2253c58248-7fd4-4f71-8774-af85013a570a%22&page=1" target="_blank" rel="nofollow noopener">scs.hosted.panopto.com/Panopto/Pages/…

Here is a tutorial on using differential privacy and adaptive data analysis to make dynamic data structures work against an adaptive adversary. I really like this connection and hope to learn more about this. youtube.com/watch?v=1cAv-A…

Lijie Chen, Shuichi Hirahara and Hanlin Ren show that the second level of the exponential-time hierarchy requires exponential-size circuits. Paper eccc.weizmann.ac.il/report/2023/14… Why you should care blog.computationalcomplexity.org/2023/09/half-e…

It's nearly October. If you need letters of recommendation for something this calendar year, you should be asking about now. That, and more details in my blog post: "How to Ask for a Letter of Recommendation" kamathematics.wordpress.com/2021/08/18/how…

at Meet the Fellows Welcome Event Fall 2023 (see #simons-tabs" target="_blank" rel="nofollow noopener">simons.berkeley.edu/workshops/meet… for more talks at the event).

I gave a short talk on recent advances in vertex connectivity algorithms at Simons Institute (link: youtube.com/live/oXmc0OeoR…), summarizing the recent results in the field in 15 minutes.