algorithms

The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way.

The theoretical computer scientist Constantinos Daskalakis has won the Rolf Nevanlinna Prize for explicating core questions in game theory and machine learning.

Computer scientists have been searching for years for a type of problem that a quantum computer can solve but that any possible future classical computer cannot. Now they’ve found one.

A century ago, the great mathematician David Hilbert posed a probing question in pure mathematics. A recent advance in optimization theory is bringing Hilbert’s work into a world of self-driving cars.

The latest in a new series of proofs brings theoretical computer scientists within striking distance of one of the great conjectures of their discipline.

Even with no one in charge, army ants work collectively to build bridges out of their bodies. New research reveals the simple rules that lead to such complex group behavior.

New algorithms show how swarms of very simple robots can be made to work together as a group.

The quest for “quantum supremacy” – unambiguous proof that a quantum computer does something faster than an ordinary computer – has paradoxically led to a boom in quasi-quantum classical algorithms.

To efficiently analyze a firehose of data, scientists first have to break big numbers into bits.