Abstract is missing.
- Constructive Algorithms for Discrepancy MinimizationNikhil Bansal. 3-10 [doi]
- Bounded Independence Fools Degree-2 Threshold FunctionsIlias Diakonikolas, Daniel M. Kane, Jelani Nelson. 11-20 [doi]
- From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 CircuitsNitin Saxena, C. Seshadhri. 21-29 [doi]
- The Coin Problem and Pseudorandomness for Branching ProgramsJoshua Brody, Elad Verbin. 30-39 [doi]
- Pseudorandom Generators for Regular Branching ProgramsMark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff. 40-47 [doi]
- Boosting and Differential PrivacyCynthia Dwork, Guy N. Rothblum, Salil P. Vadhan. 51-60 [doi]
- A Multiplicative Weights Mechanism for Privacy-Preserving Data AnalysisMoritz Hardt, Guy N. Rothblum. 61-70 [doi]
- Impossibility of Differentially Private Universally Optimal MechanismsHai Brenner, Kobbi Nissim. 71-80 [doi]
- The Limits of Two-Party Differential PrivacyAndrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan. 81-90 [doi]
- Settling the Polynomial Learnability of Mixtures of GaussiansAnkur Moitra, Gregory Valiant. 93-102 [doi]
- Polynomial Learning of Distribution FamiliesMikhail Belkin, Kaushik Sinha. 103-112 [doi]
- Agnostically Learning under Permutation Invariant DistributionsKarl Wimmer. 113-122 [doi]
- Corrigendum: A Random Sampling Algorithm for Learning an Intersection of HalfspacesSantosh Vempala. 123 [doi]
- Learning Convex Concepts from Gaussian Distributions with PCASantosh Vempala. 124-130 [doi]
- Deciding First-Order Properties for Sparse GraphsZdenek Dvorak, Daniel Král, Robin Thomas. 133-142 [doi]
- Logspace Versions of the Theorems of Bodlaender and CourcelleMichael Elberfeld, Andreas Jakoby, Till Tantau. 143-152 [doi]
- A Separator Theorem in Minor-Closed ClassesKen-ichi Kawarabayashi, Bruce A. Reed. 153-162 [doi]
- Optimal Stochastic PlanarizationAnastasios Sidiropoulos. 163-170 [doi]
- Determinant Sums for Undirected HamiltonicityAndreas Björklund. 173-182 [doi]
- Fighting Perebor: New and Improved Algorithms for Formula and QBF SatisfiabilityRahul Santhanam. 183-192 [doi]
- The Monotone Complexity of k-clique on Random GraphsBenjamin Rossman. 193-201 [doi]
- The Complexity of DistributionsEmanuele Viola. 202-211 [doi]
- Hardness of Finding Independent Sets in Almost 3-Colorable GraphsIrit Dinur, Subhash Khot, Will Perkins, Muli Safra. 212-221 [doi]
- Approaching Optimality for Solving SDD Linear SystemsIoannis Koutis, Gary L. Miller, Richard Peng. 235-244 [doi]
- Fast Approximation Algorithms for Cut-Based Problems in Undirected GraphsAleksander Madry. 245-254 [doi]
- Metric Extension Operators, Vertex Sparsifiers and Lipschitz ExtendabilityKonstantin Makarychev, Yury Makarychev. 255-264 [doi]
- Vertex Sparsifiers and Abstract Rounding AlgorithmsMoses Charikar, Tom Leighton, Shi Li, Ankur Moitra. 265-274 [doi]
- Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke DecompositionsMatthew Andrews. 277-286 [doi]
- Computational Transition at the Uniqueness ThresholdAllan Sly. 287-296 [doi]
- Clustering with Spectral Norm and the k-Means AlgorithmAmit Kumar, Ravindran Kannan. 299-308 [doi]
- Stability Yields a PTAS for k-Median and k-Means ClusteringPranjal Awasthi, Avrim Blum, Or Sheffet. 309-318 [doi]
- The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite TheoremMarcus Isaksson, Guy Kindler, Elchanan Mossel. 319-328 [doi]
- Efficient Volume Sampling for Row/Column Subset SelectionAmit Deshpande, Luis Rademacher. 329-338 [doi]
- The Sub-exponential Upper Bound for On-Line Chain PartitioningBartlomiej Bosek, Tomasz Krawczyk. 347-354 [doi]
- On the Queue Number of Planar GraphsGiuseppe Di Battista, Fabrizio Frati, János Pach. 365-374 [doi]
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query ComplexityAlexandr Andoni, Robert Krauthgamer, Krzysztof Onak. 377-386 [doi]
- Information Cost Tradeoffs for Augmented Index and Streaming Language RecognitionAmit Chakrabarti, Graham Cormode, Ranganath Kondapally, Andrew McGregor. 387-396 [doi]
- New Constructive Aspects of the Lovasz Local LemmaBernhard Haeupler, Barna Saha, Aravind Srinivasan. 397-406 [doi]
- The Geometry of SchedulingNikhil Bansal, Kirk Pruhs. 407-414 [doi]
- Strong Fault-Tolerance for Self-Assembly with Fuzzy TemperatureDavid Doty, Matthew J. Patitz, Dustin Reishus, Robert T. Schweller, Scott M. Summers. 417-426 [doi]
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSPJin-yi Cai, Pinyan Lu, Mingji Xia. 427-436 [doi]
- A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative WeightsJin-yi Cai, Xi Chen. 437-446 [doi]
- Sublinear Optimization for Machine LearningKenneth L. Clarkson, Elad Hazan, David P. Woodruff. 449-457 [doi]
- Estimating the Longest Increasing Sequence in Polylogarithmic TimeMichael Saks, C. Seshadhri. 458-467 [doi]
- Testing Properties of Sparse ImagesGilad Tsur, Dana Ron. 468-477 [doi]
- A Unified Framework for Testing Linear-Invariant PropertiesArnab Bhattacharyya, Elena Grigorescu, Asaf Shapira. 478-487 [doi]
- Optimal Testing of Reed-Muller CodesArnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, David Zuckerman. 488-497 [doi]
- Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory LeakageZvika Brakerski, Yael Tauman Kalai, Jonathan Katz, Vinod Vaikuntanathan. 501-510 [doi]
- Cryptography against Continuous Memory AttacksYevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs. 511-520 [doi]
- On the Insecurity of Parallel Repetition for Leakage ResilienceAllison B. Lewko, Brent Waters. 521-530 [doi]
- Black-Box, Round-Efficient Secure Computation via Non-malleability AmplificationHoeteck Wee. 531-540 [doi]
- Adaptive Hardness and Composable Security in the Plain Model from Standard AssumptionsRan Canetti, Huijia Lin, Rafael Pass. 541-550 [doi]
- Bounds on Monotone Switching Networks for Directed ConnectivityAaron Potechin. 553-562 [doi]
- Subexponential Algorithms for Unique Games and Related ProblemsSanjeev Arora, Boaz Barak, David Steurer. 563-572 [doi]
- Dependent Randomized Rounding via Exchange Properties of Combinatorial StructuresChandra Chekuri, Jan Vondrák, Rico Zenklusen. 575-584 [doi]
- Minimum-Cost Network Design with (Dis)economies of ScaleMatthew Andrews, Spyridon Antonakopoulos, Lisa Zhang. 585-592 [doi]
- One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-BulkAshish Goel, Ian Post. 593-600 [doi]
- Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing TimeGlencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen. 601-610 [doi]
- On the Computational Complexity of Coin FlippingHemanta K. Maji, Manoj Prabhakaran, Amit Sahai. 613-622 [doi]
- Sequential Rationality in Cryptographic ProtocolsRonen Gradwohl, Noam Livne, Alon Rosen. 623-632 [doi]
- An Efficient Test for Product States with Applications to Quantum Merlin-Arthur GamesAram Wettroth Harrow, Ashley Montanaro. 633-642 [doi]
- Subcubic Equivalences between Path, Matrix and Triangle ProblemsVirginia Vassilevska Williams, Ryan Williams. 645-654 [doi]
- Replacement Paths via Fast Matrix MultiplicationOren Weimann, Raphael Yuster. 655-662 [doi]
- All-Pairs Shortest Paths in O(n:::2:::) Time with High ProbabilityYuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick. 663-672 [doi]
- Approximating Maximum Weight Matching in Near-Linear TimeRan Duan, Seth Pettie. 673-682 [doi]
- Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite FieldsShachar Lovett, Partha Mukhopadhyay, Amir Shpilka. 695-704 [doi]
- Matching Vector CodesZeev Dvir, Parikshit Gopalan, Sergey Yekhanin. 705-714 [doi]
- Local List Decoding with a Constant Number of QueriesAvraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma. 715-722 [doi]
- Codes for Computationally Simple Channels: Explicit Constructions with Optimal RateVenkatesan Guruswami, Adam Smith. 723-732 [doi]
- Pure and Bayes-Nash Price of Anarchy for Generalized Second Price AuctionRenato Paes Leme, Éva Tardos. 735-744 [doi]
- Frugal and Truthful Auctions for Vertex Covers, Flows and CutsDavid Kempe, Mahyar Salek, Cristopher Moore. 745-754 [doi]
- Frugal Mechanism Design via Spectral TechniquesNing Chen, Edith Elkind, Nick Gravin, Fedor Petrov. 755-764 [doi]
- Budget Feasible MechanismsYaron Singer. 765-774 [doi]
- Black-Box Randomized Reductions in Algorithmic Mechanism DesignShaddin Dughmi, Tim Roughgarden. 775-784 [doi]
- Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct RepresentationYuriy Arbitman, Moni Naor, Gil Segev. 787-796 [doi]
- A Lower Bound for Dynamic Approximate Membership Data StructuresShachar Lovett, Ely Porat. 797-804 [doi]
- Lower Bounds on Near Neighbor Search via Metric ExpansionRina Panigrahy, Kunal Talwar, Udi Wieder. 805-814 [doi]
- Distance Oracles beyond the Thorup-Zwick BoundMihai Patrascu, Liam Roditty. 815-823 [doi]