<h2>LIPIcs, Volume 317, APPROX/RANDOM 2024</h2>
<ul>
<li>
<span class="authors">Amit Kumar and Noga Ron-Zewi</span>
<span class="title">LIPIcs, Volume 317, APPROX/RANDOM 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024">10.4230/LIPIcs.APPROX/RANDOM.2024</a>
</li>
<li>
<span class="authors">Amit Kumar and Noga Ron-Zewi</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.2024.0">10.4230/LIPIcs.APPROX/RANDOM.2024.0</a>
</li>
<li>
<span class="authors">Susanne Armbruster, Matthias Mnich, and Martin Nägele</span>
<span class="title">A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.1">10.4230/LIPIcs.APPROX/RANDOM.2024.1</a>
</li>
<li>
<span class="authors">Shuchi Chawla and Dimitris Christou</span>
<span class="title">Online Time-Windows TSP with Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.2">10.4230/LIPIcs.APPROX/RANDOM.2024.2</a>
</li>
<li>
<span class="authors">Michael Dinitz, Guy Kortsarz, and Shi Li</span>
<span class="title">Degrees and Network Design: New Problems and Approximations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.3">10.4230/LIPIcs.APPROX/RANDOM.2024.3</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Hybrid k-Clustering: Blending k-Median and k-Center</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.4">10.4230/LIPIcs.APPROX/RANDOM.2024.4</a>
</li>
<li>
<span class="authors">Divyarthi Mohan and Paweł Prałat</span>
<span class="title">Asynchronous Majority Dynamics on Binomial Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.5">10.4230/LIPIcs.APPROX/RANDOM.2024.5</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi</span>
<span class="title">Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.6">10.4230/LIPIcs.APPROX/RANDOM.2024.6</a>
</li>
<li>
<span class="authors">Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, and Stanislav Živný</span>
<span class="title">A Logarithmic Approximation of Linearly-Ordered Colourings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.7">10.4230/LIPIcs.APPROX/RANDOM.2024.7</a>
</li>
<li>
<span class="authors">Josef Minařík and Jiří Sgall</span>
<span class="title">Speed-Robust Scheduling Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.8">10.4230/LIPIcs.APPROX/RANDOM.2024.8</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, and Weihao Zhu</span>
<span class="title">On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.9">10.4230/LIPIcs.APPROX/RANDOM.2024.9</a>
</li>
<li>
<span class="authors">Martin Böhm, Matej Lieskovský, Sören Schmitt, Jiří Sgall, and Rob van Stee</span>
<span class="title">Improved Online Load Balancing with Known Makespan</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.10">10.4230/LIPIcs.APPROX/RANDOM.2024.10</a>
</li>
<li>
<span class="authors">Björn Martinsson</span>
<span class="title">On the NP-Hardness Approximation Curve for Max-2Lin(2)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.11">10.4230/LIPIcs.APPROX/RANDOM.2024.11</a>
</li>
<li>
<span class="authors">Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, and Seeun William Umboh</span>
<span class="title">Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.12">10.4230/LIPIcs.APPROX/RANDOM.2024.12</a>
</li>
<li>
<span class="authors">Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, and Di Wang</span>
<span class="title">The Average-Value Allocation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.13">10.4230/LIPIcs.APPROX/RANDOM.2024.13</a>
</li>
<li>
<span class="authors">Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, and Andreas Wiese</span>
<span class="title">Scheduling on a Stochastic Number of Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.14">10.4230/LIPIcs.APPROX/RANDOM.2024.14</a>
</li>
<li>
<span class="authors">Yaron Fairstein, Joseph (Seffi) Naor, and Tomer Tsachor</span>
<span class="title">Distributional Online Weighted Paging with Limited Horizon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.15">10.4230/LIPIcs.APPROX/RANDOM.2024.15</a>
</li>
<li>
<span class="authors">Diba Hashemi and Weronika Wrzos-Kaminska</span>
<span class="title">Weighted Matching in the Random-Order Streaming and Robust Communication Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.16">10.4230/LIPIcs.APPROX/RANDOM.2024.16</a>
</li>
<li>
<span class="authors">Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, and Amitabh Trehan</span>
<span class="title">Competitive Query Minimization for Stable Matching with One-Sided Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.17">10.4230/LIPIcs.APPROX/RANDOM.2024.17</a>
</li>
<li>
<span class="authors">Hao Sun</span>
<span class="title">A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.18">10.4230/LIPIcs.APPROX/RANDOM.2024.18</a>
</li>
<li>
<span class="authors">Surendra Ghentiyala and Noah Stephens-Davidowitz</span>
<span class="title">More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.19">10.4230/LIPIcs.APPROX/RANDOM.2024.19</a>
</li>
<li>
<span class="authors">Benjamin Moseley, Heather Newman, and Kirk Pruhs</span>
<span class="title">Online k-Median with Consistent Clusters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.20">10.4230/LIPIcs.APPROX/RANDOM.2024.20</a>
</li>
<li>
<span class="authors">Daniel Hathcock, Guy Kortsarz, and R. Ravi</span>
<span class="title">The Telephone k-Multicast Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.21">10.4230/LIPIcs.APPROX/RANDOM.2024.21</a>
</li>
<li>
<span class="authors">Matthew Casey, Rajmohan Rajaraman, David Stalfa, and Cheng Tan</span>
<span class="title">Scheduling Splittable Jobs on Configurable Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.22">10.4230/LIPIcs.APPROX/RANDOM.2024.22</a>
</li>
<li>
<span class="authors">Mayank Goswami and Riko Jacob</span>
<span class="title">On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.23">10.4230/LIPIcs.APPROX/RANDOM.2024.23</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, and Chen Wang</span>
<span class="title">Learning-Augmented Maximum Independent Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.24">10.4230/LIPIcs.APPROX/RANDOM.2024.24</a>
</li>
<li>
<span class="authors">Philip Cervenjak, Junhao Gan, Seeun William Umboh, and Anthony Wirth</span>
<span class="title">Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.25">10.4230/LIPIcs.APPROX/RANDOM.2024.25</a>
</li>
<li>
<span class="authors">Mridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, and Sourav Chakraborty</span>
<span class="title">Improved Streaming Algorithm for the Klee’s Measure Problem and Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.26">10.4230/LIPIcs.APPROX/RANDOM.2024.26</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.27">10.4230/LIPIcs.APPROX/RANDOM.2024.27</a>
</li>
<li>
<span class="authors">Pratik Ghosal, Syed Mohammad Meesum, and Katarzyna Paluch</span>
<span class="title">Rectangle Tiling Binary Arrays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.28">10.4230/LIPIcs.APPROX/RANDOM.2024.28</a>
</li>
<li>
<span class="authors">David Alemán Espinosa and Chaitanya Swamy</span>
<span class="title">Approximation Algorithms for Correlated Knapsack Orienteering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.29">10.4230/LIPIcs.APPROX/RANDOM.2024.29</a>
</li>
<li>
<span class="authors">Gabriel Arpino, Daniil Dmitriev, and Nicolo Grometto</span>
<span class="title">Greedy Heuristics and Linear Relaxations for the Random Hitting Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.30">10.4230/LIPIcs.APPROX/RANDOM.2024.30</a>
</li>
<li>
<span class="authors">Amnon Ta-Shma and Ron Zadicario</span>
<span class="title">The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.31">10.4230/LIPIcs.APPROX/RANDOM.2024.31</a>
</li>
<li>
<span class="authors">Xiaoyu Chen, Heng Guo, Xinyuan Zhang, and Zongrui Zou</span>
<span class="title">Near-Linear Time Samplers for Matroid Independent Sets with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.32">10.4230/LIPIcs.APPROX/RANDOM.2024.32</a>
</li>
<li>
<span class="authors">Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, and Huacheng Yu</span>
<span class="title">On the Amortized Complexity of Approximate Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.33">10.4230/LIPIcs.APPROX/RANDOM.2024.33</a>
</li>
<li>
<span class="authors">Ashish Gola, Igor Shinkar, and Harsimran Singh</span>
<span class="title">Matrix Multiplication Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.34">10.4230/LIPIcs.APPROX/RANDOM.2024.34</a>
</li>
<li>
<span class="authors">Ishay Haviv and Michal Parnas</span>
<span class="title">Testing Intersectingness of Uniform Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.35">10.4230/LIPIcs.APPROX/RANDOM.2024.35</a>
</li>
<li>
<span class="authors">Lap Chi Lau and Dante Tjowasi</span>
<span class="title">On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.36">10.4230/LIPIcs.APPROX/RANDOM.2024.36</a>
</li>
<li>
<span class="authors">Hadley Black</span>
<span class="title">Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.37">10.4230/LIPIcs.APPROX/RANDOM.2024.37</a>
</li>
<li>
<span class="authors">Nader H. Bshouty and George Haddad</span>
<span class="title">Approximating the Number of Relevant Variables in a Parity Implies Proper Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.38">10.4230/LIPIcs.APPROX/RANDOM.2024.38</a>
</li>
<li>
<span class="authors">Arnab Chatterjee, Amin Coja-Oghlan, Noela Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov, and Haodong Zhu</span>
<span class="title">The Number of Random 2-SAT Solutions Is Asymptotically Log-Normal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.39">10.4230/LIPIcs.APPROX/RANDOM.2024.39</a>
</li>
<li>
<span class="authors">Monika Henzinger, A. R. Sricharan, and Teresa Anna Steiner</span>
<span class="title">Private Counting of Distinct Elements in the Turnstile Model and Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, and Chao Yan</span>
<span class="title">Hilbert Functions and Low-Degree Randomness Extractors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.41">10.4230/LIPIcs.APPROX/RANDOM.2024.41</a>
</li>
<li>
<span class="authors">Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, and Evelyn Warton</span>
<span class="title">Matrix Multiplication Verification Using Coding Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.42">10.4230/LIPIcs.APPROX/RANDOM.2024.42</a>
</li>
<li>
<span class="authors">Eden Fargion, Ran Gelles, and Meghal Gupta</span>
<span class="title">Interactive Coding with Unbounded Noise</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.43">10.4230/LIPIcs.APPROX/RANDOM.2024.43</a>
</li>
<li>
<span class="authors">Ashish Dwivedi, Zeyu Guo, and Ben Lee Volk</span>
<span class="title">Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.44">10.4230/LIPIcs.APPROX/RANDOM.2024.44</a>
</li>
<li>
<span class="authors">Tomer Adar and Eldar Fischer</span>
<span class="title">Refining the Adaptivity Notion in the Huge Object Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.45">10.4230/LIPIcs.APPROX/RANDOM.2024.45</a>
</li>
<li>
<span class="authors">Tomer Adar, Eldar Fischer, and Amit Levi</span>
<span class="title">Support Testing in the Huge Object Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.46">10.4230/LIPIcs.APPROX/RANDOM.2024.46</a>
</li>
<li>
<span class="authors">Evan Chang, Neel Kolhe, and Youngtak Sohn</span>
<span class="title">Upper Bounds on the 2-Colorability Threshold of Random d-Regular k-Uniform Hypergraphs for k ≥ 3</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.47">10.4230/LIPIcs.APPROX/RANDOM.2024.47</a>
</li>
<li>
<span class="authors">Tomer Adar, Eldar Fischer, and Amit Levi</span>
<span class="title">Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.48">10.4230/LIPIcs.APPROX/RANDOM.2024.48</a>
</li>
<li>
<span class="authors">Holden Lee</span>
<span class="title">Parallelising Glauber Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.49">10.4230/LIPIcs.APPROX/RANDOM.2024.49</a>
</li>
<li>
<span class="authors">Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, and Vladimir Podolskii</span>
<span class="title">Towards Simpler Sorting Networks and Monotone Circuits for Majority</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.50">10.4230/LIPIcs.APPROX/RANDOM.2024.50</a>
</li>
<li>
<span class="authors">Halley Goldberg and Valentine Kabanets</span>
<span class="title">Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.51">10.4230/LIPIcs.APPROX/RANDOM.2024.51</a>
</li>
<li>
<span class="authors">Xi Chen, Anindya De, Chin Ho Lee, and Rocco A. Servedio</span>
<span class="title">Trace Reconstruction from Local Statistical Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.52">10.4230/LIPIcs.APPROX/RANDOM.2024.52</a>
</li>
<li>
<span class="authors">Dean Doron, Jonathan Mosheiff, and Mary Wootters</span>
<span class="title">When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.53">10.4230/LIPIcs.APPROX/RANDOM.2024.53</a>
</li>
<li>
<span class="authors">Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, and Dor Minzer</span>
<span class="title">Parallel Repetition of k-Player Projection Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.54">10.4230/LIPIcs.APPROX/RANDOM.2024.54</a>
</li>
<li>
<span class="authors">Praneeth Kacham and David P. Woodruff</span>
<span class="title">Faster Algorithms for Schatten-p Low Rank Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.55">10.4230/LIPIcs.APPROX/RANDOM.2024.55</a>
</li>
<li>
<span class="authors">Aiya Kuchukova, Marcus Pappik, Will Perkins, and Corrine Yap</span>
<span class="title">Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.56">10.4230/LIPIcs.APPROX/RANDOM.2024.56</a>
</li>
<li>
<span class="authors">Uri Meir, Gregory Schwartzman, and Yuichi Yoshida</span>
<span class="title">Stochastic Distance in Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.57">10.4230/LIPIcs.APPROX/RANDOM.2024.57</a>
</li>
<li>
<span class="authors">Vedat Levi Alev and Shravas Rao</span>
<span class="title">Expanderizing Higher Order Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.58">10.4230/LIPIcs.APPROX/RANDOM.2024.58</a>
</li>
<li>
<span class="authors">Elad Aigner-Horev, Dan Hefetz, and Mathias Schacht</span>
<span class="title">Ramsey Properties of Randomly Perturbed Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.59">10.4230/LIPIcs.APPROX/RANDOM.2024.59</a>
</li>
<li>
<span class="authors">Reut Levi, Moti Medina, and Omer Tubul</span>
<span class="title">Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.60">10.4230/LIPIcs.APPROX/RANDOM.2024.60</a>
</li>
<li>
<span class="authors">Kuan Cheng, Minghui Ouyang, Chong Shangguan, and Yuanting Shen</span>
<span class="title">When Can an Expander Code Correct Ω(n) Errors in O(n) Time?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.61">10.4230/LIPIcs.APPROX/RANDOM.2024.61</a>
</li>
<li>
<span class="authors">Yotam Dikstein and Irit Dinur</span>
<span class="title">Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.62">10.4230/LIPIcs.APPROX/RANDOM.2024.62</a>
</li>
<li>
<span class="authors">Vishesh Jain and Clayton Mizgerd</span>
<span class="title">Rapid Mixing of the Down-Up Walk on Matchings of a Fixed Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.63">10.4230/LIPIcs.APPROX/RANDOM.2024.63</a>
</li>
<li>
<span class="authors">Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, and Nitin Saurabh</span>
<span class="title">On the Communication Complexity of Finding a King in a Tournament</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.64">10.4230/LIPIcs.APPROX/RANDOM.2024.64</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Hsin-Po Wang</span>
<span class="title">Capacity-Achieving Gray Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.65">10.4230/LIPIcs.APPROX/RANDOM.2024.65</a>
</li>
<li>
<span class="authors">Noam Mazor and Rafael Pass</span>
<span class="title">On Black-Box Meta Complexity and Function Inversion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.66">10.4230/LIPIcs.APPROX/RANDOM.2024.66</a>
</li>
<li>
<span class="authors">Nicholas Harvey and Arvin Sahami</span>
<span class="title">Explicit and Near-Optimal Construction of t-Rankwise Independent Permutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.67">10.4230/LIPIcs.APPROX/RANDOM.2024.67</a>
</li>
<li>
<span class="authors">Inbar Ben Yaacov, Yotam Dikstein, and Gal Maor</span>
<span class="title">Sparse High Dimensional Expanders via Local Lifts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.68">10.4230/LIPIcs.APPROX/RANDOM.2024.68</a>
</li>
<li>
<span class="authors">Kuan Cheng and Ruiyang Wu</span>
<span class="title">Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.69">10.4230/LIPIcs.APPROX/RANDOM.2024.69</a>
</li>
<li>
<span class="authors">Andreas Galanis, Alkis Kalavasis, and Anthimos Vardis Kandiros</span>
<span class="title">On Sampling from Ising Models with Spectral Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.70">10.4230/LIPIcs.APPROX/RANDOM.2024.70</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, and Nitin Saurabh</span>
<span class="title">Approximate Degree Composition for Recursive Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.71">10.4230/LIPIcs.APPROX/RANDOM.2024.71</a>
</li>
<li>
<span class="authors">Tal Herman</span>
<span class="title">Public Coin Interactive Proofs for Label-Invariant Distribution Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.72">10.4230/LIPIcs.APPROX/RANDOM.2024.72</a>
</li>
<li>
<span class="authors">Jakub Tětek</span>
<span class="title">Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.73">10.4230/LIPIcs.APPROX/RANDOM.2024.73</a>
</li>
<li>
<span class="authors">Kostas Lakis, Johannes Lengler, Kalina Petrova, and Leon Schiller</span>
<span class="title">Improved Bounds for Graph Distances in Scale Free Percolation and Related Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.74">10.4230/LIPIcs.APPROX/RANDOM.2024.74</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Amit Sinhababu, and Thomas Thierauf</span>
<span class="title">Derandomizing Multivariate Polynomial Factoring for Low Degree Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.75">10.4230/LIPIcs.APPROX/RANDOM.2024.75</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