Danupon's Avatar

Danupon

@nanongkai.bsky.social

53 Followers  |  68 Following  |  6 Posts  |  Joined: 23.11.2024
Posts Following

Posts by Danupon (@nanongkai.bsky.social)

LinkedIn This link will take you to a page that’s not on LinkedIn

πŸ“’ Full Professor (W3) in Algorithms & Complexity @ Saarland University πŸ‡©πŸ‡ͺ

Join a strong TCS environment with MPIs, CISPA & more!

πŸ—“ Deadline: Sep 18, 2025
πŸ“„ Details: www.uni-saarland.de/fileadmin/up...
πŸ“ Apply: www.uni-saarland.de/verwaltung/b...
πŸ“¬ Contact: mblaeser@cs.uni-saarland.de

30.07.2025 12:45 β€” πŸ‘ 2    πŸ” 1    πŸ’¬ 0    πŸ“Œ 0
Accepted Papers – FOCS 2025

The list of accepted papers at #FOCS2025 is up!

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

13.07.2025 22:59 β€” πŸ‘ 37    πŸ” 15    πŸ’¬ 0    πŸ“Œ 0
Trevisan Prize

”The Trevisan Prize for outstanding work in the Theory of Computing”

”The deadline for notification of nomination intent is July 31, 2025, and the nomination deadline is August 31, 2025.”
cs.unibocconi.eu/trevisan-prize

12.06.2025 15:40 β€” πŸ‘ 4    πŸ” 2    πŸ’¬ 0    πŸ“Œ 0
Offers - Max Planck Institute for Informatics

πŸ“’ PhD applicants in CS: Max Planck Institutes' next deadline is June 30!
Interested in Algorithms & Complexity? πŸ‘‰ mpii.de/d1/offers
No need to email meβ€”just list my name among potential advisors in your application.

06.06.2025 08:47 β€” πŸ‘ 0    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Preview
The Fastest Way Yet to Color Graphs | Quanta Magazine Researchers have devised a scheme for painting the edges of a graph that’s almost as speedy as possible.

After 40 years with slow-moving algorithms, two teams of researchers have generated historical speed-ups. It’s β€œa milestone few would have predicted even a couple of years ago,” said mathematician Anton Bernshteyn.

22.05.2025 20:04 β€” πŸ‘ 26    πŸ” 3    πŸ’¬ 0    πŸ“Œ 2
Post image

Until now, the only known algorithms for accomplishing some computations required an amount of space roughly proportional to their runtime. The computer scientist Ryan Williams has found a way to do any computation using much less space. www.quantamagazine.org/for-algorith...

29.05.2025 13:13 β€” πŸ‘ 21    πŸ” 4    πŸ’¬ 0    πŸ“Œ 0

#STOC2025 "will feature an online poster session, designed to engage both in-person attendees and members of the broader community who are unable to attend the conference physically."

(Initiative led by @iwmertz.bsky.social, Ninad Rajgopal, and @h4n1in.bsky.social)

acm-stoc.org/stoc2025/cal...

04.06.2025 00:26 β€” πŸ‘ 11    πŸ” 3    πŸ’¬ 0    πŸ“Œ 0

Curious what theory folks think about using OpenReview for conferences like FOCS/STOC/SODA/ICALPβ€”especially to enable public reviews. If you’ve used it as a PC chair, how hard was it to configure to fit our needs compared to HotCRP or EasyChair?

29.05.2025 10:09 β€” πŸ‘ 3    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0
Post image Post image

ADFOCS 2025 – Summer School on Graph Decompositions and Efficient Algorithms

πŸ—“οΈ August 18–22, 2025

πŸ“ SaarbrΓΌcken, Germany

πŸŽ“ Speakers: Maria Chudnovsky, MichaΕ‚ Pilipczuk, Thatchaphol Saranurak

πŸ”— More info: www.mpi-inf.mpg.de/departments/...

21.05.2025 13:48 β€” πŸ‘ 4    πŸ” 2    πŸ’¬ 0    πŸ“Œ 0
The Cornell, Maryland, Max Planck Pre-doctoral Research School in Computer Science (CMMRS 2025)

Cornell, Maryland, Max Planck Pre-doctoral Research School in Computer Science (CMMRS) is now open for applications cmmrs.mpi-sws.org Two students of my team attended the 2022 and 2024 editions and I strongly recommend.

02.12.2024 08:43 β€” πŸ‘ 3    πŸ” 2    πŸ’¬ 0    πŸ“Œ 1

Congrats, Derek and Co-authors!

29.01.2025 08:53 β€” πŸ‘ 0    πŸ” 0    πŸ’¬ 0    πŸ“Œ 0
Preview
[POPL'25] Marco Polo - POPL II (23rd Jan) YouTube video by ACM SIGPLAN

We all focus on doing exciting research ... but from time to time, it's nice to step back and try to build things that are just useful according to whatever metric you care about, even if it's not easy to convince the PC that they are novel enough. From 2025 Most Influential POPL Paper Award.

29.01.2025 08:53 β€” πŸ‘ 2    πŸ” 0    πŸ’¬ 1    πŸ“Œ 0