Table of Contents

• Ramsey Properties of Randomly Perturbed HypergraphsElad Aigner-Horev, Dan Hefetz, Mathias Schacht. [doi]
• Online k-Median with Consistent ClustersBenjamin Moseley, Heather Newman, Kirk Pruhs. [doi]
• Greedy Heuristics and Linear Relaxations for the Random Hitting Set ProblemGabriel Arpino, Daniil Dmitriev, Nicolò Grometto. [doi]
• More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and MoreSurendra Ghentiyala, Noah Stephens-Davidowitz. [doi]
• A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded GenusHao Sun. [doi]
• Near-Linear Time Samplers for Matroid Independent Sets with ApplicationsXiaoyu Chen, Heng Guo, Xinyuan Zhang, Zongrui Zou. [doi]
• Learning-Augmented Maximum Independent SetVladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang. [doi]
• Parallel Repetition of k-Player Projection GamesAmey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer. [doi]
• Capacity-Achieving Gray CodesVenkatesan Guruswami, Hsin-Po Wang 0001. [doi]
• Hybrid k-Clustering: Blending k-Median and k-CenterFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Matrix Multiplication ReductionsAshish Gola, Igor Shinkar, Harsimran Singh. [doi]
• On Sampling from Ising Models with Spectral ConstraintsAndreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros. [doi]
• Approximate Degree Composition for Recursive FunctionsSourav Chakraborty 0001, Chandrima Kayal, Rajat Mittal 0001, Manaswi Paraashar, Nitin Saurabh. [doi]
• On Black-Box Meta Complexity and Function InversionNoam Mazor, Rafael Pass. [doi]
• Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable GraphsReut Levi, Moti Medina, Omer Tubul. [doi]
• Refining the Adaptivity Notion in the Huge Object ModelTomer Adar, Eldar Fischer. [doi]
• Improved Online Load Balancing with Known MakespanMartin Böhm 0001, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee. [doi]
• Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone FunctionsHadley Black. [doi]
• Derandomizing Multivariate Polynomial Factoring for Low Degree FactorsPranjal Dutta, Amit Sinhababu, Thomas Thierauf. [doi]
• On the NP-Hardness Approximation Curve for Max-2Lin(2)Björn Martinsson. [doi]
• Sparse High Dimensional Expanders via Local LiftsInbar Ben Yaacov, Yotam Dikstein, Gal Maor. [doi]
• Explicit and Near-Optimal Construction of t-Rankwise Independent PermutationsNicholas Harvey, Arvin Sahami. [doi]
• Parallelising Glauber DynamicsHolden Lee. [doi]
• Public Coin Interactive Proofs for Label-Invariant Distribution PropertiesTal Herman. [doi]
• Support Testing in the Huge Object ModelTomer Adar, Eldar Fischer, Amit Levi. [doi]
• Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant FactorsKuan Cheng, Ruiyang Wu. [doi]
• Testing Intersectingness of Uniform FamiliesIshay Haviv, Michal Parnas. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Matrix Multiplication Verification Using Coding TheoryHuck Bennett, Karthik Gajulapalli, Alexander Golovnev, Philip G. Warton. [doi]
• Scheduling on a Stochastic Number of MachinesMoritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese. [doi]
• Trace Reconstruction from Local Statistical QueriesXi Chen 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio. [doi]
• Rapid Mixing of the Down-Up Walk on Matchings of a Fixed SizeVishesh Jain, Clayton Mizgerd. [doi]
• Upper Bounds on the 2-Colorability Threshold of Random d-Regular k-Uniform Hypergraphs for k ≥ 3Evan Chang, Neel Kolhe, Youngtak Sohn. [doi]
• Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower BoundPhilip Cervenjak, Junhao Gan, Seeun William Umboh, Anthony Wirth. [doi]
• Universal Optimization for Non-Clairvoyant Subadditive Joint ReplenishmentTomer Ezra, Stefano Leonardi 0001, Michal Pawlowski, Matteo Russo, Seeun William Umboh. [doi]
• Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov ComplexityHalley Goldberg, Valentine Kabanets. [doi]
• Private Counting of Distinct Elements in the Turnstile Model and ExtensionsMonika Henzinger, A. R. Sricharan, Teresa Anna Steiner. [doi]
• The Average-Value Allocation ProblemKshipra Bhawalkar, Zhe Feng 0004, Anupam Gupta 0001, Aranyak Mehta, David Wajc, Di Wang 0005. [doi]
• Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially PrivateJakub Tetek. [doi]
• Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree GraphsAiya Kuchukova, Marcus Pappik, Will Perkins 0001, Corrine Yap. [doi]
• Approximation Algorithms for Correlated Knapsack OrienteeringDavid Alemán Espinosa, Chaitanya Swamy. [doi]
• When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?Dean Doron, Jonathan Mosheiff, Mary Wootters. [doi]
• Rectangle Tiling Binary ArraysPratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch 0001. [doi]
• Scheduling Splittable Jobs on Configurable MachinesMatthew Casey, Rajmohan Rajaraman, David Stalfa, Cheng Tan 0005. [doi]
• Online Time-Windows TSP with PredictionsShuchi Chawla 0001, Dimitris Christou. [doi]
• On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized SortingMayank Goswami 0001, Riko Jacob. [doi]
• On the Generalized Mean Densest Subgraph Problem: Complexity and AlgorithmsKarthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu. [doi]
• On the Houdré-Tetali Conjecture About an Isoperimetric Constant of GraphsLap Chi Lau, Dante Tjowasi. [doi]
• On the Amortized Complexity of Approximate CountingIshaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu. [doi]
• The Number of Random 2-SAT Solutions Is Asymptotically Log-NormalArnab Chatterjee, Amin Coja-Oghlan, Noëla Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov, Haodong Zhu. [doi]
• Faster Algorithms for Schatten-p Low Rank ApproximationPraneeth Kacham, David P. Woodruff. [doi]
• Improved Bounds for Graph Distances in Scale Free Percolation and Related ModelsKostas Lakis, Johannes Lengler, Kalina Petrova, Leon Schiller. [doi]
• When Can an Expander Code Correct Ω(n) Errors in O(n) Time?Kuan Cheng, Minghui Ouyang, Chong Shangguan, Yuanting Shen. [doi]
• On the Communication Complexity of Finding a King in a TournamentNikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh. [doi]
• Hilbert Functions and Low-Degree Randomness ExtractorsAlexander Golovnev, Zeyu Guo 0001, Pooya Hatami, Satyajeet Nagargoje, Chao Yan. [doi]
• Stochastic Distance in Property TestingUri Meir, Gregory Schwartzman, Yuichi Yoshida. [doi]
• Coboundary and Cosystolic Expansion Without Dependence on Dimension or DegreeYotam Dikstein, Irit Dinur. [doi]
• The Expander Hitting Property When the Sets Are Arbitrarily UnbalancedAmnon Ta-Shma, Ron Zadicario. [doi]
• A Logarithmic Approximation of Linearly-Ordered ColouringsJohan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný. [doi]
• Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large FieldsAshish Dwivedi, Zeyu Guo 0001, Ben lee Volk. [doi]
• Asynchronous Majority Dynamics on Binomial Random GraphsDivyarthi Mohan, Pawel Pralat. [doi]
• Competitive Query Minimization for Stable Matching with One-Sided UncertaintyEvripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan. [doi]
• Improved Streaming Algorithm for the Klee's Measure Problem and GeneralizationsMridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, Sourav Chakraborty 0001. [doi]
• A (3/2 + 1/e)-Approximation Algorithm for Ordered TSPSusanne Armbruster, Matthias Mnich, Martin Nägele. [doi]
• Weighted Matching in the Random-Order Streaming and Robust Communication ModelsDiba Hashemi, Weronika Wrzos-Kaminska. [doi]
• The Telephone k-Multicast ProblemDaniel Hathcock, Guy Kortsarz, R. Ravi 0001. [doi]
• Speed-Robust Scheduling RevisitedJosef Minarík, Jirí Sgall. [doi]
• Distributional Online Weighted Paging with Limited HorizonYaron Fairstein, Joseph (Seffi) Naor, Tomer Tsachor. [doi]
• Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube QueriesTomer Adar, Eldar Fischer, Amit Levi. [doi]
• Interactive Coding with Unbounded NoiseEden Fargion, Ran Gelles, Meghal Gupta. [doi]
• An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized RoundingIlan Doron Arad, Ariel Kulik, Hadas Shachnai. [doi]
• Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue 0003, Meirav Zehavi. [doi]
• Towards Simpler Sorting Networks and Monotone Circuits for MajorityNatalia Dobrokhotova-Maikova, Alexander Kozachinskiy, Vladimir V. Podolskii. [doi]
• Degrees and Network Design: New Problems and ApproximationsMichael Dinitz, Guy Kortsarz, Shi Li 0001. [doi]
• Expanderizing Higher Order Random WalksVedat Levi Alev, Shravas Rao. [doi]
• Approximating the Number of Relevant Variables in a Parity Implies Proper LearningNader H. Bshouty, George Haddad. [doi]