EPISODE · Jan 5, 2026 · 57 MIN
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao
from Boston Computation Club · host Max von Hippel
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!
Embed this episode
NOW PLAYING
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao
0:00
57:57
1×
No transcript for this episode yet
Similar Episodes
No similar episodes found.
Similar Podcasts
No similar podcasts found.
Frequently Asked Questions
How long is this episode of Boston Computation Club?
This episode is 57 minutes long.
When was this Boston Computation Club episode published?
This episode was published on January 5, 2026.
Can I download this Boston Computation Club episode?
Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!