Volume 39, Number 1, 2009
: Narrow Proofs May Be Spacious: Separating Space and Width in Resolution.
: On Maximizing Welfare When Utility Functions Are Subadditive.
: Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources.
Volume 39, Number 2, 2009
: Sparse Algebraic Equations over Finite Fields.
: Combinatorial Construction of Locally Testable Codes.
: Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method.
Volume 39, Number 3, 2009
: On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications.
: Tight Bounds for Randomized and Quantum Local Search.
: Circuit Lower Bounds for Merlin--Arthur Classes.
Volume 39, Number 4, 2009
: Parameterized Approximation Scheme for the Multiple Knapsack Problem.
, Xiaoming Sun
: More Efficient Algorithms for Closest String and Substring Problems.
Volume 39, Number 4, 2010
Volume 39, Number 5, 2010
, Moni Naor
: On the Compressibility of NP Instances and Cryptographic Applications.
Timothy M. Chan
: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs.
Volume 39, Number 6, 2010
, Gagan Goel
: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP.
, Karen Aardal
: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
: On the k Shortest Simple Paths Problem in Weighted Directed Graphs.
: Towards Sharp Inapproximability for Any 2-CSP.
Volume 39, Number 7, 2010
: Approximating Steiner Networks with Node-Weights.
, Kirk Pruhs
: Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service.
Volume 39, Number 8, 2010
, Parikshit Gopalan
: Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence.
Robert M. Hierons
: Reaching and Distinguishing States of Distributed Systems.
: Randomized Self-Assembly for Exact Shapes.
: Extension Preservation Theorems on Classes of Acyclic Finite Structures.