Table of Contents

• A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph ProcessPu Gao, Calum MacRury, Pawel Pralat. [doi]
• Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate CaseVishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha 0001. [doi]
• Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack ConstraintMax Klimm, Martin Knaack. [doi]
• A Unified Approach to Discrepancy MinimizationNikhil Bansal 0001, Aditi Laddha, Santosh S. Vempala. [doi]
• Prophet Matching in the Probe-Commit ModelAllan Borodin, Calum MacRury, Akash Rakheja. [doi]
• Online Facility Location with Linear DelayMarcin Bienkowski, Martin Böhm 0001, Jaroslaw Byrka, Jan Marcinkowski. [doi]
• Massively Parallel Algorithms for Small Subgraph CountingAmartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic. [doi]
• The Biased Homogeneous r-Lin ProblemSuprovat Ghoshal. [doi]
• Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique NumberVenkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. [doi]
• Lower Bound Methods for Sign-Rank and Their LimitationsHamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao. [doi]
• Fourier Growth of Regular Branching ProgramsChin Ho Lee, Edward Pyne, Salil P. Vadhan. [doi]
• Hyperbolic Concentration, Anti-Concentration, and DiscrepancyZhao Song 0002, Ruizhe Zhang. [doi]
• Relative Survivable Network DesignMichael Dinitz, Ama Koranteng, Guy Kortsarz. [doi]
• Accelerating Polarization via Alphabet ExtensionIwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang 0001. [doi]
• Finding the KT Partition of a Weighted Graph in Near-Linear TimeSimon Apers, Pawel Gawrychowski, Troy Lee. [doi]
• Sketching Distances in Monotone Graph ClassesLouis Esperet, Nathaniel Harms, Andrey Kupavskii. [doi]
• Communication Complexity of CollisionMika Göös, Siddhartha Jain 0002. [doi]
• Some Results on Approximability of Minimum Sum Vertex CoverAleksa Stankovic. [doi]
• Eigenstripping, Spectral Decay, and Edge-Expansion on PosetsJason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang 0001. [doi]
• Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in NetworksHermish Mehta, Daniel Reichman 0001. [doi]
• Exploring the Gap Between Tolerant and Non-Tolerant Distribution TestingSourav Chakraborty 0001, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen. [doi]
• High Dimensional Expansion Implies Amplified Local TestabilityTali Kaufman, Izhar Oppenheim. [doi]
• Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow SchedulingTakuro Fukunaga. [doi]
• Affine Extractors and AC0-ParityXuangui Huang, Peter Ivanov, Emanuele Viola. [doi]
• Submodular Dominance and ApplicationsFrederick Qiu, Sahil Singla 0001. [doi]
• Improved Local Testing for Multiplicity CodesDan Karliner, Amnon Ta-Shma. [doi]
• Space Optimal Vertex Cover in Dynamic StreamsKheeran K. Naidu, Vihan Shah. [doi]
• Hardness Results for Weaver's Discrepancy ProblemDaniel A. Spielman, Peng Zhang. [doi]
• Local Stochastic Algorithms for Alignment in Self-Organizing Particle SystemsHridesh Kedia, Shunhao Oh, Dana Randall. [doi]
• Cover and Hitting Times of Hyperbolic Random GraphsMarcos Kiwi, Markus Schepers, John Sylvester 0001. [doi]
• Adaptive Sketches for Robust Regression with Importance SamplingSepideh Mahabadi, David P. Woodruff, Samson Zhou. [doi]
• Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph CountingSepehr Assadi, Hoai An Nguyen. [doi]
• On Sketching Approximations for Symmetric Boolean CSPsJoanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, Santhoshini Velusamy. [doi]
• A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 GraphsTobias Friedrich 0001, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif. [doi]
• Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream ModelMoran Feldman, Ariel Szarf. [doi]
• Improved Bounds for Randomly Colouring Simple HypergraphsWeiming Feng 0001, Heng Guo 0001, Jiaheng Wang 0002. [doi]
• Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster DynamicsAntonio Blanca, Reza Gheissari. [doi]
• Approximating CSPs with OutliersSuprovat Ghoshal, Anand Louis. [doi]
• Range Avoidance for Low-Depth Circuits and Connections to PseudorandomnessVenkatesan Guruswami, Xin Lyu, Xiuhan Wang. [doi]
• Fair Correlation Clustering in General GraphsRoy Schwartz 0002, Roded Zats. [doi]
• Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial TimeVikraman Arvind, Abhranil Chatterjee 0001, Partha Mukhopadhyay. [doi]
• Unbalanced Expanders from Multiplicity CodesItay Kalev, Amnon Ta-Shma. [doi]
• (1+ε)-Approximate Shortest Paths in Dynamic StreamsMichael Elkin, Chhaya Trehan. [doi]
• Streaming Algorithms with Large Approximation FactorsYi Li 0002, Honghao Lin, David P. Woodruff, Yuheng Zhang. [doi]
• Beyond Single-Deletion Correcting Codes: Substitutions and TranspositionsRyan Gabrys, Venkatesan Guruswami, João L. Ribeiro 0001, Ke Wu. [doi]
• Fast and Perfect Sampling of Subgraphs and Polymer SystemsAntonio Blanca, Sarah Cannon, Will Perkins 0001. [doi]
• Tight Chernoff-Like Bounds Under Limited IndependenceMaciej Skorski. [doi]
• Sketching Approximability of (Weak) Monarchy PredicatesChi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy. [doi]
• Caching with ReservesSharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang. [doi]
• Ordered k-Median with OutliersShichuan Deng, Qianfan Zhang 0002. [doi]
• Approximating LCS and Alignment Distance over Multiple SequencesDebarati Das 0001, Barna Saha. [doi]
• Double Balanced Sets in High Dimensional ExpandersTali Kaufman, David Mass. [doi]
• Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary InputsUma Girish, Kunal Mittal, Ran Raz, Wei Zhan. [doi]
• A Sublinear Local Access Implementation for the Chinese Restaurant ProcessPeter Mörters, Christian Sohler, Stefan Walzer. [doi]
• Lifting with Inner Functions of Polynomial DiscrepancyYahel Manor, Or Meir. [doi]