The bookshelf problem (which computer scientists call the “list labeling” problem) is one of the most basic topics in the field of data structures. “It’s the kind of problem you’d teach to freshman or ...

Will algorithms designed for interconnected computers hold up if some of the machines are not here on Earth but flying about ...

Using Kyng's algorithm, the "additional" computing time required to reach the solution after reading the network data is now negligible. Like a Porsche racing a horse-drawn carriage.

Only 32 nations, mostly in the Northern Hemisphere, have A.I.-specialized data centers. Last month, Sam Altman, the chief ...

For years, quantum computing’s news cycle was dominated by headlines about record-setting systems. Researchers at Google and IBM have had spats over who achieved what—and whether it was worth ...

Climate models can be a million lines of code long and can take months to run on supercomputers. A new algorithm has dramatically shortened that time.

The original version of this story appeared in Quanta Magazine.. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to ...

Quantum computing is getting there. After years of slow but steady development to create a useful quantum computer that can outperform classical machines, we’re still squarely in the “noisy ...

Quantum computing is on the horizon, ... But for Bitcoin and other cryptocurrencies, which rely on today’s cryptographic algorithms for security, this technological leap could pose new risks.

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