Articles under category:
ToC Library Graduate Surveys 5 (2013) 60 pages
Fast Matrix Multiplication
by Markus Bläser
Vol 12, Article 18 (pp 1-35)
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester
by Cedric Yen-Yu Lin and Han-Hsuan Lin
Vol 12, Article 17 (pp 1-25) [APRX-RND14 Spec Issue]
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion
by Anand Louis and Yury Makarychev
Vol 12, Article 15 (pp 1-29) [APRX-RND14 Spec Issue]
Lowest-Degree $k$-Spanner: Approximation and Hardness
by Eden Chlamtáč and Michael Dinitz
Vol 12, Article 14 (pp 1-14) [APRX-RND15 Spec Issue]
Minimizing Maximum Flow-Time on Related Machines
by Nikhil Bansal and Bouke Cloostermans
Vol 12, Article 7 (pp 1-27)
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
by Swastik Kopparty, Mrinal Kumar, and Michael Saks
Vol 12, Article 6 (pp 1-11) [NOTE]
Simple Proof of Hardness of Feedback Vertex Set
by Venkatesan Guruswami and Euiwoong Lee
Vol 12, Article 2 (pp 1-34)
Lattice Sparsification and the Approximate Closest Vector Problem
by Daniel Dadush and Gábor Kun
Vol 11, Article 16 (pp 403-412) [NOTE]
Quantum Algorithm for Monotonicity Testing on the Hypercube
by Aleksandrs Belovs and Eric Blais
Vol 11, Article 15 (pp 395-401) [NOTE]
Groups with Identical $k$-Profiles
by George Glauberman and Łukasz Grabowski
Vol 11, Article 13 (pp 339-355)
Computing the Partition Function for Cliques in a Graph
by Alexander Barvinok
Vol 11, Article 7 (pp 221-235) [APRX-RND12 Spec Issue]
The Projection Games Conjecture and the NP-Hardness of ln $n$-Approximating Set-Cover
by Dana Moshkovitz
Vol 11, Article 4 (pp 105-147)
Maximizing the Spread of Influence through a Social Network
by David Kempe, Jon Kleinberg, and Éva Tardos
Vol 11, Article 1 (pp 1-34)
The Complexity of Deciding Statistical Properties of Samplable Distributions
by Thomas Watson
Vol 10, Article 18 (pp 465-514)
On Reconstruction and Testing of Read-Once Formulas
by Amir Shpilka and Ilya Volkovich
Vol 10, Article 16 (pp 421-451)
How Many Bits Can a Flock of Birds Compute?
by Bernard Chazelle
Vol 10, Article 13 (pp 341-358) [APRX-RND12 Spec Issue]
Approximation Algorithm for Non-Boolean Max-$k$-CSP
by Konstantin Makarychev and Yury Makarychev
Vol 10, Article 12 (pp 297-339)
Width-Parametrized SAT: Time--Space Tradeoffs
by Eric Allender, Shiteng Chen, Tiancheng Lou, Periklis A. Papakonstantinou, and Bangsheng Tang
Vol 10, Article 11 (pp 257-295)
Efficient Rounding for the Noncommutative Grothendieck Inequality
by Assaf Naor, Oded Regev, and Thomas Vidick
Vol 10, Article 10 (pp 237-256)
Lower Bounds for the Average and Smoothed Number of Pareto-Optima
by Tobias Brunsch, Navin Goyal, Luis Rademacher, and Heiko Röglin
Vol 9, Article 30 (pp 897-945)
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream
by Kai-Min Chung, Michael Mitzenmacher, and Salil Vadhan
Vol 9, Article 19 (pp 617-651)
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
by Uriel Feige, Elchanan Mossel, and Dan Vilenchik
Vol 8, Article 26 (pp 597-622)
A Constant-Factor Approximation Algorithm for Co-clustering
by Aris Anagnostopoulos, Anirban Dasgupta, and Ravi Kumar
Vol 8, Article 25 (pp 567-595) [Motwani Special Issue]
Online Graph Edge-Coloring in the Random-Order Arrival Model
by Bahman Bahmani, Aranyak Mehta, and Rajeev Motwani
Vol 8, Article 24 (pp 533-565)
Solving Packing Integer Programs via Randomized Rounding with Alterations
by Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, and Aravind Srinivasan
Vol 8, Article 20 (pp 429-460) [Motwani Special Issue]
Budget-Constrained Auctions with Heterogeneous Items
by Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, and Kamesh Munagala
Vol 8, Article 19 (pp 415-428)
Distance Transforms of Sampled Functions
by Pedro F. Felzenszwalb and Daniel P. Huttenlocher
Vol 8, Article 18 (pp 401-413) [Motwani Special Issue]
An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
by Julia Chuzhoy and Sanjeev Khanna
Vol 8, Article 15 (pp 351-368) [Motwani Special Issue]
One Tree Suffices: A Simultaneous $O(1)$-Approximation for Single-Sink Buy-at-Bulk
by Ashish Goel and Ian Post
Vol 8, Article 14 (pp 321-350) [Motwani Special Issue]
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
by Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani
Vol 8, Article 9 (pp 209-229) [Motwani Special Issue]
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
by Nikhil Bansal, Ho-Leung Chan, Dmitriy Katz, and Kirk Pruhs
Vol 8, Article 7 (pp 165-195) [Motwani Special Issue]
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor
by Chandra Chekuri, Sungjin Im, and Benjamin Moseley
Vol 8, Article 6 (pp 121-164) [RESEARCH SURVEY]
The Multiplicative Weights Update Method: a Meta-Algorithm and Applications
by Sanjeev Arora, Elad Hazan, and Satyen Kale
Vol 8, Article 4 (pp 69-94) [Motwani Special Issue]
Regularity Lemmas and Combinatorial Algorithms
by Nikhil Bansal and Ryan Williams
Vol 7, Article 5 (pp 49-74)
Metric Clustering via Consistent Labeling
by Robert Krauthgamer and Tim Roughgarden
Vol 7, Article 2 (pp 19-25) [NOTE]
Inverting a Permutation is as Hard as Unordered Search
by Ashwin Nayak
Vol 6, Article 11 (pp 247-290)
The Submodular Welfare Problem with Demand Queries
by Uriel Feige and Jan Vondrák
Vol 6, Article 8 (pp 179-199)
Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games
by Avrim Blum, Eyal Even-Dar, and Katrina Ligett
Vol 6, Article 2 (pp 27-46)
Reordering Buffers for General Metric Spaces
by Matthias Englert, Harald Räcke, and Matthias Westermann
Vol 5, Article 9 (pp 173-189)
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time
by Virginia Vassilevska, Ryan Williams, and Raphael Yuster
Vol 5, Article 4 (pp 83-117)
SDP Gaps and UGC-hardness for Max-Cut-Gain
by Subhash Khot and Ryan O'Donnell
Vol 4, Article 9 (pp 191-193) [COMMENT]
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
by Viswanath Nagarajan
Vol 4, Article 5 (pp 111-128)
Approximation Algorithms for Unique Games
by Luca Trevisan
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 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 3, Article 11 (pp 211-219)
The Randomized Communication Complexity of Set Disjointness
by Johan Håstad and Avi Wigderson
Vol 3, Article 10 (pp 197-209)
An   O(log n)   Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
by Chandra Chekuri and Martin Pál
Vol 3, Article 9 (pp 179-195)
Approximation Algorithms and Online Mechanisms for Item Pricing
by Maria-Florina Balcan and Avrim Blum
Vol 3, Article 8 (pp 159-177)
Removing Degeneracy May Require a Large Dimension Increase
by Jiří Matoušek and Petr Škovroň
Vol 3, Article 1 (pp 1-23)
Censorship Resistant Peer-to-Peer Networks
by Amos Fiat and Jared Saia
Vol 2, Article 13 (pp 249-266)
Correlation Clustering with a Fixed Number of Clusters
by Ioannis Giotis and Venkatesan Guruswami
Vol 2, Article 12 (pp 225-247)
Matrix Approximation and Projective Clustering via Volume Sampling
by Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang
Vol 2, Article 11 (pp 207-224)
Embedding the Ulam metric into 1
by Moses Charikar and Robert Krauthgamer
Vol 2, Article 10 (pp 185-206)
Learning Restricted Models of Arithmetic Circuits
by Adam Klivans and Amir Shpilka
Vol 2, Article 8 (pp 147-172)
On Learning Random DNF Formulas Under the Uniform Distribution
by Jeffrey C. Jackson and Rocco A. Servedio
Vol 2, Article 7 (pp 137-146)
An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow
by Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd
Vol 2, Article 4 (pp 65-90)
Rank Bounds and Integrality Gaps for Cutting Planes Procedures
by Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, and Toniann Pitassi
Vol 2, Article 3 (pp 53-64)
An Improved Approximation Ratio for the Covering Steiner Problem
by Anupam Gupta and Aravind Srinivasan
Vol 2, Article 2 (pp 19-51)
Proving Integrality Gaps without Knowing the Linear Program
by Sanjeev Arora, Béla Bollobás, László Lovász, and Iannis Tourlakis
Vol 1, Article 6 (pp 105-117)
Combining Online Algorithms for Acceptance and Rejection
by Yossi Azar, Avrim Blum, David P. Bunde, and Yishay Mansour