When quantum computers become commonplace, current cryptographic systems will become obsolete. Scientists are racing to get ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...

For decades, computer science students have been taught a central skill: using computers to solve problems. In practice, that ...

Computing is part of everything we do. Computing drives innovation in engineering, business, entertainment, education, and the sciences—and it provides solutions to complex, challenging problems of ...

Researchers have combined the Dijkstra and Bellman-Ford algorithms to develop an even faster way to find the shortest paths ...

When Nathan Klein started graduate school two years ago, his advisers proposed a modest plan: to work together on one of the most famous, long-standing problems in theoretical computer science. Even ...