Many mathematical puzzles in everyday life, like estimating travel time or making a budget, are straightforward. The building blocks that we learn as children — addition, subtraction, multiplication, ...

Pose a question to a Magic 8 Ball, and it’ll answer yes, no or something annoyingly indecisive. We think of it as a kid’s toy, but theoretical computer scientists employ a similar tool. They often ...

The original version of this story appeared in Quanta Magazine. They say a bird in the hand is worth two in the bush, but for computer scientists, two birds in a hole are better still. That’s because ...

Algebraic complexity addresses the fundamental question of how efficiently one can compute polynomials and related algebraic objects. It employs models such as arithmetic circuits, branching ...

This blog is a continuation of the Building AI Leadership Brain Trust Blog Series which targets board directors and CEO’s to accelerate their duty of care to develop stronger skills and competencies ...

Welcome to the Theoretical Computer Science (TCS) research group. Research in TCS (and in our group) encompasses diverse areas such as theory of computation, complexity, sublinear algorithms, ...