ZARZA We are Zarza, the prestigious firm behind major projects in information technology.
Listen "Breaking the Sorting Barrier in Shortest Paths"
Episode Synopsis
This episode presents a deterministic algorithm for the single-source shortest path (SSSP) problem on directed graphs with non-negative edge weights, operating within the comparison-addition model. The core contribution is achieving an O(m log^(2/3) n) time complexity, which is the first to surpass Dijkstra's algorithm's O(m + n log n) bound on sparse graphs, demonstrating that Dijkstra's is not optimal for SSSP.
More episodes of the podcast Intelligence Unbound
AI Boost Productivity by 80%, is it real?
02/12/2025
PAN: A General Interactable World Model
26/11/2025
GPT-5 Acceleration of Scientific Discovery
22/11/2025
In God we trust