Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao
Today Xiao Mao joined us to discuss his groundbreaking work, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. It's not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!
Podzilla Summary coming soon
Sign up to get notified when the full AI-powered summary is ready.
Free forever for up to 3 podcasts. No credit card required.
Listen to This Episode
More from Boston Computation Club
06/26/26: Tracing Introspection Across Model Depth, Zach Maas
An Extremely Short Proof of the Hairy Ball Theorem with Peter McGrath
Logic.py: Bridging the Gap between LLMs and Constraint Solvers with Pascal Kesseli
2/17/26: Approximately Aligned Decoding with Daniel Melcer
Get summaries like this every morning.
Free AI-powered recaps of Boston Computation Club and your other favorite podcasts, delivered to your inbox.
Free forever for up to 3 podcasts. No credit card required.