<h2>LIPIcs, Volume 207, APPROX/RANDOM 2021</h2>
<ul>
<li>
<span class="authors">Mary Wootters and Laura Sanità</span>
<span class="title">LIPIcs, Volume 207, APPROX/RANDOM 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021">10.4230/LIPIcs.APPROX/RANDOM.2021</a>
</li>
<li>
<span class="authors">Mary Wootters and Laura Sanità</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.2021.0">10.4230/LIPIcs.APPROX/RANDOM.2021.0</a>
</li>
<li>
<span class="authors">Umang Bhaskar, A. R. Sricharan, and Rohit Vaish</span>
<span class="title">On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.1">10.4230/LIPIcs.APPROX/RANDOM.2021.1</a>
</li>
<li>
<span class="authors">Susanne Albers and Sebastian Schubert</span>
<span class="title">Optimal Algorithms for Online b-Matching with Variable Vertex Capacities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.2">10.4230/LIPIcs.APPROX/RANDOM.2021.2</a>
</li>
<li>
<span class="authors">Anupam Gupta, Amit Kumar, and Sahil Singla</span>
<span class="title">Bag-Of-Tasks Scheduling on Related Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.3">10.4230/LIPIcs.APPROX/RANDOM.2021.3</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Dishant Goyal, and Ragesh Jaiswal</span>
<span class="title">Hardness of Approximation for Euclidean k-Median</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.4">10.4230/LIPIcs.APPROX/RANDOM.2021.4</a>
</li>
<li>
<span class="authors">Elena Grigorescu, Young-San Lin, and Kent Quanrud</span>
<span class="title">Online Directed Spanners and Steiner Forests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.5">10.4230/LIPIcs.APPROX/RANDOM.2021.5</a>
</li>
<li>
<span class="authors">Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar</span>
<span class="title">Query Complexity of Global Minimum Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.6">10.4230/LIPIcs.APPROX/RANDOM.2021.6</a>
</li>
<li>
<span class="authors">Eun Jung Kim, Euiwoong Lee, and Dimitrios M. Thilikos</span>
<span class="title">A Constant-Factor Approximation for Weighted Bond Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.7">10.4230/LIPIcs.APPROX/RANDOM.2021.7</a>
</li>
<li>
<span class="authors">János Balogh, Ilan Reuven Cohen, Leah Epstein, and Asaf Levin</span>
<span class="title">Truly Asymptotic Lower Bounds for Online Vector Bin Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.8">10.4230/LIPIcs.APPROX/RANDOM.2021.8</a>
</li>
<li>
<span class="authors">Karl Bringmann, Alejandro Cassis, Nick Fischer, and Marvin Künnemann</span>
<span class="title">Fine-Grained Completeness for Optimization in P</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.9">10.4230/LIPIcs.APPROX/RANDOM.2021.9</a>
</li>
<li>
<span class="authors">Hossein Jowhari</span>
<span class="title">An Estimator for Matching Size in Low Arboricity Graphs with Two Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.10">10.4230/LIPIcs.APPROX/RANDOM.2021.10</a>
</li>
<li>
<span class="authors">Rajesh Jayaram and John Kallaugher</span>
<span class="title">An Optimal Algorithm for Triangle Counting in the Stream</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.11">10.4230/LIPIcs.APPROX/RANDOM.2021.11</a>
</li>
<li>
<span class="authors">Omar El Housni, Vineet Goyal, Oussama Hanguir, and Clifford Stein</span>
<span class="title">Matching Drivers to Riders: A Two-Stage Robust Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.12">10.4230/LIPIcs.APPROX/RANDOM.2021.12</a>
</li>
<li>
<span class="authors">Allan Borodin, Calum MacRury, and Akash Rakheja</span>
<span class="title">Secretary Matching Meets Probing with Commitment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.13">10.4230/LIPIcs.APPROX/RANDOM.2021.13</a>
</li>
<li>
<span class="authors">Chien-Chung Huang and François Sellier</span>
<span class="title">Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.14">10.4230/LIPIcs.APPROX/RANDOM.2021.14</a>
</li>
<li>
<span class="authors">Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, and Danny Raz</span>
<span class="title">General Knapsack Problems in a Dynamic Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.15">10.4230/LIPIcs.APPROX/RANDOM.2021.15</a>
</li>
<li>
<span class="authors">Sandip Banerjee, Rafail Ostrovsky, and Yuval Rabani</span>
<span class="title">Min-Sum Clustering (With Outliers)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.16">10.4230/LIPIcs.APPROX/RANDOM.2021.16</a>
</li>
<li>
<span class="authors">Noah Singer, Madhu Sudan, and Santhoshini Velusamy</span>
<span class="title">Streaming Approximation Resistance of Every Ordering CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.17">10.4230/LIPIcs.APPROX/RANDOM.2021.17</a>
</li>
<li>
<span class="authors">Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, and Julian Wargalla</span>
<span class="title">Upper and Lower Bounds for Complete Linkage in General Metric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.18">10.4230/LIPIcs.APPROX/RANDOM.2021.18</a>
</li>
<li>
<span class="authors">Christian Konrad and Kheeran K. Naidu</span>
<span class="title">On Two-Pass Streaming Algorithms for Maximum Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.19">10.4230/LIPIcs.APPROX/RANDOM.2021.19</a>
</li>
<li>
<span class="authors">Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, and Kamyar Khodamoradi</span>
<span class="title">Approximation Algorithms for Demand Strip Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.20">10.4230/LIPIcs.APPROX/RANDOM.2021.20</a>
</li>
<li>
<span class="authors">Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, and Malte Tutas</span>
<span class="title">Peak Demand Minimization via Sliced Strip Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.21">10.4230/LIPIcs.APPROX/RANDOM.2021.21</a>
</li>
<li>
<span class="authors">Arindam Khan and Eklavya Sharma</span>
<span class="title">Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.22">10.4230/LIPIcs.APPROX/RANDOM.2021.22</a>
</li>
<li>
<span class="authors">Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, and Anil Vullikanti</span>
<span class="title">Approximating Two-Stage Stochastic Supplier Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.23">10.4230/LIPIcs.APPROX/RANDOM.2021.23</a>
</li>
<li>
<span class="authors">Chandra Chekuri, Kent Quanrud, and Manuel R. Torres</span>
<span class="title">Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.24">10.4230/LIPIcs.APPROX/RANDOM.2021.24</a>
</li>
<li>
<span class="authors">Alexander Göke, Jochen Koenemann, Matthias Mnich, and Hao Sun</span>
<span class="title">Hitting Weighted Even Cycles in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.25">10.4230/LIPIcs.APPROX/RANDOM.2021.25</a>
</li>
<li>
<span class="authors">Kshipra Bhawalkar, Kostas Kollias, and Manish Purohit</span>
<span class="title">Revenue Maximization in Transportation Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.26">10.4230/LIPIcs.APPROX/RANDOM.2021.26</a>
</li>
<li>
<span class="authors">Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, and Ziena Zeif</span>
<span class="title">Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.27">10.4230/LIPIcs.APPROX/RANDOM.2021.27</a>
</li>
<li>
<span class="authors">William M. Hoza</span>
<span class="title">Better Pseudodistributions and Derandomization for Space-Bounded Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.28">10.4230/LIPIcs.APPROX/RANDOM.2021.28</a>
</li>
<li>
<span class="authors">Zvika Brakerski, Noah Stephens-Davidowitz, and Vinod Vaikuntanathan</span>
<span class="title">On the Hardness of Average-Case k-SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.29">10.4230/LIPIcs.APPROX/RANDOM.2021.29</a>
</li>
<li>
<span class="authors">Vishwas Bhargava and Sumanta Ghosh</span>
<span class="title">Improved Hitting Set for Orbit of ROABPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.30">10.4230/LIPIcs.APPROX/RANDOM.2021.30</a>
</li>
<li>
<span class="authors">David G. Harris, Fotis Iliopoulos, and Vladimir Kolmogorov</span>
<span class="title">A New Notion of Commutativity for the Algorithmic Lovász Local Lemma</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31">10.4230/LIPIcs.APPROX/RANDOM.2021.31</a>
</li>
<li>
<span class="authors">Kuikui Liu</span>
<span class="title">From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.32">10.4230/LIPIcs.APPROX/RANDOM.2021.32</a>
</li>
<li>
<span class="authors">Sankeerth Rao Karingula and Shachar Lovett</span>
<span class="title">Singularity of Random Integer Matrices with Large Entries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.33">10.4230/LIPIcs.APPROX/RANDOM.2021.33</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Sayantan Sen</span>
<span class="title">Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.34">10.4230/LIPIcs.APPROX/RANDOM.2021.34</a>
</li>
<li>
<span class="authors">Yi Li and David P. Woodruff</span>
<span class="title">The Product of Gaussian Matrices Is Close to Gaussian</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.35">10.4230/LIPIcs.APPROX/RANDOM.2021.35</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and James Stewart</span>
<span class="title">Fast Mixing via Polymers for Random Graphs with Unbounded Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.36">10.4230/LIPIcs.APPROX/RANDOM.2021.36</a>
</li>
<li>
<span class="authors">Rocco A. Servedio and Li-Yang Tan</span>
<span class="title">Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.37">10.4230/LIPIcs.APPROX/RANDOM.2021.37</a>
</li>
<li>
<span class="authors">Louis Golowich</span>
<span class="title">Improved Product-Based High-Dimensional Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.38">10.4230/LIPIcs.APPROX/RANDOM.2021.38</a>
</li>
<li>
<span class="authors">Fotis Iliopoulos</span>
<span class="title">Improved Bounds for Coloring Locally Sparse Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.39">10.4230/LIPIcs.APPROX/RANDOM.2021.39</a>
</li>
<li>
<span class="authors">Rikhav Shah and Sandeep Silwal</span>
<span class="title">Smoothed Analysis of the Condition Number Under Low-Rank Perturbations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.40">10.4230/LIPIcs.APPROX/RANDOM.2021.40</a>
</li>
<li>
<span class="authors">Sumanta Ghosh and Rohit Gurjar</span>
<span class="title">Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.41">10.4230/LIPIcs.APPROX/RANDOM.2021.41</a>
</li>
<li>
<span class="authors">Srikanth Srinivasan and S. Venkitesh</span>
<span class="title">On the Probabilistic Degree of an n-Variate Boolean Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.42">10.4230/LIPIcs.APPROX/RANDOM.2021.42</a>
</li>
<li>
<span class="authors">Antonio Blanca, Zongchen Chen, Daniel Štefankovič, and Eric Vigoda</span>
<span class="title">The Swendsen-Wang Dynamics on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.43">10.4230/LIPIcs.APPROX/RANDOM.2021.43</a>
</li>
<li>
<span class="authors">Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra</span>
<span class="title">Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.44">10.4230/LIPIcs.APPROX/RANDOM.2021.44</a>
</li>
<li>
<span class="authors">Guy Blanc, Jane Lange, Mingda Qiao, and Li-Yang Tan</span>
<span class="title">Decision Tree Heuristics Can Fail, Even in the Smoothed Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.45">10.4230/LIPIcs.APPROX/RANDOM.2021.45</a>
</li>
<li>
<span class="authors">Ninad Rajgopal and Rahul Santhanam</span>
<span class="title">On the Structure of Learnability Beyond P/Poly</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.46">10.4230/LIPIcs.APPROX/RANDOM.2021.46</a>
</li>
<li>
<span class="authors">Antonio Blanca, Alistair Sinclair, and Xusheng Zhang</span>
<span class="title">The Critical Mean-Field Chayes-Machta Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.47">10.4230/LIPIcs.APPROX/RANDOM.2021.47</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Soheil Behnezhad</span>
<span class="title">On the Robust Communication Complexity of Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.48">10.4230/LIPIcs.APPROX/RANDOM.2021.48</a>
</li>
<li>
<span class="authors">Aditya Parulekar, Advait Parulekar, and Eric Price</span>
<span class="title">L1 Regression with Lewis Weights Subsampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.49">10.4230/LIPIcs.APPROX/RANDOM.2021.49</a>
</li>
<li>
<span class="authors">Chandan Saha and Bhargav Thankey</span>
<span class="title">Hitting Sets for Orbits of Circuit Classes and Polynomial Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.50">10.4230/LIPIcs.APPROX/RANDOM.2021.50</a>
</li>
<li>
<span class="authors">Talya Eden, Saleet Mossel, and Ronitt Rubinfeld</span>
<span class="title">Sampling Multiple Edges Efficiently</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.51">10.4230/LIPIcs.APPROX/RANDOM.2021.51</a>
</li>
<li>
<span class="authors">Uma Girish, Ran Raz, and Wei Zhan</span>
<span class="title">Lower Bounds for XOR of Forrelations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.52">10.4230/LIPIcs.APPROX/RANDOM.2021.52</a>
</li>
<li>
<span class="authors">Jarosław Błasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, and Emanuele Viola</span>
<span class="title">Fourier Growth of Structured 𝔽₂-Polynomials and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.53">10.4230/LIPIcs.APPROX/RANDOM.2021.53</a>
</li>
<li>
<span class="authors">Inbar Ben Yaacov, Gil Cohen, and Anand Kumar Narayanan</span>
<span class="title">Candidate Tree Codes via Pascal Determinant Cubes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.54">10.4230/LIPIcs.APPROX/RANDOM.2021.54</a>
</li>
<li>
<span class="authors">Amartya Shankha Biswas, Talya Eden, and Ronitt Rubinfeld</span>
<span class="title">Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.55">10.4230/LIPIcs.APPROX/RANDOM.2021.55</a>
</li>
<li>
<span class="authors">Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, and Madhu Sudan</span>
<span class="title">Ideal-Theoretic Explanation of Capacity-Achieving Decoding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.56">10.4230/LIPIcs.APPROX/RANDOM.2021.56</a>
</li>
<li>
<span class="authors">Omar Alrabiah and Venkatesan Guruswami</span>
<span class="title">Visible Rank and Codes with Locality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.57">10.4230/LIPIcs.APPROX/RANDOM.2021.57</a>
</li>
<li>
<span class="authors">Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan</span>
<span class="title">Pseudorandom Generators for Read-Once Monotone Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.58">10.4230/LIPIcs.APPROX/RANDOM.2021.58</a>
</li>
<li>
<span class="authors">Varsha Dani, Diksha Gupta, and Thomas P. Hayes</span>
<span class="title">On the Power of Choice for k-Colorability of Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.59">10.4230/LIPIcs.APPROX/RANDOM.2021.59</a>
</li>
<li>
<span class="authors">Sumegha Garg, Pravesh K. Kothari, Pengda Liu, and Ran Raz</span>
<span class="title">Memory-Sample Lower Bounds for Learning Parity with Noise</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.60">10.4230/LIPIcs.APPROX/RANDOM.2021.60</a>
</li>
<li>
<span class="authors">Reut Levi and Nadav Shoshan</span>
<span class="title">Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.61">10.4230/LIPIcs.APPROX/RANDOM.2021.61</a>
</li>
<li>
<span class="authors">Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, and Wei Zhan</span>
<span class="title">Parallel Repetition for the GHZ Game: A Simpler Proof</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.62">10.4230/LIPIcs.APPROX/RANDOM.2021.62</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