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

Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. For more than 40 years, Avi Wigderson ...

The Northwestern CS Theory Group and Toyota Technological Institute at Chicago co-hosted the Junior Theorists Workshop held ...