A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

A teenage programmer tests a set of instructions she has written to get her computer to mop the floor. Suitable for teaching at KS3, KS4 and National 4 and 5.

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

In life, we sometimes have to make decisions without all the information we want; that’s true in computer science, too. This is the realm of online algorithms — which, despite their name, don’t ...

In the age of AI, people might wonder if there’s anything computers can’t do. The answer is yes. In fact, there are numerous problems that are beyond the reach of even the most powerful computers.

Researchers at FIU’s College of Engineering and Computing have developed an encryption algorithm to defend videos from attackers with access to the world's most powerful computers. The encryption ...

Circle detection algorithms form a fundamental pillar in computer vision, enabling the identification of circular features across a wide range of applications from automated industrial inspection to ...

Researchers from EPFL, AMD, and the University of Novi Sad have uncovered a long-standing inefficiency in the algorithm that ...