Theory
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
In a retelling of Alice in Wonderland, Bishop illustrates the fundamentals and power of cryptography while warning how human error undermines that power.
Columbia theoretical computer scientists presented four papers at the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS) held October 18-20 2015 in Berkeley, CA.
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