A solution to P vs NP could unlock countless computational problems—or keep them forever out of reach. 1. On Monday, July 19, 2021, in the middle of another strange pandemic summer, a leading computer ...

Editor’s note: This is part of a series of stories featuring master’s degree programs at the University of Chicago. Bradley Stoller knew the University of Chicago was an ideal fit to pursue a master’s ...

Theoretical computer scientist Manuel Blum has guided generations of graduate students into fruitful careers in the field. Every academic field has its superstars. But a rare few achieve superstardom ...

Building community among early-career researchers in theoretical computer science, postdoctoral researchers and PhD students presented novel algorithms, techniques, and data structures at the annual ...

For Shang-Hua Teng, theoretical computer science has never been purely theoretical. Now 58, Teng is a professor of computer science at the University of Southern California and a two-time winner of ...

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

Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields. When Avi Wigderson and László Lovász began their ...