Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

The original version of this story appeared in Quanta Magazine. If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a ...