Abstract is missing.
- Learning Topic Models - Going beyond SVDSanjeev Arora, Rong Ge, Ankur Moitra. 1-10 [doi]
- Finding Correlations in Subquadratic Time, with Applications to Learning Parities and JuntasGregory Valiant. 11-20 [doi]
- Active Property TestingMaria-Florina Balcan, Eric Blais, Avrim Blum, Liu Yang. 21-30 [doi]
- How to Compute in the Presence of LeakageShafi Goldwasser, Guy N. Rothblum. 31-40 [doi]
- Positive Results for Concurrently Secure Computation in the Plain ModelVipul Goyal. 41-50 [doi]
- Constructing Non-malleable Commitments: A Black-Box ApproachVipul Goyal, Chen-Kuei Lee, Rafail Ostrovsky, Ivan Visconti. 51-60 [doi]
- Constructive Discrepancy Minimization by Walking on the EdgesShachar Lovett, Raghu Meka. 61-67 [doi]
- Combinatorial Coloring of 3-Colorable GraphsKen-ichi Kawarabayashi, Mikkel Thorup. 68-75 [doi]
- A Permanent Approach to the Traveling Salesman ProblemNisheeth K. Vishnoi. 76-80 [doi]
- Split and Join: Strong Partitions and Universal Steiner Trees for GraphsCostas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srinivasagopalan Srivathsan. 81-90 [doi]
- A Structure Theorem for Poorly Anticoncentrated Gaussian Chaoses and Applications to the Study of Polynomial Threshold FunctionsDaniel M. Kane. 91-100 [doi]
- Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-CircuitsChris Beck, Russell Impagliazzo, Shachar Lovett. 101-110 [doi]
- Pseudorandomness from ShrinkageRussell Impagliazzo, Raghu Meka, David Zuckerman. 111-119 [doi]
- Better Pseudorandom Generators from Milder Pseudorandom RestrictionsParikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan. 120-129 [doi]
- Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare MaximizationYang Cai, Constantinos Daskalakis, S. Matthew Weinberg. 130-139 [doi]
- The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly OptimalZhiyi Huang 0002, Sampath Kannan. 140-149 [doi]
- Concave Generalized Flows with Applications to Market EquilibriaLászló A. Végh. 150-159 [doi]
- Efficient Interactive Coding against Adversarial NoiseZvika Brakerski, Yael Tauman Kalai. 160-166 [doi]
- A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication ComplexityRahul Jain, Attila Pereszlényi, Penghui Yao. 167-176 [doi]
- An Additive Combinatorics Approach Relating Rank to Communication ComplexityEli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi. 177-186 [doi]
- Approximating the Expansion Profile and Almost Optimal Local Graph ClusteringShayan Oveis Gharan, Luca Trevisan. 187-196 [doi]
- Faster SDP Hierarchy Solvers for Local Rounding AlgorithmsVenkatesan Guruswami, Ali Kemal Sinop. 197-206 [doi]
- Learning-Graph-Based Quantum Algorithm for k-DistinctnessAleksandrs Belovs. 207-216 [doi]
- A PTAS for Computing the Supremum of Gaussian ProcessesRaghu Meka. 217-222 [doi]
- From the Impossibility of Obfuscation to a New Non-Black-Box Simulation TechniqueNir Bitansky, Omer Paneth. 223-232 [doi]
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2Julia Chuzhoy, Shi Li. 233-242 [doi]
- A Multi-prover Interactive Proof for NEXP Sound against Entangled ProversTsuyoshi Ito, Thomas Vidick. 243-252 [doi]
- Beck's Three Permutations Conjecture: A Counterexample and Some ConsequencesAlantha Newman, Ofer Neiman, Aleksandar Nikolov. 253-262 [doi]
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network DesignTakuro Fukunaga, R. Ravi. 263-272 [doi]
- LP Rounding for k-Centers with Non-uniform Hard CapacitiesMarek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller. 273-282 [doi]
- On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered ListTsvi Kopelowitz. 283-292 [doi]
- Higher Cell Probe Lower Bounds for Evaluating PolynomialsKasper Green Larsen. 293-301 [doi]
- The Tile Assembly Model is Intrinsically UniversalDavid Doty, Jack H. Lutz, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Damien Woods. 302-310 [doi]
- The Dynamics of Influence SystemsBernard Chazelle. 311-320 [doi]
- The Locality of Distributed Symmetry BreakingLeonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider. 321-330 [doi]
- How to Allocate Tasks AsynchronouslyDan Alistarh, Michael A. Bender, Seth Gilbert, Rachid Guerraoui. 331-340 [doi]
- Tight Bounds for Randomized Load Balancing on Arbitrary Network TopologiesThomas Sauerwald, He Sun 0001. 341-350 [doi]
- On the Complexity of Finding Narrow ProofsChristoph Berkholz. 351-360 [doi]
- The Computational Hardness of Counting in Two-Spin Models on d-Regular GraphsAllan Sly, Nike Sun. 361-369 [doi]
- Making the Long Code ShorterBoaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer. 370-379 [doi]
- Hardness of Finding Independent Sets in Almost q-Colorable GraphsSubhash Khot, Rishi Saket. 380-389 [doi]
- Population Recovery and Partial IdentificationAvi Wigderson, Amir Yehudayoff. 390-399 [doi]
- The Privacy of the Analyst and the Power of the StateCynthia Dwork, Moni Naor, Salil P. Vadhan. 400-409 [doi]
- The Johnson-Lindenstrauss Transform Itself Preserves Differential PrivacyJeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet. 410-419 [doi]
- On Range Searching with Semialgebraic Sets IIPankaj K. Agarwal, Jirí Matousek, Micha Sharir. 420-429 [doi]
- Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear SpaceSariel Har-Peled, Nirman Kumar. 430-439 [doi]
- On the Homotopy Test on SurfacesFrancis Lazarus, Julien Rivaud. 440-449 [doi]
- Representative Sets and Irrelevant Vertices: New Tools for KernelizationStefan Kratsch, Magnus Wahlström. 450-459 [doi]
- Designing FPT Algorithms for Cut Problems Using Randomized ContractionsRajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk. 460-469 [doi]
- Planar F-Deletion: Approximation, Kernelization and Optimal FPT AlgorithmsFedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh. 470-479 [doi]
- Approximation Limits of Linear Programs (Beyond Hierarchies)Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer. 480-489 [doi]
- Formulas Resilient to Short-Circuit ErrorsYael Tauman Kalai, Allison B. Lewko, Anup Rao. 490-499 [doi]
- Lower Bounds on Information Complexity via Zero-Communication Protocols and ApplicationsIordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao. 500-509 [doi]
- Rarity for SemimeasuresLeonid A. Levin. 510-513 [doi]
- Faster Algorithms for Rectangular Matrix MultiplicationFrançois Le Gall. 514-523 [doi]
- Quasi-optimal Multiplication of Linear Differential OperatorsAlexandre Benoit, Alin Bostan, Joris van der Hoeven. 524-530 [doi]
- Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and MatchingsMarek Cygan, Harold N. Gabow, Piotr Sankowski. 531-540 [doi]
- Almost Optimal Canonical Property Testers for SatisfiabilityChristian Sohler. 541-550 [doi]
- Partially Symmetric Functions Are Efficiently Isomorphism-TestableEric Blais, Amit Weinstein, Yuichi Yoshida. 551-560 [doi]
- Sparse Affine-Invariant Linear Codes Are Locally TestableEli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan. 561-570 [doi]
- The Cutting Plane Method Is Polynomial for Perfect MatchingsKarthekeyan Chandrasekaran, László A. Végh, Santosh Vempala. 571-580 [doi]
- A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite GraphsLyle Ramshaw, Robert Endre Tarjan. 581-590 [doi]
- A New Direction for Counting Perfect MatchingsTaisuke Izumi, Tadashi Wadayama. 591-598 [doi]
- Single Source - All Sinks Max Flows in Planar DigraphsJakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen. 599-608 [doi]
- New Limits to Classical and Quantum Instance CompressionAndrew Drucker. 609-618 [doi]
- Lower Bounds on Interactive Compressibility by Constant-Depth CircuitsArkadev Chattopadhyay, Rahul Santhanam. 619-628 [doi]
- Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization LemmaKetan Mulmuley. 629-638 [doi]
- Computing Multiplicities of Lie Group RepresentationsMatthias Christandl, Brent Doran, Michael Walter. 639-648 [doi]
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular MaximizationNiv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz. 649-658 [doi]
- A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid ConstraintYuval Filmus, Justin Ward. 659-668 [doi]
- The Power of Linear Programming for Valued CSPsJohan Thapper, Stanislav Zivny. 669-678 [doi]
- How to Construct Quantum Random FunctionsMark Zhandry. 679-687 [doi]
- Non-malleable Extractors, Two-Source Extractors and Privacy AmplificationXin Li. 688-697 [doi]
- Constructing a Pseudorandom Generator Requires an Almost Linear Number of CallsThomas Holenstein, Makrand Sinha. 698-707 [doi]
- Randomized Greedy Algorithms for the Maximum Matching Problem with New AnalysisMatthias Poloczek, Mario Szegedy. 708-717 [doi]
- Matching with Our Eyes ClosedGagan Goel, Pushkar Tripathi. 718-727 [doi]
- Online Matching with Stochastic RewardsAranyak Mehta, Debmalya Panigrahi. 728-737 [doi]
- A New Infinity of Distance Oracles for Sparse GraphsMihai Patrascu, Liam Roditty, Mikkel Thorup. 738-747 [doi]
- Improved Distance Sensitivity Oracles via Fast Single-Source Replacement PathsFabrizio Grandoni, Virginia Vassilevska Williams. 748-757 [doi]
- Everywhere-Sparse Spanners via Dense SubgraphsEden Chlamtac, Michael Dinitz, Robert Krauthgamer. 758-767 [doi]