Theory
Interview with Xi Chen, whose new book (coauthored with Jin-Yi Cai) gives a thorough introduction to complexity dichotomies of counting problems by summarizing major results contributing to progress in field.
In this talk at the Simons Foundation, Alexandr Andoni describes how the tools and perspectives of high-dimensional geometry benefit search algorithms.
With his former student Li-Yang Tan (PhD ’14), he will use random projections to prove lower bounds on Boolean circuits.
About
Theory research includes computational complexity, algorithms and data structures, cryptography, quantum computing, computational geometry, approximation algorithms, computational game theory, algorithmic graph theory and combinatorics, online algorithms, computational learning theory, algebraic computation, optimization, randomness in computing, parallel and distributed computing, algorithmic coding theory, and theoretical aspects of areas such as networks, privacy, information retrieval, computational biology, and databases.
Theory of Computing Group 
Add to GMail