A computer scientist has achieved a breakthrough in a nearly 25-year-old problem involving how computers calculate distances across enormous networks. The new algorithm delivers more reliable ...

AI can help theoretical computer scientists search for algorithms, proof components, and combinatorial structures. Here’s what recent results show—and why verification still matters.

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. Click to tell Google to ...

See how AI is changing algorithm discovery, theorem proving, and complexity theory, with real research examples and a clear look at its limitations.

People have performed many mathematical proofs to show that a quantum computer will vastly outperform traditional computers on a number of algorithms. But the quantum ...

Bio: Alfred V. Aho is the Lawrence Gussman Professor Emeritus of Computer Science at Columbia University. He has served as Vice President of the Computing Sciences Research Center at Bell Labs, the ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...