Abstract is missing.
- Approximating ATSP by Relaxing ConnectivityOla Svensson. 1-19 [doi]
- Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSPNima Anari, Shayan Oveis Gharan. 20-39 [doi]
- Compressing and Teaching for Low VC-DimensionShay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff. 40-51 [doi]
- On Monotonicity Testing and Boolean Isoperimetric Type TheoremsSubhash Khot, Dor Minzer, Muli Safra. 52-58 [doi]
- Tight Hardness Results for LCS and Other Sequence Similarity MeasuresAmir Abboud, Arturs Backurs, Virginia Vassilevska Williams. 59-78 [doi]
- Quadratic Conditional Lower Bounds for String Problems and Dynamic Time WarpingKarl Bringmann, Marvin Künnemann. 79-97 [doi]
- If the Current Clique Algorithms are Optimal, So is Valiant's ParserAmir Abboud, Arturs Backurs, Virginia Vassilevska Williams. 98-117 [doi]
- Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph ProblemsBarna Saha. 118-135 [doi]
- Probabilistic Polynomials and Hamming Nearest NeighborsJosh Alman, Ryan Williams. 136-150 [doi]
- Indistinguishability Obfuscation from the Multilinear Subgroup Elimination AssumptionCraig Gentry, Allison Bishop Lewko, Amit Sahai, Brent Waters. 151-170 [doi]
- Indistinguishability Obfuscation from Functional EncryptionNir Bitansky, Vinod Vaikuntanathan. 171-190 [doi]
- Limits on the Power of Indistinguishability Obfuscation and Functional EncryptionGilad Asharov, Gil Segev. 191-209 [doi]
- Black-Box Garbled RAMSanjam Garg, Steve Lu, Rafail Ostrovsky. 210-229 [doi]
- Efficient Inverse Maintenance and Faster Algorithms for Linear ProgrammingYin Tat Lee, Aaron Sidford. 230-249 [doi]
- Constructing Linear-Sized Spectral Sparsification in Almost-Linear TimeYin Tat Lee, He Sun. 250-269 [doi]
- Guaranteed Matrix Completion via Nonconvex FactorizationRuoyu Sun, Zhi-Quan Luo. 270-289 [doi]
- Heavy-Tailed Independent Component AnalysisJoseph Anderson, Navin Goyal, Anupama Nandi, Luis Rademacher. 290-309 [doi]
- Input Sparsity and Hardness for Robust Subspace ApproximationKenneth L. Clarkson, David P. Woodruff. 310-329 [doi]
- The Minimum Principle of SINR: A Useful Discretization Tool for Wireless CommunicationErez Kantor, Zvi Lotker, Merav Parter, David Peleg. 330-349 [doi]
- Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer NetworksJohn Augustine, Gopal Pandurangan, Peter Robinson 0002, Scott T. Roche, Eli Upfal. 350-369 [doi]
- Planar Reachability in Linear Space and Constant TimeJacob Holm, Eva Rotenberg, Mikkel Thorup. 370-389 [doi]
- Towards an Optimal Method for Dynamic Planar Point LocationTimothy M. Chan, Yakov Nekrich. 390-409 [doi]
- Pattern-Avoiding Access in Binary Search TreesParinya Chalermsook, Mayank Goswami, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak. 410-423 [doi]
- The Average Sensitivity of Bounded-Depth FormulasBenjamin Rossman. 424-430 [doi]
- The Power of Asymmetry in Constant-Depth CircuitsAlexander A. Sherstov. 431-450 [doi]
- Deterministic Divisibility Testing via Shifted Partial DerivativesMichael A. Forbes. 451-465 [doi]
- Hardness of Approximation in PSPACE and Separation Results for Pebble GamesSiu Man Chan, Massimo Lauria, Jakob Nordström, Marc Vinyals. 466-485 [doi]
- The Submodular Secretary Problem Goes LinearMoran Feldman, Rico Zenklusen. 486-505 [doi]
- Competitive Flow Time Algorithms for Polyhedral SchedulingSungjin Im, Janardhan Kulkarni, Kamesh Munagala. 506-524 [doi]
- Tight Bounds for Online Vector SchedulingSungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi. 525-544 [doi]
- Online Buy-at-Bulk Network DesignAlina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi. 545-562 [doi]
- Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again!Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz. 563-582 [doi]
- A Robust Sparse Fourier Transform in the Continuous SettingEric Price, Zhao Song. 583-600 [doi]
- Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per AlignmentTsvi Kopelowitz, Ely Porat. 601-613 [doi]
- Approximately Counting Triangles in Sublinear TimeTalya Eden, Amit Levi, Dana Ron, C. Seshadhri. 614-633 [doi]
- Differentially Private Release and Learning of Threshold FunctionsMark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan. 634-649 [doi]
- Robust Traceability from Trace AmountsCynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan Ullman, Salil P. Vadhan. 650-669 [doi]
- Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for RecoveryEmmanuel Abbe, Colin Sandon. 670-688 [doi]
- How to Refute a Random CSPSarah R. Allen, Ryan O'Donnell, David Witmer. 689-708 [doi]
- An O(1)-Approximation for Minimum Spanning Tree InterdictionRico Zenklusen. 709-728 [doi]
- Reality Distortion: Exact and Approximate Algorithms for Embedding into the LineAmir Nayyeri, Benjamin Raichel. 729-747 [doi]
- Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow ProblemF. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong. 748-758 [doi]
- A Light Metric SpannerLee-Ad Gottlieb. 759-772 [doi]
- Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of DisjointnessMark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette. 773-791 [doi]
- Hamiltonian Simulation with Nearly Optimal Dependence on all ParametersDominic W. Berry, Andrew M. Childs, Robin Kothari. 792-809 [doi]
- Quantum Expander CodesAnthony Leverrier, Jean-Pierre Tillich, Gilles Zémor. 810-824 [doi]
- Robust Testing of Lifted Codes with Applications to Low-Degree TestingAlan Guo, Elad Haramaty, Madhu Sudan. 825-844 [doi]
- Local Correlation Breakers and Applications to Three-Source Extractors and MergersGil Cohen. 845-862 [doi]
- Three-Source Extractors for Polylogarithmic Min-EntropyXin Li. 863-882 [doi]
- Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial SumsAnindya De. 883-902 [doi]
- Pseudorandomness via the Discrete Fourier TransformParikshit Gopalan, Daniek Kane, Raghu Meka. 903-922 [doi]
- Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS FunctionsVitaly Feldman, Jan Vondrák. 923-942 [doi]
- Equivalence of Deterministic Top-Down Tree-to-String Transducers is DecidableHelmut Seidl, Sebastian Maneth, Gregor Kemper. 943-962 [doi]
- FO Model Checking on Posets of Bounded WidthJakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh. 963-974 [doi]
- Satisfiability of Ordering CSPs above Average is Fixed-Parameter TractableKonstantin Makarychev, Yury Makarychev, Yuan Zhou. 975-993 [doi]
- Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2kRadu Curticapean, Mingji Xia. 994-1009 [doi]
- Isomorphism Testing for Graphs of Bounded Rank WidthMartin Grohe, Pascal Schweitzer. 1010-1029 [doi]
- An Average-Case Depth Hierarchy Theorem for Boolean CircuitsBenjamin Rossman, Rocco A. Servedio, Li-Yang Tan. 1030-1048 [doi]
- A Faster Cutting Plane Method and its Implications for Combinatorial and Convex OptimizationYin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong. 1049-1065 [doi]
- Lower Bounds for Clique vs. Independent SetMika Göös. 1066-1076 [doi]
- Deterministic Communication vs. Partition NumberMika Göös, Toniann Pitassi, Thomas Watson 0001. 1077-1088 [doi]
- New Unconditional Hardness Results for Dynamic and Online ProblemsRaphaël Clifford, Allan Grønlund, Kasper Green Larsen. 1089-1107 [doi]
- Tight Hardness of the Non-commutative Grothendieck ProblemJop Briët, Oded Regev, Rishi Saket. 1108-1122 [doi]
- No Small Linear Program Approximates Vertex Cover within a Factor 2 - eAbbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson. 1123-1142 [doi]
- Approximate ModularityFlavio Chierichetti, Abhimanyu Das, Anirban Dasgupta 0001, Ravi Kumar. 1143-1162 [doi]
- Trading Query Complexity for Sample-Based Testing and Multi-testing ScalabilityEldar Fischer, Oded Lachish, Yadu Vasudev. 1163-1182 [doi]
- Optimal Algorithms and Lower Bounds for Testing Closeness of Structured DistributionsIlias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin. 1183-1202 [doi]
- On the Structure, Covering, and Learning of Poisson Multinomial DistributionsConstantinos Daskalakis, Gautam Kamath, Christos Tzamos. 1203-1217 [doi]
- Uniform Generation of Random Regular GraphsPu Gao, Nicholas C. Wormald. 1218-1230 [doi]
- Symbolic Integration and the Complexity of Computing AveragesLeonard J. Schulman, Alistair Sinclair, Piyush Srivastava. 1231-1245 [doi]
- The Complexity of General-Valued CSPsVladimir Kolmogorov, Andrei A. Krokhin, Michal Rolinek. 1246-1258 [doi]
- A Holant Dichotomy: Is the FKT Algorithm Universal?Jin-yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams. 1259-1276 [doi]
- Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8Mikkel Thorup. 1277-1291 [doi]
- Hashing for Statistics over K-PartitionsSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup. 1292-1310 [doi]
- Optimal Induced Universal Graphs and Adjacency Labeling for TreesStephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen. 1311-1326 [doi]
- An Algorithmic Proof of the Lovasz Local Lemma via Resampling OraclesNicholas J. A. Harvey, Jan Vondrák. 1327-1346 [doi]
- Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan GraphsCharles Bordenave, Marc Lelarge, Laurent Massoulié. 1347-1357 [doi]
- Interlacing Families IV: Bipartite Ramanujan Graphs of All SizesAdam W. Marcus, Daniel A. Spielman, Nikhil Srivastava. 1358-1377 [doi]
- Incidences between Points and Lines in R^4Micha Sharir, Noam Solomon. 1378-1394 [doi]
- Talagrand's Convolution Conjecture on Gaussian SpaceRonen Eldan, James R. Lee. 1395-1408 [doi]
- Random Matrices: l1 Concentration and Dictionary Learning with Few SamplesKyle Luh, Van Vu. 1409-1425 [doi]
- Mixture Selection, Mechanism Design, and SignalingYu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng. 1426-1445 [doi]
- Optimal Auctions vs. Anonymous PricingSaeed Alaei, Jason D. Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan. 1446-1463 [doi]
- On the Complexity of Optimal Lottery Pricing and Randomized MechanismsXi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis. 1464-1479 [doi]
- On the Cryptographic Hardness of Finding a Nash EquilibriumNir Bitansky, Omer Paneth, Alon Rosen. 1480-1498 [doi]
- Welfare Maximization with Limited InteractionNoga Alon, Noam Nisan, Ran Raz, Omri Weinstein. 1499-1512 [doi]