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