<h2>LIPIcs, Volume 145, APPROX/RANDOM 2019</h2>
<ul>
<li>
<span class="authors">Dimitris Achlioptas and László A. Végh</span>
<span class="title">LIPIcs, Volume 145, APPROX/RANDOM'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019">10.4230/LIPIcs.APPROX-RANDOM.2019</a>
</li>
<li>
<span class="authors">Dimitris Achlioptas and László A. Végh</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.2019.0">10.4230/LIPIcs.APPROX-RANDOM.2019.0</a>
</li>
<li>
<span class="authors">Manuel Fernández V, David P. Woodruff, and Taisuke Yasuda</span>
<span class="title">The Query Complexity of Mastermind with l_p Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.1">10.4230/LIPIcs.APPROX-RANDOM.2019.1</a>
</li>
<li>
<span class="authors">Chi-Ning Chou, Zhixian Lei, and Preetum Nakkiran</span>
<span class="title">Tracking the l_2 Norm with Constant Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.2">10.4230/LIPIcs.APPROX-RANDOM.2019.2</a>
</li>
<li>
<span class="authors">Benjamin Moseley and Maxim Sviridenko</span>
<span class="title">Submodular Optimization with Contention Resolution Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.3">10.4230/LIPIcs.APPROX-RANDOM.2019.3</a>
</li>
<li>
<span class="authors">David Ellis Hershkowitz, R. Ravi, and Sahil Singla</span>
<span class="title">Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.4">10.4230/LIPIcs.APPROX-RANDOM.2019.4</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Runzhou Tao</span>
<span class="title">Streaming Hardness of Unique Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.5">10.4230/LIPIcs.APPROX-RANDOM.2019.5</a>
</li>
<li>
<span class="authors">Arnold Filtser</span>
<span class="title">On Strong Diameter Padded Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.6">10.4230/LIPIcs.APPROX-RANDOM.2019.6</a>
</li>
<li>
<span class="authors">Alon Eden, Uriel Feige, and Michal Feldman</span>
<span class="title">Max-Min Greedy Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.7">10.4230/LIPIcs.APPROX-RANDOM.2019.7</a>
</li>
<li>
<span class="authors">Gary L. Miller, Noel J. Walkington, and Alex L. Wang</span>
<span class="title">Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.8">10.4230/LIPIcs.APPROX-RANDOM.2019.8</a>
</li>
<li>
<span class="authors">Prahladh Harsha, Subhash Khot, Euiwoong Lee, and Devanathan Thiruvenkatachari</span>
<span class="title">Improved 3LIN Hardness via Linear Label Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.9">10.4230/LIPIcs.APPROX-RANDOM.2019.9</a>
</li>
<li>
<span class="authors">Ilan Reuven Cohen, Alon Eden, Amos Fiat, and Łukasz Jeż</span>
<span class="title">Dynamic Pricing of Servers on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.10">10.4230/LIPIcs.APPROX-RANDOM.2019.10</a>
</li>
<li>
<span class="authors">Eden Chlamtáč, Michael Dinitz, and Thomas Robinson</span>
<span class="title">Approximating the Norms of Graph Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.11">10.4230/LIPIcs.APPROX-RANDOM.2019.11</a>
</li>
<li>
<span class="authors">Dhruv Rohatgi</span>
<span class="title">Conditional Hardness of Earth Mover Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.12">10.4230/LIPIcs.APPROX-RANDOM.2019.12</a>
</li>
<li>
<span class="authors">Reyna Hulett</span>
<span class="title">Single-Elimination Brackets Fail to Approximate Copeland Winner</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.13">10.4230/LIPIcs.APPROX-RANDOM.2019.13</a>
</li>
<li>
<span class="authors">Timothy Carpenter, Ario Salmasi, and Anastasios Sidiropoulos</span>
<span class="title">Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.14">10.4230/LIPIcs.APPROX-RANDOM.2019.14</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Sai Sandeep</span>
<span class="title">Rainbow Coloring Hardness via Low Sensitivity Polymorphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.15">10.4230/LIPIcs.APPROX-RANDOM.2019.15</a>
</li>
<li>
<span class="authors">Eric Allender, Martín Farach-Colton, and Meng-Tsung Tsai</span>
<span class="title">Syntactic Separation of Subset Satisfiability Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.16">10.4230/LIPIcs.APPROX-RANDOM.2019.16</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Jannik Matuschke, and Orestis Papadigenopoulos</span>
<span class="title">Malleable Scheduling Beyond Identical Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.17">10.4230/LIPIcs.APPROX-RANDOM.2019.17</a>
</li>
<li>
<span class="authors">Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, and Melanie Schmidt</span>
<span class="title">On the Cost of Essentially Fair Clusterings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.18">10.4230/LIPIcs.APPROX-RANDOM.2019.18</a>
</li>
<li>
<span class="authors">Neeraj Kumar, Stavros Sintos, and Subhash Suri</span>
<span class="title">The Maximum Exposure Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.19">10.4230/LIPIcs.APPROX-RANDOM.2019.19</a>
</li>
<li>
<span class="authors">Sagar Kale</span>
<span class="title">Small Space Stream Summary for Matroid Center</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.20">10.4230/LIPIcs.APPROX-RANDOM.2019.20</a>
</li>
<li>
<span class="authors">Alexander Birx, Yann Disser, and Kevin Schewior</span>
<span class="title">Improved Bounds for Open Online Dial-a-Ride on the Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.21">10.4230/LIPIcs.APPROX-RANDOM.2019.21</a>
</li>
<li>
<span class="authors">Susanne Albers, Arindam Khan, and Leon Ladewig</span>
<span class="title">Improved Online Algorithms for Knapsack and GAP in the Random Order Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.22">10.4230/LIPIcs.APPROX-RANDOM.2019.22</a>
</li>
<li>
<span class="authors">Kent Quanrud</span>
<span class="title">Fast and Deterministic Approximations for k-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.23">10.4230/LIPIcs.APPROX-RANDOM.2019.23</a>
</li>
<li>
<span class="authors">Per Austrin and Aleksa Stanković</span>
<span class="title">Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.24">10.4230/LIPIcs.APPROX-RANDOM.2019.24</a>
</li>
<li>
<span class="authors">Andreas S. Schulz and Rajan Udwani</span>
<span class="title">Robust Appointment Scheduling with Heterogeneous Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.25">10.4230/LIPIcs.APPROX-RANDOM.2019.25</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, and Maksim Nikolaev</span>
<span class="title">Collapsing Superstring Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.26">10.4230/LIPIcs.APPROX-RANDOM.2019.26</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Harry Lang, Enayat Ullah, and Samson Zhou</span>
<span class="title">Improved Algorithms for Time Decay Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.27">10.4230/LIPIcs.APPROX-RANDOM.2019.27</a>
</li>
<li>
<span class="authors">Suprovat Ghoshal, Anand Louis, and Rahul Raychaudhury</span>
<span class="title">Approximation Algorithms for Partially Colorable Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.28">10.4230/LIPIcs.APPROX-RANDOM.2019.28</a>
</li>
<li>
<span class="authors">Rajesh Jayaram and David P. Woodruff</span>
<span class="title">Towards Optimal Moment Estimation in Streaming and Distributed Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.29">10.4230/LIPIcs.APPROX-RANDOM.2019.29</a>
</li>
<li>
<span class="authors">Umang Bhaskar and Gunjan Kumar</span>
<span class="title">The Complexity of Partial Function Extension for Coverage Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.30">10.4230/LIPIcs.APPROX-RANDOM.2019.30</a>
</li>
<li>
<span class="authors">Sevag Gharibian and Ojas Parekh</span>
<span class="title">Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.31">10.4230/LIPIcs.APPROX-RANDOM.2019.31</a>
</li>
<li>
<span class="authors">Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, and Nabil H. Mustafa</span>
<span class="title">Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.32">10.4230/LIPIcs.APPROX-RANDOM.2019.32</a>
</li>
<li>
<span class="authors"> Devvrit, Ravishankar Krishnaswamy, and Nived Rajaraman</span>
<span class="title">Robust Correlation Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.33">10.4230/LIPIcs.APPROX-RANDOM.2019.33</a>
</li>
<li>
<span class="authors">Chao Liao, Jiabao Lin, Pinyan Lu, and Zhenyu Mao</span>
<span class="title">Counting Independent Sets and Colorings on Random Regular Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.34">10.4230/LIPIcs.APPROX-RANDOM.2019.34</a>
</li>
<li>
<span class="authors">Josep Diaz and Mordecai Golin</span>
<span class="title">The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.35">10.4230/LIPIcs.APPROX-RANDOM.2019.35</a>
</li>
<li>
<span class="authors">Michael Anastos and Alan Frieze</span>
<span class="title">On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.36">10.4230/LIPIcs.APPROX-RANDOM.2019.36</a>
</li>
<li>
<span class="authors">Matthew Fahrbach and Dana Randall</span>
<span class="title">Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.37">10.4230/LIPIcs.APPROX-RANDOM.2019.37</a>
</li>
<li>
<span class="authors">Ray Li and Mary Wootters</span>
<span class="title">Lifted Multiplicity Codes and the Disjoint Repair Group Property</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.38">10.4230/LIPIcs.APPROX-RANDOM.2019.38</a>
</li>
<li>
<span class="authors">Grant Schoenebeck, Biaoshuai Tao, and Fang-Yi Yu</span>
<span class="title">Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.39">10.4230/LIPIcs.APPROX-RANDOM.2019.39</a>
</li>
<li>
<span class="authors">Irit Dinur and Konstantin Golubev</span>
<span class="title">Direct Sum Testing: The General Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.40">10.4230/LIPIcs.APPROX-RANDOM.2019.40</a>
</li>
<li>
<span class="authors">Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda</span>
<span class="title">Fast Algorithms at Low Temperatures via Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.41">10.4230/LIPIcs.APPROX-RANDOM.2019.41</a>
</li>
<li>
<span class="authors">Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil Vadhan</span>
<span class="title">Deterministic Approximation of Random Walks in Small Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.42">10.4230/LIPIcs.APPROX-RANDOM.2019.42</a>
</li>
<li>
<span class="authors">Avraham Ben-Aroya, Gil Cohen, Dean Doron, and Amnon Ta-Shma</span>
<span class="title">Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.43">10.4230/LIPIcs.APPROX-RANDOM.2019.43</a>
</li>
<li>
<span class="authors">Frank Ban, Xi Chen, Rocco A. Servedio, and Sandip Sinha</span>
<span class="title">Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.44">10.4230/LIPIcs.APPROX-RANDOM.2019.44</a>
</li>
<li>
<span class="authors">Rocco A. Servedio and Li-Yang Tan</span>
<span class="title">Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.45">10.4230/LIPIcs.APPROX-RANDOM.2019.45</a>
</li>
<li>
<span class="authors">Bruce Spang and Mary Wootters</span>
<span class="title">Unconstraining Graph-Constrained Group Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.46">10.4230/LIPIcs.APPROX-RANDOM.2019.46</a>
</li>
<li>
<span class="authors">Ioannis Z. Emiris, Vasilis Margonis, and Ioannis Psarros</span>
<span class="title">Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l_1</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.47">10.4230/LIPIcs.APPROX-RANDOM.2019.47</a>
</li>
<li>
<span class="authors">Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Štefankovič, and Eric Vigoda</span>
<span class="title">Improved Strong Spatial Mixing for Colorings on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.48">10.4230/LIPIcs.APPROX-RANDOM.2019.48</a>
</li>
<li>
<span class="authors">Domagoj Bradac, Sahil Singla, and Goran Zuzic</span>
<span class="title">(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.49">10.4230/LIPIcs.APPROX-RANDOM.2019.49</a>
</li>
<li>
<span class="authors">Roy Gotlib and Tali Kaufman</span>
<span class="title">Testing Odd Direct Sums Using High Dimensional Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.50">10.4230/LIPIcs.APPROX-RANDOM.2019.50</a>
</li>
<li>
<span class="authors">Mika Göös and Thomas Watson</span>
<span class="title">A Lower Bound for Sampling Disjoint Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.51">10.4230/LIPIcs.APPROX-RANDOM.2019.51</a>
</li>
<li>
<span class="authors">Ronitt Rubinfeld and Arsen Vasilyan</span>
<span class="title">Approximating the Noise Sensitivity of a Monotone Boolean Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.52">10.4230/LIPIcs.APPROX-RANDOM.2019.52</a>
</li>
<li>
<span class="authors">Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, and Barna Saha</span>
<span class="title">Connectivity of Random Annulus Graphs and the Geometric Block Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.53">10.4230/LIPIcs.APPROX-RANDOM.2019.53</a>
</li>
<li>
<span class="authors">Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, and Andréa W. Richa</span>
<span class="title">A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.54">10.4230/LIPIcs.APPROX-RANDOM.2019.54</a>
</li>
<li>
<span class="authors">Mark Bun and Justin Thaler</span>
<span class="title">The Large-Error Approximate Degree of AC^0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.55">10.4230/LIPIcs.APPROX-RANDOM.2019.55</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Mika Göös, Daniel Reichman, and Igor Shinkar</span>
<span class="title">String Matching: Communication, Circuits, and Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.56">10.4230/LIPIcs.APPROX-RANDOM.2019.56</a>
</li>
<li>
<span class="authors">V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay</span>
<span class="title">Efficient Black-Box Identity Testing for Free Group Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.57">10.4230/LIPIcs.APPROX-RANDOM.2019.57</a>
</li>
<li>
<span class="authors">Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, and Angelika Steger</span>
<span class="title">The Maximum Label Propagation Algorithm on Sparse Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.58">10.4230/LIPIcs.APPROX-RANDOM.2019.58</a>
</li>
<li>
<span class="authors">Rohit Agrawal</span>
<span class="title">Samplers and Extractors for Unbounded Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.59">10.4230/LIPIcs.APPROX-RANDOM.2019.59</a>
</li>
<li>
<span class="authors">Svante Janson and Gregory B. Sorkin</span>
<span class="title">Successive Minimum Spanning Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.60">10.4230/LIPIcs.APPROX-RANDOM.2019.60</a>
</li>
<li>
<span class="authors">Meena Jagadeesan</span>
<span class="title">Simple Analysis of Sparse, Sign-Consistent JL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.61">10.4230/LIPIcs.APPROX-RANDOM.2019.61</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Dan Feldman, Harry Lang, and Daniela Rus</span>
<span class="title">Streaming Coreset Constructions for M-Estimators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.62">10.4230/LIPIcs.APPROX-RANDOM.2019.62</a>
</li>
<li>
<span class="authors">Shyam Narayanan</span>
<span class="title">Pairwise Independent Random Walks Can Be Slightly Unbounded</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.63">10.4230/LIPIcs.APPROX-RANDOM.2019.63</a>
</li>
<li>
<span class="authors">Zongchen Chen and Santosh S. Vempala</span>
<span class="title">Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.64">10.4230/LIPIcs.APPROX-RANDOM.2019.64</a>
</li>
<li>
<span class="authors">Amos Beimel, Kobbi Nissim, and Mohammad Zaheri</span>
<span class="title">Exploring Differential Obliviousness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.65">10.4230/LIPIcs.APPROX-RANDOM.2019.65</a>
</li>
<li>
<span class="authors">Michael Anastos, Peleg Michaeli, and Samantha Petti</span>
<span class="title">Thresholds in Random Motif Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.66">10.4230/LIPIcs.APPROX-RANDOM.2019.66</a>
</li>
<li>
<span class="authors">Antonio Blanca, Reza Gheissari, and Eric Vigoda</span>
<span class="title">Random-Cluster Dynamics in Z^2: Rapid Mixing with General Boundary Conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.67">10.4230/LIPIcs.APPROX-RANDOM.2019.67</a>
</li>
<li>
<span class="authors">Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, and Shashwat Silas</span>
<span class="title">On List Recovery of High-Rate Tensor Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.68">10.4230/LIPIcs.APPROX-RANDOM.2019.68</a>
</li>
<li>
<span class="authors">Grigory Yaroslavtsev and Samson Zhou</span>
<span class="title">Approximate F_2-Sketching of Valuation Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.69">10.4230/LIPIcs.APPROX-RANDOM.2019.69</a>
</li>
<li>
<span class="authors">Amit Chakrabarti and Prantar Ghosh</span>
<span class="title">Streaming Verification of Graph Computations via Graph Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.70">10.4230/LIPIcs.APPROX-RANDOM.2019.70</a>
</li>
<li>
<span class="authors">Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, and Christopher Williamson</span>
<span class="title">Approximate Degree, Secret Sharing, and Concentration Phenomena</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.71">10.4230/LIPIcs.APPROX-RANDOM.2019.71</a>
</li>
<li>
<span class="authors">Fu Li and David Zuckerman</span>
<span class="title">Improved Extractors for Recognizable and Algebraic Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.72">10.4230/LIPIcs.APPROX-RANDOM.2019.72</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