<p>Today <a href="https://matthew99a.github.io/" target="_blank" rel="noopener noreferer">Xiao Mao</a> joined us to discuss his groundbreaking work, <a href="https://arxiv.org/abs/2504.17033" target="_blank" rel="noopener noreferer">Breaking the Sorting Barrier for Directed Single-Source Shortest Paths</a>. It's not every day you beat Djikstra at something. This was a good one.  Thank you for talking to us, Xiao!</p>

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!

<p>Today <a href="https://matthew99a.github.io/" rel="noopener noreferrer">Xiao Mao</a> joined us to discuss his groundbreaking work, <a href="https://arxiv.org/abs/2504.17033" rel="noopener noreferrer">Breaking the Sorting Barrier for Directed Single-Source Shortest Paths</a>. It's not every day you beat Djikstra at something. This was a good one.  Thank you for talking to us, Xiao!</p>

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao

The Boston Computation Club is a small seminar group focused on mathematical computer science, and computational mathematics. Its name is plagiarized from the London Computation Club. Boston Computation Club meetings occur roughly every other week, on weekends, around 5pm EDT (modulo speaker availability). The usual format is a 20m presentation followed by 40m of discussion. Some, but not all, meetings are posted on YouTube and in podcast form.

Share Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao

Sign up to save your podcasts

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao

More shows like Boston Computation Club

The Ezra Klein Show