Thank you for printing the lively article “A Storied Approach to Operations Research” (Notes from Academe, June 14), about Gene Woolsey of the Colorado School of Mines. ... I was especially struck by ...

Recent progress in camera systems, image analysis, and machine learning have made optical-based gesture recognition a more attractive option in most contexts. However, current methods are hindered by ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

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

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

Jory Denny is a member of two professional societies: the Association of Computing Machinery and IEEE. He is associated with Waymo LLC. The world of computing is full of buzzwords: AI, supercomputers, ...

One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling discovery about the relationship between time and memory in computing.

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

The original version of this story appeared in Quanta Magazine. Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price.