1 | -- | 20 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jiri Sgall. Single Source Multiroute Flows and Cuts on Uniform Capacity Networks |
21 | -- | 51 | Miklós Ajtai. Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr s algorithm for the shortest vector problem |
53 | -- | 76 | Avi Wigderson, David Xiao. Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications |
77 | -- | 109 | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler. Near-Optimal Network Design with Selfish Agents |
111 | -- | 128 | Luca Trevisan. Approximation Algorithms for Unique Games |
129 | -- | 135 | T. S. Jayram, Ravi Kumar, D. Sivakumar. The One-Way Communication Complexity of Hamming Distance |
137 | -- | 168 | Emanuele Viola, Avi Wigderson. Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols |
169 | -- | 190 | Edward Farhi, Jeffrey Goldstone, Sam Gutmann. A Quantum Algorithm for the Hamiltonian NAND Tree |
191 | -- | 193 | Viswanath Nagarajan. On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem |