Table of Contents

• Approximating Submodular k-Partition via Principal Partition SequenceKarthekeyan Chandrasekaran, Weihang Wang 0002. [doi]
• The Full Rank Condition for Sparse Random MatricesAmin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien. [doi]
• Round and Bipartize for Vertex Cover ApproximationDanish Kashaev, Guido Schäfer. [doi]
• Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree CaseAntonio Blanca, Xusheng Zhang. [doi]
• Range Avoidance for Constant Depth Circuits: Hardness and AlgorithmsKarthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi. [doi]
• An Embarrassingly Parallel Optimal-Space Cardinality Estimation AlgorithmEmin Karayel. [doi]
• The (Im)possibility of Simple Search-To-Decision Reductions for Approximation ProblemsAlexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz. [doi]
• n/2 / poly(n)Xi Chen 0001, Yaonan Jin, Tim Randolph 0001, Rocco A. Servedio. [doi]
• A Deterministic Construction of a Large Distance Code from the Wozencraft EnsembleVenkatesan Guruswami, Shilun Li. [doi]
• A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free GraphsZachary Friggstad, Ramin Mousavi. [doi]
• Bias Reduction for Sum EstimationTalya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek. [doi]
• Oblivious Algorithms for the Max-kAND ProblemNoah G. Singer. [doi]
• Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon CodesHuck Bennett, Chris Peikert. [doi]
• Giant Components in Random Temporal GraphsRuben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev. [doi]
• On the Power of Regular and Permutation Branching ProgramsChin Ho Lee, Edward Pyne, Salil P. Vadhan. [doi]
• Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPsFernando Granha Jeronimo. [doi]
• Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACEJoshua Cook, Dana Moshkovitz. [doi]
• Stable Approximation Algorithms for Dominating Set and Independent SetMark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma. [doi]
• NP-Hardness of Almost Coloring Almost 3-Colorable GraphsYahli Hecht, Dor Minzer, Muli Safra. [doi]
• An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP RoundingIlan Doron Arad, Ariel Kulik, Hadas Shachnai. [doi]
• On the Complexity of Triangle Counting Using Emptiness QueriesArijit Bishnu, Arijit Ghosh, Gopinath Mishra. [doi]
• A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star GraphsFelix Höhne, Rob van Stee. [doi]
• Improved Local Computation Algorithms for Constructing SpannersRubi Arviv, Lily Chung, Reut Levi, Edward Pyne. [doi]
• Superpolynomial Lower Bounds for Learning Monotone ClassesNader H. Bshouty. [doi]
• Approximation Algorithms for Directed Weighted SpannersElena Grigorescu, Nithish Kumar, Young-San Lin. [doi]
• On Optimization and Counting of Non-Broken Bases of MatroidsDorna Abdolazimi, Kasper Lindberg, Shayan Oveis Gharan. [doi]
• Synergy Between Circuit Obfuscation and Circuit MinimizationRussell Impagliazzo, Valentine Kabanets, Ilya Volkovich. [doi]
• Bicriteria Approximation Algorithms for Priority Matroid MedianTanvi Bajpai, Chandra Chekuri. [doi]
• Efficient Algorithms and Hardness Results for the Weighted k-Server ProblemAnupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi. [doi]
• Improved Diversity Maximization Algorithms for Matching and PseudoforestSepideh Mahabadi, Shyam Narayanan. [doi]
• Classical Simulation of One-Query Quantum DistinguishersAndrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh 0001, John C. S. Lui. [doi]
• Extracting Mergers and Projections of PartitionsSwastik Kopparty, Vishvajeet N. [doi]
• Sampling and Certifying Symmetric FunctionsYuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov 0001. [doi]
• On Constructing Spanners from Random Gaussian ProjectionsSepehr Assadi, Michael Kapralov, Huacheng Yu. [doi]
• Submodular Norms with Applications To Online Facility Location and Stochastic ProbingKalen Patton, Matteo Russo, Sahil Singla 0001. [doi]
• Approximating Red-Blue Set Cover and Minimum Monotone Satisfying AssignmentEden Chlamtác, Yury Makarychev, Ali Vakilian. [doi]
• Low-Degree Testing over GridsPrashanth Amireddy, Srikanth Srinivasan 0001, Madhu Sudan 0001. [doi]
• Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural BalanceVikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao 0001, Chen Wang 0027. [doi]
• Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber DynamicsAndreas Galanis, Leslie Ann Goldberg, Paulina Smolarova. [doi]
• Robustness for Space-Bounded Statistical Zero KnowledgeEric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, Pengxiang Wang 0002. [doi]
• Perfect Sampling for Hard Spheres from Strong Spatial MixingKonrad Anand, Andreas Göbel 0001, Marcus Pappik, Will Perkins 0001. [doi]
• Independent Sets in Elimination Graphs with a Submodular ObjectiveChandra Chekuri, Kent Quanrud. [doi]
• Online Matching with Set and Concave DelaysLindsey Deryckere, Seeun William Umboh. [doi]
• Approximation Algorithms and Lower Bounds for Graph BurningMatej Lieskovský, Jirí Sgall, Andreas Emil Feldmann. [doi]
• Facility Location in the Sublinear Geometric ModelMorteza Monemizadeh. [doi]
• Interactive Error Correcting Codes: New Constructions and Impossibility BoundsMeghal Gupta, Rachel Yun Zhang. [doi]
• How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low SensitivityJeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou. [doi]
• Testing Versus Estimation of Graph Properties, RevisitedLior Gishboliner, Nick Kushnir, Asaf Shapira. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Testing Connectedness of ImagesPiotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache. [doi]
• Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz FunctionsRenato Ferreira Pinto Jr.. [doi]
• On Complexity of 1-Center in Various MetricsAmir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin. [doi]
• Tighter Approximation for the Uniform Cost-Distance Steiner Tree ProblemJosefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley. [doi]
• On the Composition of Randomized Query Complexity and Approximate DegreeSourav Chakraborty 0001, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh. [doi]
• Probabilistic Metric Embedding via Metric LabelingKamesh Munagala, Govind S. Sankar, Erin Taylor 0002. [doi]
• Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of TerminalsIshan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur. [doi]
• Approximation Algorithms for Maximum Weighted Throughput on Unrelated MachinesGeorge Karakostas, Stavros G. Kolliopoulos. [doi]
• Fine Grained Analysis of High Dimensional Random WalksRoy Gotlib, Tali Kaufman. [doi]
• Efficient Interactive Proofs for Non-Deterministic Bounded SpaceJoshua Cook, Ron D. Rothblum. [doi]
• Private Data Stream Analysis for Universal Symmetric Norm EstimationVladimir Braverman, Joel Manning, Zhiwei Steven Wu, Samson Zhou. [doi]
• On Minimizing Generalized Makespan on Unrelated MachinesNikhil Ayyadevara, Nikhil Bansal 0001, Milind Prabhu. [doi]
• Experimental Design for Any p-NormLap Chi Lau, Robert Wang 0004, Hong Zhou 0001. [doi]
• Approximating Pandora's Box with CorrelationsShuchi Chawla 0001, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos. [doi]
• Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary TreesCharilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda. [doi]
• On Connectivity in Random Graph Models with Limited DependenciesJohannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber 0001, Emo Welzl. [doi]
• An Approximation Algorithm for the Exact Matching Problem in Bipartite GraphsAnita Dürr, Nicolas El Maalouly, Lasse Wulf. [doi]
• Scalable Auction Algorithms for Bipartite Maximum Matching ProblemsQuanquan C. Liu, Yiduo Ke, Samir Khuller. [doi]