Table of Contents

• Dynamic matching in school choice: efficient seat reassignment after late cancellations (invited talk)Irene Lo. 1 [doi]
• Generalization and equilibrium in generative adversarial nets (GANs) (invited talk)Tengyu Ma. 2 [doi]
• k-server via multiscale entropic regularizationSébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry. 3-16 [doi]
• How to match when all vertices arrive onlineZhiyi Huang 0002, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu. 17-29 [doi]
• Online load balancing on related machinesSungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo. 30-43 [doi]
• A converse to Banach's fixed point theorem and its CLS-completenessConstantinos Daskalakis, Christos Tzamos, Manolis Zampetakis. 44-50 [doi]
• Consensus halving is PPA-completeAris Filos-Ratsikas, Paul W. Goldberg. 51-64 [doi]
• The art gallery problem is ∃ ℝ-completeMikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow. 65-73 [doi]
• Composable and versatile privacy via truncated CDPMark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke. 74-86 [doi]
• Universal protocols for information dissemination using emergent signalsBartlomiej Dudek, Adrian Kosowski. 87-99 [doi]
• Shape of diffusion and size of monochromatic region of a two-dimensional spin systemHamed Omidvar, Massimo Franceschetti. 100-113 [doi]
• Stochastic bandits robust to adversarial corruptionsThodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme. 114-122 [doi]
• Bounding the menu-size of approximately optimal auctions via optimal-transport dualityYannai A. Gonczarowski. 123-131 [doi]
• A tighter welfare guarantee for first-price auctionsDarrell Hoy, Samuel Taggart, Zihe Wang. 132-137 [doi]
• An exponential lower bound for individualization-refinement algorithms for graph isomorphismDaniel Neuen, Pascal Schweitzer. 138-150 [doi]
• Extensor-codingCornelius Brand, Holger Dell, Thore Husfeldt. 151-164 [doi]
• The query complexity of graph isomorphism: bypassing distribution testing lower boundsKrzysztof Onak, Xiaorui Sun. 165-171 [doi]
• Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testingZeyuan Allen Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson. 172-181 [doi]
• The Paulsen problem, continuous operator scaling, and smoothed analysisTsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran. 182-189 [doi]
• Operator scaling with specified marginalsCole Franks. 190-203 [doi]
• A constant-factor approximation algorithm for the asymmetric traveling salesman problemOla Svensson, Jakub Tarnawski, László A. Végh. 204-213 [doi]
• An almost-linear time algorithm for uniform random spanning tree generationAaron Schild. 214-227 [doi]
• (Gap/S)ETH hardness of SVPDivesh Aggarwal, Noah Stephens-Davidowitz. 228-238 [doi]
• Fine-grained complexity for sparse graphsUdit Agarwal, Vijaya Ramachandran. 239-252 [doi]
• More consequences of falsifying SETH and the orthogonal vectors conjectureAmir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof. 253-266 [doi]
• Towards tight approximation bounds for graph diameter and eccentricitiesArturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein. 267-280 [doi]
• Fine-grained reductions from approximate counting to decisionHolger Dell, John Lapinskas. 281-288 [doi]
• Universal points in the asymptotic spectrum of tensorsMatthias Christandl, Péter Vrana, Jeroen Zuiddam. 289-296 [doi]
• The polynomial method strikes back: tight quantum query bounds via dual polynomialsMark Bun, Robin Kothari, Justin Thaler. 297-310 [doi]
• Algorithmic polynomialsAlexander A. Sherstov. 311-324 [doi]
• Shadow tomography of quantum statesScott Aaronson. 325-338 [doi]
• Capacity approaching coding for low noise interactive quantum communicationDebbie Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu. 339-352 [doi]
• Hitting sets with near-optimal error for read-once branching programsMark Braverman, Gil Cohen, Sumegha Garg. 353-362 [doi]
• Improved pseudorandomness for unordered branching programs through local monotonicityEshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal. 363-375 [doi]
• Towards a proof of the 2-to-1 games conjecture?Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra. 376-389 [doi]
• A friendly smoothed analysis of the simplex methodDaniel Dadush, Sophie Huiberts. 390-403 [doi]
• Incomplete nested dissectionRasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang. 404-417 [doi]
• Deterministic distributed edge-coloring with fewer colorsMohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto. 418-430 [doi]
• Improved distributed algorithms for exact shortest pathsMohsen Ghaffari, Jason Li. 431-444 [doi]
• An optimal distributed (Δ+1)-coloring algorithm?Yi-Jun Chang, Wenzheng Li, Seth Pettie. 445-456 [doi]
• Nearly work-efficient parallel algorithm for digraph reachabilityJeremy T. Fineman. 457-470 [doi]
• Round compression for parallel matching algorithmsArtur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski. 471-484 [doi]
• General strong polarizationJaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan. 485-492 [doi]
• Capacity upper bounds for deletion-type channelsMahdi Cheraghchi. 493-506 [doi]
• Interactive coding over the noisy broadcast channelKlim Efremenko, Gillat Kol, Raghuvansh Saxena. 507-520 [doi]
• Efficient decoding of random errors for quantum expander codesOmar Fawzi, Antoine Grospellier, Anthony Leverrier. 521-534 [doi]
• Explicit binary tree codes with polylogarithmic size alphabetGil Cohen, Bernhard Haeupler, Leonard J. Schulman. 535-544 [doi]
• The minimum euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponentialJesús A. De Loera, Jamie Haddock, Luis Rademacher. 545-553 [doi]
• Near-optimal linear decision trees for k-SUM and related problemsDaniel M. Kane, Shachar Lovett, Shay Moran. 554-563 [doi]
• Fast fencingMikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup. 564-573 [doi]
• A framework for ETH-tight algorithms and lower bounds in geometric intersection graphsMark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden. 574-586 [doi]
• The gram-schmidt walk: a cure for the Banaszczyk bluesNikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett. 587-597 [doi]
• Approximating generalized network design under (dis)economies of scale with applications to energy efficiencyYuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi. 598-606 [doi]
• A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxesFabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese, Hang Zhou 0001. 607-619 [doi]
• Constant-factor approximation for ordered k-medianJaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase. 620-631 [doi]
• Improved approximation for tree augmentation: saving by rewiringFabrizio Grandoni 0001, Christos Kalaitzis, Rico Zenklusen. 632-645 [doi]
• Constant approximation for k-median and k-means with outliers via iterative roundingRavishankar Krishnaswamy, Shi Li, Sai Sandeep. 646-659 [doi]
• Collusion resistant traitor tracing from learning with errorsRishab Goyal, Venkata Koppula, Brent Waters. 660-670 [doi]
• Multi-collision resistance: a paradigm for keyless hash functionsNir Bitansky, Yael Tauman Kalai, Omer Paneth. 671-684 [doi]
• Non-malleable secret sharingVipul Goyal, Ashutosh Kumar 0002. 685-698 [doi]
• Breaking the circuit-size barrier in secret sharingTianren Liu, Vinod Vaikuntanathan. 699-708 [doi]
• Succinct delegation for low-space non-deterministic computationSaikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs. 709-721 [doi]
• On approximating the number of k-cliques in sublinear timeTalya Eden, Dana Ron, C. Seshadhri. 722-734 [doi]
• Testing conditional independence of discrete distributionsClément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart. 735-748 [doi]
• Distribution-free junta testingZhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie. 749-759 [doi]
• A generalized Turán problem and its applicationsLior Gishboliner, Asaf Shapira. 760-772 [doi]
• Construction of new local spectral high dimensional expandersTali Kaufman, Izhar Oppenheim. 773-786 [doi]
• Data-dependent hashing via nonlinear spectral gapsAlexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten. 787-800 [doi]
• Smooth heaps and a dual view of self-adjusting data structuresLászló Kozma 0002, Thatchaphol Saranurak. 801-814 [doi]
• Fully dynamic maximal independent set with sublinear update timeSepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon. 815-826 [doi]
• At the roots of dictionary compression: string attractorsDominik Kempa, Nicola Prezza. 827-840 [doi]
• Synchronization strings: explicit constructions, local decoding, and applicationsBernhard Haeupler, Amirbehshad Shahrasbi. 841-854 [doi]
• Quantified derandomization of linear threshold circuitsRoei Tell. 855-865 [doi]
• Clique is hard on average for regular resolutionAlbert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov. 866-877 [doi]
• On the complexity of hazard-free circuitsChristian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah. 878-889 [doi]
• Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQPCody Murray, R. Ryan Williams. 890-901 [doi]
• Monotone circuit lower bounds from resolutionAnkit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov. 902-911 [doi]
• Sparse Kneser graphs are HamiltonianTorsten Mütze, Jerri Nummenpalo, Bartosz Walczak. 912-919 [doi]
• A simply exponential upper bound on the maximum number of stable matchingsAnna R. Karlin, Shayan Oveis Gharan, Robbie Weber. 920-925 [doi]
• Counting hypergraph colourings in the local lemma regimeHeng Guo 0001, Chao Liao, Pinyan Lu, Chihao Zhang. 926-939 [doi]
• On non-optimally expanding sets in Grassmann graphsIrit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra. 940-951 [doi]
• Metric embedding via shortest path decompositionsIttai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman. 952-963 [doi]
• Interactive compression to external informationMark Braverman, Gillat Kol. 964-977 [doi]
• Crossing the logarithmic barrier for dynamic Boolean data structure lower boundsKasper Green Larsen, Omri Weinstein, Huacheng Yu. 978-989 [doi]
• Extractor-based time-space lower bounds for learningSumegha Garg, Ran Raz, Avishay Tal. 990-1002 [doi]
• Cell-probe lower bounds from online communication complexityJosh Alman, Joshua R. Wang, Huacheng Yu. 1003-1012 [doi]
• Simulation beats richness: new data-structure lower boundsArkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay. 1013-1020 [doi]
• Mixture models, robustness, and sum of squares proofsSamuel B. Hopkins, Jerry Li 0001. 1021-1034 [doi]
• Robust moment estimation and improved clustering via sum of squaresPravesh K. Kothari, Jacob Steinhardt, David Steurer. 1035-1046 [doi]
• List-decodable robust mean estimation and learning mixtures of spherical gaussiansIlias Diakonikolas, Daniel M. Kane, Alistair Stewart. 1047-1060 [doi]
• Learning geometric concepts with nasty noiseIlias Diakonikolas, Daniel M. Kane, Alistair Stewart. 1061-1073 [doi]
• Prediction with a short memoryVatsal Sharan, Sham Kakade, Percy Liang, Gregory Valiant. 1074-1087 [doi]
• Nonlinear dimension reduction via outer Bi-Lipschitz extensionsSepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn. 1088-1101 [doi]
• A matrix expander Chernoff boundAnkit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava. 1102-1114 [doi]
• Convergence rate of riemannian Hamiltonian Monte Carlo and faster polytope volume computationYin Tat Lee, Santosh S. Vempala. 1115-1121 [doi]
• Stochastic localization + Stieltjes barrier = tight bound for log-SobolevYin Tat Lee, Santosh S. Vempala. 1122-1129 [doi]
• p regression provably beyond self-concordance and in input-sparsity timeSébastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li. 1130-1137 [doi]
• The adaptive complexity of maximizing a submodular functionEric Balkanski, Yaron Singer. 1138-1151 [doi]
• Discovering the roots: uniform closure results for algebraic classes under factoringPranjal Dutta, Nitin Saxena 0001, Amit Sinhababu. 1152-1165 [doi]
• Bootstrapping variables in algebraic circuitsManindra Agrawal, Sumanta Ghosh, Nitin Saxena 0001. 1166-1179 [doi]
• A PSPACE construction of a hitting set for the closure of small algebraic circuitsMichael A. Forbes, Amir Shpilka. 1180-1192 [doi]
• Generalized matrix completion and algebraic natural proofsMarkus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov. 1193-1206 [doi]
• Lifting nullstellensatz to monotone span programs over any fieldToniann Pitassi, Robert Robere. 1207-1219 [doi]
• Almost polynomial hardness of node-disjoint paths in gridsJulia Chuzhoy, David H. K. Kim, Rachit Nimavat. 1220-1233 [doi]
• Inapproximability of the independent set polynomial in the complex planeIvona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic. 1234-1240 [doi]
• Sum-of-squares meets nash: lower bounds for finding any equilibriumPravesh K. Kothari, Ruta Mehta. 1241-1248 [doi]
• Tight query complexity lower bounds for PCA via finite sample deformed wigner lawMax Simchowitz, Ahmed El Alaoui, Benjamin Recht. 1249-1259 [doi]
• Hardness of approximate nearest neighbor searchAviad Rubinstein. 1260-1268 [doi]
• Fast algorithms for knapsack via convolution and predictionMohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein. 1269-1282 [doi]
• On the parameterized complexity of approximating dominating setKarthik C. S., Bundit Laekhanukit, Pasin Manurangsi. 1283-1296 [doi]
• Tight cell probe bounds for succinct Boolean matrix-vector multiplicationDiptarka Chakraborty, Lior Kamma, Kasper Green Larsen. 1297-1306 [doi]
• New classes of distributed time complexityAlkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, Jukka Suomela. 1307-1318 [doi]
• Holiest minimum-cost paths and flows in surface graphsJeff Erickson 0001, Kyle Fox, Luvsandondov Lkhamsuren. 1319-1332 [doi]