A new single-string method lets flat designs deploy into complex 3D structures, with potential uses in modular space habitats ...

A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin (2025): Breaking the Sorting Barrier for Directed Single-Source Shortest Paths“. 57th Annual ACM Symposium on Theory of Computing (STOC). Faster ...

In any military operation, reliable logistics is essential to maintaining a combat-effective force. Without the continual resupply of ammunition, food, and other materiel, forces cannot sustain their ...

Abstract: In undirected graphs with real non-negative weights, we give a new randomized algorithm for the single-source shortest path (SSSP) problem with running time ...

Abstract: We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing. While close-to-optimal solutions, ...