One of the most well-established and disruptive uses for a future quantum computer is the ability to crack encryption. A new algorithm could significantly lower the barrier to achieving this. Despite ...

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 ...

Finnish researchers are focusing on a small set of quantum algorithms they think will have a global impact.

For decades, computer scientists working on negative-weight graphs tried to match the speed of Dijkstra’s algorithm with similar “combinatorial” algorithms. These involve discrete operations — like ...

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.” ...

But Gail's Bakery looks to spark a fresh row away from the debate over its over-expansion, after admitting using a computer algorithm to help them select spots for new branches.

One computer scientist’s “stunning” proof is the first progress in 50 years on one of the most famous questions in computer science.

The findings, published in IEEE Transactions on Consumer Electronics, present a way to protect sensitive videos from rare but extremely powerful computers.