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 ...

When scientists test algorithms that sort or classify data, they often turn to a trusted tool called Normalized Mutual Information (or NMI) to measure how well an algorithm's output matches reality.

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...