| 1 | -- | 51 | Dieter van Melkebeek, Thomas Watson. Time-Space Efficient Simulations of Quantum Computations |
| 53 | -- | 54 | Samir Khuller, Sudipto Guha. Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword |
| 55 | -- | 68 | Prabhakar Raghavan. Rajeev Motwani (1962-2009) |
| 69 | -- | 94 | Nikhil Bansal, Ryan Williams. Regularity Lemmas and Combinatorial Algorithms |
| 95 | -- | 119 | Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan. Revenue Submodularity |
| 121 | -- | 164 | Sanjeev Arora, Elad Hazan, Satyen Kale. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications |
| 165 | -- | 195 | Chandra Chekuri, Sungjin Im, Benjamin Moseley. Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor |
| 197 | -- | 208 | Alexander A. Sherstov. The Communication Complexity of Gap Hamming Distance |
| 209 | -- | 229 | Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, Kirk Pruhs. Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule |
| 231 | -- | 238 | Oded Goldreich, Rani Izsak. Monotone Circuits: One-Way Functions versus Pseudorandom Generators |
| 239 | -- | 267 | Venkatesan Guruswami, Yuan Zhou. Tight Bounds on the Approximability of Almost-Satisfiable Horn SAT and Exact Hitting Set |
| 269 | -- | 289 | Siavosh Benabbas, Konstantinos Georgiou, Avner Magen, Madhur Tulsiani. SDP Gaps from Pairwise Independence |
| 291 | -- | 319 | Ben Reichardt, Robert Spalek. Span-Program-Based Quantum Algorithm for Evaluating Formulas |
| 321 | -- | 350 | Sariel Har-Peled, Piotr Indyk, Rajeev Motwani. Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality |
| 351 | -- | 368 | Ashish Goel, Ian Post. One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk |
| 369 | -- | 374 | François Le Gall. Quantum Private Information Retrieval with Sublinear Communication Complexity |
| 375 | -- | 400 | Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang. On the Power of a Unique Quantum Witness |
| 401 | -- | 413 | Julia Chuzhoy, Sanjeev Khanna. 3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design |
| 415 | -- | 428 | Pedro F. Felzenszwalb, Daniel P. Huttenlocher. Distance Transforms of Sampled Functions |
| 429 | -- | 460 | Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala. Budget-Constrained Auctions with Heterogeneous Items |
| 461 | -- | 486 | Roy Kasher, Julia Kempe. Two-Source Extractors Secure Against Quantum Adversaries |
| 487 | -- | 512 | Daniele Micciancio. Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction |
| 513 | -- | 531 | Ishay Haviv, Oded Regev. Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors |
| 533 | -- | 565 | Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan. Solving Packing Integer Programs via Randomized Rounding with Alterations |
| 567 | -- | 595 | Bahman Bahmani, Aranyak Mehta, Rajeev Motwani. Online Graph Edge-Coloring in the Random-Order Arrival Model |
| 597 | -- | 622 | Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar. A Constant-Factor Approximation Algorithm for Co-clustering |
| 623 | -- | 645 | Harry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf. Near-Optimal and Explicit Bell Inequality Violations |