Ce Jin

[Ce Jin @jcvbcn]

@TheSIAMNews Thanks, Berkeley has access now

[Ce Jin @jcvbcn]

SIAM @TheSIAMNews has removed UC Berkeley's online access to all SODA 2025 papers? https://t.co/DixLKLmxkA

[Ce Jin @jcvbcn]

@Fujii_shiki 恭喜！

[Ce Jin @jcvbcn]

@vetohaze Congrats!!

[Ce Jin @jcvbcn]

@GolowichNoah Congrats!

[Ce Jin @jcvbcn]

@alexwei_ Congrats Alex!!!! 🎉

[Deedy @deedydas]

Huge computer science result:

A Tsinghua professor JUST discovered the fastest shortest path algorithm for graphs in 40yrs.

This improves on Turing award winner Tarjan’s O(m + nlogn) with Dijkstra’s, something every Computer Science student learns in college.

[Ce Jin @jcvbcn]

@alexwei_ @OpenAI Congrats Alex!!

[Ce Jin @jcvbcn]

@matthew99a 🤩🤩

[Iva Topuria @inksamurai_]

Dijkstra is not optimal — proven by Codeforces legends

https://t.co/ZFQvIH8LCS

[Ce Jin @jcvbcn]

@yosupot Hi yosupo, this can be improved to Omega~(N^1.5)? Roughly speaking, pick a random prime p ~ N^0.5 and group the numbers based on residues mod p (each group likely has size ~ N^0.5). Let each group occupy a contiguous subarray. There are only p^2 interesting triples of groups

[Ce Jin @jcvbcn]

@Glaciohound @hengjinlp @aviaviavi__ Congrats 🎉!!!

[Ce Jin @jcvbcn]

@alexwei_ Amazing!! 🤩

[Ce Jin @jcvbcn]

@geelaw95 congratulations!

[Ce Jin @jcvbcn]

@minilek @meghal_bagel @msinghal55 @HongxunWu 🎉🎉🎉🎉 congrats 😍😍😍😍😍

[Ce Jin @jcvbcn]

@minilek Happy birthday!!

[Ce Jin @jcvbcn]

@noshi91 Congratulations!! @noshi91 @elegia_li

[Ce Jin @jcvbcn]

@Glaciohound @hengjinlp @sinongwang @haopeng_nlp @XiongWenhan @chenyu_hugo congratulations!!

[Virginia V. Williams @pinkfloydie]

Congratulations to Ryan @rrwilliams!!! https://t.co/qIhmcTbdid

[Rasmus Pagh @RasmusPagh1]

Ryan Williams wins the Gödel prize! (finally) https://t.co/EGdIOAwwi8