Early-career researchers in theoretical computer science presented novel algorithms, techniques, and data structures at the annual Junior Theorists Workshop, co-hosted by the Northwestern CS Theory ...

Computer scientists’ daydreams have revealed the power of quantum mechanics. Imagine meeting omniscient beings who claim to have the solution to a complex problem that no computer could ever solve.

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

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 the Clay Mathematics Institute put individual $1-million prize bounties on seven unsolved mathematical problems, they may have undervalued one entry—by a lot. If mathematicians were to resolve, ...

Getting students to buy into a class, getting them to buy into the content, pushing them beyond what they think they're capable of — that is what drives my work. Professor Sam Gutekunst, the John D.

A paper posted online this month has settled a nearly 30-year-old conjecture about the structure of the fundamental building blocks of computer circuits. This “sensitivity” conjecture has stumped many ...

The Northwestern CS Theory Group and Toyota Technological Institute at Chicago co-hosted the Junior Theorists Workshop held Dec. 8-9 The Junior Theorists Workshop, held Dec. 8-9, was more than just a ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...