Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

What’s the best way to solve hard problems? That’s the question at the heart of a subfield of computer science called computational complexity theory. It’s a hard question to answer, but flip it ...

Rice quantum computing researchers have introduced a novel algorithm that earned the team a place in the global XPRIZE Quantum Applications competition.

As algorithms become more widespread within government institutions, there are two basic challenges. One is to design better ...