Dijkstra's algorithm has long been the quickest way of finding the shortest possible paths in a network, but researchers have ...

Daniel Lokshtanov’s work explores the limits of what computers can solve, paving the way for advances in artificial intelligence and computational efficiency.

For decades, the graph isomorphism problem has held a special status within complexity theory. While thousands of other computational problems have meekly succumbed to categorization as either hard or ...

What do encrypted messages, recognizing speech commands and running simulations to predict the weather have in common? They all rely on matrix multiplication for accurate calculations. DeepMind, an ...

A 20-year-old algorithm that demonstrated the benefit of using quantum mechanics to solve certain problems has finally been run on a quantum computer. Simon’s algorithm, proposed by computer scientist ...

Barbara Liskov pioneered the modern approach to writing code. She warns that the challenges facing computer science today can’t be overcome with good design alone. Good code has both substance and ...

Jelani Nelson, an associate professor of Computer Science at the School of Engineering and Applied Sciences whose research focuses on designing algorithms to process large, high-dimensional datasets, ...

Being on the leading edge of computer science is more than writing code. At Luther, you'll learn about the essential problem-solving and critical/analytical skills you need to be competitive in the ...

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