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 a retelling of Alice in Wonderland, Bishop illustrates the fundamentals and power of cryptography while warning how human error undermines that power.
On the Complexity of Nash Equilibria in Anonymous Games / Boolean function monotonicity testing requires (almost) n1/2 non-adaptive queries / Indistinguishability Obfuscation for Turing Machines with Unbounded Memory / In Faster Canonical Forms for Primitive Coherent Configurations
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