Volume 2,
Number 1,
2006
- Robert Spalek, Mario Szegedy:
All Quantum Adversary Methods are Equivalent.
1-18
Electronic Edition (link) BibTeX
- Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program.
19-51
Electronic Edition (link) BibTeX
- Anupam Gupta, Aravind Srinivasan:
An Improved Approximation Ratio for the Covering Steiner Problem.
53-64
Electronic Edition (link) BibTeX
- Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures.
65-90
Electronic Edition (link) BibTeX
- Eyal Rozenman, Aner Shalev, Avi Wigderson:
Iterative Construction of Cayley Expander Graphs.
91-120
Electronic Edition (link) BibTeX
- Ran Raz:
Separation of Multilinear Circuit and Formula Size.
121-135
Electronic Edition (link) BibTeX
- Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.
137-146
Electronic Edition (link) BibTeX
- Jeffrey C. Jackson, Rocco A. Servedio:
On Learning Random DNF Formulas Under the Uniform Distribution.
147-172
Electronic Edition (link) BibTeX
- Eldar Fischer, Lance Fortnow:
Tolerant Versus Intolerant Testing for Boolean Properties.
173-183
Electronic Edition (link) BibTeX
- Adam R. Klivans, Amir Shpilka:
Learning Restricted Models of Arithmetic Circuits.
185-206
Electronic Edition (link) BibTeX
- Moses Charikar, Robert Krauthgamer:
Embedding the Ulam metric into l1.
207-224
Electronic Edition (link) BibTeX
- Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang:
Matrix Approximation and Projective Clustering via Volume Sampling.
225-247
Electronic Edition (link) BibTeX
- Ioannis Giotis, Venkatesan Guruswami:
Correlation Clustering with a Fixed Number of Clusters.
249-266
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:29:37 2009
by Michael Ley (ley@uni-trier.de)