Chicago Journal of Theoretical Computer Science, Volume 2013
: A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem.
: Interactive proofs with competing teams of no-signaling provers.
: Simpler semidefinite programs for completely bounded norms.
: Complexity of the homomorphism extension problem in the random case.
Niel de Beaudrap
: On the complexity of solving linear congruences and computing nullspaces modulo a constant.
: A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy.