Danupon
@nanongkai.bsky.social
51 followers 68 following 6 posts
Posts Media Videos Starter Packs
nanongkai.bsky.social
📢 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: [email protected]
LinkedIn
This link will take you to a page that’s not on LinkedIn
lnkd.in
Reposted by Danupon
jukkasuomela.fi
”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
Trevisan Prize
cs.unibocconi.eu
nanongkai.bsky.social
📢 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.
Offers - Max Planck Institute for Informatics
mpii.de
Reposted by Danupon
quantamagazine.bsky.social
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.
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.
www.quantamagazine.org
Reposted by Danupon
quantamagazine.bsky.social
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...
Reposted by Danupon
ccanonne.github.io
#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...
nanongkai.bsky.social
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?
nanongkai.bsky.social
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/...
Reposted by Danupon
dcampelo.bsky.social
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.
The Cornell, Maryland, Max Planck Pre-doctoral Research School in Computer Science (CMMRS 2025)
cmmrs.mpi-sws.org
nanongkai.bsky.social
Congrats, Derek and Co-authors!
nanongkai.bsky.social
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.
[POPL'25] Marco Polo - POPL II (23rd Jan)
YouTube video by ACM SIGPLAN
www.youtube.com