Table of Contents

• Dynamic Pricing of Servers on TreesIlan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez. [doi]
• Improved Bounds for Open Online Dial-a-Ride on the LineAlexander Birx, Yann Disser, Kevin Schewior. [doi]
• Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence MaximizationGrant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu. [doi]
• Successive Minimum Spanning TreesSvante Janson, Gregory B. Sorkin. [doi]
• Unconstraining Graph-Constrained Group TestingBruce Spang, Mary Wootters. [doi]
• Syntactic Separation of Subset Satisfiability ProblemsEric Allender, Martin Farach-Colton, Meng-Tsung Tsai. [doi]
• Single-Elimination Brackets Fail to Approximate Copeland WinnerReyna Hulett. [doi]
• Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient FunctionsAvraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma. [doi]
• Routing Symmetric Demands in Directed Minor-Free Graphs with Constant CongestionTimothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos. [doi]
• Improved Algorithms for Time Decay StreamsVladimir Braverman, Harry Lang, Enayat Ullah, Samson Zhou. [doi]
• Testing Odd Direct Sums Using High Dimensional ExpandersRoy Gotlib, Tali Kaufman. [doi]
• Streaming Coreset Constructions for M-EstimatorsVladimir Braverman, Dan Feldman, Harry Lang, Daniela Rus. [doi]
• 2: Rapid Mixing with General Boundary ConditionsAntonio Blanca, Reza Gheissari, Eric Vigoda. [doi]
• Samplers and Extractors for Unbounded FunctionsRohit Agrawal 0002. [doi]
• Fast and Deterministic Approximations for k-CutKent Quanrud. [doi]
• Collapsing Superstring ConjectureAlexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev. [doi]
• Thresholds in Random Motif GraphsMichael Anastos, Peleg Michaeli, Samantha Petti. [doi]
• On the Cost of Essentially Fair ClusteringsIoana Oriana Bercea, Martin Groß 0001, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt 0001. [doi]
• Approximate Degree, Secret Sharing, and Concentration PhenomenaAndrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson. [doi]
• Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered PhasesMatthew Fahrbach, Dana Randall. [doi]
• Robust Correlation ClusteringDevvrit, Ravishankar Krishnaswamy, Nived Rajaraman. [doi]
• On a Connectivity Threshold for Colorings of Random Graphs and HypergraphsMichael Anastos, Alan M. Frieze. [doi]
• Malleable Scheduling Beyond Identical MachinesDimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos. [doi]
• The Complexity of Partial Function Extension for Coverage FunctionsUmang Bhaskar, Gunjan Kumar. [doi]
• The Maximum Label Propagation Algorithm on Sparse Random GraphsCharlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger. [doi]
• Fast Algorithms at Low Temperatures via Markov ChainsZongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda. [doi]
• Towards Optimal Moment Estimation in Streaming and Distributed ModelsRajesh Jayaram, David P. Woodruff. [doi]
• Improved Online Algorithms for Knapsack and GAP in the Random Order ModelSusanne Albers, Arindam Khan 0001, Leon Ladewig. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• 2-Sketching of Valuation FunctionsGrigory Yaroslavtsev, Samson Zhou. [doi]
• Lifted Multiplicity Codes and the Disjoint Repair Group PropertyRay Li, Mary Wootters. [doi]
• On Strong Diameter Padded DecompositionsArnold Filtser. [doi]
• Improved Strong Spatial Mixing for Colorings on TreesCharilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda. [doi]
• Simple Analysis of Sparse, Sign-Consistent JLMeena Jagadeesan. [doi]
• Rainbow Coloring Hardness via Low Sensitivity PolymorphismsVenkatesan Guruswami, Sai Sandeep. [doi]
• Improved Extractors for Recognizable and Algebraic SourcesFu Li, David Zuckerman. [doi]
• Conditional Hardness of Earth Mover DistanceDhruv Rohatgi. [doi]
• Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under UncertaintyDavid Ellis Hershkowitz, R. Ravi 0001, Sahil Singla 0001. [doi]
• A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle SystemsSarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, Andréa W. Richa. [doi]
• Direct Sum Testing: The General CaseIrit Dinur, Konstantin Golubev. [doi]
• Maximizing Covered Area in the Euclidean Plane with Connectivity ConstraintChien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa. [doi]
• Approximating the Noise Sensitivity of a Monotone Boolean FunctionRonitt Rubinfeld, Arsen Vasilyan. [doi]
• 2 Norm with Constant Update TimeChi-Ning Chou, Zhixian Lei, Preetum Nakkiran. [doi]
• Connectivity of Random Annulus Graphs and the Geometric Block ModelSainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha. [doi]
• String Matching: Communication, Circuits, and LearningAlexander Golovnev, Mika Göös, Daniel Reichman 0001, Igor Shinkar. [doi]
• The Maximum Exposure ProblemNeeraj Kumar 0004, Stavros Sintos, Subhash Suri. [doi]
• Efficient Black-Box Identity Testing for Free Group AlgebrasVikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. [doi]
• Pairwise Independent Random Walks Can Be Slightly UnboundedShyam Narayanan. [doi]
• Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-CutSevag Gharibian, Ojas Parekh. [doi]
• Hardy-Muckenhoupt Bounds for Laplacian EigenvaluesGary L. Miller, Noel J. Walkington, Alex L. Wang. [doi]
• Counting Independent Sets and Colorings on Random Regular Bipartite GraphsChao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao. [doi]
• Robust Appointment Scheduling with Heterogeneous CostsAndreas S. Schulz, Rajan Udwani. [doi]
• Exploring Differential ObliviousnessAmos Beimel, Kobbi Nissim, Mohammad-Zaheri. [doi]
• Approximating the Norms of Graph SpannersEden Chlamtác, Michael Dinitz, Thomas Robinson. [doi]
• 1Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros. [doi]
• Max-Min Greedy MatchingAlon Eden, Uriel Feige, Michal Feldman. [doi]
• On List Recovery of High-Rate Tensor CodesSwastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas. [doi]
• (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value ProbingDomagoj Bradac, Sahil Singla 0001, Goran Zuzic. [doi]
• Improved Pseudorandom Generators from Pseudorandom Multi-Switching LemmasRocco A. Servedio, Li-Yang Tan. [doi]
• Approximation Algorithms for Partially Colorable GraphsSuprovat Ghoshal, Anand Louis, Rahul Raychaudhury. [doi]
• Efficient Average-Case Population Recovery in the Presence of Insertions and DeletionsFrank Ban, Xi Chen 0001, Rocco A. Servedio, Sandip Sinha. [doi]
• p DistancesManuel Fernandez, David P. Woodruff, Taisuke Yasuda 0002. [doi]
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs HarderPer Austrin, Aleksa Stankovic. [doi]
• Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave DistributionsZongchen Chen, Santosh S. Vempala. [doi]
• A Lower Bound for Sampling Disjoint SetsMika Göös, Thomas Watson 0001. [doi]
• Streaming Verification of Graph Computations via Graph StructureAmit Chakrabarti, Prantar Ghosh. [doi]
• Deterministic Approximation of Random Walks in Small SpaceJack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan. [doi]
• Improved 3LIN Hardness via Linear Label CoverPrahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari. [doi]
• Small Space Stream Summary for Matroid CenterSagar Kale. [doi]
• Streaming Hardness of Unique GamesVenkatesan Guruswami, Runzhou Tao. [doi]
• Submodular Optimization with Contention Resolution ExtensionsBenjamin Moseley, Maxim Sviridenko. [doi]
• The Expected Number of Maximal Points of the Convolution of Two 2-D DistributionsJosep Díaz, Mordecai J. Golin. [doi]
• 0Mark Bun, Justin Thaler. [doi]