Boston Computation Club podcast

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

0:00
57:57
Manda indietro di 15 secondi
Manda avanti di 15 secondi

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!

Altri episodi di "Boston Computation Club"