Table of Contents

• Approximate Distance Oracles with Improved BoundsShiri Chechik. 1-10 [doi]
• The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner TreeJakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych. 11-20 [doi]
• Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication ConjectureMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak. 21-30 [doi]
• Clustered Integer 3SUM via Additive CombinatoricsTimothy M. Chan, Moshe Lewenstein. 31-40 [doi]
• Matching Triangles and Basing Hardness on an Extremely Popular ConjectureAmir Abboud, Virginia Vassilevska Williams, Huacheng Yu. 41-50 [doi]
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)Arturs Backurs, Piotr Indyk. 51-58 [doi]
• Proof of the Satisfiability Conjecture for Large kJian Ding, Allan Sly, Nike Sun. 59-68 [doi]
• Consistency Thresholds for the Planted Bisection ModelElchanan Mossel, Joe Neeman, Allan Sly. 69-75 [doi]
• On the Complexity of Random Satisfiability Problems with Planted SolutionsVitaly Feldman, Will Perkins, Santosh Vempala. 77-86 [doi]
• Sum-of-squares Lower Bounds for Planted CliqueRaghu Meka, Aaron Potechin, Avi Wigderson. 87-96 [doi]
• Sum of Squares Lower Bounds from Pairwise IndependenceBoaz Barak, Siu On Chan, Pravesh K. Kothari. 97-106 [doi]
• Inapproximability of Combinatorial Problems via Small LPs and SDPsGábor Braun, Sebastian Pokutta, Daniel Zink. 107-116 [doi]
• Preserving Statistical Validity in Adaptive Data AnalysisCynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth. 117-126 [doi]
• Local, Private, Efficient Protocols for Succinct HistogramsRaef Bassily, Adam D. Smith. 127-135 [doi]
• Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse FunctionsShachar Lovett, Jiapeng Zhang. 137-142 [doi]
• Dictionary Learning and Tensor Decomposition via the Sum-of-Squares MethodBoaz Barak, Jonathan A. Kelner, David Steurer. 143-151 [doi]
• Randomized Composable Core-sets for Distributed Submodular MaximizationVahab S. Mirrokni, Morteza Zadimoghaddam. 153-162 [doi]
• Dimensionality Reduction for k-Means Clustering and Low Rank ApproximationMichael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, Madalina Persu. 163-172 [doi]
• Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic StreamsSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis. 173-182 [doi]
• p Row Sampling by Lewis WeightsMichael B. Cohen, Richard Peng. 183-192 [doi]
• On the Lovász Theta function for Independent Sets in Sparse GraphsNikhil Bansal, Anupam Gupta, Guru Guruganesh. 193-200 [doi]
• The Complexity of the Simplex MethodJohn Fearnley, Rahul Savani. 201-208 [doi]
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex AlgorithmThomas Dueholm Hansen, Uri Zwick. 209-218 [doi]
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite GraphsShuchi Chawla, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev. 219-228 [doi]
• Nearly-Linear Time Positive LP Solver with Faster Convergence RateZeyuan Allen Zhu, Lorenzo Orecchia. 229-236 [doi]
• Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative UpdatesZeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia. 237-245 [doi]
• Almost Optimal Pseudorandom Generators for Spherical Caps: Extended AbstractPravesh K. Kothari, Raghu Meka. 247-256 [doi]
• Rectangles Are Nonnegative JuntasMika Göös, Shachar Lovett, Raghu Meka, Thomas Watson 0001, David Zuckerman. 257-266 [doi]
• Polynomially Low Error PCPs with polyloglog n Queries via Modular CompositionIrit Dinur, Prahladh Harsha, Guy Kindler. 267-276 [doi]
• The List Decoding Radius of Reed-Muller Codes over Small FieldsAbhishek Bhowmick 0001, Shachar Lovett. 277-285 [doi]
• A Characterization of the Capacity of Online (causal) Binary ChannelsZitan Chen, Sidharth Jaggi, Michael Langberg. 287-296 [doi]
• Reed-Muller Codes for Random Erasures and ErrorsEmmanuel Abbe, Amir Shpilka, Avi Wigderson. 297-306 [doi]
• Forrelation: A Problem that Optimally Separates Quantum from Classical ComputingScott Aaronson, Andris Ambainis. 307-316 [doi]
• Quantum Information ComplexityDave Touchette. 317-326 [doi]
• Sparse Quantum Codes from Quantum CircuitsDave Bacon, Steven T. Flammia, Aram Wettroth Harrow, Jonathan Shi. 327-334 [doi]
• Small Value Parallel Repetition for General GamesMark Braverman, Ankit Garg. 335-340 [doi]
• An Interactive Information Odometer and ApplicationsMark Braverman, Omri Weinstein. 341-350 [doi]
• The communication complexity of interleaved group productsTimothy Gowers, Emanuele Viola. 351-360 [doi]
• Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's TheoremSiddharth Barman. 361-369 [doi]
• Approximating the Nash Social Welfare with Indivisible ItemsRichard Cole 0001, Vasilis Gkatzelis. 371-380 [doi]
• On the Complexity of Nash Equilibria in Anonymous GamesXi Chen, David Durfee, Anthi Orfanou. 381-390 [doi]
• Hardness of Graph Pricing Through Generalized Max-DicutEuiwoong Lee. 391-399 [doi]
• Inapproximability of Truthful Mechanisms via Generalizations of the VC DimensionAmit Daniely, Michael Schapira, Gal Shahaf. 401-408 [doi]
• Inapproximability of Nash EquilibriumAviad Rubinstein. 409-418 [doi]
• Indistinguishability Obfuscation for Turing Machines with Unbounded MemoryVenkata Koppula, Allison Bishop Lewko, Brent Waters. 419-428 [doi]
• Succinct Garbling and Indistinguishability Obfuscation for RAM ProgramsRan Canetti, Justin Holmgren, Abhishek Jain 0002, Vinod Vaikuntanathan. 429-437 [doi]
• Succinct Randomized Encodings and their ApplicationsNir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang. 439-448 [doi]
• Garbled RAM From One-Way FunctionsSanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro. 449-458 [doi]
• Non-malleable Reductions and ApplicationsDivesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski. 459-468 [doi]
• Leveled Fully Homomorphic Signatures from Standard LatticesSergey Gorbunov, Vinod Vaikuntanathan, Daniel Wichs. 469-477 [doi]
• Sketching and Embedding are Equivalent for NormsAlexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn. 479-488 [doi]
• Prioritized Metric Structures and EmbeddingMichael Elkin, Arnold Filtser, Ofer Neiman. 489-498 [doi]
• Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean SpaceJean Bourgain, Sjoerd Dirksen, Jelani Nelson. 499-508 [doi]
• A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower BoundsAmirali Abdullah, Suresh Venkatasubramanian. 509-518 [doi]
• Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive QueriesXi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan. 519-528 [doi]
• Quantum Spectrum TestingRyan O'Donnell, John Wright. 529-538 [doi]
• Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume AlgorithmBenjamin Cousins, Santosh Vempala. 539-548 [doi]
• FPTAS for #BIS with Degree Bounds on One SideJingcheng Liu, Pinyan Lu. 549-556 [doi]
• Exponential Separation of Information and Communication for Boolean FunctionsAnat Ganor, Gillat Kol, Ran Raz. 557-566 [doi]
• Lower Bounds on the Size of Semidefinite Programming RelaxationsJames R. Lee, Prasad Raghavendra, David Steurer. 567-576 [doi]
• 2-Server PIR with Sub-Polynomial CommunicationZeev Dvir, Sivakanth Gopi. 577-584 [doi]
• Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd MethodAndris Ambainis, Yuval Filmus, François Le Gall. 585-593 [doi]
• High Parallel Complexity Graphs and Memory-Hard FunctionsJoël Alwen, Vladimir Serbinenko. 595-603 [doi]
• Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial ComplexityIttai Abraham, Danny Dolev. 605-614 [doi]
• Test-and-Set in Optimal SpaceGeorge Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel. 615-623 [doi]
• Adjacency Labeling Schemes and Induced-Universal GraphsStephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick. 625-634 [doi]
• How Well Can Graphs Represent Wireless Interference?Magnús M. Halldórsson, Tigran Tonoyan. 635-644 [doi]
• Excluded Grid Theorem: Improved and SimplifiedJulia Chuzhoy. 645-654 [doi]
• The Directed Grid TheoremKen-ichi Kawarabayashi, Stephan Kreutzer. 655-664 [doi]
• Deterministic Global Minimum Cut of a Simple Graph in Near-Linear TimeKen-ichi Kawarabayashi, Mikkel Thorup. 665-674 [doi]
• Beyond the Euler Characteristic: Approximating the Genus of General GraphsKen-ichi Kawarabayashi, Anastasios Sidiropoulos. 675-682 [doi]
• Computing with TanglesMartin Grohe, Pascal Schweitzer. 683-692 [doi]
• Faster Canonical Forms for Primitive Coherent Configurations: Extended AbstractXiaorui Sun, John Wilmes. 693-702 [doi]
• Random Permutations using Switching NetworksArtur Czumaj. 703-712 [doi]
• Hypergraph Markov Operators, Eigenvalues and Approximation AlgorithmsAnand Louis. 713-722 [doi]
• Testing Cluster Structure of GraphsArtur Czumaj, Pan Peng, Christian Sohler. 723-732 [doi]
• n Time Using Discrete Gaussian Sampling: Extended AbstractDivesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz. 733-742 [doi]
• Learning Arbitrary Statistical Mixtures of Discrete DistributionsJian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy. 743-752 [doi]
• Tight Bounds for Learning a Mixture of Two GaussiansMoritz Hardt, Eric Price. 753-760 [doi]
• Learning Mixtures of Gaussians in High DimensionsRong Ge, Qingqing Huang, Sham M. Kakade. 761-770 [doi]
• Efficiently Learning Ising Models on Arbitrary GraphsGuy Bresler. 771-782 [doi]
• Approximate k-flat Nearest Neighbor SearchWolfgang Mulzer, Huy L. Nguyên, Paul Seiferth, Yannik Stein. 783-792 [doi]
• Optimal Data-Dependent Hashing for Approximate Near NeighborsAlexandr Andoni, Ilya Razenshteyn. 793-801 [doi]
• Time Lower Bounds for Nonadaptive Turnstile Streaming AlgorithmsKasper Green Larsen, Jelani Nelson, Huy L. Nguyên. 803-812 [doi]
• From Independence to Expansion and Back AgainTobias Christiani, Rasmus Pagh, Mikkel Thorup. 813-820 [doi]
• Super-resolution, Extremal Functions and the Condition Number of Vandermonde MatricesAnkur Moitra. 821-830 [doi]
• Analysis of a Classical Matrix Preconditioning AlgorithmLeonard J. Schulman, Alistair Sinclair. 831-840 [doi]
• A Polynomial-time Bicriteria Approximation Scheme for Planar BisectionKyle Fox, Philip N. Klein, Shay Mozes. 841-850 [doi]
• Minimizing Flow-Time on Unrelated MachinesNikhil Bansal, Janardhan Kulkarni. 851-860 [doi]
• Randomized Rounding for the Largest Simplex ProblemAleksandar Nikolov. 861-870 [doi]
• Greedy Algorithms for Steiner ForestAnupam Gupta, Amit Kumar 0001. 871-878 [doi]
• Secretary Problems with Non-Uniform Arrival OrderThomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh. 879-888 [doi]
• Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random OrderNitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam. 889-898 [doi]