Journal: Theory of Computing

Volume 2, Issue 1

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