<h2>LIPIcs, Volume 275, APPROX/RANDOM 2023</h2>
<ul>
<li>
<span class="authors">Nicole Megow and Adam Smith</span>
<span class="title">LIPIcs, Volume 275, APPROX/RANDOM 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023">10.4230/LIPIcs.APPROX/RANDOM.2023</a>
</li>
<li>
<span class="authors">Nicole Megow and Adam Smith</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.2023.0">10.4230/LIPIcs.APPROX/RANDOM.2023.0</a>
</li>
<li>
<span class="authors">Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., and Saeed Seddighin</span>
<span class="title">On Complexity of 1-Center in Various Metrics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.1">10.4230/LIPIcs.APPROX/RANDOM.2023.1</a>
</li>
<li>
<span class="authors">Kamesh Munagala, Govind S. Sankar, and Erin Taylor</span>
<span class="title">Probabilistic Metric Embedding via Metric Labeling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.2">10.4230/LIPIcs.APPROX/RANDOM.2023.2</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran and Weihang Wang</span>
<span class="title">Approximating Submodular k-Partition via Principal Partition Sequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.3">10.4230/LIPIcs.APPROX/RANDOM.2023.3</a>
</li>
<li>
<span class="authors">Lap Chi Lau, Robert Wang, and Hong Zhou</span>
<span class="title">Experimental Design for Any p-Norm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.4">10.4230/LIPIcs.APPROX/RANDOM.2023.4</a>
</li>
<li>
<span class="authors">George Karakostas and Stavros G. Kolliopoulos</span>
<span class="title">Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.5">10.4230/LIPIcs.APPROX/RANDOM.2023.5</a>
</li>
<li>
<span class="authors">Morteza Monemizadeh</span>
<span class="title">Facility Location in the Sublinear Geometric Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.6">10.4230/LIPIcs.APPROX/RANDOM.2023.6</a>
</li>
<li>
<span class="authors">Tanvi Bajpai and Chandra Chekuri</span>
<span class="title">Bicriteria Approximation Algorithms for Priority Matroid Median</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.7">10.4230/LIPIcs.APPROX/RANDOM.2023.7</a>
</li>
<li>
<span class="authors">Elena Grigorescu, Nithish Kumar, and Young-San Lin</span>
<span class="title">Approximation Algorithms for Directed Weighted Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.8">10.4230/LIPIcs.APPROX/RANDOM.2023.8</a>
</li>
<li>
<span class="authors">Matej Lieskovský, Jiří Sgall, and Andreas Emil Feldmann</span>
<span class="title">Approximation Algorithms and Lower Bounds for Graph Burning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.9">10.4230/LIPIcs.APPROX/RANDOM.2023.9</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Siyao Guo, Spencer Peters, and Noah Stephens-Davidowitz</span>
<span class="title">The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.10">10.4230/LIPIcs.APPROX/RANDOM.2023.10</a>
</li>
<li>
<span class="authors">Eden Chlamtáč, Yury Makarychev, and Ali Vakilian</span>
<span class="title">Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.11">10.4230/LIPIcs.APPROX/RANDOM.2023.11</a>
</li>
<li>
<span class="authors">Anupam Gupta, Amit Kumar, and Debmalya Panigrahi</span>
<span class="title">Efficient Algorithms and Hardness Results for the Weighted k-Server Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.12">10.4230/LIPIcs.APPROX/RANDOM.2023.12</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Ramin Mousavi</span>
<span class="title">A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.13">10.4230/LIPIcs.APPROX/RANDOM.2023.13</a>
</li>
<li>
<span class="authors">Ishan Bansal, Joe Cheriyan, Logan Grout, and Sharat Ibrahimpur</span>
<span class="title">Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.14">10.4230/LIPIcs.APPROX/RANDOM.2023.14</a>
</li>
<li>
<span class="authors">Noah G. Singer</span>
<span class="title">Oblivious Algorithms for the Max-kAND Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.15">10.4230/LIPIcs.APPROX/RANDOM.2023.15</a>
</li>
<li>
<span class="authors">Felix Höhne and Rob van Stee</span>
<span class="title">A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.16">10.4230/LIPIcs.APPROX/RANDOM.2023.16</a>
</li>
<li>
<span class="authors">Lindsey Deryckere and Seeun William Umboh</span>
<span class="title">Online Matching with Set and Concave Delays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.17">10.4230/LIPIcs.APPROX/RANDOM.2023.17</a>
</li>
<li>
<span class="authors">Anita Dürr, Nicolas El Maalouly, and Lasse Wulf</span>
<span class="title">An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.18">10.4230/LIPIcs.APPROX/RANDOM.2023.18</a>
</li>
<li>
<span class="authors">Josefine Foos, Stephan Held, and Yannik Kyle Dustin Spitzley</span>
<span class="title">Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.19">10.4230/LIPIcs.APPROX/RANDOM.2023.19</a>
</li>
<li>
<span class="authors">Danish Kashaev and Guido Schäfer</span>
<span class="title">Round and Bipartize for Vertex Cover Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.20">10.4230/LIPIcs.APPROX/RANDOM.2023.20</a>
</li>
<li>
<span class="authors">Nikhil Ayyadevara, Nikhil Bansal, and Milind Prabhu</span>
<span class="title">On Minimizing Generalized Makespan on Unrelated Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.21">10.4230/LIPIcs.APPROX/RANDOM.2023.21</a>
</li>
<li>
<span class="authors">Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai</span>
<span class="title">An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.22">10.4230/LIPIcs.APPROX/RANDOM.2023.22</a>
</li>
<li>
<span class="authors">Kalen Patton, Matteo Russo, and Sahil Singla</span>
<span class="title">Submodular Norms with Applications To Online Facility Location and Stochastic Probing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.23">10.4230/LIPIcs.APPROX/RANDOM.2023.23</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Kent Quanrud</span>
<span class="title">Independent Sets in Elimination Graphs with a Submodular Objective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.24">10.4230/LIPIcs.APPROX/RANDOM.2023.24</a>
</li>
<li>
<span class="authors">Sepideh Mahabadi and Shyam Narayanan</span>
<span class="title">Improved Diversity Maximization Algorithms for Matching and Pseudoforest</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.25">10.4230/LIPIcs.APPROX/RANDOM.2023.25</a>
</li>
<li>
<span class="authors">Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, and Christos Tzamos</span>
<span class="title">Approximating Pandora’s Box with Correlations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.26">10.4230/LIPIcs.APPROX/RANDOM.2023.26</a>
</li>
<li>
<span class="authors">Mark de Berg, Arpan Sadhukhan, and Frits Spieksma</span>
<span class="title">Stable Approximation Algorithms for Dominating Set and Independent Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.27">10.4230/LIPIcs.APPROX/RANDOM.2023.27</a>
</li>
<li>
<span class="authors">Quanquan C. Liu, Yiduo Ke, and Samir Khuller</span>
<span class="title">Scalable Auction Algorithms for Bipartite Maximum Matching Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.28">10.4230/LIPIcs.APPROX/RANDOM.2023.28</a>
</li>
<li>
<span class="authors">Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, and Viktor Zamaraev</span>
<span class="title">Giant Components in Random Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.29">10.4230/LIPIcs.APPROX/RANDOM.2023.29</a>
</li>
<li>
<span class="authors">Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, and Emo Welzl</span>
<span class="title">On Connectivity in Random Graph Models with Limited Dependencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.30">10.4230/LIPIcs.APPROX/RANDOM.2023.30</a>
</li>
<li>
<span class="authors">Russell Impagliazzo, Valentine Kabanets, and Ilya Volkovich</span>
<span class="title">Synergy Between Circuit Obfuscation and Circuit Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.31">10.4230/LIPIcs.APPROX/RANDOM.2023.31</a>
</li>
<li>
<span class="authors">Meghal Gupta and Rachel Yun Zhang</span>
<span class="title">Interactive Error Correcting Codes: New Constructions and Impossibility Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.32">10.4230/LIPIcs.APPROX/RANDOM.2023.32</a>
</li>
<li>
<span class="authors">Charilaos Efthymiou, Thomas P. Hayes, Daniel Štefankovič, and Eric Vigoda</span>
<span class="title">Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.33">10.4230/LIPIcs.APPROX/RANDOM.2023.33</a>
</li>
<li>
<span class="authors">Nader H. Bshouty</span>
<span class="title">Superpolynomial Lower Bounds for Learning Monotone Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.34">10.4230/LIPIcs.APPROX/RANDOM.2023.34</a>
</li>
<li>
<span class="authors">Emin Karayel</span>
<span class="title">An Embarrassingly Parallel Optimal-Space Cardinality Estimation Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.35">10.4230/LIPIcs.APPROX/RANDOM.2023.35</a>
</li>
<li>
<span class="authors">Yuval Filmus, Itai Leigh, Artur Riazanov, and Dmitry Sokolov</span>
<span class="title">Sampling and Certifying Symmetric Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.36">10.4230/LIPIcs.APPROX/RANDOM.2023.36</a>
</li>
<li>
<span class="authors">Huck Bennett and Chris Peikert</span>
<span class="title">Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.37">10.4230/LIPIcs.APPROX/RANDOM.2023.37</a>
</li>
<li>
<span class="authors">Konrad Anand, Andreas Göbel, Marcus Pappik, and Will Perkins</span>
<span class="title">Perfect Sampling for Hard Spheres from Strong Spatial Mixing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.38">10.4230/LIPIcs.APPROX/RANDOM.2023.38</a>
</li>
<li>
<span class="authors">Xi Chen, Yaonan Jin, Tim Randolph, and Rocco A. Servedio</span>
<span class="title">Subset Sum in Time 2^{n/2} / poly(n)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.39">10.4230/LIPIcs.APPROX/RANDOM.2023.39</a>
</li>
<li>
<span class="authors">Dorna Abdolazimi, Kasper Lindberg, and Shayan Oveis Gharan</span>
<span class="title">On Optimization and Counting of Non-Broken Bases of Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.40">10.4230/LIPIcs.APPROX/RANDOM.2023.40</a>
</li>
<li>
<span class="authors">Prashanth Amireddy, Srikanth Srinivasan, and Madhu Sudan</span>
<span class="title">Low-Degree Testing over Grids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.41">10.4230/LIPIcs.APPROX/RANDOM.2023.41</a>
</li>
<li>
<span class="authors">Rubi Arviv, Lily Chung, Reut Levi, and Edward Pyne</span>
<span class="title">Improved Local Computation Algorithms for Constructing Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.42">10.4230/LIPIcs.APPROX/RANDOM.2023.42</a>
</li>
<li>
<span class="authors">Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh, and John C. S. Lui</span>
<span class="title">Classical Simulation of One-Query Quantum Distinguishers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.43">10.4230/LIPIcs.APPROX/RANDOM.2023.43</a>
</li>
<li>
<span class="authors">Chin Ho Lee, Edward Pyne, and Salil Vadhan</span>
<span class="title">On the Power of Regular and Permutation Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.44">10.4230/LIPIcs.APPROX/RANDOM.2023.44</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Joel Manning, Zhiwei Steven Wu, and Samson Zhou</span>
<span class="title">Private Data Stream Analysis for Universal Symmetric Norm Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.45">10.4230/LIPIcs.APPROX/RANDOM.2023.45</a>
</li>
<li>
<span class="authors">Lior Gishboliner, Nick Kushnir, and Asaf Shapira</span>
<span class="title">Testing Versus Estimation of Graph Properties, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.46">10.4230/LIPIcs.APPROX/RANDOM.2023.46</a>
</li>
<li>
<span class="authors">Joshua Cook and Ron D. Rothblum</span>
<span class="title">Efficient Interactive Proofs for Non-Deterministic Bounded Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.47">10.4230/LIPIcs.APPROX/RANDOM.2023.47</a>
</li>
<li>
<span class="authors">Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra</span>
<span class="title">On the Complexity of Triangle Counting Using Emptiness Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.48">10.4230/LIPIcs.APPROX/RANDOM.2023.48</a>
</li>
<li>
<span class="authors">Roy Gotlib and Tali Kaufman</span>
<span class="title">Fine Grained Analysis of High Dimensional Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.49">10.4230/LIPIcs.APPROX/RANDOM.2023.49</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Shilun Li</span>
<span class="title">A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.50">10.4230/LIPIcs.APPROX/RANDOM.2023.50</a>
</li>
<li>
<span class="authors">Yahli Hecht, Dor Minzer, and Muli Safra</span>
<span class="title">NP-Hardness of Almost Coloring Almost 3-Colorable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.51">10.4230/LIPIcs.APPROX/RANDOM.2023.51</a>
</li>
<li>
<span class="authors">Swastik Kopparty and Vishvajeet N</span>
<span class="title">Extracting Mergers and Projections of Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.52">10.4230/LIPIcs.APPROX/RANDOM.2023.52</a>
</li>
<li>
<span class="authors">Antonio Blanca and Xusheng Zhang</span>
<span class="title">Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.53">10.4230/LIPIcs.APPROX/RANDOM.2023.53</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noela Müller, and Maurice Rolvien</span>
<span class="title">The Full Rank Condition for Sparse Random Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.54">10.4230/LIPIcs.APPROX/RANDOM.2023.54</a>
</li>
<li>
<span class="authors">Joshua Cook and Dana Moshkovitz</span>
<span class="title">Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.55">10.4230/LIPIcs.APPROX/RANDOM.2023.55</a>
</li>
<li>
<span class="authors">Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, and Pengxiang Wang</span>
<span class="title">Robustness for Space-Bounded Statistical Zero Knowledge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.56">10.4230/LIPIcs.APPROX/RANDOM.2023.56</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Michael Kapralov, and Huacheng Yu</span>
<span class="title">On Constructing Spanners from Random Gaussian Projections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.57">10.4230/LIPIcs.APPROX/RANDOM.2023.57</a>
</li>
<li>
<span class="authors">Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, and Chen Wang</span>
<span class="title">Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.58">10.4230/LIPIcs.APPROX/RANDOM.2023.58</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, and Samson Zhou</span>
<span class="title">How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.59">10.4230/LIPIcs.APPROX/RANDOM.2023.59</a>
</li>
<li>
<span class="authors">Fernando Granha Jeronimo</span>
<span class="title">Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.60">10.4230/LIPIcs.APPROX/RANDOM.2023.60</a>
</li>
<li>
<span class="authors">Renato Ferreira Pinto Jr.</span>
<span class="title">Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.61">10.4230/LIPIcs.APPROX/RANDOM.2023.61</a>
</li>
<li>
<span class="authors">Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, and Jakub Tětek</span>
<span class="title">Bias Reduction for Sum Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.62">10.4230/LIPIcs.APPROX/RANDOM.2023.62</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, and Nitin Saurabh</span>
<span class="title">On the Composition of Randomized Query Complexity and Approximate Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63">10.4230/LIPIcs.APPROX/RANDOM.2023.63</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and Paulina Smolarova</span>
<span class="title">Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.64">10.4230/LIPIcs.APPROX/RANDOM.2023.64</a>
</li>
<li>
<span class="authors">Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, and Sidhant Saraogi</span>
<span class="title">Range Avoidance for Constant Depth Circuits: Hardness and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.65">10.4230/LIPIcs.APPROX/RANDOM.2023.65</a>
</li>
<li>
<span class="authors">Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, and Dragos Ristache</span>
<span class="title">Testing Connectedness of Images</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.66">10.4230/LIPIcs.APPROX/RANDOM.2023.66</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