Boston Computation Club

← Boston Computation Club5 Jan · 58 min

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

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao5 Jan58 min

<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&#39;s not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!</p>