<h2>LIPIcs, Volume 80, ICALP 2017</h2>
<ul>
<li>
<span class="authors">Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl</span>
<span class="title">LIPIcs, Volume 80, ICALP'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017">10.4230/LIPIcs.ICALP.2017</a>
</li>
<li>
<span class="authors">Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl</span>
<span class="title">Front Matter, Table of Contents, Preface, Organization, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.0">10.4230/LIPIcs.ICALP.2017.0</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Orbit-Finite Sets and Their Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.1">10.4230/LIPIcs.ICALP.2017.1</a>
</li>
<li>
<span class="authors">Monika Henzinger</span>
<span class="title">Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.2">10.4230/LIPIcs.ICALP.2017.2</a>
</li>
<li>
<span class="authors">Ronitt Rubinfeld</span>
<span class="title">Local Computation Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.3">10.4230/LIPIcs.ICALP.2017.3</a>
</li>
<li>
<span class="authors">Mikkel Thorup</span>
<span class="title">Fast and Powerful Hashing Using Tabulation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.4">10.4230/LIPIcs.ICALP.2017.4</a>
</li>
<li>
<span class="authors">Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, and C. Seshadhri</span>
<span class="title">Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.5">10.4230/LIPIcs.ICALP.2017.5</a>
</li>
<li>
<span class="authors">Guy Even, Reut Levi, Moti Medina, and Adi Rosén</span>
<span class="title">Sublinear Random Access Generators for Preferential Attachment Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.6">10.4230/LIPIcs.ICALP.2017.6</a>
</li>
<li>
<span class="authors">Talya Eden, Dana Ron, and C. Seshadhri</span>
<span class="title">Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.7">10.4230/LIPIcs.ICALP.2017.7</a>
</li>
<li>
<span class="authors">Ilias Diakonikolas, Daniel M. Kane, and Vladimir Nikishkin</span>
<span class="title">Near-Optimal Closeness Testing of Discrete Histogram Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.8">10.4230/LIPIcs.ICALP.2017.8</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer, Simon Korman, and Daniel Reichman</span>
<span class="title">Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.9">10.4230/LIPIcs.ICALP.2017.9</a>
</li>
<li>
<span class="authors">Susanne Albers and Dennis Kraft</span>
<span class="title">On the Value of Penalties in Time-Inconsistent Planning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.10">10.4230/LIPIcs.ICALP.2017.10</a>
</li>
<li>
<span class="authors">Jing Chen, Bo Li, and Yingkai Li</span>
<span class="title">Efficient Approximations for the Online Dispersion Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.11">10.4230/LIPIcs.ICALP.2017.11</a>
</li>
<li>
<span class="authors">Viswanath Nagarajan and Xiangkun Shen</span>
<span class="title">Online Covering with Sum of $ell_q$-Norm Objectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.12">10.4230/LIPIcs.ICALP.2017.12</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Jaroslaw Byrka, and Marcin Mucha</span>
<span class="title">Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.13">10.4230/LIPIcs.ICALP.2017.13</a>
</li>
<li>
<span class="authors">Christian Coester, Elias Koutsoupias, and Philip Lazos</span>
<span class="title">The Infinite Server Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.14">10.4230/LIPIcs.ICALP.2017.14</a>
</li>
<li>
<span class="authors">Guy Kindler and Ryan O'Donnell</span>
<span class="title">Quantum Automata Cannot Detect Biased Coins, Even in the Limit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.15">10.4230/LIPIcs.ICALP.2017.15</a>
</li>
<li>
<span class="authors">Miriam Backens</span>
<span class="title">A New Holant Dichotomy Inspired by Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.16">10.4230/LIPIcs.ICALP.2017.16</a>
</li>
<li>
<span class="authors">Richard Cleve and Chunhao Wang</span>
<span class="title">Efficient Quantum Algorithms for Simulating Lindblad Evolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.17">10.4230/LIPIcs.ICALP.2017.17</a>
</li>
<li>
<span class="authors">Catalin Dohotaru and Peter Høyer</span>
<span class="title">Controlled Quantum Amplification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.18">10.4230/LIPIcs.ICALP.2017.18</a>
</li>
<li>
<span class="authors">Rajesh Jayaram and Barna Saha</span>
<span class="title">Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.19">10.4230/LIPIcs.ICALP.2017.19</a>
</li>
<li>
<span class="authors">Robert Krauthgamer and Ohad Trabelsi</span>
<span class="title">Conditional Lower Bounds for All-Pairs Max-Flow</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.20">10.4230/LIPIcs.ICALP.2017.20</a>
</li>
<li>
<span class="authors">Marvin Künnemann, Ramamohan Paturi, and Stefan Schneider</span>
<span class="title">On the Fine-Grained Complexity of One-Dimensional Dynamic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.21">10.4230/LIPIcs.ICALP.2017.21</a>
</li>
<li>
<span class="authors">Marek Cygan, Marcin Mucha, Karol Wegrzycki, and Michal Wlodarczyk</span>
<span class="title">On Problems Equivalent to (min,+)-Convolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.22">10.4230/LIPIcs.ICALP.2017.22</a>
</li>
<li>
<span class="authors">Marc Bury and Chris Schwiegelshohn</span>
<span class="title">On Finding the Jaccard Center</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.23">10.4230/LIPIcs.ICALP.2017.23</a>
</li>
<li>
<span class="authors">Shaull Almagor, Joël Ouaknine, and James Worrell</span>
<span class="title">The Polytope-Collision Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.24">10.4230/LIPIcs.ICALP.2017.24</a>
</li>
<li>
<span class="authors">Omer Gold and Micha Sharir</span>
<span class="title">Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.25">10.4230/LIPIcs.ICALP.2017.25</a>
</li>
<li>
<span class="authors">Guy E. Blelloch, Yan Gu, and Yihan Sun</span>
<span class="title">Efficient Construction of Probabilistic Tree Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.26">10.4230/LIPIcs.ICALP.2017.26</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and Kuan Yang</span>
<span class="title">Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.27">10.4230/LIPIcs.ICALP.2017.27</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, and Daniel Stefankovic</span>
<span class="title">Inapproximability of the Independent Set Polynomial Below the Shearer Threshold</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.28">10.4230/LIPIcs.ICALP.2017.28</a>
</li>
<li>
<span class="authors">Jiabao Lin and Hanpin Wang</span>
<span class="title">The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.29">10.4230/LIPIcs.ICALP.2017.29</a>
</li>
<li>
<span class="authors">Alex Galicki</span>
<span class="title">Polynomial-Time Rademacher Theorem, Porosity and Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.30">10.4230/LIPIcs.ICALP.2017.30</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, and Andreas Wiese</span>
<span class="title">A QPTAS for the General Scheduling Problem with Identical Release Dates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.31">10.4230/LIPIcs.ICALP.2017.31</a>
</li>
<li>
<span class="authors">André Linhares and Chaitanya Swamy</span>
<span class="title">Improved Algorithms for MST and Metric-TSP Interdiction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.32">10.4230/LIPIcs.ICALP.2017.32</a>
</li>
<li>
<span class="authors">Matthias Kohler and Harald Räcke</span>
<span class="title">Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.33">10.4230/LIPIcs.ICALP.2017.33</a>
</li>
<li>
<span class="authors">Shahar Chen, Dotan Di Castro, Zohar Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, and Roy Schwartz</span>
<span class="title">Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.34">10.4230/LIPIcs.ICALP.2017.34</a>
</li>
<li>
<span class="authors">Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, and Michal Wlodarczyk</span>
<span class="title">When the Optimum is also Blind: a New Perspective on Universal Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.35">10.4230/LIPIcs.ICALP.2017.35</a>
</li>
<li>
<span class="authors">Shweta Agrawal and Ishaan Preet Singh</span>
<span class="title">Reusable Garbled Deterministic Finite Automata from Learning With Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.36">10.4230/LIPIcs.ICALP.2017.36</a>
</li>
<li>
<span class="authors">Ran Cohen, Sandro Coretti, Juan Garay, and Vassilis Zikas</span>
<span class="title">Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.37">10.4230/LIPIcs.ICALP.2017.37</a>
</li>
<li>
<span class="authors">Daniel Apon, Nico Döttling, Sanjam Garg, and Pratyay Mukherjee</span>
<span class="title">Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.38">10.4230/LIPIcs.ICALP.2017.38</a>
</li>
<li>
<span class="authors">Krzysztof Pietrzak and Maciej Skorski</span>
<span class="title">Non-Uniform Attacks Against Pseudoentropy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.39">10.4230/LIPIcs.ICALP.2017.39</a>
</li>
<li>
<span class="authors">Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, and Nicholas Spooner</span>
<span class="title">Interactive Oracle Proofs with Constant Rate and Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.40">10.4230/LIPIcs.ICALP.2017.40</a>
</li>
<li>
<span class="authors">Josh Alman, Matthias Mnich, and Virginia Vassilevska Williams</span>
<span class="title">Dynamic Parameterized Problems and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.41">10.4230/LIPIcs.ICALP.2017.41</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, and Nikos Parotsidis</span>
<span class="title">Decremental Data Structures for Connectivity and Dominators in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.42">10.4230/LIPIcs.ICALP.2017.42</a>
</li>
<li>
<span class="authors">Aaron Bernstein, Yann Disser, and Martin Groß</span>
<span class="title">General Bounds for Incremental Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.43">10.4230/LIPIcs.ICALP.2017.43</a>
</li>
<li>
<span class="authors">Aaron Bernstein</span>
<span class="title">Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.44">10.4230/LIPIcs.ICALP.2017.44</a>
</li>
<li>
<span class="authors">Greg Bodwin</span>
<span class="title">Testing Core Membership in Public Goods Economies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.45">10.4230/LIPIcs.ICALP.2017.45</a>
</li>
<li>
<span class="authors">Toni Böhnlein, Stefan Kratsch, and Oliver Schaudt</span>
<span class="title">Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.46">10.4230/LIPIcs.ICALP.2017.46</a>
</li>
<li>
<span class="authors">Yiannis Giannakopoulos, Elias Koutsoupias, and Philip Lazos</span>
<span class="title">Online Market Intermediation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.47">10.4230/LIPIcs.ICALP.2017.47</a>
</li>
<li>
<span class="authors">Nick Gravin, Yuval Peres, and Balasubramanian Sivan</span>
<span class="title">Tight Lower Bounds for Multiplicative Weights Algorithmic Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.48">10.4230/LIPIcs.ICALP.2017.48</a>
</li>
<li>
<span class="authors">Badih Ghazi and Madhu Sudan</span>
<span class="title">The Power of Shared Randomness in Uncertain Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.49">10.4230/LIPIcs.ICALP.2017.49</a>
</li>
<li>
<span class="authors">Benjamin Rossman and Srikanth Srinivasan</span>
<span class="title">Separation of AC^0[oplus] Formulas and Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.50">10.4230/LIPIcs.ICALP.2017.50</a>
</li>
<li>
<span class="authors">Chengyu Lin and Shengyu Zhang</span>
<span class="title">Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.51">10.4230/LIPIcs.ICALP.2017.51</a>
</li>
<li>
<span class="authors">Mika Göös, T. S. Jayram, Toniann Pitassi, and Thomas Watson</span>
<span class="title">Randomized Communication vs. Partition Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.52">10.4230/LIPIcs.ICALP.2017.52</a>
</li>
<li>
<span class="authors">Andrej Bogdanov and Christopher Williamson</span>
<span class="title">Approximate Bounded Indistinguishability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.53">10.4230/LIPIcs.ICALP.2017.53</a>
</li>
<li>
<span class="authors">Ivona Bezáková, Radu Curticapean, Holger Dell, and Fedor V. Fomin</span>
<span class="title">Finding Detours is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.54">10.4230/LIPIcs.ICALP.2017.54</a>
</li>
<li>
<span class="authors">Sara Ahmadian and Zachary Friggstad</span>
<span class="title">Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.55">10.4230/LIPIcs.ICALP.2017.55</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, and Saket Saurabh</span>
<span class="title">Covering Vectors by Spaces: Regular Matroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.56">10.4230/LIPIcs.ICALP.2017.56</a>
</li>
<li>
<span class="authors">Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, and Marcin Wrochna</span>
<span class="title">Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.57">10.4230/LIPIcs.ICALP.2017.57</a>
</li>
<li>
<span class="authors">Gregory Gutin, Felix Reidl, and Magnus Wahlström</span>
<span class="title">k-Distinct In- and Out-Branchings in Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.58">10.4230/LIPIcs.ICALP.2017.58</a>
</li>
<li>
<span class="authors">Eric Price, Zhao Song, and David P. Woodruff</span>
<span class="title">Fast Regression with an $ell_infty$ Guarantee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.59">10.4230/LIPIcs.ICALP.2017.59</a>
</li>
<li>
<span class="authors">Yi Li and David P. Woodruff</span>
<span class="title">Embeddings of Schatten Norms with Applications to Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.60">10.4230/LIPIcs.ICALP.2017.60</a>
</li>
<li>
<span class="authors">Vasileios Nakos</span>
<span class="title">On Fast Decoding of High-Dimensional Signals from One-Bit Measurements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.61">10.4230/LIPIcs.ICALP.2017.61</a>
</li>
<li>
<span class="authors">Juha Kärkkäinen, Marcin Piatkowski, and Simon J. Puglisi</span>
<span class="title">String Inference from Longest-Common-Prefix Array</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.62">10.4230/LIPIcs.ICALP.2017.62</a>
</li>
<li>
<span class="authors">Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebertz</span>
<span class="title">Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.63">10.4230/LIPIcs.ICALP.2017.63</a>
</li>
<li>
<span class="authors">Mathias Bæk Tejs Knudsen</span>
<span class="title">Additive Spanners and Distance Oracles in Quadratic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.64">10.4230/LIPIcs.ICALP.2017.64</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.65">10.4230/LIPIcs.ICALP.2017.65</a>
</li>
<li>
<span class="authors">Pascal Schweitzer</span>
<span class="title">A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.66">10.4230/LIPIcs.ICALP.2017.66</a>
</li>
<li>
<span class="authors">Andreas Wiese</span>
<span class="title">A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.67">10.4230/LIPIcs.ICALP.2017.67</a>
</li>
<li>
<span class="authors">Yoichi Iwata</span>
<span class="title">Linear-Time Kernelization for Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.68">10.4230/LIPIcs.ICALP.2017.68</a>
</li>
<li>
<span class="authors">Serge Gaspers and Edward J. Lee</span>
<span class="title">Exact Algorithms via Multivariate Subroutines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.69">10.4230/LIPIcs.ICALP.2017.69</a>
</li>
<li>
<span class="authors">Florian Barbero, Christophe Paul, and Michal Pilipczuk</span>
<span class="title">Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.70">10.4230/LIPIcs.ICALP.2017.70</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Packing Cycles Faster Than Erdos-Posa</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.71">10.4230/LIPIcs.ICALP.2017.71</a>
</li>
<li>
<span class="authors">Surender Baswana, Keerti Choudhary, and Liam Roditty</span>
<span class="title">An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.72">10.4230/LIPIcs.ICALP.2017.72</a>
</li>
<li>
<span class="authors">Greg Bodwin, Fabrizio Grandoni, Merav Parter, and Virginia Vassilevska Williams</span>
<span class="title">Preserving Distances in Very Faulty Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.73">10.4230/LIPIcs.ICALP.2017.73</a>
</li>
<li>
<span class="authors">Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, and Przemyslaw Uznanski</span>
<span class="title">All-Pairs 2-Reachability in O(n^w log n) Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.74">10.4230/LIPIcs.ICALP.2017.74</a>
</li>
<li>
<span class="authors">Lena Schlipf and Jens M. Schmidt</span>
<span class="title">Edge-Orders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.75">10.4230/LIPIcs.ICALP.2017.75</a>
</li>
<li>
<span class="authors">Laura Mancinska, David E. Roberson, Robert Samal, Simone Severini, and Antonios Varvitsiotis</span>
<span class="title">Relaxations of Graph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.76">10.4230/LIPIcs.ICALP.2017.76</a>
</li>
<li>
<span class="authors">Aviad Rubinstein</span>
<span class="title">Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.77">10.4230/LIPIcs.ICALP.2017.77</a>
</li>
<li>
<span class="authors">Pasin Manurangsi and Prasad Raghavendra</span>
<span class="title">A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.78">10.4230/LIPIcs.ICALP.2017.78</a>
</li>
<li>
<span class="authors">Pasin Manurangsi</span>
<span class="title">Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.79">10.4230/LIPIcs.ICALP.2017.79</a>
</li>
<li>
<span class="authors">Prasad Raghavendra and Benjamin Weitz</span>
<span class="title">On the Bit Complexity of Sum-of-Squares Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.80">10.4230/LIPIcs.ICALP.2017.80</a>
</li>
<li>
<span class="authors">Amos Korman and Yoav Rodeh</span>
<span class="title">The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.81">10.4230/LIPIcs.ICALP.2017.81</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Yuval Emek, Jara Uitto, and Roger Wattenhofer</span>
<span class="title">A Tight Lower Bound for the Capture Time of the Cops and Robbers Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.82">10.4230/LIPIcs.ICALP.2017.82</a>
</li>
<li>
<span class="authors">Dimitris Achlioptas, Fotis Iliopoulos, and Nikos Vlassis</span>
<span class="title">Stochastic Control via Entropy Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.83">10.4230/LIPIcs.ICALP.2017.83</a>
</li>
<li>
<span class="authors">Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, and Mengchuan Zou</span>
<span class="title">Approximation Strategies for Generalized Binary Search in Weighted Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.84">10.4230/LIPIcs.ICALP.2017.84</a>
</li>
<li>
<span class="authors">Pavel Pudlák, Dominik Scheder, and Navid Talebanfard</span>
<span class="title">Tighter Hard Instances for PPSZ</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.85">10.4230/LIPIcs.ICALP.2017.85</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Chaoping Xing, and Chen Yuan</span>
<span class="title">Subspace Designs Based on Algebraic Function Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.86">10.4230/LIPIcs.ICALP.2017.86</a>
</li>
<li>
<span class="authors">Shafi Goldwasser and Ofer Grossman</span>
<span class="title">Bipartite Perfect Matching in Pseudo-Deterministic NC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.87">10.4230/LIPIcs.ICALP.2017.87</a>
</li>
<li>
<span class="authors">Mikhail Raskin</span>
<span class="title">A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.88">10.4230/LIPIcs.ICALP.2017.88</a>
</li>
<li>
<span class="authors">Jannik Matuschke, S. Thomas McCormick, and Gianpaolo Oriolo</span>
<span class="title">Rerouting Flows When Links Fail</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.89">10.4230/LIPIcs.ICALP.2017.89</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine</span>
<span class="title">The Parameterized Complexity of Positional Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.90">10.4230/LIPIcs.ICALP.2017.90</a>
</li>
<li>
<span class="authors">Andreas Björklund, Petteri Kaski, and Ioannis Koutis</span>
<span class="title">Directed Hamiltonicity and Out-Branchings via Generalized Laplacians</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.91">10.4230/LIPIcs.ICALP.2017.91</a>
</li>
<li>
<span class="authors">Euiwoong Lee</span>
<span class="title">Improved Hardness for Cut, Interdiction, and Firefighter Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.92">10.4230/LIPIcs.ICALP.2017.92</a>
</li>
<li>
<span class="authors">Benjamin Rossman</span>
<span class="title">Subspace-Invariant AC^0 Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.93">10.4230/LIPIcs.ICALP.2017.93</a>
</li>
<li>
<span class="authors">Dmitry Chistikov and Christoph Haase</span>
<span class="title">On the Complexity of Quantified Integer Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.94">10.4230/LIPIcs.ICALP.2017.94</a>
</li>
<li>
<span class="authors">Artur Jez</span>
<span class="title">Word Equations in Nondeterministic Linear Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.95">10.4230/LIPIcs.ICALP.2017.95</a>
</li>
<li>
<span class="authors">Volker Diekert and Murray Elder</span>
<span class="title">Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.96">10.4230/LIPIcs.ICALP.2017.96</a>
</li>
<li>
<span class="authors">Kazuyuki Asada and Naoki Kobayashi</span>
<span class="title">Pumping Lemma for Higher-order Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.97">10.4230/LIPIcs.ICALP.2017.97</a>
</li>
<li>
<span class="authors">Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, and Thomas Zeume</span>
<span class="title">A Strategy for Dynamic Programs: Start over and Muddle Through</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.98">10.4230/LIPIcs.ICALP.2017.98</a>
</li>
<li>
<span class="authors">Nicolas Bacquey, Etienne Grandjean, and Frédéric Olive</span>
<span class="title">Definability by Horn Formulas and Linear Time on Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.99">10.4230/LIPIcs.ICALP.2017.99</a>
</li>
<li>
<span class="authors">Fabian Reiter</span>
<span class="title">Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.100">10.4230/LIPIcs.ICALP.2017.100</a>
</li>
<li>
<span class="authors">Jérémie Chalopin and Victor Chepoi</span>
<span class="title">A Counterexample to Thiagarajan's Conjecture on Regular Event Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.101">10.4230/LIPIcs.ICALP.2017.101</a>
</li>
<li>
<span class="authors">Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, and Pierre-Yves Strub</span>
<span class="title">*-Liftings for Differential Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.102">10.4230/LIPIcs.ICALP.2017.102</a>
</li>
<li>
<span class="authors">Borja Balle, Pascale Gourdeau, and Prakash Panangaden</span>
<span class="title">Bisimulation Metrics for Weighted Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.103">10.4230/LIPIcs.ICALP.2017.103</a>
</li>
<li>
<span class="authors">Giovanni Bacci, Giorgio Bacci, Kim G. Larsen, and Radu Mardare</span>
<span class="title">On the Metric-Based Approximate Minimization of Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.104">10.4230/LIPIcs.ICALP.2017.104</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow, Bartek Klin, and Prakash Panangaden</span>
<span class="title">Expressiveness of Probabilistic Modal Logics, Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.105">10.4230/LIPIcs.ICALP.2017.105</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk, Hugo Gimbert, and Edon Kelmendi</span>
<span class="title">Emptiness of Zero Automata Is Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.106">10.4230/LIPIcs.ICALP.2017.106</a>
</li>
<li>
<span class="authors">Michael Benedikt, Pierre Bourhis, and Michael Vanden Boom</span>
<span class="title">Characterizing Definability in Decidable Fixpoint Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.107">10.4230/LIPIcs.ICALP.2017.107</a>
</li>
<li>
<span class="authors">Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider, and Frank Wolter</span>
<span class="title">Conservative Extensions in Guarded and Two-Variable Fragments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.108">10.4230/LIPIcs.ICALP.2017.108</a>
</li>
<li>
<span class="authors">Gilles Dowek</span>
<span class="title">Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.109">10.4230/LIPIcs.ICALP.2017.109</a>
</li>
<li>
<span class="authors">Albert Atserias and Joanna Ochremiak</span>
<span class="title">Proof Complexity Meets Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.110">10.4230/LIPIcs.ICALP.2017.110</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel</span>
<span class="title">A Circuit-Based Approach to Efficient Enumeration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.111">10.4230/LIPIcs.ICALP.2017.111</a>
</li>
<li>
<span class="authors">Rajeev Alur, Konstantinos Mamouras, and Caleb Stanford</span>
<span class="title">Automata-Based Stream Processing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.112">10.4230/LIPIcs.ICALP.2017.112</a>
</li>
<li>
<span class="authors">Luc Dartois, Paulin Fournier, Ismaël Jecker, and Nathan Lhote</span>
<span class="title">On Reversible Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.113">10.4230/LIPIcs.ICALP.2017.113</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, and Vincent Penelle</span>
<span class="title">Which Classes of Origin Graphs Are Generated by Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.114">10.4230/LIPIcs.ICALP.2017.114</a>
</li>
<li>
<span class="authors">Michaël Cadilhac, Olivier Carton, and Charles Paperman</span>
<span class="title">Continuity and Rational Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.115">10.4230/LIPIcs.ICALP.2017.115</a>
</li>
<li>
<span class="authors">Olivier Bournez and Amaury Pouly</span>
<span class="title">A Universal Ordinary Differential Equation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.116">10.4230/LIPIcs.ICALP.2017.116</a>
</li>
<li>
<span class="authors">Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, and Charles Paperman</span>
<span class="title">Regular Separability of Parikh Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.117">10.4230/LIPIcs.ICALP.2017.117</a>
</li>
<li>
<span class="authors">Bernard Boigelot, Isabelle Mainz, Victor Marsault, and Michel Rigo</span>
<span class="title">An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.118">10.4230/LIPIcs.ICALP.2017.118</a>
</li>
<li>
<span class="authors">Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, and Grégoire Sutre</span>
<span class="title">Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.119">10.4230/LIPIcs.ICALP.2017.119</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, and Pietro Sala</span>
<span class="title">Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.120">10.4230/LIPIcs.ICALP.2017.120</a>
</li>
<li>
<span class="authors">Raphaël Berthon, Mickael Randour, and Jean-François Raskin</span>
<span class="title">Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.121">10.4230/LIPIcs.ICALP.2017.121</a>
</li>
<li>
<span class="authors">Alain Finkel and Etienne Lozes</span>
<span class="title">Synchronizability of Communicating Finite State Machines is not Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.122">10.4230/LIPIcs.ICALP.2017.122</a>
</li>
<li>
<span class="authors">Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, and Ocan Sankur</span>
<span class="title">Admissiblity in Concurrent Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.123">10.4230/LIPIcs.ICALP.2017.123</a>
</li>
<li>
<span class="authors">Karl Bringmann, Thomas Dueholm Hansen, and Sebastian Krinninger</span>
<span class="title">Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.124">10.4230/LIPIcs.ICALP.2017.124</a>
</li>
<li>
<span class="authors">Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, and Gianpiero Monaco</span>
<span class="title">Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.125">10.4230/LIPIcs.ICALP.2017.125</a>
</li>
<li>
<span class="authors">Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Saeed Seddighin</span>
<span class="title">Stochastic k-Server: How Should Uber Work?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.126">10.4230/LIPIcs.ICALP.2017.126</a>
</li>
<li>
<span class="authors">Manoj Gupta and Shahbaz Khan</span>
<span class="title">Multiple Source Dual Fault Tolerant BFS Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.127">10.4230/LIPIcs.ICALP.2017.127</a>
</li>
<li>
<span class="authors">Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, and Morten Stöckel</span>
<span class="title">Near-Optimal Induced Universal Graphs for Bounded Degree Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.128">10.4230/LIPIcs.ICALP.2017.128</a>
</li>
<li>
<span class="authors">Eyjólfur I. Ásgeirsson, Magnús M. Halldórsson, and Tigran Tonoyan</span>
<span class="title">Universal Framework for Wireless Scheduling Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.129">10.4230/LIPIcs.ICALP.2017.129</a>
</li>
<li>
<span class="authors">Lucas Boczkowski, Iordanis Kerenidis, and Frédéric Magniez</span>
<span class="title">Streaming Communication Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.130">10.4230/LIPIcs.ICALP.2017.130</a>
</li>
<li>
<span class="authors">Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, and Christian Sohler</span>
<span class="title">Testable Bounded Degree Graph Properties Are Random Order Streamable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.131">10.4230/LIPIcs.ICALP.2017.131</a>
</li>
<li>
<span class="authors">Barun Gorain and Andrzej Pelc</span>
<span class="title">Deterministic Graph Exploration with Advice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.132">10.4230/LIPIcs.ICALP.2017.132</a>
</li>
<li>
<span class="authors">Martin Hoefer and Bojana Kodric</span>
<span class="title">Combinatorial Secretary Problems with Ordinal Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.133">10.4230/LIPIcs.ICALP.2017.133</a>
</li>
<li>
<span class="authors">Moshe Babaioff, Liad Blumrosen, and Noam Nisan</span>
<span class="title">Selling Complementary Goods: Dynamics, Efficiency and Revenue</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.134">10.4230/LIPIcs.ICALP.2017.134</a>
</li>
<li>
<span class="authors">Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, and M. S. Ramanujan</span>
<span class="title">Saving Critical Nodes with Firefighters is FPT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.135">10.4230/LIPIcs.ICALP.2017.135</a>
</li>
<li>
<span class="authors">Othon Michail, George Skretas, and Paul G. Spirakis</span>
<span class="title">On the Transformation Capability of Feasible Mechanisms for Programmable Matter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.136">10.4230/LIPIcs.ICALP.2017.136</a>
</li>
<li>
<span class="authors">Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler</span>
<span class="title">Distributed Monitoring of Network Properties: The Power of Hybrid Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>
</li>
<li>
<span class="authors">Benjamin Doerr and Anatolii Kostrygin</span>
<span class="title">Randomized Rumor Spreading Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.138">10.4230/LIPIcs.ICALP.2017.138</a>
</li>
<li>
<span class="authors">Leran Cai and Thomas Sauerwald</span>
<span class="title">Randomized Load Balancing on Networks with Stochastic Inputs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.139">10.4230/LIPIcs.ICALP.2017.139</a>
</li>
<li>
<span class="authors">Tung Mai, Ioannis Panageas, and Vijay V. Vazirani</span>
<span class="title">Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.140">10.4230/LIPIcs.ICALP.2017.140</a>
</li>
<li>
<span class="authors">Amanda Belleville, David Doty, and David Soloveichik</span>
<span class="title">Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2017.141">10.4230/LIPIcs.ICALP.2017.141</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