<h2>LIPIcs, Volume 168, ICALP 2020</h2>
<ul>
<li>
<span class="authors">Artur Czumaj, Anuj Dawar, and Emanuela Merelli</span>
<span class="title">LIPIcs, Volume 168, ICALP 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020">10.4230/LIPIcs.ICALP.2020</a>
</li>
<li>
<span class="authors">Artur Czumaj, Anuj Dawar, and Emanuela Merelli</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.0">10.4230/LIPIcs.ICALP.2020.0</a>
</li>
<li>
<span class="authors">Andrew Chi chih Yao</span>
<span class="title">An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.1">10.4230/LIPIcs.ICALP.2020.1</a>
</li>
<li>
<span class="authors">Robert Krauthgamer</span>
<span class="title">Sketching Graphs and Combinatorial Optimization (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.2">10.4230/LIPIcs.ICALP.2020.2</a>
</li>
<li>
<span class="authors">Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, and Dominik Wojtczak</span>
<span class="title">How to Play in Infinite MDPs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.3">10.4230/LIPIcs.ICALP.2020.3</a>
</li>
<li>
<span class="authors">Amir Abboud, Karl Bringmann, Danny Hermelin, and Dvir Shabtay</span>
<span class="title">Scheduling Lower Bounds via AND Subset Sum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.4">10.4230/LIPIcs.ICALP.2020.4</a>
</li>
<li>
<span class="authors">Amir Abboud, Shon Feller, and Oren Weimann</span>
<span class="title">On the Fine-Grained Complexity of Parity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.5">10.4230/LIPIcs.ICALP.2020.5</a>
</li>
<li>
<span class="authors">Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, and Andrew Suh</span>
<span class="title">Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.6">10.4230/LIPIcs.ICALP.2020.6</a>
</li>
<li>
<span class="authors">Dan Alistarh, Giorgi Nadiradze, and Amirmojtaba Sabour</span>
<span class="title">Dynamic Averaging Load Balancing on Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.7">10.4230/LIPIcs.ICALP.2020.7</a>
</li>
<li>
<span class="authors">Maryam Bahrani, Nicole Immorlica, Divyarthi Mohan, and S. Matthew Weinberg</span>
<span class="title">Asynchronous Majority Dynamics in Preferential Attachment Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.8">10.4230/LIPIcs.ICALP.2020.8</a>
</li>
<li>
<span class="authors">Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, and Li-Yang Tan</span>
<span class="title">The Power of Many Samples in Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.9">10.4230/LIPIcs.ICALP.2020.9</a>
</li>
<li>
<span class="authors">Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, and Yann Vaxès</span>
<span class="title">Medians in Median Graphs and Their Cube Complexes in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.10">10.4230/LIPIcs.ICALP.2020.10</a>
</li>
<li>
<span class="authors">Suman K. Bera, Amit Chakrabarti, and Prantar Ghosh</span>
<span class="title">Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.11">10.4230/LIPIcs.ICALP.2020.11</a>
</li>
<li>
<span class="authors">Aaron Bernstein</span>
<span class="title">Improved Bounds for Matching in Random-Order Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.12">10.4230/LIPIcs.ICALP.2020.12</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Maciej Pacut, and Krzysztof Piecuch</span>
<span class="title">An Optimal Algorithm for Online Multiple Knapsack</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.13">10.4230/LIPIcs.ICALP.2020.13</a>
</li>
<li>
<span class="authors">Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, and Eva Rotenberg</span>
<span class="title">Space Efficient Construction of Lyndon Arrays in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.14">10.4230/LIPIcs.ICALP.2020.14</a>
</li>
<li>
<span class="authors">Greg Bodwin, Keerti Choudhary, Merav Parter, and Noa Shahar</span>
<span class="title">New Fault Tolerant Subset Preservers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.15">10.4230/LIPIcs.ICALP.2020.15</a>
</li>
<li>
<span class="authors">Marin Bougeret, Bart M. P. Jansen, and Ignasi Sau</span>
<span class="title">Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.16">10.4230/LIPIcs.ICALP.2020.16</a>
</li>
<li>
<span class="authors">Alex Brandts, Marcin Wrochna, and Stanislav Živný</span>
<span class="title">The Complexity of Promise SAT on Non-Boolean Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.17">10.4230/LIPIcs.ICALP.2020.17</a>
</li>
<li>
<span class="authors">Milutin Brankovic, Nikola Grujic, André van Renssen, and Martin P. Seybold</span>
<span class="title">A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.18">10.4230/LIPIcs.ICALP.2020.18</a>
</li>
<li>
<span class="authors">Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, and Philip Wellnitz</span>
<span class="title">Faster Minimization of Tardy Processing Time on a Single Machine</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.19">10.4230/LIPIcs.ICALP.2020.19</a>
</li>
<li>
<span class="authors">Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, and Marcel Roeloffzen</span>
<span class="title">Fréchet Distance for Uncertain Curves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.20">10.4230/LIPIcs.ICALP.2020.20</a>
</li>
<li>
<span class="authors">Andrei A. Bulatov and Amineh Dadsetan</span>
<span class="title">Counting Homomorphisms in Plain Exponential Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.21">10.4230/LIPIcs.ICALP.2020.21</a>
</li>
<li>
<span class="authors">Jin-Yi Cai, Zhiguo Fu, and Shuai Shao</span>
<span class="title">From Holant to Quantum Entanglement and Back</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.22">10.4230/LIPIcs.ICALP.2020.22</a>
</li>
<li>
<span class="authors">Jin-Yi Cai and Tianyu Liu</span>
<span class="title">Counting Perfect Matchings and the Eight-Vertex Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.23">10.4230/LIPIcs.ICALP.2020.23</a>
</li>
<li>
<span class="authors">Ruoxu Cen, Ran Duan, and Yong Gu</span>
<span class="title">Roundtrip Spanners with (2k-1) Stretch</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.24">10.4230/LIPIcs.ICALP.2020.24</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty and Keerti Choudhary</span>
<span class="title">New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.25">10.4230/LIPIcs.ICALP.2020.25</a>
</li>
<li>
<span class="authors">Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', and Kristýna Pekárková</span>
<span class="title">Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.26">10.4230/LIPIcs.ICALP.2020.26</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Paweł Gawrychowski, and Karol Pokorski</span>
<span class="title">Dynamic Longest Common Substring in Polylogarithmic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.27">10.4230/LIPIcs.ICALP.2020.27</a>
</li>
<li>
<span class="authors">Rohit Chatterjee, Xiao Liang, and Omkant Pandey</span>
<span class="title">Improved Black-Box Constructions of Composable Secure Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.28">10.4230/LIPIcs.ICALP.2020.28</a>
</li>
<li>
<span class="authors">Shiri Chechik and Moran Nechushtan</span>
<span class="title">Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.29">10.4230/LIPIcs.ICALP.2020.29</a>
</li>
<li>
<span class="authors">Yu Chen, Sampath Kannan, and Sanjeev Khanna</span>
<span class="title">Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.30">10.4230/LIPIcs.ICALP.2020.30</a>
</li>
<li>
<span class="authors">Man-Kwun Chiu, Aruni Choudhary, and Wolfgang Mulzer</span>
<span class="title">Computational Complexity of the α-Ham-Sandwich Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.31">10.4230/LIPIcs.ICALP.2020.31</a>
</li>
<li>
<span class="authors">George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, and Clara Waldmann</span>
<span class="title">Existence and Complexity of Approximate Equilibria in Weighted Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.32">10.4230/LIPIcs.ICALP.2020.32</a>
</li>
<li>
<span class="authors">Julia Chuzhoy, Merav Parter, and Zihan Tan</span>
<span class="title">On Packing Low-Diameter Spanning Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.33">10.4230/LIPIcs.ICALP.2020.33</a>
</li>
<li>
<span class="authors">Ilan Cohen, Sungjin Im, and Debmalya Panigrahi</span>
<span class="title">Online Two-Dimensional Load Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.34">10.4230/LIPIcs.ICALP.2020.34</a>
</li>
<li>
<span class="authors">Mina Dalirrooyfard and Virginia Vassilevska Williams</span>
<span class="title">Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.35">10.4230/LIPIcs.ICALP.2020.35</a>
</li>
<li>
<span class="authors">Anuj Dawar and Gregory Wilsenach</span>
<span class="title">Symmetric Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.36">10.4230/LIPIcs.ICALP.2020.36</a>
</li>
<li>
<span class="authors">Anindya De, Sanjeev Khanna, Huan Li, and Hesam Nikpey</span>
<span class="title">An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.37">10.4230/LIPIcs.ICALP.2020.37</a>
</li>
<li>
<span class="authors">Argyrios Deligkas, John Fearnley, and Rahul Savani</span>
<span class="title">Tree Polymatrix Games Are PPAD-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.38">10.4230/LIPIcs.ICALP.2020.38</a>
</li>
<li>
<span class="authors">Dean Doron, Jack Murtagh, Salil Vadhan, and David Zuckerman</span>
<span class="title">Spectral Sparsification via Bounded-Independence Sampling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.39">10.4230/LIPIcs.ICALP.2020.39</a>
</li>
<li>
<span class="authors">Jan Dreier, Henri Lotze, and Peter Rossmanith</span>
<span class="title">Hard Problems on Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.40">10.4230/LIPIcs.ICALP.2020.40</a>
</li>
<li>
<span class="authors">Ran Duan, Haoqing He, and Tianyi Zhang</span>
<span class="title">A Scaling Algorithm for Weighted f-Factors in General Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.41">10.4230/LIPIcs.ICALP.2020.41</a>
</li>
<li>
<span class="authors">Shaddin Dughmi</span>
<span class="title">The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.42">10.4230/LIPIcs.ICALP.2020.42</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg</span>
<span class="title">Extending Partial 1-Planar Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.43">10.4230/LIPIcs.ICALP.2020.43</a>
</li>
<li>
<span class="authors">Uriel Feige and Vadim Grinberg</span>
<span class="title">How to Hide a Clique?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.44">10.4230/LIPIcs.ICALP.2020.44</a>
</li>
<li>
<span class="authors">Hendrik Fichtenberger, Mingze Gao, and Pan Peng</span>
<span class="title">Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.45">10.4230/LIPIcs.ICALP.2020.45</a>
</li>
<li>
<span class="authors">Andrés Fielbaum, Ignacio Morales, and José Verschae</span>
<span class="title">A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.46">10.4230/LIPIcs.ICALP.2020.46</a>
</li>
<li>
<span class="authors">Arnold Filtser</span>
<span class="title">Scattering and Sparse Partitions, and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.47">10.4230/LIPIcs.ICALP.2020.47</a>
</li>
<li>
<span class="authors">Arnold Filtser, Omrit Filtser, and Matthew J. Katz</span>
<span class="title">Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.48">10.4230/LIPIcs.ICALP.2020.48</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.49">10.4230/LIPIcs.ICALP.2020.49</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, and Stratis Skoulakis</span>
<span class="title">Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.50">10.4230/LIPIcs.ICALP.2020.50</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, and Manolis Vardas</span>
<span class="title">The Online Min-Sum Set Cover Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.51">10.4230/LIPIcs.ICALP.2020.51</a>
</li>
<li>
<span class="authors">Martin Fürer, Carlos Hoppen, and Vilmar Trevisan</span>
<span class="title">Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.52">10.4230/LIPIcs.ICALP.2020.52</a>
</li>
<li>
<span class="authors">Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Kuan Yang</span>
<span class="title">Counting Solutions to Random CNF Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.53">10.4230/LIPIcs.ICALP.2020.53</a>
</li>
<li>
<span class="authors">Arun Ganesh, Bruce M. Maggs, and Debmalya Panigrahi</span>
<span class="title">Robust Algorithms for TSP and Steiner Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.54">10.4230/LIPIcs.ICALP.2020.54</a>
</li>
<li>
<span class="authors">Chaya Ganesh, Bernardo Magri, and Daniele Venturi</span>
<span class="title">Cryptographic Reverse Firewalls for Interactive Proof Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.55">10.4230/LIPIcs.ICALP.2020.55</a>
</li>
<li>
<span class="authors">Paritosh Garg, Sagar Kale, Lars Rohwedder, and Ola Svensson</span>
<span class="title">Robust Algorithms Under Adversarial Injections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.56">10.4230/LIPIcs.ICALP.2020.56</a>
</li>
<li>
<span class="authors">Paweł Gawrychowski, Shay Mozes, and Oren Weimann</span>
<span class="title">Minimum Cut in O(m log² n) Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.57">10.4230/LIPIcs.ICALP.2020.57</a>
</li>
<li>
<span class="authors">Anna Gilbert, Albert Gu, Christopher Ré, Atri Rudra, and Mary Wootters</span>
<span class="title">Sparse Recovery for Orthogonal Polynomial Transforms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.58">10.4230/LIPIcs.ICALP.2020.58</a>
</li>
<li>
<span class="authors">Alexander Göke, Dániel Marx, and Matthias Mnich</span>
<span class="title">Hitting Long Directed Cycles Is Fixed-Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.59">10.4230/LIPIcs.ICALP.2020.59</a>
</li>
<li>
<span class="authors">Petr Gregor, Ondřej Mička, and Torsten Mütze</span>
<span class="title">On the Central Levels Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.60">10.4230/LIPIcs.ICALP.2020.60</a>
</li>
<li>
<span class="authors">Rohit Gurjar and Rajat Rathi</span>
<span class="title">Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.61">10.4230/LIPIcs.ICALP.2020.61</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Sai Sandeep</span>
<span class="title">d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.62">10.4230/LIPIcs.ICALP.2020.62</a>
</li>
<li>
<span class="authors">Tuomas Hakoniemi</span>
<span class="title">Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.63">10.4230/LIPIcs.ICALP.2020.63</a>
</li>
<li>
<span class="authors">Sariel Har-Peled, Mitchell Jones, and Saladi Rahul</span>
<span class="title">Active Learning a Convex Body in Low Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.64">10.4230/LIPIcs.ICALP.2020.64</a>
</li>
<li>
<span class="authors">Hiroshi Hirai and Motoki Ikeda</span>
<span class="title">Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.65">10.4230/LIPIcs.ICALP.2020.65</a>
</li>
<li>
<span class="authors">Artem Govorov, Jin-Yi Cai, and Martin Dyer</span>
<span class="title">A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.66">10.4230/LIPIcs.ICALP.2020.66</a>
</li>
<li>
<span class="authors">Taisuke Izumi and Yota Otachi</span>
<span class="title">Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.67">10.4230/LIPIcs.ICALP.2020.67</a>
</li>
<li>
<span class="authors">Susanne Albers and Maximilian Janke</span>
<span class="title">Scheduling in the Random-Order Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.68">10.4230/LIPIcs.ICALP.2020.68</a>
</li>
<li>
<span class="authors">Zhihao Jiang, Debmalya Panigrahi, and Kevin Sun</span>
<span class="title">Online Algorithms for Weighted Paging with Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.69">10.4230/LIPIcs.ICALP.2020.69</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Popular Matchings with One-Sided Bias</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.70">10.4230/LIPIcs.ICALP.2020.70</a>
</li>
<li>
<span class="authors">Bart de Keijzer, Maria Kyropoulou, and Carmine Ventre</span>
<span class="title">Obviously Strategyproof Single-Minded Combinatorial Auctions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.71">10.4230/LIPIcs.ICALP.2020.71</a>
</li>
<li>
<span class="authors">Thomas Kesselheim and Marco Molinaro</span>
<span class="title">Knapsack Secretary with Bursty Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.72">10.4230/LIPIcs.ICALP.2020.72</a>
</li>
<li>
<span class="authors">Sandra Kiefer and Brendan D. McKay</span>
<span class="title">The Iteration Number of Colour Refinement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.73">10.4230/LIPIcs.ICALP.2020.73</a>
</li>
<li>
<span class="authors">Tsvi Kopelowitz and Virginia Vassilevska Williams</span>
<span class="title">Towards Optimal Set-Disjointness and Set-Intersection Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.74">10.4230/LIPIcs.ICALP.2020.74</a>
</li>
<li>
<span class="authors">Matias Korman, André van Renssen, Marcel Roeloffzen, and Frank Staals</span>
<span class="title">Kinetic Geodesic Voronoi Diagrams in a Simple Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.75">10.4230/LIPIcs.ICALP.2020.75</a>
</li>
<li>
<span class="authors">Thijs Laarhoven</span>
<span class="title">Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.76">10.4230/LIPIcs.ICALP.2020.76</a>
</li>
<li>
<span class="authors">Yi Li and Vasileios Nakos</span>
<span class="title">Deterministic Sparse Fourier Transform with an 𝓁_{∞} Guarantee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.77">10.4230/LIPIcs.ICALP.2020.77</a>
</li>
<li>
<span class="authors">Andrea Lincoln and Adam Yedidia</span>
<span class="title">Faster Random k-CNF Satisfiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.78">10.4230/LIPIcs.ICALP.2020.78</a>
</li>
<li>
<span class="authors">Mingmou Liu, Yitong Yin, and Huacheng Yu</span>
<span class="title">Succinct Filters for Sets of Unknown Sizes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.79">10.4230/LIPIcs.ICALP.2020.79</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, and Saket Saurabh</span>
<span class="title">A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.80">10.4230/LIPIcs.ICALP.2020.80</a>
</li>
<li>
<span class="authors">Shiri Chechik and Ofer Magen</span>
<span class="title">Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.81">10.4230/LIPIcs.ICALP.2020.81</a>
</li>
<li>
<span class="authors">Frédéric Magniez and Ashwin Nayak</span>
<span class="title">Quantum Distributed Complexity of Set Disjointness on a Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.82">10.4230/LIPIcs.ICALP.2020.82</a>
</li>
<li>
<span class="authors">Mohammad Mahmoody, Caleb Smith, and David J. Wu</span>
<span class="title">Can Verifiable Delay Functions Be Based on Random Oracles?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.83">10.4230/LIPIcs.ICALP.2020.83</a>
</li>
<li>
<span class="authors">Arturo Merino and Andreas Wiese</span>
<span class="title">On the Two-Dimensional Knapsack Problem for Convex Polygons</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.84">10.4230/LIPIcs.ICALP.2020.84</a>
</li>
<li>
<span class="authors">Evi Micha and Nisarg Shah</span>
<span class="title">Proportionally Fair Clustering Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.85">10.4230/LIPIcs.ICALP.2020.85</a>
</li>
<li>
<span class="authors">Tobias Mömke and Andreas Wiese</span>
<span class="title">Breaking the Barrier of 2 for the Storage Allocation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.86">10.4230/LIPIcs.ICALP.2020.86</a>
</li>
<li>
<span class="authors">Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen</span>
<span class="title">On the Complexity of Zero Gap MIP*</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.87">10.4230/LIPIcs.ICALP.2020.87</a>
</li>
<li>
<span class="authors">Daniel Neuen</span>
<span class="title">Hypergraph Isomorphism for Groups with Restricted Composition Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.88">10.4230/LIPIcs.ICALP.2020.88</a>
</li>
<li>
<span class="authors">Taihei Oki</span>
<span class="title">On Solving (Non)commutative Weighted Edmonds' Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.89">10.4230/LIPIcs.ICALP.2020.89</a>
</li>
<li>
<span class="authors">Pál András Papp and Roger Wattenhofer</span>
<span class="title">A General Stabilization Bound for Influence Propagation in Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.90">10.4230/LIPIcs.ICALP.2020.90</a>
</li>
<li>
<span class="authors">Pál András Papp and Roger Wattenhofer</span>
<span class="title">Network-Aware Strategies in Financial Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.91">10.4230/LIPIcs.ICALP.2020.91</a>
</li>
<li>
<span class="authors">Toniann Pitassi, Morgan Shirley, and Thomas Watson</span>
<span class="title">Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.92">10.4230/LIPIcs.ICALP.2020.92</a>
</li>
<li>
<span class="authors">Aditya Potukuchi</span>
<span class="title">A Spectral Bound on Hypergraph Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.93">10.4230/LIPIcs.ICALP.2020.93</a>
</li>
<li>
<span class="authors">Bryce Sandlund and Yinzhan Xu</span>
<span class="title">Faster Dynamic Range Mode</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.94">10.4230/LIPIcs.ICALP.2020.94</a>
</li>
<li>
<span class="authors">Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos</span>
<span class="title">An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.95">10.4230/LIPIcs.ICALP.2020.95</a>
</li>
<li>
<span class="authors">Shuai Shao and Yuxin Sun</span>
<span class="title">Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.96">10.4230/LIPIcs.ICALP.2020.96</a>
</li>
<li>
<span class="authors">Nobutaka Shimizu and Takeharu Shiraga</span>
<span class="title">Quasi-Majority Functional Voting on Expander Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.97">10.4230/LIPIcs.ICALP.2020.97</a>
</li>
<li>
<span class="authors">Rogers Epstein and Sandeep Silwal</span>
<span class="title">Property Testing of LP-Type Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.98">10.4230/LIPIcs.ICALP.2020.98</a>
</li>
<li>
<span class="authors">Hsin-Hao Su and Nicole Wein</span>
<span class="title">Lower Bounds for Dynamic Distributed Task Allocation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.99">10.4230/LIPIcs.ICALP.2020.99</a>
</li>
<li>
<span class="authors">Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, and Yufan Zheng</span>
<span class="title">On the Degree of Boolean Functions as Polynomials over ℤ_m</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.100">10.4230/LIPIcs.ICALP.2020.100</a>
</li>
<li>
<span class="authors">Magnus Wahlström</span>
<span class="title">On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.101">10.4230/LIPIcs.ICALP.2020.101</a>
</li>
<li>
<span class="authors">Armin Weiß</span>
<span class="title">Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.102">10.4230/LIPIcs.ICALP.2020.102</a>
</li>
<li>
<span class="authors">Daniel Wiebking</span>
<span class="title">Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.103">10.4230/LIPIcs.ICALP.2020.103</a>
</li>
<li>
<span class="authors">Michał Włodarczyk</span>
<span class="title">Parameterized Inapproximability for Steiner Orientation by Gap Amplification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.104">10.4230/LIPIcs.ICALP.2020.104</a>
</li>
<li>
<span class="authors">Hongxun Wu</span>
<span class="title">Near-Optimal Algorithm for Constructing Greedy Consensus Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.105">10.4230/LIPIcs.ICALP.2020.105</a>
</li>
<li>
<span class="authors">Mahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo, and Dan Suciu</span>
<span class="title">Decision Problems in Information Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.106">10.4230/LIPIcs.ICALP.2020.106</a>
</li>
<li>
<span class="authors">Shaull Almagor, Edon Kelmendi, Joël Ouaknine, and James Worrell</span>
<span class="title">Invariants for Continuous Linear Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.107">10.4230/LIPIcs.ICALP.2020.107</a>
</li>
<li>
<span class="authors">Boaz Barak, Raphaëlle Crubillé, and Ugo Dal Lago</span>
<span class="title">On Higher-Order Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.108">10.4230/LIPIcs.ICALP.2020.108</a>
</li>
<li>
<span class="authors">David Barozzini, Lorenzo Clemente, Thomas Colcombet, and Paweł Parys</span>
<span class="title">Cost Automata, Safe Schemes, and Downward Closures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.109">10.4230/LIPIcs.ICALP.2020.109</a>
</li>
<li>
<span class="authors">Libor Barto, Marcin Kozik, Johnson Tan, and Matt Valeriote</span>
<span class="title">Sensitive Instances of the Constraint Satisfaction Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.110">10.4230/LIPIcs.ICALP.2020.110</a>
</li>
<li>
<span class="authors">Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, and Georg Zetzsche</span>
<span class="title">The Complexity of Bounded Context Switching with Dynamic Thread Creation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.111">10.4230/LIPIcs.ICALP.2020.111</a>
</li>
<li>
<span class="authors">Michael Benedikt, Egor V. Kostylev, and Tony Tan</span>
<span class="title">Two Variable Logic with Ultimately Periodic Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.112">10.4230/LIPIcs.ICALP.2020.112</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk and Rafał Stefański</span>
<span class="title">Single-Use Automata and Transducers for Infinite Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.113">10.4230/LIPIcs.ICALP.2020.113</a>
</li>
<li>
<span class="authors">Alin Bostan, Arnaud Carayol, Florent Koechlin, and Cyril Nicaud</span>
<span class="title">Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.114">10.4230/LIPIcs.ICALP.2020.114</a>
</li>
<li>
<span class="authors">Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, and Jonathan Tanner</span>
<span class="title">On the Size of Finite Rational Matrix Semigroups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.115">10.4230/LIPIcs.ICALP.2020.115</a>
</li>
<li>
<span class="authors">Michaël Cadilhac, Dmitry Chistikov, and Georg Zetzsche</span>
<span class="title">Rational Subsets of Baumslag-Solitar Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.116">10.4230/LIPIcs.ICALP.2020.116</a>
</li>
<li>
<span class="authors">Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michał Pilipczuk, and Géraud Sénizergues</span>
<span class="title">On Polynomial Recursive Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.117">10.4230/LIPIcs.ICALP.2020.117</a>
</li>
<li>
<span class="authors">Titouan Carette and Emmanuel Jeandel</span>
<span class="title">A Recipe for Quantum Graphical Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.118">10.4230/LIPIcs.ICALP.2020.118</a>
</li>
<li>
<span class="authors">Dmitry Chistikov and Christoph Haase</span>
<span class="title">On the Power of Ordering in Linear Arithmetic Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.119">10.4230/LIPIcs.ICALP.2020.119</a>
</li>
<li>
<span class="authors">Laura Ciobanu and Alan D. Logan</span>
<span class="title">The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.120">10.4230/LIPIcs.ICALP.2020.120</a>
</li>
<li>
<span class="authors">Lorenzo Clemente, Sławomir Lasota, and Radosław Piórkowski</span>
<span class="title">Timed Games and Deterministic Separability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.121">10.4230/LIPIcs.ICALP.2020.121</a>
</li>
<li>
<span class="authors">Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, and Thomas Zeume</span>
<span class="title">Dynamic Complexity of Reachability: How Many Changes Can We Handle?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.122">10.4230/LIPIcs.ICALP.2020.122</a>
</li>
<li>
<span class="authors">Laure Daviaud, Marcin Jurdziński, and K. S. Thejaswini</span>
<span class="title">The Strahler Number of a Parity Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.123">10.4230/LIPIcs.ICALP.2020.123</a>
</li>
<li>
<span class="authors">Joel D. Day and Florin Manea</span>
<span class="title">On the Structure of Solution Sets to Regular Word Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.124">10.4230/LIPIcs.ICALP.2020.124</a>
</li>
<li>
<span class="authors">Alberto Dennunzio, Enrico Formenti, Darij Grinberg, and Luciano Margara</span>
<span class="title">From Linear to Additive Cellular Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.125">10.4230/LIPIcs.ICALP.2020.125</a>
</li>
<li>
<span class="authors">Michael Figelius, Moses Ganardi, Markus Lohrey, and Georg Zetzsche</span>
<span class="title">The Complexity of Knapsack Problems in Wreath Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.126">10.4230/LIPIcs.ICALP.2020.126</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin</span>
<span class="title">The Adversarial Stackelberg Value in Quantitative Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.127">10.4230/LIPIcs.ICALP.2020.127</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud and Ami Paz</span>
<span class="title">The Topology of Local Computing in Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.128">10.4230/LIPIcs.ICALP.2020.128</a>
</li>
<li>
<span class="authors">Marco Gaboardi, Kobbi Nissim, and David Purser</span>
<span class="title">The Complexity of Verifying Loop-Free Programs as Differentially Private</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.129">10.4230/LIPIcs.ICALP.2020.129</a>
</li>
<li>
<span class="authors">Maciej Gazda and Mohammad Reza Mousavi</span>
<span class="title">Logical Characterisation of Hybrid Conformance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.130">10.4230/LIPIcs.ICALP.2020.130</a>
</li>
<li>
<span class="authors">Pierre Gillibert, Julius Jonušas, Michael Kompatscher, Antoine Mottet, and Michael Pinsker</span>
<span class="title">Hrushovski’s Encoding and ω-Categorical CSP Monsters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.131">10.4230/LIPIcs.ICALP.2020.131</a>
</li>
<li>
<span class="authors">Mathieu Hoyrup</span>
<span class="title">Descriptive Complexity on Non-Polish Spaces II</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.132">10.4230/LIPIcs.ICALP.2020.132</a>
</li>
<li>
<span class="authors">Rupak Majumdar, Mahmoud Salamati, and Sadegh Soudjani</span>
<span class="title">On Decidability of Time-Bounded Reachability in CTMDPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.133">10.4230/LIPIcs.ICALP.2020.133</a>
</li>
<li>
<span class="authors">Sebastian Maneth and Helmut Seidl</span>
<span class="title">When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.134">10.4230/LIPIcs.ICALP.2020.134</a>
</li>
<li>
<span class="authors">Lê Thành Dũng Nguyễn and Pierre Pradic</span>
<span class="title">Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.135">10.4230/LIPIcs.ICALP.2020.135</a>
</li>
<li>
<span class="authors">Damian Niwiński, Marcin Przybyłko, and Michał Skrzypczak</span>
<span class="title">Computing Measures of Weak-MSO Definable Sets of Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.136">10.4230/LIPIcs.ICALP.2020.136</a>
</li>
<li>
<span class="authors">Erik Paul</span>
<span class="title">Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.137">10.4230/LIPIcs.ICALP.2020.137</a>
</li>
<li>
<span class="authors">Jakob Piribauer and Christel Baier</span>
<span class="title">On Skolem-Hardness and Saturation Points in Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.138">10.4230/LIPIcs.ICALP.2020.138</a>
</li>
<li>
<span class="authors">Zachary Remscrim</span>
<span class="title">The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.139">10.4230/LIPIcs.ICALP.2020.139</a>
</li>
<li>
<span class="authors">Aleksi Saarela</span>
<span class="title">Hardness Results for Constant-Free Pattern Languages and Word Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.140">10.4230/LIPIcs.ICALP.2020.140</a>
</li>
<li>
<span class="authors">Wenbo Zhang, Qiang Yin, Huan Long, and Xian Xu</span>
<span class="title">Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2020.141">10.4230/LIPIcs.ICALP.2020.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