Table of Contents

• Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight UpdatesSayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak. 1-47 [doi]
• Maintaining Expander Decompositions via Sparse CutsYiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu. 48-69 [doi]
• Fully Dynamic Exact Edge Connectivity in Sublinear TimeGramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak, Mikkel Thorup, Christian Wulff-Nilsen. 70-86 [doi]
• Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest PathsShiri Chechik, Tianyi Zhang. 87-99 [doi]
• Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update TimeSayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc. 100-128 [doi]
• Dynamic Algorithms for Maximum Matching SizeSoheil Behnezhad. 129-162 [doi]
• Closing the Gap Between Directed Hopsets and Shortcut SetsAaron Bernstein, Nicole Wein. 163-182 [doi]
• k-Edge-Connected Subgraphs in Weighted Graphs via Local Random ContractionChaitanya Nalam, Thatchaphol Saranurak. 183-211 [doi]
• Faster and Unified Algorithms for Diameter Reducing Shortcuts and Minimum Chain CoversShimon Kogan, Merav Parter. 212-239 [doi]
• Near-Linear Time Approximations for Cut Problems via Fair CutsJason Li 0006, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak. 240-275 [doi]
• Fast Discrepancy Minimization with Hereditary GuaranteesKasper Green Larsen. 276-289 [doi]
• A tight quasi-polynomial bound for Global Label Min-CutLars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza. 290-303 [doi]
• Fair allocation of a multiset of indivisible itemsPranay Gorantla, Kunal Marwaha, Santhoshini Velusamy. 304-331 [doi]
• The Price of Stability for First Price AuctionYaonan Jin, Pinyan Lu. 332-352 [doi]
• Competitive Information Design for Pandora's BoxBolin Ding, Yiding Feng, Chien-Ju Ho, Wei Tang, Haifeng Xu. 353-381 [doi]
• Optimal Pricing Schemes for an Impatient BuyerYuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang. 382-398 [doi]
• Pricing Query Complexity of Revenue MaximizationRenato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah. 399-415 [doi]
• Interdependent Public ProjectsAvi Cohen, Michal Feldman, Divyarthi Mohan, Inbal Talgam-Cohen. 416-443 [doi]
• Stronger 3SUM-Indexing Lower BoundsEldon Chung, Kasper Green Larsen. 444-455 [doi]
• Tight Bounds for Monotone Minimal Perfect HashingSepehr Assadi, Martin Farach-Colton, William Kuszmaul. 456-476 [doi]
• Tiny PointersMichael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini. 477-508 [doi]
• Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix DecompositionParinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai. 509-534 [doi]
• A Nearly-Tight Analysis of Multipass Pairing HeapsCorwin Sinnamon, Robert E. Tarjan. 535-548 [doi]
• A Tight Analysis of Slim Heaps and Smooth HeapsCorwin Sinnamon, Robert E. Tarjan. 549-567 [doi]
• Hierarchies of Minion Tests for PCSPs through TensorsLorenzo Ciardo, Stanislav Zivný. 568-580 [doi]
• Short Synchronizing Words for Random AutomataGuillaume Chapuy, Guillem Perarnau. 581-604 [doi]
• Approximate Trace Reconstruction from a Single TraceXi Chen 0001, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha. 605-637 [doi]
• Sharp threshold sequence and universality for Ising perceptron modelsShuta Nakajima, Nike Sun. 638-674 [doi]
• On complex roots of the independence polynomialFerenc Bencs, Péter Csikvári, Piyush Srivastava 0001, Jan Vondrák. 675-699 [doi]
• n) over all Finite FieldsEli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit. 700-737 [doi]
• Low Degree Testing over the RealsVipul Arora 0002, Arnab Bhattacharyya 0001, Noah Fleming, Esty Kelman, Yuichi Yoshida. 738-792 [doi]
• Streaming algorithms for the missing item finding problemManuel Stoeckl. 793-818 [doi]
• Single-Pass Streaming Algorithms for Correlation ClusteringSoheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan. 819-849 [doi]
• p-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector MachinesYi Li 0002, Honghao Lin, David P. Woodruff. 850-877 [doi]
• Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-CutLijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song 0002, Huacheng Yu. 878-924 [doi]
• Learning Hierarchical Cluster Structure of Graphs in Sublinear TimeMichael Kapralov, Akash Kumar 0009, Silvio Lattanzi, Aida Mousavifar. 925-939 [doi]
• k-MedianVincent Cohen-Addad, Fabrizio Grandoni 0001, Euiwoong Lee, Chris Schwiegelshohn. 940-986 [doi]
• k-MedianKishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh. 987-1011 [doi]
• A Nearly Tight Analysis of Greedy k-means++Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek. 1012-1070 [doi]
• On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location ProblemMong-Jen Kao. 1071-1089 [doi]
• k-Set PackingMeike Neuwohner. 1090-1137 [doi]
• k-Set PackingTheophile Thiery, Justin Ward. 1138-1162 [doi]
• Testing and Learning Quantum Juntas Nearly OptimallyThomas Chen, Shivam Nadimpalli, Henry Yuen. 1163-1185 [doi]
• Mean estimation when you have the source code; or, quantum Monte Carlo methodsRobin Kothari, Ryan O'Donnell. 1186-1215 [doi]
• Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codesAnthony Leverrier, Gilles Zémor. 1216-1244 [doi]
• A Sublinear-Time Quantum Algorithm for Approximating Partition FunctionsArjan Cornelissen, Yassine Hamoudi. 1245-1264 [doi]
• Quantum tomography using state-preparation unitariesJoran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini. 1265-1318 [doi]
• Unique Games hardness of Quantum Max-Cut, and a conjectured vector-valued Borell's inequalityYeongwoo Hwang, Joe Neeman, Ojas Parekh, Kevin Thompson 0007, John Wright. 1319-1384 [doi]
• Halving by a Thousand Cuts or PuncturesSariel Har-Peled, Da-Wei Zheng. 1385-1397 [doi]
• On the Number of Incidences When Avoiding an Induced Biclique in Geometric SettingsTimothy M. Chan, Sariel Har-Peled. 1398-1413 [doi]
• Curve Simplification and Clustering under Fréchet DistanceSiu-Wing Cheng, Haoqiang Huang. 1414-1432 [doi]
• Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman ToursFrançois Dross, Krzysztof Fleszar 0001, Karol Wegrzycki, Anna Zych-Pawlewicz. 1433-1463 [doi]
• Map matching queries on realistic input graphs under the Fréchet distanceJoachim Gudmundsson, Martin P. Seybold, Sampson Wong. 1464-1492 [doi]
• Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data StructuresTimothy M. Chan, Da-Wei Zheng. 1493-1511 [doi]
• Player-optimal Stable Regret for Bandit Learning in Matching MarketsFang Kong 0002, Shuai Li 0010. 1512-1522 [doi]
• Almost Tight Bounds for Online Facility Location in the Random-Order ModelHaim Kaplan, David Naori, Danny Raz. 1523-1544 [doi]
• Online Min-Max PagingAshish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch. 1545-1565 [doi]
• p NormsThomas Kesselheim, Marco Molinaro 0001, Sahil Singla 0001. 1566-1593 [doi]
• The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with DelayNgoc Mai Le, Seeun William Umboh, Ningyuan Xie. 1594-1610 [doi]
• Online Prediction in Sub-linear SpaceBinghui Peng, Fred Zhang. 1611-1634 [doi]
• The Exact Bipartite Matching Polytope Has Exponential Extension ComplexityXinrui Jia 0001, Ola Svensson, Weiqiang Yuan 0002. 1635-1654 [doi]
• Shrunk subspaces via operator Sinkhorn iterationCole Franks, Tasuku Soma, Michel X. Goemans. 1655-1668 [doi]
• Small Shadows of Lattice PolytopesAlexander E. Black. 1669-1679 [doi]
• A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular FunctionTsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu. 1680-1691 [doi]
• Integrality Gaps for Random Integer Programs via DiscrepancySander Borst, Daniel Dadush, Dan Mikulincer. 1692-1733 [doi]
• Discrepancy Minimization via RegularizationLucas Pesenti, Adrian Vladu. 1734-1758 [doi]
• ε-approximation for the Continuous Fréchet DistanceThijs van der Horst, Marc J. van Kreveld, Tim Ophelders, Bettina Speckmann. 1759-1776 [doi]
• Finding Triangles and Other Small Subgraphs in Geometric Intersection GraphsTimothy M. Chan. 1777-1805 [doi]
• Online Sorting and Translational Packing of Convex PolygonsAnders Aamand, Mikkel Abrahamsen, Lorenzo Beretta 0001, Linda Kleist. 1806-1833 [doi]
• Economical Convex Coverings and ApplicationsSunil Arya, Guilherme Dias da Fonseca, David M. Mount. 1834-1861 [doi]
• 4D Range Reporting in the Pointer Machine Model in Almost-Optimal TimeYakov Nekrich, Saladi Rahul. 1862-1876 [doi]
• Approximate Distance Oracles for Planar Graphs with Subpolynomial Error DependencyHung Le. 1877-1904 [doi]
• Minimizing Completion Times for Stochastic Jobs via Batched Free TimesAnupam Gupta 0001, Benjamin Moseley, Rudy Zhou. 1905-1930 [doi]
• Beating (1 - 1/e)-Approximation for Weighted Stochastic MatchingMahsa Derakhshan, Alireza Farhadi 0001. 1931-1961 [doi]
• Superpolynomial lower bounds for decision tree learning and testingCaleb Koch, Carmen Strassle, Li-Yang Tan. 1962-1994 [doi]
• On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) GraphsCalum MacRury, Will Ma, Nathaniel Grammel. 1995-2014 [doi]
• Secretary Problems: The Power of a Single SamplePranav Nuti, Jan Vondrák. 2015-2029 [doi]
• Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)Niv Buchbinder, Joseph (Seffi) Naor, David Wajc. 2030-2068 [doi]
• Packing cycles in planar and bounded-genus graphsNiklas Schlomberg, Hanjo Thiele, Jens Vygen. 2069-2086 [doi]
• Computing Square Colorings on Bounded-Treewidth and Planar GraphsAkanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek. 2087-2110 [doi]
• Excluding Single-Crossing Matching Minors in Bipartite GraphsArchontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht. 2111-2121 [doi]
• A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut ProblemsJulia Chuzhoy. 2122-2213 [doi]
• Shortest Cycles With Monotone Submodular CostsFedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis. 2214-2227 [doi]
• A Framework for Approximation Schemes on Disk GraphsDaniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Jie Xue 0003, Meirav Zehavi. 2228-2241 [doi]
• Improved girth approximation in weighted undirected graphsAvi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick. 2242-2255 [doi]
• Approximate Graph Colouring and CrystalsLorenzo Ciardo, Stanislav Zivný. 2256-2267 [doi]
• Weisfeiler-Leman and Graph SpectraGaurav Rattan, Tim Seppelt. 2268-2285 [doi]
• Fast algorithms for solving the Hamilton Cycle problem with high probabilityMichael Anastos. 2286-2323 [doi]
• A simple and sharper proof of the hypergraph Moore boundJun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty. 2324-2344 [doi]
• Small subgraphs with large average degreeOliver Janzer, Benny Sudakov, István Tomon. 2345-2353 [doi]
• Exact Flow Sparsification Requires Unbounded SizeRobert Krauthgamer, Ron Mosenzon. 2354-2367 [doi]
• Improved Approximation for Two-Edge-ConnectivityMohit Garg 0003, Fabrizio Grandoni 0001, Afrouz Jabal Ameli. 2368-2410 [doi]
• Timeliness Through Telephones: Approximating Information Freshness in Vector Clock ModelsDa Qi Chen, Lin An, Aidin Niaparast, R. Ravi 0001, Oleksandr Rudenko. 2411-2428 [doi]
• Approximation Algorithms for Steiner Tree Augmentation ProblemsR. Ravi 0001, Weizhong Zhang, Michael Zlatin. 2429-2448 [doi]
• Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum FlowsRuoxu Cen, William He, Jason Li 0006, Debmalya Panigrahi. 2449-2488 [doi]
• Faster Computation of 3-Edge-Connected Components in DigraphsLoukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis. 2489-2531 [doi]
• Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via DerandomizationMohsen Ghaffari 0001, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon. 2532-2566 [doi]
• Fast Distributed Brooks' TheoremManuela Fischer, Magnús M. Halldórsson, Yannic Maus. 2567-2588 [doi]
• Optimal Deterministic Massively Parallel Connectivity on ForestsAlkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto. 2589-2631 [doi]
• Distributed Maximal Matching and Maximal Independent Set on HypergraphsAlkida Balliu, Sebastian Brandt 0002, Fabian Kuhn, Dennis Olivetti. 2632-2676 [doi]
• k-Center Clustering for Adaptive and Oblivious AdversariesMohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese. 2677-2727 [doi]
• A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander GraphsLawrence Li, Sushant Sachdeva. 2728-2745 [doi]
• The complete classification for quantified equality constraintsDmitriy Zhuk, Barnaby Martin, Michal Wrona. 2746-2760 [doi]
• Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube TestDor Minzer, Kai Zheng. 2761-2776 [doi]
• Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-CompleteStefan Göller, Pawel Parys. 2777-2815 [doi]
• Algorithmizing the Multiplicity Schwartz-Zippel LemmaSiddharth Bhandari, Prahladh Harsha, Mrinal Kumar 0001, Ashutosh Shankar. 2816-2835 [doi]
• Query Complexity of Inversion Minimization on TreesIvan Hu, Dieter van Melkebeek, Andrew Morgan. 2836-2866 [doi]
• Efficient resilient functionsPeter Ivanov, Raghu Meka, Emanuele Viola. 2867-2874 [doi]
• Improved Integrality Gap in Max-Min Allocation: or Topology at the North PolePenny Haxell, Tibor Szabó. 2875-2897 [doi]
• Generalized Unrelated Machine Scheduling ProblemShichuan Deng, Jian Li 0015, Yuval Rabani. 2898-2916 [doi]
• Improved Approximations for Unrelated Machine SchedulingSungjin Im, Shi Li 0001. 2917-2946 [doi]
• On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPsKim-Manuel Klein, Adam Polak 0001, Lars Rohwedder. 2947-2960 [doi]
• Approximating Knapsack and Partition via Dense Subset SumsMingyang Deng, Ce Jin, Xiao Mao. 2961-2979 [doi]
• On Problems Related to Unbounded SubsetSum: A Unified Combinatorial ApproachMingyang Deng, Xiao Mao, Ziqian Zhong. 2980-2990 [doi]
• Conflict-free hypergraph matchingsStefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev. 2991-3005 [doi]
• Sparse graphs with bounded induced cycle packing number have logarithmic treewidthMarthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek. 3006-3028 [doi]
• Zigzagging through acyclic orientations of chordal graphs and hypergraphsJean Cardinal, Hung Phuc Hoang, Arturo I. Merino, Torsten Mütze. 3029-3042 [doi]
• A half-integral Erdős-Pósa theorem for directed odd cyclesKen-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon, Qiqin Xie. 3043-3062 [doi]
• Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced SubgraphsPeter Gartland, Daniel Lokshtanov. 3063-3097 [doi]
• Graph Classes with Few Minimal Separators. II. A DichotomyPeter Gartland, Daniel Lokshtanov. 3098-3178 [doi]
• Almost Consistent Systems of Linear EquationsKonrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström. 3179-3217 [doi]
• Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraintsEun Jung Kim 0002, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström. 3218-3228 [doi]
• Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentationMeike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge. 3229-3244 [doi]
• Polynomial formulations as a barrier for reduction-based hardness proofsTatiana Belova, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Denil Sharipov. 3245-3281 [doi]
• A logic-based algorithmic meta-theorem for mim-widthBenjamin Bergougnoux, Jan Dreier, Lars Jaffke. 3282-3304 [doi]
• k-SETCOVER is W[2]-hardBingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang. 3305-3316 [doi]
• Subexponential mixing for partition chains on grid-like graphsAlan M. Frieze, Wesley Pegden. 3317-3329 [doi]
• Improved Bounds for Sampling Solutions of Random CNF FormulasKun He 0011, Kewen Wu 0001, Kuan Yang. 3330-3361 [doi]
• Moser-Tardos Algorithm: Beyond Shearer's BoundKun He 0011, Qian Li 0012, Xiaoming Sun. 3362-3387 [doi]
• Deterministic counting Lovász local lemma beyond linear programmingKun He 0011, Chunyang Wang, Yitong Yin. 3388-3425 [doi]
• Instability of backoff protocols with arbitrary arrival ratesLeslie Ann Goldberg, John Lapinskas. 3426-3436 [doi]
• k-SATZongchen Chen, Nitya Mani. 3437-3470 [doi]
• Robust Voting Rules from Algorithmic Robust StatisticsAllen Liu, Ankur Moitra. 3471-3512 [doi]
• Higher degree sum-of-squares relaxations robust against oblivious outliersTommaso d'Orsi, Rajai Nasser, Gleb Novikov, David Steurer. 3513-3550 [doi]
• Non-Stochastic CDF Estimation Using Threshold QueriesPrincewill Okoroafor, Vaishnavi Gupta, Robert Kleinberg. 3551-3572 [doi]
• Positivity of the symmetric group characters is as hard as the polynomial time hierarchyChristian Ikenmeyer, Igor Pak, Greta Panova. 3573-3586 [doi]
• Interactive Coding with Small MemoryKlim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena. 3587-3613 [doi]
• Concentration of polynomial random matrices via Efron-Stein inequalitiesGoutham Rajendran, Madhur Tulsiani. 3614-3653 [doi]
• Kernelization for Graph Packing Problems via Rainbow MatchingStéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht. 3654-3663 [doi]
• Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth GraphsJacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz. 3664-3683 [doi]
• Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph ClassesPetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. 3684-3699 [doi]
• Fixed-Parameter Tractability of Maximum Colored Path and BeyondFedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis. 3700-3712 [doi]
• k-Weight SAT and Max CoveragePallavi Jain 0001, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh 0001, Anannya Upasana. 3713-3733 [doi]
• nKyungjin Cho, Eunjin Oh 0001, Seunghyeok Oh. 3734-3758 [doi]
• "Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online SettingsTomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang. 3759-3776 [doi]
• A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix GamesArgyrios Deligkas, Michail Fasoulakis, Evangelos Markakis. 3777-3787 [doi]
• Bidder Subset Selection Problem in Auction DesignXiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang. 3788-3801 [doi]
• Simple Mechanisms for Non-linear AgentsYiding Feng, Jason D. Hartline, Yingkai Li. 3802-3816 [doi]
• Sampling Equilibria: Fast No-Regret Learning in Structured GamesDaniel Beaglehole, Max Hopkins, Daniel Kane, Sihan Liu, Shachar Lovett. 3817-3855 [doi]
• Foundations of Transaction Fee Mechanism DesignHao Chung, Elaine Shi. 3856-3899 [doi]
• Beating Greedy Matching in Sublinear TimeSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi. 3900-3945 [doi]
• Spencer's theorem in nearly input-sparsity timeVishesh Jain, Ashwin Sah, Mehtaab Sawhney. 3946-3958 [doi]
• p Polynomial RegressionRaphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff, Samson Zhou. 3959-4025 [doi]
• Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication TimeYeshwanth Cherapanamjeri, Sandeep Silwal, David P. Woodruff, Samson Zhou. 4026-4049 [doi]
• Testing Convex TruncationAnindya De, Shivam Nadimpalli, Rocco A. Servedio. 4050-4082 [doi]
• Streaming complexity of CSPs with randomly ordered constraintsRaghuvansh R. Saxena, Noah Singer, Madhu Sudan 0001, Santhoshini Velusamy. 4083-4103 [doi]
• Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink boundsShu Liu 0004, Tingyi Wu, Chaoping Xing. 4104-4114 [doi]
• On the orbit closure intersection problems for matrix tuples under conjugation and left-right actionsGábor Ivanyos, Youming Qiao. 4115-4126 [doi]
• Toeplitz Low-Rank Approximation with Sublinear Query ComplexityMichael Kapralov, Hannah Lawrence, Mikhail Makarov, Cameron Musco, Kshiteej Sheth. 4127-4158 [doi]
• Smaller Low-Depth Circuits for Kronecker PowersJosh Alman, Yunfeng Guan, Ashwin Padaki. 4159-4187 [doi]
• Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative RankTaihei Oki, Tasuku Soma. 4188-4204 [doi]
• Equivalence Test for Read-Once Arithmetic FormulasNikhil Gupta 0008, Chandan Saha 0001, Bhargav Thankey. 4205-4272 [doi]
• Improved Distributed Algorithms for the Lovász Local Lemma and Edge ColoringPeter Davies. 4273-4295 [doi]
• k-Edge-Connected Spanning SubgraphMichal Dory, Mohsen Ghaffari 0001. 4296-4334 [doi]
• Byzantine Agreement with Optimal Resilience via Statistical Fraud DetectionShang-En Huang, Seth Pettie, Leqi Zhu. 4335-4353 [doi]
• Parallel Exact Shortest Paths in Almost Linear Work and Square Root DepthNairen Cao, Jeremy T. Fineman. 4354-4372 [doi]
• Massively Parallel Computation on Embedded Planar GraphsJacob Holm, Jakub Tetek. 4373-4408 [doi]
• Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and BeyondSalwa Faour, Mohsen Ghaffari 0001, Christoph Grunau, Fabian Kuhn, Václav Rozhon. 4409-4447 [doi]
• Balanced Allocations with Heterogeneous Bins: The Power of MemoryDimitrios Los, Thomas Sauerwald, John Sylvester 0001. 4448-4477 [doi]
• A Near-Linear Time Sampler for the Ising Model with External FieldXiaoyu Chen, Xinyuan Zhang. 4478-4503 [doi]
• Almost-Linear Planted Cliques Elude the Metropolis ProcessZongchen Chen, Elchanan Mossel, Ilias Zadik. 4504-4539 [doi]
• The Need for Seed (in the abstract Tile Assembly Model)Andrew Alseth, Matthew J. Patitz. 4540-4589 [doi]
• Faster Algorithm for Turn-based Stochastic Games with Bounded TreewidthKrishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda. 4590-4605 [doi]
• Spatial mixing and the random-cluster dynamics on latticesReza Gheissari, Alistair Sinclair. 4606-4621 [doi]
• Online Lewis Weight SamplingDavid P. Woodruff, Taisuke Yasuda 0002. 4622-4666 [doi]
• Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample ComplexityYaonan Jin, Daogao Liu, Zhao Song 0002. 4667-4767 [doi]
• Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier TransformsKarl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh. 4768-4845 [doi]
• Cubic Goldreich-LevinDain Kim, Anqi Li, Jonathan Tidor. 4846-4892 [doi]
• Query Complexity of the Metric Steiner Tree ProblemYu Chen 0039, Sanjeev Khanna, Zihan Tan. 4893-4935 [doi]
• q), and Unique Label Cover on ExpandersPan Peng 0001, Yuichi Yoshida. 4936-4965 [doi]
• Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential PrivacyVitaly Feldman, Audra McMillan, Kunal Talwar. 4966-4981 [doi]
• Private Query Release via the Johnson-Lindenstrauss TransformAleksandar Nikolov. 4982-5002 [doi]
• Almost Tight Error Bounds on Differentially Private Continual CountingMonika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay. 5003-5039 [doi]
• Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower BoundsJustin Y. Chen, Badih Ghazi, Ravi Kumar 0001, Pasin Manurangsi, Shyam Narayanan, Jelani Nelson, Yinzhan Xu. 5040-5067 [doi]
• Private Convex Optimization in General NormsSivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian. 5068-5089 [doi]
• k-mismatch MatchingCe Jin, Jakob Nogler. 5090-5121 [doi]
• n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix TreesDominik Kempa, Tomasz Kociumaka. 5122-5202 [doi]
• Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distanceMichal Koucký 0001, Michael E. Saks. 5203-5219 [doi]
• Optimal Square Detection Over General AlphabetsJonas Ellert, Pawel Gawrychowski, Garance Gourdel. 5220-5242 [doi]
• Time-Space Tradeoffs for Element Distinctness and Set Intersection via PseudorandomnessXin Lyu 0003, Weihao Zhu. 5243-5281 [doi]