Table of Contents

• Tight Bounds for Online Edge ColoringIlan Reuven Cohen, Binghui Peng, David Wajc. 1-25 [doi]
• Online Matching with General ArrivalsBuddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc. 26-37 [doi]
• Polylogarithmic Guarantees for Generalized Reordering Buffer ManagementMatthias Englert, Harald Räcke, Richard Stotz. 38-59 [doi]
• General Framework for Metric Optimization Problems with Delay or with DeadlinesYossi Azar, Noam Touitou. 60-71 [doi]
• How to Use Heuristics for Differential PrivacySeth Neel, Aaron Roth 0001, Zhiwei Steven Wu. 72-93 [doi]
• The Role of Interactivity in Local Differential PrivacyMatthew Joseph, Jieming Mao, Seth Neel, Aaron Roth 0001. 94-105 [doi]
• Learning from Outcomes: Evidence-Based RankingsCynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona. 106-125 [doi]
• Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed BanditsChao Tao, Qin Zhang 0001, Yuan Zhou 0007. 126-146 [doi]
• Derandomization from Algebraic Hardness: Treading the BordersZeyu Guo, Mrinal Kumar 0001, Ramprasad Saptharishi, Noam Solomon. 147-157 [doi]
• Expander Graphs - Both Local and GlobalMichael Chapman, Nati Linial, Yuval Peled. 158-170 [doi]
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible ErrorBenny Applebaum, Eliran Kachlon. 171-179 [doi]
• Approximating Constraint Satisfaction Problems on High-Dimensional ExpandersVedat Levi Alev, Fernando Granha Jeronimo, Madhur Tulsiani. 180-201 [doi]
• Adversarial Bandits with KnapsacksNicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins. 202-219 [doi]
• Approximation Schemes for a Unit-Demand Buyer with Independent Items via SymmetriesPravesh Kothari, Sahil Singla 0001, Divyarthi Mohan, Ariel Schvartzman, S. Matthew Weinberg. 220-232 [doi]
• Improved Truthful Mechanisms for Combinatorial Auctions with Submodular BiddersSepehr Assadi, Sahil Singla 0001. 233-248 [doi]
• Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive BuyersTomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, Matthew Weinberg. 249-272 [doi]
• Reed-Muller Codes PolarizeEmmanuel Abbe, Min Ye. 273-286 [doi]
• SETH-Hardness of Coding ProblemsNoah Stephens-Davidowitz, Vinod Vaikuntanathan. 287-301 [doi]
• Quasilinear Time List-Decodable Codes for Space Bounded ChannelsJad Silbak, Swastik Kopparty, Ronen Shaltiel. 302-333 [doi]
• Optimal Document Exchange and New Codes for Insertions and DeletionsBernhard Haeupler. 334-347 [doi]
• Radio Network Coding Requires Logarithmic OverheadKlim Efremenko, Gillat Kol, Raghuvansh Saxena. 348-369 [doi]
• Fully Dynamic Maximal Independent Set in Expected Poly-Log Update TimeShiri Chechik, Tianyi Zhang. 370-381 [doi]
• Fully Dynamic Maximal Independent Set with Polylogarithmic Update TimeSoheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan. 382-405 [doi]
• A New Deterministic Algorithm for Dynamic Set CoverSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai. 406-423 [doi]
• Sensitive Distance and Reachability Oracles for Large Batch UpdatesJan van den Brand, Thatchaphol Saranurak. 424-435 [doi]
• Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update TimeJan van den Brand, Danupon Nanongkai. 436-455 [doi]
• Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower BoundsJan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak. 456-480 [doi]
• Lower Bounds for Maximal Matchings and Maximal Independent SetsAlkida Balliu, Sebastian Brandt 0002, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela. 481-497 [doi]
• Automating Resolution is NP-HardAlbert Atserias, Moritz Müller. 498-509 [doi]
• NEEXP is Contained in MIPAnand Natarajan, John Wright 0004. 510-518 [doi]
• Inapproximability of Clustering in Lp MetricsVincent Cohen-Addad, Karthik C. S.. 519-539 [doi]
• Near-Linear Time Approximations Schemes for Clustering in Doubling MetricsDavid Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann. 540-559 [doi]
• A Polynomial-Time Approximation Scheme for Facility Location on Planar GraphsVincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk. 560-581 [doi]
• Smoothed Analysis in Unsupervised Learning via DecouplingAditya Bhaskara, Aidao Chen, Aidan Perreault, Aravindan Vijayaraghavan. 582-610 [doi]
• Perfect Zero Knowledge for Quantum Multiprover Interactive ProofsAlex Bredariol Grilo, William Slofstra, Henry Yuen. 611-635 [doi]
• Leakage-Resilient Secret Sharing Against Colluding PartiesAshutosh Kumar 0002, Raghu Meka, Amit Sahai. 636-660 [doi]
• Laconic Conditional Disclosure of Secrets and ApplicationsNico Döttling, Sanjam Garg, Vipul Goyal, Giulio Malavolta. 661-685 [doi]
• Non-Malleable Commitments using Goldreich-Levin List DecodingVipul Goyal, Silas Richelson. 686-699 [doi]
• Distributed Local Approximation Algorithms for Maximum Matching in Graphs and HypergraphsDavid G. Harris. 700-724 [doi]
• Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic ApplicationsDimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair. 725-744 [doi]
• Beyond Trace Reconstruction: Population Recovery from the Deletion ChannelFrank Ban, Xi Chen 0001, Adam Freilich, Rocco A. Servedio, Sandip Sinha. 745-768 [doi]
• Multi-resolution Hashing for Fast Pairwise SummationsMoses Charikar, Paris Siminelakis. 769-792 [doi]
• Fast Generalized DFTs for all Finite GroupsChris Umans. 793-805 [doi]
• Waring Rank, Parameterized and Exact AlgorithmsKevin Pratt. 806-823 [doi]
• More Barriers for Rank Methods, via a "numeric to Symbolic" TransferAnkit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson. 824-844 [doi]
• Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and PolytopesPeter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson. 845-861 [doi]
• Planar Graphs have Bounded Queue-NumberVida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood. 862-875 [doi]
• Parametric Shortest Paths in Planar GraphsKshitij Gajjar, Jaikumar Radhakrishnan. 876-895 [doi]
• Random k-out Subgraph Leaves only O(n/k) Inter-Component EdgesJacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick. 896-909 [doi]
• New Notions and Constructions of Sparsification for Graphs and HypergraphsNikhil Bansal, Ola Svensson, Luca Trevisan. 910-928 [doi]
• Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on SurfacesLuke Postle. 929-941 [doi]
• A Quantum Query Complexity Trichotomy for Regular LanguagesScott Aaronson, Daniel Grier, Luke Schaeffer. 942-965 [doi]
• Exponential Separation between Quantum Communication and Logarithm of Approximate RankMakrand Sinha, Ronald de Wolf. 966-981 [doi]
• Quantum Log-Approximate-Rank Conjecture is Also FalseAnurag Anshu, Naresh Goud Boddu, Dave Touchette. 982-994 [doi]
• Quantum Advantage with Noisy Shallow Circuits in 3DSergey Bravyi, David Gosset, Robert König, Marco Tomamichel. 995-999 [doi]
• Stoquastic PCP vs. RandomnessDorit Aharonov, Alex Bredariol Grilo. 1000-1023 [doi]
• Computationally-Secure and Composable Remote State PreparationAlexandru Gheorghiu, Thomas Vidick. 1024-1033 [doi]
• Efficient Construction of Rigid Matrices Using an NP OracleJosh Alman, Lijie Chen. 1034-1055 [doi]
• Faster Minimum k-cut of a Simple GraphJason Li. 1056-1077 [doi]
• Truly Optimal Euclidean SpannersHung Le, Shay Solomon. 1078-1100 [doi]
• Sublinear Algorithms for Gap Edit DistanceElazar Goldenberg, Robert Krauthgamer, Barna Saha. 1101-1120 [doi]
• Approximation Algorithms for LCS and LIS with Truly Improved Running TimesAviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun. 1121-1145 [doi]
• Faster Matroid IntersectionDeeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla 0001, Sam Chiu-wai Wong. 1146-1168 [doi]
• Balancing Straight-Line ProgramsMoses Ganardi, Artur Jez, Markus Lohrey. 1169-1183 [doi]
• Spectral Analysis of Matrix Scaling and Operator ScalingTsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran. 1184-1204 [doi]
• Noise Sensitivity on the p -Biased HypercubeNoam Lifshitz, Dor Minzer. 1205-1226 [doi]
• The Complexity of 3-Colouring H-Colourable GraphsAndrei A. Krokhin, Jakub Oprsal. 1227-1239 [doi]
• Hardness Magnification for all Sparse NP LanguagesLijie Chen, Ce Jin, R. Ryan Williams. 1240-1255 [doi]
• The Average-Case Complexity of Counting Cliques in Erdős-Rényi HypergraphsEnric Boix-Adserà, Matthew Brennan, Guy Bresler. 1256-1280 [doi]
• Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC CircuitsLijie Chen. 1281-1304 [doi]
• Why are Proof Complexity Lower Bounds Hard?Ján Pich, Rahul Santhanam. 1305-1324 [doi]
• Polynomial Calculus Space and Resolution WidthNicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen. 1325-1337 [doi]
• Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball WalkOren Mangoubi, Nisheeth K. Vishnoi. 1338-1357 [doi]
• Modified log-Sobolev Inequalities for Strongly Log-Concave DistributionsMary Cryan, Heng Guo 0001, Giorgos Mousa. 1358-1370 [doi]
• Fast Uniform Generation of Random Graphs with Given Degree SequencesAndrii Arman, Pu Gao, Nicholas C. Wormald. 1371-1379 [doi]
• A Deterministic Algorithm for Counting Colorings with 2-Delta ColorsJingcheng Liu 0001, Alistair Sinclair, Piyush Srivastava. 1380-1404 [doi]
• Breaking of 1RSB in Random Regular MAX-NAE-SATZsolt Bartha, Nike Sun, Yumeng Zhang. 1405-1416 [doi]
• Optimization of the Sherrington-Kirkpatrick HamiltonianAndrea Montanari. 1417-1433 [doi]
• A Tight Analysis of Bethe Approximation for PermanentNima Anari, Alireza Rezaei. 1434-1445 [doi]
• The Kikuchi Hierarchy and Tensor PCAAlexander S. Wein, Ahmed El Alaoui, Cristopher Moore. 1446-1468 [doi]
• Finding Monotone Patterns in Sublinear TimeOmri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten. 1469-1494 [doi]
• Agreement Testing Theorems on Layered Set SystemsYotam Dikstein, Irit Dinur. 1495-1524 [doi]
• A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs)Artur Czumaj, Christian Sohler. 1525-1548 [doi]
• Junta Correlation is TestableAnindya De, Elchanan Mossel, Joe Neeman. 1549-1563 [doi]
• An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard MatricesJaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, Shravas Rao. 1564-1567 [doi]
• (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and FilterlessVasileios Nakos, Zhao Song, Zhengyu Wang. 1568-1577 [doi]
• Efficient Truncated Statistics with Unknown TruncationVasilis Kontonis, Christos Tzamos, Manolis Zampetakis. 1578-1595 [doi]
• Residual Based Sampling for Online Low Rank ApproximationAditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam. 1596-1614 [doi]
• Near-Optimal Massively Parallel Graph ConnectivitySoheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni. 1615-1636 [doi]
• Exponentially Faster Massively Parallel Maximal MatchingSoheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris. 1637-1649 [doi]
• Conditional Hardness Results for Massively Parallel Computation from Distributed Lower BoundsMohsen Ghaffari, Fabian Kuhn, Jara Uitto. 1650-1663 [doi]
• Parallel Reachability in Almost Linear Work and Square Root DepthYang P. Liu, Arun Jambulapati, Aaron Sidford. 1664-1686 [doi]