Table of Contents

• Binary Codes with Resilience Beyond 1/4 via InteractionKlim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang 0007. 1-12 [doi]
• Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size CircuitsRonen Shaltiel, Jad Silbak. 13-23 [doi]
• Relaxed Locally Decodable and Correctable Codes: Beyond TensoringGil Cohen, Tal Yankovitz. 24-35 [doi]
• Punctured Low-Bias Codes Behave Like Random Linear CodesVenkatesan Guruswami, Jonathan Mosheiff. 36-45 [doi]
• Classical Verification of Quantum Computations in Linear TimeJiayu Zhang. 46-57 [doi]
• Inapproximability of Positive Semidefinite Permanents and Quantum State TomographyAlexander Meiburg. 58-68 [doi]
• Verifiable Quantum Advantage without StructureTakashi Yamakawa, Mark Zhandry. 69-74 [doi]
• Properly learning monotone functions via local correctionJane Lange, Ronitt Rubinfeld, Arsen Vasilyan. 75-86 [doi]
• Testing Positive Semidefiniteness Using Linear MeasurementsDeanna Needell, William Swartworth, David P. Woodruff. 87-97 [doi]
• Improved Optimal Testing Results from Global HypercontractivityTali Kaufman, Dor Minzer. 98-109 [doi]
• Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract)Yuansi Chen, Ronen Eldan. 110-122 [doi]
• Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic IndependenceNima Anari, Yang P. Liu, Thuy Duong Vuong. 123-134 [doi]
• Optimal learning of quantum Hamiltonians from high-temperature Gibbs statesJeongwan Haah, Robin Kothari, Ewin Tang. 135-146 [doi]
• Sampling Lovász local lemma for general constraint satisfaction solutions in near-linear timeKun He, Chunyang Wang, Yitong Yin. 147-158 [doi]
• Pure-Circuit: Strong Inapproximability for PPADArgyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos. 159-170 [doi]
• Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time DesignBo Peng, Zhihao Gavin Tang. 171-178 [doi]
• 2 EfficientYaonan Jin, Pinyan Lu. 179-187 [doi]
• Simple Hard Instances for Low-Depth Algebraic ProofsNashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret. 188-199 [doi]
• Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuitsPranjal Dutta, Nitin Saxena 0001. 200-211 [doi]
• Radical Sylvester-Gallai Theorem for CubicsRafael Oliveira, Akash Kumar Sengupta. 212-220 [doi]
• Fast Multivariate Multipoint Evaluation Over All Finite FieldsVishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar 0001, Chris Umans. 221-232 [doi]
• Solving SDP Faster: A Robust IPM Framework and Efficient ImplementationBaihe Huang, Shunhua Jiang, Zhao Song 0002, Runzhou Tao, Ruizhe Zhang 0001. 233-244 [doi]
• Improved Lower Bounds for Submodular Function MinimizationDeeparnab Chakrabarty, Andrei Graur, Haotian Jiang, Aaron Sidford. 245-254 [doi]
• Determinant Maximization via Matroid Intersection AlgorithmsAdam Brown, Aditi Laddha, Madhusudhan Pittu, Mohit Singh, Prasad Tetali. 255-266 [doi]
• Interior point methods are not worse than SimplexXavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh. 267-277 [doi]
• Survivable Network Design Revisited: Group-ConnectivityQingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang 0001. 278-289 [doi]
• Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest CyclesMina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein. 290-300 [doi]
• Fitting Metrics and Ultrametrics with Minimum DisagreementsVincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay. 301-311 [doi]
• Tight Lipschitz Hardness for optimizing Mean Field Spin GlassesBrice Huang, Mark Sellke. 312-322 [doi]
• Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localizationAhmed El Alaoui, Andrea Montanari, Mark Sellke. 323-334 [doi]
• Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass modelsJoao Basso, David Gamarnik, Song Mei, Leo Zhou. 335-343 [doi]
• Algorithms for the ferromagnetic Potts model on expandersCharlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap. 344-355 [doi]
• On Matrix Multiplication and Polynomial Identity TestingRobert Andrews. 356-365 [doi]
• Cheeger Inequalities for Vertex Expansion and Reweighted EigenvaluesTsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung. 366-377 [doi]
• Almost Ramanujan Expanders from Arbitrary Expanders via Operator AmplificationFernando Granha Jeronimo, Tushant Mittal, Sourya Roy, Avi Wigderson. 378-388 [doi]
• Motif Cut SparsifiersMichael Kapralov, Mikhail Makarov, Sandeep Silwal, Christian Sohler, Jakab Tardos. 389-398 [doi]
• *Harm Derksen, Emanuele Viola. 399-406 [doi]
• Derandomizing Directed Random Walks in Almost-Linear TimeRasmus Kyng, Simon Meierhans, Maximilian Probst. 407-418 [doi]
• Linear Hashing with ℓ∞ guarantees and two-sided Kakeya boundsManik Dhar, Zeev Dvir. 419-428 [doi]
• Unstructured Hardness to Average-Case RandomnessLijie Chen 0001, Ron D. Rothblum, Roei Tell. 429-437 [doi]
• Local Computation of Maximal Independent SetMohsen Ghaffari 0001. 438-449 [doi]
• Streaming Facility Location in High Dimension via Geometric HashingArtur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý 0001, MingWei Yang. 450-461 [doi]
• The Power of Uniform Sampling for CoresetsVladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu 0002. 462-473 [doi]
• On Weighted Graph Sparsification by Linear SketchingYu Chen, Sanjeev Khanna, Huan Li. 474-485 [doi]
• Factorial Lower Bounds for (Almost) Random Order StreamsAshish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price 0001. 486-497 [doi]
• The Quantum and Classical Streaming Complexity of Quantum and Classical Max-CutJohn Kallaugher, Ojas Parekh. 498-506 [doi]
• Cut Query Algorithms with Star ContractionSimon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai. 507-518 [doi]
• Memory Bounds for Continual LearningXi Chen, Christos H. Papadimitriou, Binghui Peng. 519-530 [doi]
• Induced Cycles and Paths Are Harder Than You ThinkMina Dalirrooyfard, Virginia Vassilevska Williams. 531-542 [doi]
• Hardness Self-Amplification from Feasible Hard-Core SetsShuichi Hirahara, Nobutaka Shimizu. 543-554 [doi]
• A tight (non-combinatorial) conditional lower bound for Klee's Measure Problem in 3DMarvin Künnemann. 555-566 [doi]
• Sparse random hypergraphs: Non-backtracking spectra and community detectionLudovic Stephan, Yizhe Zhu. 567-575 [doi]
• Algorithms and Barriers in the Symmetric Binary Perceptron ModelDavid Gamarnik, Eren C. Kizildag, Will Perkins 0001, Changji Xu. 576-587 [doi]
• Optimal mixing for two-state anti-ferromagnetic spin systemsXiaoyu Chen, Weiming Feng 0001, Yitong Yin, Xinyuan Zhang. 588-599 [doi]
• Negative-Weight Single-Source Shortest Paths in Near-linear TimeAaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen. 600-611 [doi]
• Maximum Flow and Minimum-Cost Flow in Almost-Linear TimeLi Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva. 612-623 [doi]
• Randomised Composition and Small-Bias MinimaxShalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre. 624-635 [doi]
• A Proof of the Kahn-Kalai ConjectureJinyoung Park, Huy Tuan Pham. 636-639 [doi]
• On the Range Avoidance Problem for CircuitsHanlin Ren, Rahul Santhanam, Zhikun Wang. 640-650 [doi]
• Correlation Clustering with Sherali-AdamsVincent Cohen-Addad, Euiwoong Lee, Alantha Newman. 651-661 [doi]
• Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-SquaresMax Hopkins, Ting-Chun Lin. 662-673 [doi]
• Gap Edit Distance via Non-Adaptive Queries: Simple and OptimalElazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha. 674-685 [doi]
• Õ(n+poly(k))-time Algorithm for Bounded Tree Edit DistanceDebarati Das 0001, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh. 686-697 [doi]
• Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation MatricesPanagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz. 698-707 [doi]
• Estimating the Longest Increasing Subsequence in Nearly Optimal TimeAlexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein 0001. 708-719 [doi]
• Almost 3-Approximate Correlation Clustering in Constant RoundsSoheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan. 720-731 [doi]
• High-Dimensional Geometric Streaming in Polynomial SpaceDavid P. Woodruff, Taisuke Yasuda 0002. 732-743 [doi]
• Active Linear Regression for ℓp Norms and BeyondCameron Musco, Christopher Musco, David P. Woodruff, Taisuke Yasuda 0002. 744-753 [doi]
• Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest SubgraphsLaxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, Shangdi Yu. 754-765 [doi]
• Having Hope in Hops: New Spanners, Preservers and Lower Bounds for HopsetsShimon Kogan, Merav Parter. 766-777 [doi]
• New Additive Spanner Lower Bounds by an Unlayered Obstacle ProductGreg Bodwin, Gary Hoppenworth. 778-788 [doi]
• Deterministic Small Vertex Connectivity in Almost Linear TimeThatchaphol Saranurak, Sorrachai Yingchareonthawornchai. 789-800 [doi]
• Balanced Allocations: The Heavily Loaded Case with DeletionsNikhil Bansal 0001, William Kuszmaul. 801-812 [doi]
• Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed SensingNamiko Matsumoto, Arya Mazumdar. 813-822 [doi]
• Minimax Rates for Robust Community DetectionAllen Liu, Ankur Moitra. 823-831 [doi]
• A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSPAnna Karlin, Nathan Klein, Shayan Oveis Gharan. 832-843 [doi]
• Generalised entropy accumulationTony Metger, Omar Fawzi, David Sutter, Renato Renner. 844-850 [doi]
• Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding UndetectablyAlex Lombardi, Fermi Ma, Nicholas Spooner. 851-859 [doi]
• What is in #P and what is not?Christian Ikenmeyer, Igor Pak. 860-871 [doi]
• Quantum Tanner codesAnthony Leverrier, Gilles Zémor. 872-883 [doi]
• Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic TimeAmir Abboud, Robert Krauthgamer, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi. 884-895 [doi]
• Constant Approximation of Min-Distances in Near-Linear TimeShiri Chechik, Tianyi Zhang. 896-906 [doi]
• Algorithms and Lower Bounds for Replacement Paths under Multiple Edge FailureVirginia Vassilevska Williams, Eyob Woldeghebriel, Yinzhan Xu. 907-918 [doi]
• Solving the Hamilton cycle problem fast on averageMichael Anastos. 919-930 [doi]
• Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir. 931-942 [doi]
• A Characterization of Multiclass LearnabilityNataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff. 943-955 [doi]
• Polynomial-Time Power-Sum Decomposition of PolynomialsMitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff Xu. 956-967 [doi]
• NP-Hardness of Learning Programs and Partial MCSPShuichi Hirahara. 968-979 [doi]
• 2n BarrierMichael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein. 980-990 [doi]
• A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random BitsWilliam Kuszmaul. 991-1001 [doi]
• Near-Optimal Deterministic Vertex-Failure Connectivity OraclesYaowei Long, Thatchaphol Saranurak. 1002-1010 [doi]
• Fast Deterministic Fully Dynamic Distance ApproximationJan van den Brand, Sebastian Forster, Yasamin Nazari. 1011-1022 [doi]
• Indistinguishability Obfuscation via Mathematical Proofs of EquivalenceAbhishek Jain 0002, Zhengzhong Jin. 1023-1034 [doi]
• Geometry of Secure Two-party ComputationSaugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen. 1035-1044 [doi]
• Incrementally Verifiable Computation via Rate-1 Batch ArgumentsOmer Paneth, Rafael Pass. 1045-1056 [doi]
• Rate-1 Non-Interactive Arguments for Batch-NP and ApplicationsLalita Devadas, Rishab Goyal, Yael Kalai, Vinod Vaikuntanathan. 1057-1068 [doi]
• Killing a vortexDimitrios M. Thilikos, Sebastian Wiederrecht. 1069-1080 [doi]
• Low Treewidth Embeddings of Planar and Minor-Free MetricsArnold Filtser, Hung Le. 1081-1092 [doi]
• An Approximate Generalization of the Okamura-Seymour TheoremNikhil Kumar. 1093-1101 [doi]
• Shortest Paths without a Map, but with an Entropic RegularizerSébastien Bubeck, Christian Coester, Yuval Rabani. 1102-1113 [doi]
• Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel ApplicationsVáclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler. 1114-1121 [doi]
• Computing in Anonymous Dynamic Networks Is LinearGiuseppe Antonio Di Luna, Giovanni Viglietta. 1122-1133 [doi]
• The Implicit Graph Conjecture is FalseHamed Hatami, Pooya Hatami. 1134-1137 [doi]
• On Bounded Depth Proofs for Tseitin Formulas on the Grid; RevisitedJohan Håstad, Kilian Risse. 1138-1149 [doi]
• Separations in Proof Complexity and TFNPMika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao. 1150-1161 [doi]
• Continuous LWE is as Hard as LWE & Applications to Learning Gaussian MixturesAparna Gupte, Neekon Vafa, Vinod Vaikuntanathan. 1162-1173 [doi]
• Nearly Optimal Communication and Query Complexity of Bipartite MatchingJoakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai. 1174-1185 [doi]
• Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract)Huacheng Yu. 1186-1192 [doi]
• Rounds vs Communication Tradeoffs for Maximal Independent SetsSepehr Assadi, Gillat Kol, Zhijun Zhang 0007. 1193-1204 [doi]
• Tight Bounds for Quantum State Certification with Incoherent MeasurementsSitan Chen, Jerry Li 0001, Brice Huang, Allen Liu. 1205-1213 [doi]