Abstract is missing.
- Almost tight bounds for eliminating depth cycles in three dimensionsBoris Aronov, Micha Sharir. 1-8 [doi]
- Geometric median in nearly linear timeMichael B. Cohen, Yin Tat Lee, Gary L. Miller, Jakub Pachocki, Aaron Sidford. 9-21 [doi]
- Separating subadditive euclidean functionalsAlan M. Frieze, Wesley Pegden. 22-35 [doi]
- Bounded degree cosystolic expanders of every dimensionShai Evra, Tali Kaufman. 36-48 [doi]
- Constant-round interactive proofs for delegating computationOmer Reingold, Guy N. Rothblum, Ron D. Rothblum. 49-62 [doi]
- Candidate hard unique gameSubhash Khot, Dana Moshkovitz. 63-76 [doi]
- On the effect of randomness on planted 3-coloring modelsRoee David, Uriel Feige. 77-90 [doi]
- Matrix rigidity of random toeplitz matricesOded Goldreich, Avishay Tal. 91-104 [doi]
- Complexity theoretic limitations on learning halfspacesAmit Daniely. 105-117 [doi]
- A cost function for similarity-based hierarchical clusteringSanjoy Dasgupta. 118-127 [doi]
- The computational power of optimization in online learningElad Hazan, Tomer Koren. 128-141 [doi]
- Instance optimal learning of discrete distributionsGregory Valiant, Paul Valiant. 142-155 [doi]
- Lift-and-round to improve weighted completion time on unrelated machinesNikhil Bansal, Aravind Srinivasan, Ola Svensson. 156-167 [doi]
- A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchiesElaine Levey, Thomas Rothvoss. 168-177 [doi]
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectorsSamuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer. 178-191 [doi]
- Maximizing determinants under partition constraintsAleksandar Nikolov, Mohit Singh. 192-201 [doi]
- High-rate locally-correctable and locally-testable codes with sub-polynomial query complexitySwastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf. 202-215 [doi]
- Repairing Reed-solomon codesVenkatesan Guruswami, Mary Wootters. 216-226 [doi]
- Efficiently decoding Reed-Muller codes from random errorsRamprasad Saptharishi, Amir Shpilka, Ben lee Volk. 227-235 [doi]
- Optimal principal component analysis in distributed and streaming modelsChristos Boutsidis, David P. Woodruff, Peilin Zhong. 236-249 [doi]
- Weighted low rank approximations with provable guaranteesIlya P. Razenshteyn, Zhao Song, David P. Woodruff. 250-263 [doi]
- Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear timeMichael Kapralov. 264-277 [doi]
- Two-source dispersers for polylogarithmic entropy and improved ramsey graphsGil Cohen. 278-284 [doi]
- Non-malleable extractors and codes, with their many tampered extensionsEshan Chattopadhyay, Vipul Goyal, Xin Li 0006. 285-298 [doi]
- Extractors for sumset sourcesEshan Chattopadhyay, Xin Li. 299-311 [doi]
- Parallel exhaustive search without coordinationPierre Fraigniaud, Amos Korman, Yoav Rodeh. 312-323 [doi]
- Beyond matroids: secretary problem and prophet inequality with general constraintsAviad Rubinstein. 324-332 [doi]
- Online matching: haste makes waste!Yuval Emek, Shay Kutten, Roger Wattenhofer. 333-344 [doi]
- A tight space bound for consensusLeqi Zhu. 345-350 [doi]
- The 4/3 additive spanner exponent is tightAmir Abboud, Greg Bodwin. 351-361 [doi]
- Cell-probe lower bounds for dynamic problems via a new communication modelHuacheng Yu. 362-374 [doi]
- Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound madeAmir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams. 375-388 [doi]
- Deterministic decremental single source shortest paths: beyond the o(mn) boundAaron Bernstein, Shiri Chechik. 389-397 [doi]
- New deterministic approximation algorithms for fully dynamic matchingSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai. 398-411 [doi]
- Algorithmic Bayesian persuasionShaddin Dughmi, Haifeng Xu. 412-425 [doi]
- The sample complexity of auctions with side informationNikhil R. Devanur, Zhiyi Huang 0002, Christos-Alexandros Psomas. 426-439 [doi]
- Do prices coordinate markets?Justin Hsu, Jamie Morgenstern, Ryan M. Rogers, Aaron Roth, Rakesh Vohra. 440-453 [doi]
- A discrete and bounded envy-free cake cutting protocol for four agentsHaris Aziz, Simon Mackenzie. 454-464 [doi]
- Distributed (∆+1)-coloring in sublogarithmic roundsDavid G. Harris, Johannes Schneider, Hsin-Hao Su. 465-478 [doi]
- A lower bound for the distributed Lovász local lemmaSebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, Jara Uitto. 479-488 [doi]
- A deterministic almost-tight distributed algorithm for approximating single-source shortest pathsMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 489-498 [doi]
- Contention resolution with log-logstar channel accessesMichael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young. 499-508 [doi]
- Fault tolerant subgraph for single source reachability: generic and optimalSurender Baswana, Keerti Choudhary, Liam Roditty. 509-518 [doi]
- Deterministic and probabilistic binary search in graphsEhsan Emamjomeh-Zadeh, David Kempe, Vikrant Singhal. 519-532 [doi]
- Ramanujan coverings of graphsChris Hall, Doron Puder, William F. Sawin. 533-541 [doi]
- Enumerating parametric global minimum cuts by random interleavingDavid R. Karger. 542-555 [doi]
- Improved approximation for node-disjoint paths in planar graphsJulia Chuzhoy, David H. K. Kim, Shi Li. 556-569 [doi]
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collectingMohammadHossein Bateni, Erik D. Demaine, MohammadTaghi Hajiaghayi, Dániel Marx. 570-583 [doi]
- Approximating connectivity domination in weighted bounded-genus graphsVincent Cohen-Addad, Éric Colin de Verdière, Philip N. Klein, Claire Mathieu, David Meierfrankenfeld. 584-597 [doi]
- Routing under balanceAlina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford. 598-611 [doi]
- Near-optimal small-depth lower bounds for small distance connectivityXi Chen, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan. 612-625 [doi]
- On the size of homogeneous and of depth four formulas with low individual degreeNeeraj Kayal, Chandan Saha, Sébastien Tavenas. 626-632 [doi]
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuitsDaniel M. Kane, Ryan Williams. 633-643 [doi]
- Poly-logarithmic Frege depth lower bounds via an expander switching lemmaToniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan. 644-657 [doi]
- Reed-Muller codes achieve capacity on erasure channelsShrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke. 658-669 [doi]
- Explicit two-source extractors and resilient functionsEshan Chattopadhyay, David Zuckerman. 670-683 [doi]
- Graph isomorphism in quasipolynomial time [extended abstract]László Babai. 684-697 [doi]
- Tight bounds for single-pass streaming complexity of the set cover problemSepehr Assadi, Sanjeev Khanna, Yang Li. 698-711 [doi]
- Streaming algorithms for embedding and computing edit distance in the low distance regimeDiptarka Chakraborty, Elazar Goldenberg, Michal Koucký. 712-725 [doi]
- On approximating functions of the singular values in a streamYi Li, David P. Woodruff. 726-739 [doi]
- Beating CountSketch for heavy hitters in insertion streamsVladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P. Woodruff. 740-753 [doi]
- Bipartite perfect matching is in quasi-NCStephen A. Fenner, Rohit Gurjar, Thomas Thierauf. 754-763 [doi]
- Exact algorithms via monotone local searchFedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh. 764-775 [doi]
- Basis collapse for holographic algorithms over all domain sizesSitan Chen. 776-789 [doi]
- Base collapse of holographic algorithmsMingji Xia. 790-799 [doi]
- Separations in query complexity based on pointer functionsAndris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs. 800-813 [doi]
- Semidefinite programs on sparse random graphs and their application to community detectionAndrea Montanari, Subhabrata Sen. 814-827 [doi]
- How robust are reconstruction thresholds for community detection?Ankur Moitra, William Perry, Alexander S. Wein. 828-841 [doi]
- Sparsified Cholesky and multigrid solvers for connection laplaciansRasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman. 842-850 [doi]
- Parallel algorithms for select and partition with noisy comparisonsMark Braverman, Jieming Mao, S. Matthew Weinberg. 851-862 [doi]
- Separations in query complexity using cheat sheetsScott Aaronson, Shalev Ben-David, Robin Kothari. 863-876 [doi]
- Entangled simultaneity versus classical interactivity in communication complexityDmitry Gavinsky. 877-884 [doi]
- Classical verification of quantum proofsZhengfeng Ji. 885-898 [doi]
- Efficient quantum tomographyRyan O'Donnell, John Wright. 899-912 [doi]
- Sample-optimal tomography of quantum statesJeongwan Haah, Aram Wettroth Harrow, Zheng-Feng Ji, Xiaodi Wu, Nengkun Yu. 913-925 [doi]
- A duality based unified approach to Bayesian mechanism designYang Cai, Nikhil R. Devanur, S. Matthew Weinberg. 926-939 [doi]
- Breaking the logarithmic barrier for truthful combinatorial auctions with submodular biddersShahar Dobzinski. 940-948 [doi]
- Watch and learn: optimizing from revealed preferences feedbackAaron Roth, Jonathan Ullman, Zhiwei Steven Wu. 949-962 [doi]
- The price of anarchy in large gamesMichal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, Vasilis Syrgkanis. 963-976 [doi]
- Exponential separation of communication and external informationAnat Ganor, Gillat Kol, Ran Raz. 977-986 [doi]
- Interactive compression for product distributionsGillat Kol. 987-998 [doi]
- Constant-rate coding for multiparty interactive communication is impossibleMark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler. 999-1010 [doi]
- Communication lower bounds for statistical estimation problems via a distributed data processing inequalityMark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff. 1011-1020 [doi]
- A polynomial lower bound for testing monotonicityAleksandrs Belovs, Eric Blais. 1021-1032 [doi]
- Relating two property testing models for bounded degree directed graphsArtur Czumaj, Pan Peng, Christian Sohler. 1033-1045 [doi]
- Algorithmic stability for adaptive data analysisRaef Bassily, Kobbi Nissim, Adam D. Smith, Thomas Steinke, Uri Stemmer, Jonathan Ullman. 1046-1059 [doi]
- The fourier transform of poisson multinomial distributions and its algorithmic applicationsIlias Diakonikolas, Daniel M. Kane, Alistair Stewart. 1060-1073 [doi]
- A size-free CLT for poisson multinomials and its applicationsConstantinos Daskalakis, Anindya De, Gautam Kamath, Christos Tzamos. 1074-1086 [doi]
- Algebraic attacks against random local functions and their countermeasuresBenny Applebaum, Shachar Lovett. 1087-1100 [doi]
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocationsGilad Asharov, Moni Naor, Gil Segev, Ido Shahaf. 1101-1114 [doi]
- Watermarking cryptographic capabilitiesAloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs. 1115-1127 [doi]
- Textbook non-malleable commitmentsVipul Goyal, Omkant Pandey, Silas Richelson. 1128-1141 [doi]