Published by the Department of Computer Science University of Chicago.

• 2012 Articles
  • 1. 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 by Thomas Vidick
  • 2. Minimum and maximum against k lies by Michael Hoffman, Jiří Matoušek, Yoshio Okamoto and Philipp Zumstein
  • 3. Linear cover time for trees is exponentially unlikely by Amir Yehudayoff
  • 4. Hardness of the Covering Radius Problem on Lattices by Ishay Haviv and Oded Regev
  • 5. Best Effort and Priority Queuing Policies for Buffered Crossbar Switches by Alex Kesselman, Kirill Kogan and Michael Segal
  • 6. Interactive proofs with efficient quantum prover for recursive Fourier sampling by Matthew McKague
  • 7. Computational Models with No Linear Speedup by Amir M. Ben-Amram, Niels H. Christensen and Jakob Grue Simonsen
  • 8. Almost all decision trees do not allow significant quantum speed-up by Ashley Montanaro
  • 9. On Quantum Interactive Proofs with Short Messages by Attila Pereszlényi
  • 10. Learning graph based quantum query algorithms for finding constant-size subgraphs by Troy Lee, Frédéric Magniez and Miklos Santha
• 2012 Abstracts

Volume 2011

Published articles