Sorrachai Yingchareonthawornchai

Junior Research Fellow at ETH-ITS

[José A. Alonso @Jose_A_Alonso]

CSLib: The Lean computer science library. ~ Clark Barrett, Swarat Chaudhuri, Fabrizio Montesi, Jim Grundy, Pushmeet Kohli, Leonardo de Moura, Alexandre Rademaker, Sorrachai Yingchareonthawornchai. https://t.co/5aruq4Nl3S #ITP #LeanProver #CompSci

[Gautam Kamath @thegautamkamath]

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

[Online Parallels (@onlineparallels.bsky.social) @onlineparallels]

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)
https://t.co/zCXAnaDiCN
#ITCS25 #ITCS2025 #OnlineParallels

[Sepideh Mahabadi @SepidehMahabadi]

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:

https://t.co/FaCYaHNS20

[danupon @danupon]

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)

[danupon @danupon]

Opportunities for Computer Science undergrad at Max Planck Institutes in 2025:

1. Paid internship:
- Apply here: https://t.co/QfPURILxun
- Deadline: November 1 (!)

2. ADFOCS summer school (https://t.co/lNyEkWb6Cj). Small travel support may be awarded to a few applicants.
(1/2)

[Thatchaphol Saranurak @eig]

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!

https://t.co/B1gZYsLYU4

Let me explain some nice connections below.

1/

[Sorrachai Yingchareonthawornchai @sorrachai]

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

[Thatchaphol Saranurak @eig]

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

https://t.co/apeP86WWqC
1/3

[NS Ramnath @rmnth]

Daniel Dennett (28th March 1942 - 19th April 2024)

RIP

Dennett on how to criticise wisely

[Thatchaphol Saranurak @eig]

Here is a new hypothesis about "static" problems that explains the hardness of tons of "dynamic" data structure problems (including the OMv conjecture) https://t.co/YpkVARgPJh

A very cool work by Karl Bringmann, Allan Gronlund, Marvin Kuennermann, Kasper Green Larsen.

[Jukka Suomela @JukkaSuomela]

We are hiring summer interns: https://t.co/UW6eQkcu4a

[Tim Roughgarden @Tim_Roughgarden]

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

[Simons Institute for the Theory of Computing @SimonsInstitute]

Optimization and Algorithm Design (Workshop)
Monday, 11/27 – Friday, 12/1

Join us!

https://t.co/CkKTv0rcqx

[Caglar @caglar_ee]

Video lectures, CMU 15 850 Advanced Algorithms spring 2023, by Anupam Gupta
https://t.co/MCgBIXzJnD
https://t.co/37hA66RyEA

[Thatchaphol Saranurak @eig]

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.

https://t.co/dqvQr4FRin

[Lance Fortnow @fortnow]

Lijie Chen, Shuichi Hirahara and Hanlin Ren show that the second level of the exponential-time hierarchy requires exponential-size circuits.

Paper
https://t.co/UIBv1QujVW

Why you should care
https://t.co/3k12sw6OGx

[Gautam Kamath @thegautamkamath]

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"
https://t.co/5wyy7DpWoI

[Sorrachai Yingchareonthawornchai @sorrachai]

@SimonsInstitute

[Sorrachai Yingchareonthawornchai @sorrachai]

I gave a short talk on recent advances in vertex connectivity algorithms at Simons Institute (link: https://t.co/cACsyiSi0k), summarizing the recent results in the field in 15 minutes.

[Sorrachai Yingchareonthawornchai @sorrachai]

at Meet the Fellows Welcome Event Fall 2023 (see
https://t.co/QOI24D1sQI for more talks at the event).