Theory
An average-case depth hierarchy theorem for Boolean circuits, a paper co-authored by Rocco A. Servedio and student Li-Yang Tan wins Best Paper at FOCS 2015.
With his former student Li-Yang Tan (PhD ’14), he will use random projections to prove lower bounds on Boolean circuits.
In a retelling of Alice in Wonderland, Bishop illustrates the fundamentals and power of cryptography while warning how human error undermines that power.
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