Volume 5, Number 1, 2009
- Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement.
1-42
- Tal Moran, Moni Naor, Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
43-67
- Shachar Lovett:
Unconditional Pseudorandom Generators for Low Degree Polynomials.
69-82
- Subhash Khot, Ryan O'Donnell:
SDP Gaps and UGC-hardness for Max-Cut-Gain.
83-117
- Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo:
Discrete-Query Quantum Algorithm for NAND Trees.
119-123
- Ilan Newman, Yuri Rabinovich:
Hard Metrics from Cayley Graphs of Abelian Groups.
125-134
- Lance Fortnow:
A Simple Proof of Toda's Theorem.
135-140
- Thomas Holenstein:
Parallel Repetition: Simplification and the No-Signaling Case.
141-172
- Virginia Vassilevska, Ryan Williams, Raphael Yuster:
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time.
173-189
- Dana Glasner, Rocco A. Servedio:
Distribution-Free Testing Lower Bound for Basic Boolean Functions.
191-216
- John Watrous:
Semidefinite Programs for Completely Bounded Norms.
217-238
- Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes are Robust.
239-255
- Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions.
257-282
Last update Fri May 24 20:56:55 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
