<h2>LIPIcs, Volume 245, APPROX/RANDOM 2022</h2>
<ul>
<li>
<span class="authors">Amit Chakrabarti and Chaitanya Swamy</span>
<span class="title">LIPIcs, Volume 245, APPROX/RANDOM 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022">10.4230/LIPIcs.APPROX/RANDOM.2022</a>
</li>
<li>
<span class="authors">Amit Chakrabarti and Chaitanya Swamy</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.0">10.4230/LIPIcs.APPROX/RANDOM.2022.0</a>
</li>
<li>
<span class="authors">Nikhil Bansal, Aditi Laddha, and Santosh Vempala</span>
<span class="title">A Unified Approach to Discrepancy Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.1">10.4230/LIPIcs.APPROX/RANDOM.2022.1</a>
</li>
<li>
<span class="authors">Chin Ho Lee, Edward Pyne, and Salil Vadhan</span>
<span class="title">Fourier Growth of Regular Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.2">10.4230/LIPIcs.APPROX/RANDOM.2022.2</a>
</li>
<li>
<span class="authors">Tali Kaufman and David Mass</span>
<span class="title">Double Balanced Sets in High Dimensional Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.3">10.4230/LIPIcs.APPROX/RANDOM.2022.3</a>
</li>
<li>
<span class="authors">Antonio Blanca, Sarah Cannon, and Will Perkins</span>
<span class="title">Fast and Perfect Sampling of Subgraphs and Polymer Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.4">10.4230/LIPIcs.APPROX/RANDOM.2022.4</a>
</li>
<li>
<span class="authors">Tali Kaufman and Izhar Oppenheim</span>
<span class="title">High Dimensional Expansion Implies Amplified Local Testability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.5">10.4230/LIPIcs.APPROX/RANDOM.2022.5</a>
</li>
<li>
<span class="authors">Uma Girish, Kunal Mittal, Ran Raz, and Wei Zhan</span>
<span class="title">Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.6">10.4230/LIPIcs.APPROX/RANDOM.2022.6</a>
</li>
<li>
<span class="authors">Hermish Mehta and Daniel Reichman</span>
<span class="title">Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.7">10.4230/LIPIcs.APPROX/RANDOM.2022.7</a>
</li>
<li>
<span class="authors">Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, and Ke Wu</span>
<span class="title">Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.8">10.4230/LIPIcs.APPROX/RANDOM.2022.8</a>
</li>
<li>
<span class="authors">Xuangui Huang, Peter Ivanov, and Emanuele Viola</span>
<span class="title">Affine Extractors and AC0-Parity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.9">10.4230/LIPIcs.APPROX/RANDOM.2022.9</a>
</li>
<li>
<span class="authors">Zhao Song and Ruizhe Zhang</span>
<span class="title">Hyperbolic Concentration, Anti-Concentration, and Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.10">10.4230/LIPIcs.APPROX/RANDOM.2022.10</a>
</li>
<li>
<span class="authors">Dan Karliner and Amnon Ta-Shma</span>
<span class="title">Improved Local Testing for Multiplicity Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.11">10.4230/LIPIcs.APPROX/RANDOM.2022.11</a>
</li>
<li>
<span class="authors">Itay Kalev and Amnon Ta-Shma</span>
<span class="title">Unbalanced Expanders from Multiplicity Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.12">10.4230/LIPIcs.APPROX/RANDOM.2022.12</a>
</li>
<li>
<span class="authors">Yi Li, Honghao Lin, David P. Woodruff, and Yuheng Zhang</span>
<span class="title">Streaming Algorithms with Large Approximation Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.13">10.4230/LIPIcs.APPROX/RANDOM.2022.13</a>
</li>
<li>
<span class="authors">Hridesh Kedia, Shunhao Oh, and Dana Randall</span>
<span class="title">Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.14">10.4230/LIPIcs.APPROX/RANDOM.2022.14</a>
</li>
<li>
<span class="authors">Maciej Skorski</span>
<span class="title">Tight Chernoff-Like Bounds Under Limited Independence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.15">10.4230/LIPIcs.APPROX/RANDOM.2022.15</a>
</li>
<li>
<span class="authors">Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, and Ruizhe Zhang</span>
<span class="title">Eigenstripping, Spectral Decay, and Edge-Expansion on Posets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16">10.4230/LIPIcs.APPROX/RANDOM.2022.16</a>
</li>
<li>
<span class="authors">Iwan Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, and Hsin-Po Wang</span>
<span class="title">Accelerating Polarization via Alphabet Extension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.17">10.4230/LIPIcs.APPROX/RANDOM.2022.17</a>
</li>
<li>
<span class="authors">Louis Esperet, Nathaniel Harms, and Andrey Kupavskii</span>
<span class="title">Sketching Distances in Monotone Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.18">10.4230/LIPIcs.APPROX/RANDOM.2022.18</a>
</li>
<li>
<span class="authors">Mika Göös and Siddhartha Jain</span>
<span class="title">Communication Complexity of Collision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.19">10.4230/LIPIcs.APPROX/RANDOM.2022.19</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Xin Lyu, and Xiuhan Wang</span>
<span class="title">Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.20">10.4230/LIPIcs.APPROX/RANDOM.2022.20</a>
</li>
<li>
<span class="authors">Vishwas Bhargava, Ankit Garg, Neeraj Kayal, and Chandan Saha</span>
<span class="title">Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.21">10.4230/LIPIcs.APPROX/RANDOM.2022.21</a>
</li>
<li>
<span class="authors">Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, and Rosie Zhao</span>
<span class="title">Lower Bound Methods for Sign-Rank and Their Limitations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.22">10.4230/LIPIcs.APPROX/RANDOM.2022.22</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, and Partha Mukhopadhyay</span>
<span class="title">Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.23">10.4230/LIPIcs.APPROX/RANDOM.2022.23</a>
</li>
<li>
<span class="authors">Antonio Blanca and Reza Gheissari</span>
<span class="title">Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.24">10.4230/LIPIcs.APPROX/RANDOM.2022.24</a>
</li>
<li>
<span class="authors">Weiming Feng, Heng Guo, and Jiaheng Wang</span>
<span class="title">Improved Bounds for Randomly Colouring Simple Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.25">10.4230/LIPIcs.APPROX/RANDOM.2022.25</a>
</li>
<li>
<span class="authors">Yahel Manor and Or Meir</span>
<span class="title">Lifting with Inner Functions of Polynomial Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.26">10.4230/LIPIcs.APPROX/RANDOM.2022.26</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, and Sayantan Sen</span>
<span class="title">Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.27">10.4230/LIPIcs.APPROX/RANDOM.2022.27</a>
</li>
<li>
<span class="authors">Peter Mörters, Christian Sohler, and Stefan Walzer</span>
<span class="title">A Sublinear Local Access Implementation for the Chinese Restaurant Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.28">10.4230/LIPIcs.APPROX/RANDOM.2022.28</a>
</li>
<li>
<span class="authors">Pu Gao, Calum MacRury, and Paweł Prałat</span>
<span class="title">A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.29">10.4230/LIPIcs.APPROX/RANDOM.2022.29</a>
</li>
<li>
<span class="authors">Marcos Kiwi, Markus Schepers, and John Sylvester</span>
<span class="title">Cover and Hitting Times of Hyperbolic Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.30">10.4230/LIPIcs.APPROX/RANDOM.2022.30</a>
</li>
<li>
<span class="authors">Sepideh Mahabadi, David P. Woodruff, and Samson Zhou</span>
<span class="title">Adaptive Sketches for Robust Regression with Importance Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.31">10.4230/LIPIcs.APPROX/RANDOM.2022.31</a>
</li>
<li>
<span class="authors">Simon Apers, Paweł Gawrychowski, and Troy Lee</span>
<span class="title">Finding the KT Partition of a Weighted Graph in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.32">10.4230/LIPIcs.APPROX/RANDOM.2022.32</a>
</li>
<li>
<span class="authors">Moran Feldman and Ariel Szarf</span>
<span class="title">Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.33">10.4230/LIPIcs.APPROX/RANDOM.2022.33</a>
</li>
<li>
<span class="authors">Shichuan Deng and Qianfan Zhang</span>
<span class="title">Ordered k-Median with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.34">10.4230/LIPIcs.APPROX/RANDOM.2022.34</a>
</li>
<li>
<span class="authors">Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, and Santhoshini Velusamy</span>
<span class="title">Sketching Approximability of (Weak) Monarchy Predicates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.35">10.4230/LIPIcs.APPROX/RANDOM.2022.35</a>
</li>
<li>
<span class="authors">Takuro Fukunaga</span>
<span class="title">Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.36">10.4230/LIPIcs.APPROX/RANDOM.2022.36</a>
</li>
<li>
<span class="authors">Roy Schwartz and Roded Zats</span>
<span class="title">Fair Correlation Clustering in General Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.37">10.4230/LIPIcs.APPROX/RANDOM.2022.37</a>
</li>
<li>
<span class="authors">Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, and Santhoshini Velusamy</span>
<span class="title">On Sketching Approximations for Symmetric Boolean CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.38">10.4230/LIPIcs.APPROX/RANDOM.2022.38</a>
</li>
<li>
<span class="authors">Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, and Slobodan Mitrović</span>
<span class="title">Massively Parallel Algorithms for Small Subgraph Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.39">10.4230/LIPIcs.APPROX/RANDOM.2022.39</a>
</li>
<li>
<span class="authors">Daniel A. Spielman and Peng Zhang</span>
<span class="title">Hardness Results for Weaver’s Discrepancy Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.40">10.4230/LIPIcs.APPROX/RANDOM.2022.40</a>
</li>
<li>
<span class="authors">Michael Dinitz, Ama Koranteng, and Guy Kortsarz</span>
<span class="title">Relative Survivable Network Design</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.41">10.4230/LIPIcs.APPROX/RANDOM.2022.41</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Pravesh K. Kothari, and Peter Manohar</span>
<span class="title">Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.42">10.4230/LIPIcs.APPROX/RANDOM.2022.42</a>
</li>
<li>
<span class="authors">Suprovat Ghoshal and Anand Louis</span>
<span class="title">Approximating CSPs with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.43">10.4230/LIPIcs.APPROX/RANDOM.2022.43</a>
</li>
<li>
<span class="authors">Frederick Qiu and Sahil Singla</span>
<span class="title">Submodular Dominance and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.44">10.4230/LIPIcs.APPROX/RANDOM.2022.44</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Martin Böhm, Jarosław Byrka, and Jan Marcinkowski</span>
<span class="title">Online Facility Location with Linear Delay</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.45">10.4230/LIPIcs.APPROX/RANDOM.2022.45</a>
</li>
<li>
<span class="authors">Allan Borodin, Calum MacRury, and Akash Rakheja</span>
<span class="title">Prophet Matching in the Probe-Commit Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.46">10.4230/LIPIcs.APPROX/RANDOM.2022.46</a>
</li>
<li>
<span class="authors">Suprovat Ghoshal</span>
<span class="title">The Biased Homogeneous r-Lin Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.47">10.4230/LIPIcs.APPROX/RANDOM.2022.47</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Hoai-An Nguyen</span>
<span class="title">Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.48">10.4230/LIPIcs.APPROX/RANDOM.2022.48</a>
</li>
<li>
<span class="authors">Max Klimm and Martin Knaack</span>
<span class="title">Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.49">10.4230/LIPIcs.APPROX/RANDOM.2022.49</a>
</li>
<li>
<span class="authors">Aleksa Stanković</span>
<span class="title">Some Results on Approximability of Minimum Sum Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.50">10.4230/LIPIcs.APPROX/RANDOM.2022.50</a>
</li>
<li>
<span class="authors">Michael Elkin and Chhaya Trehan</span>
<span class="title">(1+ε)-Approximate Shortest Paths in Dynamic Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.51">10.4230/LIPIcs.APPROX/RANDOM.2022.51</a>
</li>
<li>
<span class="authors">Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang</span>
<span class="title">Caching with Reserves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.52">10.4230/LIPIcs.APPROX/RANDOM.2022.52</a>
</li>
<li>
<span class="authors">Kheeran K. Naidu and Vihan Shah</span>
<span class="title">Space Optimal Vertex Cover in Dynamic Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.53">10.4230/LIPIcs.APPROX/RANDOM.2022.53</a>
</li>
<li>
<span class="authors">Debarati Das and Barna Saha</span>
<span class="title">Approximating LCS and Alignment Distance over Multiple Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.54">10.4230/LIPIcs.APPROX/RANDOM.2022.54</a>
</li>
<li>
<span class="authors">Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, and Ziena Zeif</span>
<span class="title">A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.55">10.4230/LIPIcs.APPROX/RANDOM.2022.55</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing