Table of Contents

• Eigenvalue Bounds for Symmetric Markov Chains on Multislices with ApplicationsPrashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan 0001, Madhu Sudan 0001. [doi]
• Testing Tensor Products of Algebraic CodesSumegha Garg, Madhu Sudan 0001, Gabriel Wu. [doi]
• Multipass Linear Sketches for Geometric LP-Type ProblemsN. Efe Çekirge, William Gay, David P. Woodruff. [doi]
• A Randomized Rounding Approach for DAG Edge DeletionSina Kalantarzadeh, Nathan Klein, Victor Reis. [doi]
• Algorithmic Contiguity from Low-Degree Conjecture and Applications in Correlated Random GraphsZhangsong Li. [doi]
• Triangles Improve 0.878 Approximation for MaxcutFredie George, Anand Louis, Rameesh Paul. [doi]
• Fooling Near-Maximal Decision TreesWilliam M. Hoza, Zelin Lv. [doi]
• Covering Simple Orthogonal Polygons with RectanglesAniket Basu Roy. [doi]
• Solving Linear Programs with Differential PrivacyAlina Ene, Huy Le Nguyen, Ta Duy Nguyen, Adrian Vladu. [doi]
• List-Recovery of Random Linear Codes over Small FieldsDean Doron, Jonathan Mosheiff, Nicolas Resch, João Ribeiro 0002. [doi]
• Structured-Seed Local Pseudorandom Generators and Their ApplicationsBenny Applebaum, Dung Bui, Geoffroy Couteau, Nikolas Melissaris. [doi]
• Quantum Property Testing in Sparse Directed GraphsSimon Apers, Frédéric Magniez, Sayantan Sen, Dániel Szabó. [doi]
• Permanental Rank vs Determinantal Rank of Random Matrices over Finite FieldsFatemeh Ghasemi, Gal Gross, Swastik Kopparty. [doi]
• On Finding Randomly Planted Cliques in Arbitrary GraphsFrancesco Agrimonti, Marco Bressan 0002, Tommaso d'Orsi. [doi]
• Consumable Data via Quantum CommunicationDar Gilboa, Siddhartha Jain 0002, Jarrod R. McClean. [doi]
• Pseudorandomness of Expander Walks via Fourier Analysis on GroupsFernando Granha Jeronimo, Tushant Mittal, Sourya Roy. [doi]
• Maximum And- vs. Even-SATTamio-Vesa Nakajima, Stanislav Zivný. [doi]
• Equality Is Far Weaker Than Constant-Cost CommunicationMika Göös, Nathaniel Harms, Artur Riazanov. [doi]
• Near-Optimal List-Recovery of Linear Code FamiliesRay Li, Nikhil Shagrithaya. [doi]
• Streaming Algorithms for Network DesignChandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian. [doi]
• Gabidulin Codes Achieve List Decoding Capacity with an Order-Optimal Column-To-Row RatioZeyu Guo 0001, Chaoping Xing, Chen Yuan 0003, Zihan Zhang 0001. [doi]
• Low-Degree Polynomials Are Good ExtractorsOmar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro 0002. [doi]
• Non-Adaptive Evaluation of k-of- n Functions: Tight Gap and a Unit-Cost PTASMads Anker Nielsen, Lars Rohwedder, Kevin Schewior. [doi]
• Dual Charging for Half-Integral TSPNathan Klein, Mehrshad Taziki. [doi]
• Efficient Parallel Ising Samplers via Localization SchemesXiaoyu Chen, Hongyang Liu, Yitong Yin, Xinyuan Zhang. [doi]
• Lifting to Randomized Parity Decision TreesFarzan Byramji, Russell Impagliazzo. [doi]
• QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and MoreYanlin Chen, Yilei Chen, Rajendra Kumar 0002, Subhasree Patro, Florian Speelman. [doi]
• A Polynomial-Time Approximation Algorithm for Complete Interval MinorsRomain Bourneuf, Julien Cocquet, Chaoliang Tang, Stéphan Thomassé. [doi]
• Budget and Profit Approximations for Spanning Tree InterdictionRafail Ostrovsky, Yuval Rabani, Yoav Siman Tov. [doi]
• Simplifying Armoni's PRGBen Chen, Amnon Ta-Shma. [doi]
• Density Frankl-Rödl on the SphereVenkatesan Guruswami, Shilun Li. [doi]
• Shared Randomness in Locally Checkable Problems: The Role of Computational AssumptionsAdar Hadad, Moni Naor. [doi]
• Bit-Fixing Extractors for Almost-Logarithmic EntropyDean Doron, Ori Fridman. [doi]
• Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SATAditya Anand 0001, Euiwoong Lee, Davide Mazzali, Amatya Sharma. [doi]
• Sink-Free Orientations: A Local Sampler with ApplicationsKonrad Anand, Graham Freifeld, Heng Guo 0001, Chunyang Wang 0003, Jiaheng Wang 0002. [doi]
• Sublinear Space Graph Algorithms in the Continual Release ModelAlessandro Epasto, Quanquan C. Liu, Tamalika Mukherjee, Felix Zhou 0002. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Approximation Schemes for Orienteering and Deadline TSP in Doubling MetricsKinter Ren, Mohammad R. Salavatipour. [doi]
• What Is the Minimum Number of Random Bits Required for Computability and Efficiency in Anonymous Networks?Dariusz R. Kowalski, Piotr Krysta, Shay Kutten. [doi]
• Sharp Thresholds for the Overlap Gap Property: Ising p-Spin Glass and Random k-SATEren C. Kizildag. [doi]
• Tarski Lower Bounds from Multi-Dimensional HerringbonesSimina Brânzei, Reed C. Phillips, Nicholas J. Recker. [doi]
• A Simplified Reduction for Error Correcting Matrix Multiplication AlgorithmsIgor Shinkar, Harsimran Singh. [doi]
• Time Lower Bounds for the Metropolis Process and Simulated AnnealingZongchen Chen, Dan Mikulincer, Daniel Reichman 0001, Alexander S. Wein. [doi]
• Rapid Mixing via Coupling Independence for Spin Systems with Unbounded DegreeXiaoyu Chen, Weiming Feng 0001. [doi]
• Improved Mixing of Critical Hardcore ModelZongchen Chen, Tianhui Jiang. [doi]
• Searching for Falsified Clause in Random (log{n})-CNFs Is Hard for Randomized CommunicationArtur Riazanov, Anastasia Sofronova, Dmitry Sokolov 0001, Weiqiang Yuan 0002. [doi]
• On the Spectral Expansion of Monotone Subsets of the HypercubeYumou Fei, Renato Ferreira Pinto Jr.. [doi]
• Efficient Polynomial Identity Testing over Nonassociative AlgebrasPartha Mukhopadhyay, C. Ramya, Pratik Shastri. [doi]
• Local Computation Algorithms for Knapsack: Impossibility Results, and How to Avoid ThemClément L. Canonne, Yun Li, Seeun William Umboh. [doi]
• Improved Approximation Guarantees for Advertisement PlacementWaldo Gálvez, Roberto Oliva, Victor Verdugo. [doi]
• New Constructions of Pseudorandom CodesSurendra Ghentiyala, Venkatesan Guruswami. [doi]
• Relational Approximations for Subspace PrimitivesXiang Liu, Kasturi R. Varadarajan. [doi]
• New Statistical and Computational Results for Learning Junta DistributionsLorenzo Beretta 0001. [doi]
• Directed Buy-At-Bulk SpannersElena Grigorescu, Nithish Kumar, Young-San Lin. [doi]
• Sparsest Cut and Eigenvalue Multiplicities on Low Degree Abelian Cayley GraphsTommaso d'Orsi, Chris Jones, Jake Ruotolo, Salil P. Vadhan, Jiyu Zhang. [doi]
• Improved Lower Bounds on Multiflow-Multicut GapsSina Kalantarzadeh, Nikhil Kumar 0001. [doi]
• Implications of Better PRGs for Permutation Branching ProgramsDean Doron, William M. Hoza. [doi]
• Avoiding Range via Turan-Type BoundsNeha Kuntewar, Jayalal Sarma. [doi]
• Approximating Maximum Cut on Interval Graphs and Split Graphs Beyond Goemans-WilliamsonJungho Ahn, Ian DeHaan, Eun Jung Kim 0002, Euiwoong Lee. [doi]
• Optimal Competitive Ratio for Optimization Problems with Congestion EffectsMiriam Fischer, Dario Paccagnan, Cosimo Vinci. [doi]
• Improved Approximation Algorithms for the EPR HamiltonianNathan Ju, Ansh Nagda. [doi]
• On Sums of INW Pseudorandom GeneratorsWilliam M. Hoza, Zelin Lv. [doi]
• Spectral Refutations of Semirandom k-LIN over Larger FieldsNicholas Kocurek, Peter Manohar. [doi]
• Testing Isomorphism of Boolean Functions over Finite Abelian GroupsSwarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manaswi Paraashar, Manmatha Roy. [doi]
• Covering a Few Submodular Constraints and ApplicationsTanvi Bajpai, Chandra Chekuri, Pooja Kulkarni. [doi]
• A Fast Coloring Oracle for Average Case HypergraphsCassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Asaf Shapira, Shlomo Tauber. [doi]
• Max-Cut with Multiple Cardinality ConstraintsYury Makarychev, Madhusudhan Reddy Pittu, Ali Vakilian. [doi]
• Improved FPT Approximation for Sum of Radii Clustering with Mergeable ConstraintsSayan Bandyapadhyay, Tianzhi Chen. [doi]
• On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction ProblemsIan DeHaan, Neng Huang, Euiwoong Lee. [doi]