Theory
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.
Two papers prove new lower bounds; one gives significant quantitative improvements over earlier lower bounds. The third paper reports progress in solving certain dynamic graph problems s using a deterministic approach.
"Settling the query complexity of non-adaptive junta testing" was named best paper at the 32nd Computational Complexity Conference (CCC), the top venue for research in computational complexity theory.
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