Table of Contents

• Almost Chor-Goldreich Sources and Adversarial Random WalksDean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman. 1-9 [doi]
• A New Berry-Esseen Theorem for Expander WalksLouis Golowich. 10-22 [doi]
• Near-Optimal Derandomization of Medium-Width Branching ProgramsAaron (Louie) Putterman, Edward Pyne. 23-34 [doi]
• Approximating Iterated Multiplication of Stochastic Matrices in Small SpaceGil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma. 35-45 [doi]
• Extractors for Images of VarietiesZeyu Guo, Ben lee Volk, Akhil Jalan, David Zuckerman. 46-59 [doi]
• When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof SystemsLijie Chen 0001, Roei Tell. 60-69 [doi]
• Hardness Self-Amplification: Simplified, Optimized, and UnifiedShuichi Hirahara, Nobutaka Shimizu. 70-83 [doi]
• Sum-of-Squares Lower Bounds for Densest k-SubgraphChris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu. 84-95 [doi]
• Exact Phase Transitions for Stochastic Block Models and Reconstruction on TreesElchanan Mossel, Allan Sly, Youngtak Sohn. 96-102 [doi]
• Parallel Discrete Sampling via Continuous WalksNima Anari, Yizhi Huang, Tianyu Liu, Thuy Duong Vuong, Brian Xu, Katherine Yu. 103-116 [doi]
• Sampling from Convex Sets with a Cold Start using Multiscale DecompositionsHariharan Narayanan, Amit Rajaraman, Piyush Srivastava 0001. 117-130 [doi]
• On Regularity Lemma and Barriers in Streaming and Dynamic MatchingSepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li. 131-144 [doi]
• Optimal Eigenvalue Approximation via SketchingWilliam Swartworth, David P. Woodruff. 145-155 [doi]
• Streaming Euclidean MST to a Constant FactorXi Chen, Vincent Cohen-Addad, Rajesh Jayaram, Amit Levi, Erik Waingarten. 156-169 [doi]
• Streaming Euclidean Max-Cut: Dimension vs Data ReductionXiaoyu Chen, Shaofeng H.-C. Jiang, Robert Krauthgamer. 170-182 [doi]
• (Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and BeyondSepehr Assadi, Janani Sundaresan. 183-195 [doi]
• Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph SparsificationArun Jambulapati, Yang P. Liu, Aaron Sidford. 196-206 [doi]
• Spectral Hypergraph Sparsification via ChainingJames R. Lee. 207-218 [doi]
• Locally Consistent Decomposition of Strings with Applications to Edit Distance SketchingSudatta Bhattacharya, Michal Koucký 0001. 219-232 [doi]
• Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity TesterHadley Black, Deeparnab Chakrabarty, C. Seshadhri 0001. 233-241 [doi]
• Stochastic Minimum Vertex Cover in General Graphs: A 3/2-ApproximationMahsa Derakhshan, Naveen Durvasula, Nika Haghtalab. 242-253 [doi]
• Sublinear Algorithms for (1.5+ε)-Approximate MatchingSayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak. 254-266 [doi]
• Sublinear Time Algorithms and Complexity of Approximate Maximum MatchingSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein. 267-280 [doi]
• Almost-Optimal Sublinear Additive SpannersZihan Tan, Tianyi Zhang. 281-294 [doi]
• A Unified Framework for Light SpannersHung Le, Shay Solomon. 295-308 [doi]
• New Algorithms for All Pairs Approximate Shortest PathsLiam Roditty. 309-320 [doi]
• Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate DistancesVáclav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic. 321-334 [doi]
• A New Approach to Learning Linear Dynamical SystemsAinesh Bakshi, Allen Liu, Ankur Moitra, Morris Yau. 335-348 [doi]
• Planning and Learning in Partially Observable Systems via Filter StabilityNoah Golowich, Ankur Moitra, Dhruv Rohatgi. 349-362 [doi]
• Optimistic MLE: A Generic Model-Based Algorithm for Partially Observable Sequential Decision MakingQinghua Liu, Praneeth Netrapalli, Csaba Szepesvári, Chi Jin 0001. 363-376 [doi]
• Weighted Edit Distance Computation: Strings, Trees, and DyckDebarati Das 0001, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha. 377-390 [doi]
• Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive CombinatoricsAmir Abboud, Karl Bringmann, Nick Fischer. 391-404 [doi]
• Removing Additive Structure in 3SUM-Based ReductionsCe Jin, Yinzhan Xu. 405-418 [doi]
• Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and MoreTimothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu. 419-432 [doi]
• Linear Independence, Alternants, and ApplicationsVishwas Bhargava, Shubhangi Saraf, Ilya Volkovich. 441-454 [doi]
• Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidityJosh Alman, Kevin Rao. 455-462 [doi]
• A Borsuk-Ulam Lower Bound for Sign-Rank and Its ApplicationsHamed Hatami, Kaave Hosseini, Xiang Meng. 463-471 [doi]
• Optimal Differentially Private Learning of Thresholds and Quasi-Concave OptimizationEdith Cohen, Xin Lyu 0002, Jelani Nelson, Tamás Sarlós, Uri Stemmer. 472-482 [doi]
• Privately Estimating a Gaussian: Efficient, Robust, and OptimalDaniel Alabi, Pravesh K. Kothari, Pranay Tankala, Prayaag Venkat, Fred Zhang. 483-496 [doi]
• Robustness Implies Privacy in Statistical EstimationSamuel B. Hopkins, Gautam Kamath 0001, Mahbod Majid, Shyam Narayanan. 497-506 [doi]
• Concurrent Composition Theorems for Differential PrivacySalil P. Vadhan, Wanrong Zhang 0001. 507-519 [doi]
• Stability Is Stable: Connections between Replicability, Privacy, and Adaptive GeneralizationMark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell. 520-527 [doi]
• An Improved Parameterized Algorithm for TreewidthTuukka Korhonen, Daniel Lokshtanov. 528-541 [doi]
• The Complexity of Pattern Counting in Directed Graphs, Parameterised by the OutdegreeMarco Bressan 0002, Matthias Lanzinger, Marc Roth. 542-552 [doi]
• p NormsHuck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002. 553-566 [doi]
• First-Order Model Checking on Structurally Sparse Graph ClassesJan Dreier, Nikolas Mählmann, Sebastian Siebertz. 567-580 [doi]
• The Randomized k-Server Conjecture Is False!Sébastien Bubeck, Christian Coester, Yuval Rabani. 581-594 [doi]
• Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWEWei-Kai Lin, Ethan Mook, Daniel Wichs. 595-608 [doi]
• SDPs and Robust Satisfiability of Promise CSPJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. 609-622 [doi]
• Approximate Graph Colouring and the Hollow ShadowLorenzo Ciardo, Stanislav Zivný. 623-631 [doi]
• On Approximability of Satisfiable k-CSPs: IIAmey Bhangale, Subhash Khot, Dor Minzer. 632-642 [doi]
• On Approximability of Satisfiable k-CSPs: IIIAmey Bhangale, Subhash Khot, Dor Minzer. 643-655 [doi]
• An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 GamesDavid Ellis, Guy Kindler, Noam Lifshitz. 656-660 [doi]
• Noise Stability on the Boolean Hypercube via a Renormalized Brownian MotionRonen Eldan, Dan Mikulincer, Prasad Raghavendra. 661-671 [doi]
• A Proof of the Nisan-Ronen ConjectureGeorge Christodoulou 0001, Elias Koutsoupias, Annamária Kovács. 672-685 [doi]
• A Constant Factor Prophet Inequality for Online Combinatorial AuctionsJosé R. Correa, Andrés Cristi. 686-697 [doi]
• Complexity of Equilibria in First-Price Auctions under General Tie-Breaking RulesXi Chen, Binghui Peng. 698-709 [doi]
• Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite ProgrammingIoannis Caragiannis, Zhile Jiang. 710-722 [doi]
• Credible Decentralized Exchange Design via Verifiable Sequencing RulesMatheus Venturyne Xavier Ferreira, David C. Parkes. 723-736 [doi]
• On the Optimal Fixed-Price Mechanism in Bilateral TradeYang Cai, Jinzhao Wu. 737-750 [doi]
• Improved Approximation Ratios of Fixed-Price Mechanisms in Bilateral TradesZhengyang Liu, Zeyu Ren, Zihe Wang 0001. 751-760 [doi]
• Improved and Deterministic Online Service with Deadlines or DelayNoam Touitou. 761-774 [doi]
• Online Unrelated-Machine Load Balancing and Generalized Flow with RecourseRavishankar Krishnaswamy, Shi Li 0001, Varun Suriyanarayana. 775-788 [doi]
• Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation SchemeHu Fu, Jiawei Li, Daogao Liu. 789-802 [doi]
• Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTASHedyeh Beyhaghi, Linda Cai. 803-816 [doi]
• Local and Global Expansion in Random Geometric GraphsSiqi Liu 0005, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang. 817-825 [doi]
• New High Dimensional Expanders from CoversYotam Dikstein. 826-838 [doi]
• Towards the Erdős-Gallai Cycle Decomposition ConjectureMatija Bucic, Richard Montgomery 0001. 839-852 [doi]
• An Optimal "It Ain't Over Till It's Over" TheoremRonen Eldan, Avi Wigderson, Pei Wu. 853-866 [doi]
• Randomized versus Deterministic Decision Tree SizeArkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal. 867-880 [doi]
• Optimal Explicit Small-Depth Formulas for the Coin ProblemSrikanth Srinivasan 0001, Utkarsh Tripathi. 881-894 [doi]
• Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR TreesPooya Hatami, William M. Hoza, Avishay Tal, Roei Tell. 895-904 [doi]
• Good Quantum LDPC Codes with Linear Time DecodersIrit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick. 905-918 [doi]
• An Efficient Decoder for a Linear Distance Quantum LDPC CodeShouzhen Gu, Christopher A. Pattison, Eugene Tang. 919-932 [doi]
• Certified Randomness from Quantum SupremacyScott Aaronson, Shih-Han Hung. 933-944 [doi]
• A Polynomial-Time Classical Algorithm for Noisy Random Circuit SamplingDorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, Umesh V. Vazirani. 945-957 [doi]
• Nearly All k-SAT Functions Are UnateJózsef Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao. 958-962 [doi]
• Kneser Graphs Are HamiltonianArturo I. Merino, Torsten Mütze, Namrata. 963-970 [doi]
• Random Walks on Rotating ExpandersGil Cohen, Gal Maor. 971-984 [doi]
• Algorithmic Applications of Hypergraph and Partition ContainersOr Zamir. 985-998 [doi]
• Subsampling Suffices for Adaptive Data AnalysisGuy Blanc. 999-1012 [doi]
• The Power of Multi-step Vizing ChainsAleksander Bjørn Grodt Christiansen. 1013-1026 [doi]
• Capturing One-Way Functions via NP-Hardness of Meta-ComplexityShuichi Hirahara. 1027-1038 [doi]
• A Duality between One-Way Functions and Average-Case Symmetry of InformationShuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira. 1039-1050 [doi]
• Unprovability of Strong Complexity Lower Bounds in Bounded ArithmeticJiatu Li, Igor C. Oliveira. 1051-1057 [doi]
• Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs AlgorithmsYeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren. 1058-1066 [doi]
• NP-Hardness of Approximating Meta-Complexity: A Cryptographic ApproachYizhi Huang, Rahul Ilango, Hanlin Ren. 1067-1075 [doi]
• Indistinguishability Obfuscation, Range Avoidance, and Bounded ArithmeticRahul Ilango, Jiatu Li, R. Ryan Williams. 1076-1089 [doi]
• NLTS Hamiltonians from Good Quantum CodesAnurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe. 1090-1096 [doi]
• Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid MemoryQipeng Liu, Ran Raz, Wei Zhan. 1097-1110 [doi]
• Quantum Depth in the Random Oracle ModelAtul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner. 1111-1124 [doi]
• Multidimensional Quantum WalksStacey Jeffery, Sebastian Zur. 1125-1130 [doi]
• Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the EndAlexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, Fernando G. S. L. Brandão. 1131-1144 [doi]
• Approximating Binary Longest Common Subsequence in Almost-Linear TimeXiaoyu He, Ray Li. 1145-1158 [doi]
• A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest PathsJulia Chuzhoy, Ruimin Zhang. 1159-1172 [doi]
• Deterministic Incremental APSP with Polylogarithmic Update Time and StretchSebastian Forster, Yasamin Nazari, Maximilian Probst Gutenberg. 1173-1186 [doi]
• Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating SetShay Solomon, Amitai Uzrad. 1187-1200 [doi]
• Improved Dynamic Colouring of Sparse GraphsAleksander Bjørn Grodt Christiansen, Krzysztof Nowicki 0002, Eva Rotenberg. 1201-1214 [doi]
• Dynamic Maxflow via Dynamic Interior Point MethodsJan van den Brand, Yang P. Liu, Aaron Sidford. 1215-1228 [doi]
• Fast Algorithms via Dynamic-Oracle MatroidsJoakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai, Ta-Wei Tu. 1229-1242 [doi]
• Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured HardnessRiddhi Ghosal, Yuval Ishai, Alexis Korb, Eyal Kushilevitz, Paul Lou, Amit Sahai. 1243-1256 [doi]
• On the Consistency of Circuit Lower Bounds for Non-deterministic TimeAlbert Atserias, Sam Buss, Moritz Müller. 1257-1270 [doi]
• Shellability Is Hard Even for BallsPavel Paták, Martin Tancer. 1271-1284 [doi]
• The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3Jin-yi Cai, Ashwin Maran. 1285-1297 [doi]
• Approximating Nash Social Welfare by Matching and Local SearchJugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák. 1298-1310 [doi]
• Multi-agent ContractsPaul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim. 1311-1324 [doi]
• Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded TreewidthTobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif. 1325-1334 [doi]
• A PTAS for Minimizing Weighted Flow Time on a Single MachineAlexander Armbruster, Lars Rohwedder, Andreas Wiese. 1335-1344 [doi]
• Random Graph Matching at Otter's Threshold via Counting ChandeliersCheng Mao, Yihong Wu 0001, Jiaming Xu, Sophie H. Yu. 1345-1356 [doi]
• Uniformly Random Colourings of Sparse GraphsEoin Hurley, François Pirot. 1357-1370 [doi]
• Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and FastBernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak. 1371-1383 [doi]
• Tight Conditional Lower Bounds for Vertex Connectivity ProblemsZhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang. 1384-1395 [doi]
• Approximate Distance Sensitivity Oracles in Subquadratic SpaceDavide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Simon Krogmann, Martin Schirneck. 1396-1409 [doi]
• External Memory Fully Persistent Search TreesGerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning. 1410-1423 [doi]
• The Rate of Interactive Codes Is Bounded Away from 1Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. 1424-1437 [doi]
• A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP RefutationOmar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. 1438-1448 [doi]
• Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary ChannelMeghal Gupta, Rachel Yun Zhang. 1449-1462 [doi]
• A High Dimensional Goldreich-Levin TheoremParker Newton, Silas Richelson, Chase Wilson. 1463-1474 [doi]
• Binary Error-Correcting Codes with Minimal Noiseless FeedbackMeghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang. 1475-1487 [doi]
• Generic Reed-Solomon Codes Achieve List-Decoding CapacityJoshua Brakensiek, Sivakanth Gopi, Visu Makam. 1488-1501 [doi]
• Optimal Bounds for Noisy SortingYuzhou Gu, Yinzhan Xu. 1502-1515 [doi]
• Lattice Problems beyond Polynomial TimeDivesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar 0002, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan. 1516-1526 [doi]
• The Round Complexity of Statistical MPC with Optimal ResiliencyBenny Applebaum, Eliran Kachlon, Arpita Patra. 1527-1536 [doi]
• Constant-Round Arguments from One-Way FunctionsNoga Amit, Guy N. Rothblum. 1537-1544 [doi]
• Boosting Batch Arguments and RAM DelegationYael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs. 1545-1552 [doi]
• Succinct Computational Secret SharingBenny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan. 1553-1566 [doi]
• Obfuscation of Pseudo-Deterministic Quantum CircuitsJames Bartusek, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa. 1567-1578 [doi]
• Commitments to Quantum StatesSam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry. 1579-1588 [doi]
• Quantum Cryptography in AlgorithmicaWilliam Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal. 1589-1602 [doi]
• Quantum Free GamesAnand Natarajan, Tina Zhang. 1603-1616 [doi]
• Quantum Advantage from Any Non-local GameYael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang 0001. 1617-1628 [doi]
• The Power of Unentangled Quantum Proofs with Non-negative AmplitudesFernando Granha Jeronimo, Pei Wu. 1629-1642 [doi]
• Testing Distributional Assumptions of Learning AlgorithmsRonitt Rubinfeld, Arsen Vasilyan. 1643-1656 [doi]
• A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher ComplexityAravind Gollakota, Adam R. Klivans, Pravesh K. Kothari. 1657-1670 [doi]
• Learning Polynomial Transformations via Generalized Tensor DecompositionsSitan Chen, Jerry Li 0001, Yuanzhi Li, Anru R. Zhang. 1671-1684 [doi]
• Average-Case Complexity of Tensor Decomposition for Low-Degree PolynomialsAlexander S. Wein. 1685-1698 [doi]
• What Makes a Good Fisherman? Linear Regression under Self-Selection BiasYeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis. 1699-1712 [doi]
• A Characterization of List LearnabilityMoses Charikar, Chirag Pabbaraju. 1713-1726 [doi]
• A Unifying Theory of Distance from CalibrationJaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran. 1727-1740 [doi]
• A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace LearningIlias Diakonikolas, Christos Tzamos, Daniel M. Kane. 1741-1754 [doi]
• Lifting Uniform Learners via Distributional DecompositionGuy Blanc, Jane Lange, Ali Malik, Li-Yang Tan. 1755-1767 [doi]
• Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial AxisAndré Lieutier, Mathijs Wintraecken. 1768-1776 [doi]
• Faster Deterministic Distributed MIS and Approximate MatchingMohsen Ghaffari 0001, Christoph Grunau. 1777-1790 [doi]
• Finding a Small Vertex Cut on Distributed NetworksYonggang Jiang, Sagnik Mukhopadhyay. 1791-1801 [doi]
• New Subset Selection Algorithms for Low Rank Approximation: Offline and OnlineDavid P. Woodruff, Taisuke Yasuda 0002. 1802-1813 [doi]
• Resolving Matrix Spencer Conjecture Up to Poly-logarithmic RankNikhil Bansal 0001, Haotian Jiang, Raghu Meka. 1814-1819 [doi]
• A (1.5+ε)-Approximation Algorithm for Weighted Connectivity AugmentationVera Traub, Rico Zenklusen. 1820-1833 [doi]
• Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted EigenvaluesLap Chi Lau, Kam Chuen Tung, Robert Wang. 1834-1847 [doi]
• An Improved Approximation Guarantee for Prize-Collecting TSPJannis Blauth, Martin Nägele. 1848-1861 [doi]
• Better Trees for Santa ClausÉtienne Bamas, Lars Rohwedder. 1862-1875 [doi]
• Interior Point Methods with a Gradient OracleAdrian Vladu. 1876-1889 [doi]
• The Smoothed Complexity of Policy Iteration for Markov Decision ProcessesMiranda Christ, Mihalis Yannakakis. 1890-1903 [doi]
• Upper and Lower Bounds on the Smoothed Complexity of the Simplex MethodSophie Huiberts, Yin Tat Lee, Xinzhi Zhang 0002. 1904-1917 [doi]
• Algorithms Approaching the Threshold for Semi-random Planted CliqueRares-Darius Buhai, Pravesh K. Kothari, David Steurer. 1918-1926 [doi]