Ben Brubaker

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.”

Three researchers have figured out how to craft a proof that spreads out information while keeping it perfectly secret.

While devising a new quantum algorithm, four researchers accidentally established a hard limit on entanglement.

After decades of uncertainty, a motley team of programmers has proved precisely how complicated simple computer programs can get.

Researchers have proved that secure quantum encryption is possible in a world without hard problems.

Researchers have shown how to find the simplest description of a data set faster than by simply checking every possibility.

Russell Impagliazzo studies hard problems, the limits of cryptography, the nature of randomness and more.

Large language models do better at solving problems when they show their work. Researchers are beginning to understand why.

Two researchers have proved that Penrose tilings, famous patterns that never repeat, are mathematically equivalent to a kind of quantum error correction.