Abstract is missing.
- Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear SketchesAmit Chakrabarti, Prantar Ghosh, Justin Thaler. [doi]
- Pinning down the Strong Wilber 1 Bound for Binary Search TreesParinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak. [doi]
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic SizeJan Dreier, Philipp Kuinke, Peter Rossmanith. [doi]
- Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov ChainsSarah Miracle, Amanda Pascoe Streib, Noah Streib. [doi]
- Better and Simpler Learning-Augmented Online CachingAlexander Wei. [doi]
- Online Minimum Cost Matching with Recourse on the LineNicole Megow, Lukas Nölke. [doi]
- Approximating Requirement Cut via a Configuration LPRoy Schwartz, Yotam Sharoni. [doi]
- Palette Sparsification Beyond (Δ+1) Vertex ColoringNoga Alon, Sepehr Assadi. [doi]
- On Approximating Degree-Bounded Network Design ProblemsXiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz 0001, Jiayi Xian. [doi]
- Extractor Lower Bounds, RevisitedDivesh Aggarwal, Siyao Guo, Maciej Obremski, João L. Ribeiro 0001, Noah Stephens-Davidowitz. [doi]
- On Testing and Robust Characterizations of ConvexityEric Blais, Abhinav Bommireddi. [doi]
- On the Facility Location Problem in Online and Dynamic ModelsXiangyu Guo, Janardhan Kulkarni, Shi Li, Jiayi Xian. [doi]
- Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and BeyondAnup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar. [doi]
- Low-Rank Binary Matrix Approximation in Column-Sum NormFedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov. [doi]
- On Guillotine Separability of Squares and RectanglesArindam Khan 0001, Madhusudhan Reddy Pittu. [doi]
- On Nonadaptive Security Reductions of Hitting Set GeneratorsShuichi Hirahara, Osamu Watanabe 0001. [doi]
- Improved Explicit Hitting-Sets for ROABPsZeyu Guo, Rohit Gurjar. [doi]
- Nearly Optimal Embeddings of Flat ToriIshan Agarwal, Oded Regev 0001, Yi Tang. [doi]
- Weighted Maximum Independent Set of Geometric Objects in Turnstile StreamsAinesh Bakshi, Nadiia Chepurko, David P. Woodruff. [doi]
- Almost Optimal Testers for Concise RepresentationsNader H. Bshouty. [doi]
- On Perturbation Resilience of Non-Uniform k-CenterSayan Bandyapadhyay. [doi]
- A Tight (3/2+ε) Approximation for Skewed Strip PackingWaldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan 0001, Malin Rau. [doi]
- Approximating Star Cover ProblemsBuddhima Gamlath, Vadim Grinberg. [doi]
- A Constant Factor Approximation for Capacitated Min-Max Tree CoverSyamantak Das, Lavina Jain, Nikhil Kumar. [doi]
- Computing Bi-Lipschitz Outlier Embeddings into the LineKarine Chubarian, Anastasios Sidiropoulos. [doi]
- On the Approximability of Presidential Type PredicatesNeng Huang, Aaron Potechin. [doi]
- Reaching a Consensus on Random Networks: The Power of FewLinh V. Tran, Van Vu. [doi]
- A Fast Binary Splitting Approach to Non-Adaptive Group TestingEric Price, Jonathan Scarlett. [doi]
- A Simpler Strong Refutation of Random k-XORKwangjun Ahn. [doi]
- Almost Optimal Distribution-Free Sample-Based Testing of k-ModalityDana Ron, Asaf Rosin. [doi]
- The GaussianSketch for Almost Relative Error Kernel DistanceJeff M. Phillips, Wai Ming Tai. [doi]
- On the List Recoverability of Randomly Punctured CodesBen Lund, Aditya Potukuchi. [doi]
- On the Parameterized Approximability of Contraction to Classes of Chordal GraphsSpoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. [doi]
- A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral CaseSylvia Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang. [doi]
- An Extension of Plücker Relations with Applications to Subdeterminant MaximizationNima Anari, Thuy Duong Vuong. [doi]
- Streaming Complexity of SVMsAlexandr Andoni, Collin Burns, Yi Li 0002, Sepideh Mahabadi, David P. Woodruff. [doi]
- Distributed Testing of Graph Isomorphism in the CONGEST ModelReut Levi, Moti Medina. [doi]
- p Pattern Matching in a StreamTatiana Starikovskaya, Michal Svagerka, Przemyslaw Uznanski. [doi]
- On Multilinear Forms: Bias, Correlation, and Tensor RankAbhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar 0001. [doi]
- Improved Circular k-Mismatch SketchesShay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski. [doi]
- An Approximation Algorithm for the MAX-2-Local Hamiltonian ProblemSean Hallgren, Eunou Lee, Ojas Parekh. [doi]
- Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRGSumegha Garg, Pravesh K. Kothari, Ran Raz. [doi]
- Is It Possible to Improve Yao's XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle?Ronen Shaltiel. [doi]
- Hardness of Approximation of (Multi-)LCS over Small AlphabetAmey Bhangale, Diptarka Chakraborty, Rajendra Kumar. [doi]
- Revisiting Alphabet Reduction in Dinur's PCPVenkatesan Guruswami, Jakub Oprsal, Sai Sandeep. [doi]
- Maximizing the Correlation: Extending Grothendieck's Inequality to Large DomainsDor Katzelnick, Roy Schwartz. [doi]
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite GraphsChun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang 0001. [doi]
- Learning Lines with Ordinal ConstraintsBohan Fan, Diego Ihara, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh. [doi]
- Online Coloring of Short IntervalsJoanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak 0001. [doi]
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph ProblemsCyrus Rashtchian, David P. Woodruff, Hanlin Zhu. [doi]
- Polynomial Identity Testing for Low Degree Polynomials with Optimal RandomnessMarkus Bläser, Anurag Pandey. [doi]
- When Is Amplification Necessary for Composition in Randomized Query Complexity?Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson 0001. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid ConstraintsChien-Chung Huang, Theophile Thiery, Justin Ward. [doi]
- On Hitting-Set Generators for Polynomials That Vanish RarelyDean Doron, Amnon Ta-Shma, Roei Tell. [doi]
- Multicriteria Cuts and Size-Constrained k-Cuts in HypergraphsCalvin Beideman, Karthekeyan Chandrasekaran, Chao Xu 0002. [doi]
- Bounds for List-Decoding and List-Recovery of Random Linear CodesVenkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters. [doi]
- Permutation Strikes Back: The Power of Recourse in Online Metric MatchingVarun Gupta 0004, Ravishankar Krishnaswamy, Sai Sandeep. [doi]
- Chernoff Bound for High-Dimensional ExpandersTali Kaufman, Ella Sharakanski. [doi]
- How to Cut a Ball Without Separating: Improved Approximations for Length Bounded CutEden Chlamtác, Petr Kolman. [doi]
- Testing Data BinningsClément L. Canonne, Karl Wimmer. [doi]
- Balanced Allocation on Dynamic HypergraphsCatherine S. Greenhill, Bernard Mans, Ali Pourmiri. [doi]
- Testable Properties in General Graphs and Random Order StreamingArtur Czumaj, Hendrik Fichtenberger, Pan Peng 0001, Christian Sohler. [doi]
- Parametrized Metrical Task SystemsSébastien Bubeck, Yuval Rabani. [doi]
- Maximizing Throughput in Flow Shop Real-Time SchedulingLior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. [doi]