<h2>LIPIcs, Volume 198, ICALP 2021</h2>
<ul>
<li>
<span class="authors">Nikhil Bansal, Emanuela Merelli, and James Worrell</span>
<span class="title">LIPIcs, Volume 198, ICALP 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021">10.4230/LIPIcs.ICALP.2021</a>
</li>
<li>
<span class="authors">Nikhil Bansal, Emanuela Merelli, and James Worrell</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.0">10.4230/LIPIcs.ICALP.2021.0</a>
</li>
<li>
<span class="authors">Christel Baier, Clemens Dubslaff, Florian Funke, Simon Jantsch, Rupak Majumdar, Jakob Piribauer, and Robin Ziemek</span>
<span class="title">From Verification to Causality-Based Explications (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.1">10.4230/LIPIcs.ICALP.2021.1</a>
</li>
<li>
<span class="authors">Andrei A. Bulatov</span>
<span class="title">Symmetries and Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.2">10.4230/LIPIcs.ICALP.2021.2</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel</span>
<span class="title">Distributed Subgraph Finding: Progress and Challenges (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.3">10.4230/LIPIcs.ICALP.2021.3</a>
</li>
<li>
<span class="authors">Orr Dunkelman, Zeev Geyzel, Chaya Keller, Nathan Keller, Eyal Ronen, Adi Shamir, and Ran J. Tessler</span>
<span class="title">Error Resilient Space Partitioning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.4">10.4230/LIPIcs.ICALP.2021.4</a>
</li>
<li>
<span class="authors">Toniann Pitassi</span>
<span class="title">Algebraic Proof Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.5">10.4230/LIPIcs.ICALP.2021.5</a>
</li>
<li>
<span class="authors">David P. Woodruff</span>
<span class="title">A Very Sketchy Talk (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.6">10.4230/LIPIcs.ICALP.2021.6</a>
</li>
<li>
<span class="authors">Amir Abboud and Virginia Vassilevska Williams</span>
<span class="title">Fine-Grained Hardness for Edit Distance to a Fixed Sequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.7">10.4230/LIPIcs.ICALP.2021.7</a>
</li>
<li>
<span class="authors">Dimitris Achlioptas and Kostas Zampetakis</span>
<span class="title">Local Approximations of the Independent Set Polynomial</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.8">10.4230/LIPIcs.ICALP.2021.8</a>
</li>
<li>
<span class="authors">Deeksha Adil, Brian Bullins, Rasmus Kyng, and Sushant Sachdeva</span>
<span class="title">Almost-Linear-Time Weighted 𝓁_p-Norm Solvers in Slightly Dense Graphs via Sparsification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.9">10.4230/LIPIcs.ICALP.2021.9</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal and Alex Steiger</span>
<span class="title">An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.10">10.4230/LIPIcs.ICALP.2021.10</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, and Jun Yang</span>
<span class="title">Dynamic Enumeration of Similarity Joins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.11">10.4230/LIPIcs.ICALP.2021.11</a>
</li>
<li>
<span class="authors">Shyan Akmal and Ce Jin</span>
<span class="title">Faster Algorithms for Bounded Tree Edit Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.12">10.4230/LIPIcs.ICALP.2021.12</a>
</li>
<li>
<span class="authors">Shyan Akmal and Virginia Vassilevska Williams</span>
<span class="title">Improved Approximation for Longest Common Subsequence over Small Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.13">10.4230/LIPIcs.ICALP.2021.13</a>
</li>
<li>
<span class="authors">Noga Alon and Andrei Graur</span>
<span class="title">Efficient Splitting of Necklaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.14">10.4230/LIPIcs.ICALP.2021.14</a>
</li>
<li>
<span class="authors">Markus Anders, Pascal Schweitzer, and Florian Wetzels</span>
<span class="title">Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.15">10.4230/LIPIcs.ICALP.2021.15</a>
</li>
<li>
<span class="authors">Markus Anders and Pascal Schweitzer</span>
<span class="title">Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.16">10.4230/LIPIcs.ICALP.2021.16</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis, and Pavel Veselý</span>
<span class="title">Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.17">10.4230/LIPIcs.ICALP.2021.17</a>
</li>
<li>
<span class="authors">Vahid R. Asadi and Igor Shinkar</span>
<span class="title">Relaxed Locally Correctable Codes with Improved Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.18">10.4230/LIPIcs.ICALP.2021.18</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Soheil Behnezhad</span>
<span class="title">Beating Two-Thirds For Random-Order Streaming Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.19">10.4230/LIPIcs.ICALP.2021.19</a>
</li>
<li>
<span class="authors">Mitali Bafna and Nikhil Vyas</span>
<span class="title">Optimal Fine-Grained Hardness of Approximation of Linear Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.20">10.4230/LIPIcs.ICALP.2021.20</a>
</li>
<li>
<span class="authors">Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, and Maryam Negahbani</span>
<span class="title">Revisiting Priority k-Center: Fairness and Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.21">10.4230/LIPIcs.ICALP.2021.21</a>
</li>
<li>
<span class="authors">Etienne Bamas, Paritosh Garg, and Lars Rohwedder</span>
<span class="title">The Submodular Santa Claus Problem in the Restricted Assignment Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.22">10.4230/LIPIcs.ICALP.2021.22</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Fedor V. Fomin, and Kirill Simonov</span>
<span class="title">On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.23">10.4230/LIPIcs.ICALP.2021.23</a>
</li>
<li>
<span class="authors">Eleni Batziou, Kristoffer Arnsfelt Hansen, and Kasper Høgh</span>
<span class="title">Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.24">10.4230/LIPIcs.ICALP.2021.24</a>
</li>
<li>
<span class="authors">Ran Ben Basat, Michael Mitzenmacher, and Shay Vargaftik</span>
<span class="title">How to Send a Real Number Using a Single Bit (And Some Shared Randomness)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.25">10.4230/LIPIcs.ICALP.2021.25</a>
</li>
<li>
<span class="authors">Matthias Bentert, André Nichterlein, Malte Renken, and Philipp Zschoche</span>
<span class="title">Using a Geometric Lens to Find k Disjoint Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.26">10.4230/LIPIcs.ICALP.2021.26</a>
</li>
<li>
<span class="authors">Sayan Bhattacharya and Peter Kiss</span>
<span class="title">Deterministic Rounding of Dynamic Fractional Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.27">10.4230/LIPIcs.ICALP.2021.27</a>
</li>
<li>
<span class="authors">Marcin Bienkowski, Artur Kraska, and Hsiang-Hsuan Liu</span>
<span class="title">Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.28">10.4230/LIPIcs.ICALP.2021.28</a>
</li>
<li>
<span class="authors">Andreas Björklund and Petteri Kaski</span>
<span class="title">Counting Short Vector Pairs by Inner Product and Relations to the Permanent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.29">10.4230/LIPIcs.ICALP.2021.29</a>
</li>
<li>
<span class="authors">Guy Blanc, Jane Lange, and Li-Yang Tan</span>
<span class="title">Learning Stochastic Decision Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.30">10.4230/LIPIcs.ICALP.2021.30</a>
</li>
<li>
<span class="authors">Joakim Blikstad</span>
<span class="title">Breaking O(nr) for Matroid Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.31">10.4230/LIPIcs.ICALP.2021.31</a>
</li>
<li>
<span class="authors">Jan Böker</span>
<span class="title">Graph Similarity and Homomorphism Densities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.32">10.4230/LIPIcs.ICALP.2021.32</a>
</li>
<li>
<span class="authors">Andrej Bogdanov and Gautam Prakriya</span>
<span class="title">Direct Sum and Partitionability Testing over General Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.33">10.4230/LIPIcs.ICALP.2021.33</a>
</li>
<li>
<span class="authors">Édouard Bonnet</span>
<span class="title">4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.34">10.4230/LIPIcs.ICALP.2021.34</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant</span>
<span class="title">Twin-width III: Max Independent Set, Min Dominating Set, and Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.35">10.4230/LIPIcs.ICALP.2021.35</a>
</li>
<li>
<span class="authors">Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, and Andrzej Pelc</span>
<span class="title">Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.36">10.4230/LIPIcs.ICALP.2021.36</a>
</li>
<li>
<span class="authors">Joshua Brakensiek, Venkatesan Guruswami, and Sai Sandeep</span>
<span class="title">Conditional Dichotomy of Boolean Ordered Promise CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.37">10.4230/LIPIcs.ICALP.2021.37</a>
</li>
<li>
<span class="authors">Cornelius Brand and Kevin Pratt</span>
<span class="title">Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.38">10.4230/LIPIcs.ICALP.2021.38</a>
</li>
<li>
<span class="authors">Karl Bringmann and Debarati Das</span>
<span class="title">A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.39">10.4230/LIPIcs.ICALP.2021.39</a>
</li>
<li>
<span class="authors">Karl Bringmann and Jasper Slusallek</span>
<span class="title">Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.40">10.4230/LIPIcs.ICALP.2021.40</a>
</li>
<li>
<span class="authors">Karl Bringmann and Vasileios Nakos</span>
<span class="title">Fast n-Fold Boolean Convolution via Additive Combinatorics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.41">10.4230/LIPIcs.ICALP.2021.41</a>
</li>
<li>
<span class="authors">Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, and Andreas Wiese</span>
<span class="title">Additive Approximation Schemes for Load Balancing Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.42">10.4230/LIPIcs.ICALP.2021.42</a>
</li>
<li>
<span class="authors">Massimo Cairo, Romeo Rizzi, Alexandru I. Tomescu, and Elia C. Zirondelli</span>
<span class="title">Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.43">10.4230/LIPIcs.ICALP.2021.43</a>
</li>
<li>
<span class="authors">Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova</span>
<span class="title">Lifting for Constant-Depth Circuits and Applications to MCSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.44">10.4230/LIPIcs.ICALP.2021.44</a>
</li>
<li>
<span class="authors">Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, and Kevin Sun</span>
<span class="title">Sparsification of Directed Graphs via Cut Balance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.45">10.4230/LIPIcs.ICALP.2021.45</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Noa Marelly, Roy Schwartz, and Tigran Tonoyan</span>
<span class="title">Fault Tolerant Max-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.46">10.4230/LIPIcs.ICALP.2021.46</a>
</li>
<li>
<span class="authors">Timothy M. Chan, Virginia Vassilevska Williams, and Yinzhan Xu</span>
<span class="title">Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.47">10.4230/LIPIcs.ICALP.2021.47</a>
</li>
<li>
<span class="authors">Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes, and Oren Weimann</span>
<span class="title">An Almost Optimal Edit Distance Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.48">10.4230/LIPIcs.ICALP.2021.48</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Kent Quanrud</span>
<span class="title">Faster Algorithms for Rooted Connectivity in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.49">10.4230/LIPIcs.ICALP.2021.49</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Kent Quanrud</span>
<span class="title">Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.50">10.4230/LIPIcs.ICALP.2021.50</a>
</li>
<li>
<span class="authors">Lijie Chen, Zhenjian Lu, Xin Lyu, and Igor C. Oliveira</span>
<span class="title">Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.51">10.4230/LIPIcs.ICALP.2021.51</a>
</li>
<li>
<span class="authors">Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, and Huacheng Yu</span>
<span class="title">Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.52">10.4230/LIPIcs.ICALP.2021.52</a>
</li>
<li>
<span class="authors">Yu Chen, Sanjeev Khanna, and Ansh Nagda</span>
<span class="title">Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.53">10.4230/LIPIcs.ICALP.2021.53</a>
</li>
<li>
<span class="authors">Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, and Yu Zheng</span>
<span class="title">Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.54">10.4230/LIPIcs.ICALP.2021.54</a>
</li>
<li>
<span class="authors">Andrew M. Childs, Shih-Han Hung, and Tongyang Li</span>
<span class="title">Quantum Query Complexity with Matrix-Vector Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.55">10.4230/LIPIcs.ICALP.2021.55</a>
</li>
<li>
<span class="authors">George Christodoulou, Elias Koutsoupias, and Annamária Kovács</span>
<span class="title">Truthful Allocation in Graphs and Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.56">10.4230/LIPIcs.ICALP.2021.56</a>
</li>
<li>
<span class="authors">Christian Coester and Elias Koutsoupias</span>
<span class="title">Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.57">10.4230/LIPIcs.ICALP.2021.57</a>
</li>
<li>
<span class="authors">Artur Czumaj, George Kontogeorgiou, and Mike Paterson</span>
<span class="title">Haystack Hunting Hints and Locker Room Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.58">10.4230/LIPIcs.ICALP.2021.58</a>
</li>
<li>
<span class="authors">Gianlorenzo D'Angelo, Debashmita Poddar, and Cosimo Vinci</span>
<span class="title">Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.59">10.4230/LIPIcs.ICALP.2021.59</a>
</li>
<li>
<span class="authors">Mina Dalirrooyfard and Jenny Kaufmann</span>
<span class="title">Approximation Algorithms for Min-Distance Problems in DAGs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.60">10.4230/LIPIcs.ICALP.2021.60</a>
</li>
<li>
<span class="authors">Christoph Damerius, Dominik Kaaser, Peter Kling, and Florian Schneider</span>
<span class="title">On Greedily Packing Anchored Rectangles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.61">10.4230/LIPIcs.ICALP.2021.61</a>
</li>
<li>
<span class="authors">Ewan Davies and Will Perkins</span>
<span class="title">Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.62">10.4230/LIPIcs.ICALP.2021.62</a>
</li>
<li>
<span class="authors">Jonas Ellert and Johannes Fischer</span>
<span class="title">Linear Time Runs Over General Ordered Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.63">10.4230/LIPIcs.ICALP.2021.63</a>
</li>
<li>
<span class="authors">Jacob Evald, Viktor Fredslund-Hansen, Maximilian Probst Gutenberg, and Christian Wulff-Nilsen</span>
<span class="title">Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.64">10.4230/LIPIcs.ICALP.2021.64</a>
</li>
<li>
<span class="authors">Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, and Stratis Skoulakis</span>
<span class="title">On the Approximability of Multistage Min-Sum Set Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.65">10.4230/LIPIcs.ICALP.2021.65</a>
</li>
<li>
<span class="authors">Tobias Friedrich, Andreas Göbel, Martin S. Krejca, and Marcus Pappik</span>
<span class="title">A Spectral Independence View on Hard Spheres via Block Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.66">10.4230/LIPIcs.ICALP.2021.66</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Chaitanya Swamy</span>
<span class="title">Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.67">10.4230/LIPIcs.ICALP.2021.67</a>
</li>
<li>
<span class="authors">Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, and Qianfan Zhang</span>
<span class="title">Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.68">10.4230/LIPIcs.ICALP.2021.68</a>
</li>
<li>
<span class="authors">Bernd Gärtner, Sebastian Haslebacher, and Hung P. Hoang</span>
<span class="title">A Subexponential Algorithm for ARRIVAL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.69">10.4230/LIPIcs.ICALP.2021.69</a>
</li>
<li>
<span class="authors">Arun Ganesh, Bruce M. Maggs, and Debmalya Panigrahi</span>
<span class="title">Universal Algorithms for Clustering Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.70">10.4230/LIPIcs.ICALP.2021.70</a>
</li>
<li>
<span class="authors">Arnab Ganguly, Dhrumil Patel, Rahul Shah, and Sharma V. Thankachan</span>
<span class="title">LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.71">10.4230/LIPIcs.ICALP.2021.71</a>
</li>
<li>
<span class="authors">Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, and Birgit Vogtenhuber</span>
<span class="title">Crossing-Optimal Extension of Simple Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.72">10.4230/LIPIcs.ICALP.2021.72</a>
</li>
<li>
<span class="authors">Uma Girish, Ran Raz, and Wei Zhan</span>
<span class="title">Quantum Logspace Algorithm for Powering Matrices with Bounded Norm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.73">10.4230/LIPIcs.ICALP.2021.73</a>
</li>
<li>
<span class="authors">Nick Gravin, Zhihao Gavin Tang, and Kangning Wang</span>
<span class="title">Online Stochastic Matching with Edge Arrivals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.74">10.4230/LIPIcs.ICALP.2021.74</a>
</li>
<li>
<span class="authors">Yuzhou Gu, Adam Polak, Virginia Vassilevska Williams, and Yinzhan Xu</span>
<span class="title">Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.75">10.4230/LIPIcs.ICALP.2021.75</a>
</li>
<li>
<span class="authors">Yong Gu and Hanlin Ren</span>
<span class="title">Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.76">10.4230/LIPIcs.ICALP.2021.76</a>
</li>
<li>
<span class="authors">Anupam Gupta, Benjamin Moseley, and Rudy Zhou</span>
<span class="title">Structural Iterative Rounding for Generalized k-Median Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.77">10.4230/LIPIcs.ICALP.2021.77</a>
</li>
<li>
<span class="authors">Bernhard Haeupler, D. Ellis Hershkowitz, and David Wajc</span>
<span class="title">Near-Optimal Schedules for Simultaneous Multicasts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.78">10.4230/LIPIcs.ICALP.2021.78</a>
</li>
<li>
<span class="authors">Maria Hartmann, László Kozma, Corwin Sinnamon, and Robert E. Tarjan</span>
<span class="title">Analysis of Smooth Heaps and Slim Heaps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.79">10.4230/LIPIcs.ICALP.2021.79</a>
</li>
<li>
<span class="authors">Chien-Chung Huang, Mathieu Mari, Claire Mathieu, and Jens Vygen</span>
<span class="title">Approximating Maximum Integral Multiflows on Bounded Genus Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.80">10.4230/LIPIcs.ICALP.2021.80</a>
</li>
<li>
<span class="authors">Sharat Ibrahimpur and Chaitanya Swamy</span>
<span class="title">Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.81">10.4230/LIPIcs.ICALP.2021.81</a>
</li>
<li>
<span class="authors">Hyejung H. Jee, Carlo Sparaciari, Omar Fawzi, and Mario Berta</span>
<span class="title">Quasi-Polynomial Time Algorithms for Free Quantum Games in Bounded Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.82">10.4230/LIPIcs.ICALP.2021.82</a>
</li>
<li>
<span class="authors">Adam Karczmarz</span>
<span class="title">Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.83">10.4230/LIPIcs.ICALP.2021.83</a>
</li>
<li>
<span class="authors">Tali Kaufman and Izhar Oppenheim</span>
<span class="title">Coboundary and Cosystolic Expansion from Strong Symmetry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.84">10.4230/LIPIcs.ICALP.2021.84</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Maximum Matchings and Popularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.85">10.4230/LIPIcs.ICALP.2021.85</a>
</li>
<li>
<span class="authors">Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, and Peter Zeman</span>
<span class="title">Automorphisms and Isomorphisms of Maps in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.86">10.4230/LIPIcs.ICALP.2021.86</a>
</li>
<li>
<span class="authors">Tuukka Korhonen</span>
<span class="title">Lower Bounds on Dynamic Programming for Maximum Weight Independent Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.87">10.4230/LIPIcs.ICALP.2021.87</a>
</li>
<li>
<span class="authors">Michal Koucký and Karel Král</span>
<span class="title">Sorting Short Integers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.88">10.4230/LIPIcs.ICALP.2021.88</a>
</li>
<li>
<span class="authors">Jakub Kozik</span>
<span class="title">Improving Gebauer’s Construction of 3-Chromatic Hypergraphs with Few Edges</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.89">10.4230/LIPIcs.ICALP.2021.89</a>
</li>
<li>
<span class="authors">Adam Kurpisz, Aaron Potechin, and Elias Samuel Wirth</span>
<span class="title">SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.90">10.4230/LIPIcs.ICALP.2021.90</a>
</li>
<li>
<span class="authors">J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, and Tobias Friedrich</span>
<span class="title">On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.91">10.4230/LIPIcs.ICALP.2021.91</a>
</li>
<li>
<span class="authors">Michael Lampis</span>
<span class="title">Minimum Stable Cut and Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.92">10.4230/LIPIcs.ICALP.2021.92</a>
</li>
<li>
<span class="authors">Reut Levi</span>
<span class="title">Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.93">10.4230/LIPIcs.ICALP.2021.93</a>
</li>
<li>
<span class="authors">Zhenjian Lu and Igor C. Oliveira</span>
<span class="title">An Efficient Coding Theorem via Probabilistic Representations and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.94">10.4230/LIPIcs.ICALP.2021.94</a>
</li>
<li>
<span class="authors">Dániel Marx, Govind S. Sankar, and Philipp Schepper</span>
<span class="title">Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.95">10.4230/LIPIcs.ICALP.2021.95</a>
</li>
<li>
<span class="authors">Theo McKenzie and Sidhanth Mohanty</span>
<span class="title">High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.96">10.4230/LIPIcs.ICALP.2021.96</a>
</li>
<li>
<span class="authors">Benjamin Moseley, Kirk Pruhs, Alireza Samadian, and Yuyan Wang</span>
<span class="title">Relational Algorithms for k-Means Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.97">10.4230/LIPIcs.ICALP.2021.97</a>
</li>
<li>
<span class="authors">Yonatan Nakar and Dana Ron</span>
<span class="title">Testing Dynamic Environments: Back to Basics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.98">10.4230/LIPIcs.ICALP.2021.98</a>
</li>
<li>
<span class="authors">Eike Neumann, Joël Ouaknine, and James Worrell</span>
<span class="title">Decision Problems for Second-Order Holonomic Recurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.99">10.4230/LIPIcs.ICALP.2021.99</a>
</li>
<li>
<span class="authors">Ilan Newman and Nithin Varma</span>
<span class="title">New Sublinear Algorithms and Lower Bounds for LIS Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.100">10.4230/LIPIcs.ICALP.2021.100</a>
</li>
<li>
<span class="authors">Takaaki Nishimoto and Yasuo Tabei</span>
<span class="title">Optimal-Time Queries on BWT-Runs Compressed Indexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.101">10.4230/LIPIcs.ICALP.2021.101</a>
</li>
<li>
<span class="authors">Ojas Parekh and Kevin Thompson</span>
<span class="title">Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.102">10.4230/LIPIcs.ICALP.2021.102</a>
</li>
<li>
<span class="authors">Enoch Peserico and Michele Scquizzato</span>
<span class="title">Matching on the Line Admits No o(√log n)-Competitive Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.103">10.4230/LIPIcs.ICALP.2021.103</a>
</li>
<li>
<span class="authors">Seth Pettie, Dingyu Wang, and Longhui Yin</span>
<span class="title">Non-Mergeable Sketching for Cardinality Estimation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.104">10.4230/LIPIcs.ICALP.2021.104</a>
</li>
<li>
<span class="authors">Seth Pettie and Longhui Yin</span>
<span class="title">The Structure of Minimum Vertex Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.105">10.4230/LIPIcs.ICALP.2021.105</a>
</li>
<li>
<span class="authors">Adam Polak, Lars Rohwedder, and Karol Węgrzycki</span>
<span class="title">Knapsack and Subset Sum with Small Items</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.106">10.4230/LIPIcs.ICALP.2021.106</a>
</li>
<li>
<span class="authors">Nicolás Rivera, Thomas Sauerwald, and John Sylvester</span>
<span class="title">Multiple Random Walks on Graphs: Mixing Few to Cover Many</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.107">10.4230/LIPIcs.ICALP.2021.107</a>
</li>
<li>
<span class="authors">Marc Roth, Johannes Schmitt, and Philip Wellnitz</span>
<span class="title">Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.108">10.4230/LIPIcs.ICALP.2021.108</a>
</li>
<li>
<span class="authors">Amin Saberi and David Wajc</span>
<span class="title">The Greedy Algorithm Is not Optimal for On-Line Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.109">10.4230/LIPIcs.ICALP.2021.109</a>
</li>
<li>
<span class="authors">Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter, and Ronald de Wolf</span>
<span class="title">Quantum Algorithms for Matrix Scaling and Matrix Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.110">10.4230/LIPIcs.ICALP.2021.110</a>
</li>
<li>
<span class="authors">Emanuele Viola</span>
<span class="title">Fourier Conjectures, Correlation Bounds, and Majority</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.111">10.4230/LIPIcs.ICALP.2021.111</a>
</li>
<li>
<span class="authors">David P. Woodruff and Samson Zhou</span>
<span class="title">Separations for Estimating Large Frequency Moments on Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.112">10.4230/LIPIcs.ICALP.2021.112</a>
</li>
<li>
<span class="authors">Or Zamir</span>
<span class="title">Breaking the 2ⁿ Barrier for 5-Coloring and 6-Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.113">10.4230/LIPIcs.ICALP.2021.113</a>
</li>
<li>
<span class="authors">Tianyi Zhang</span>
<span class="title">Deterministic Maximum Flows in Simple Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.114">10.4230/LIPIcs.ICALP.2021.114</a>
</li>
<li>
<span class="authors">Samson Abramsky and Luca Reggio</span>
<span class="title">Arboreal Categories and Resources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.115">10.4230/LIPIcs.ICALP.2021.115</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Louis Jachiet, and Charles Paperman</span>
<span class="title">Dynamic Membership for Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.116">10.4230/LIPIcs.ICALP.2021.116</a>
</li>
<li>
<span class="authors">Paolo Baldan, Francesco Ranzato, and Linpeng Zhang</span>
<span class="title">A Rice’s Theorem for Abstract Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.117">10.4230/LIPIcs.ICALP.2021.117</a>
</li>
<li>
<span class="authors">Borja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup, and Guillaume Rabusseau</span>
<span class="title">Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.118">10.4230/LIPIcs.ICALP.2021.118</a>
</li>
<li>
<span class="authors">Gabriel Bathie and Tatiana Starikovskaya</span>
<span class="title">Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.119">10.4230/LIPIcs.ICALP.2021.119</a>
</li>
<li>
<span class="authors">Manuel Bodirsky, Simon Knäuer, and Sebastian Rudolph</span>
<span class="title">Datalog-Expressibility for Monadic and Guarded Second-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.120">10.4230/LIPIcs.ICALP.2021.120</a>
</li>
<li>
<span class="authors">Alex Brandts and Stanislav Živný</span>
<span class="title">Beyond PCSP(1-in-3, NAE)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.121">10.4230/LIPIcs.ICALP.2021.121</a>
</li>
<li>
<span class="authors">Antonin Callard and Pascal Vanier</span>
<span class="title">Computational Characterization of Surface Entropies for ℤ² Subshifts of Finite Type</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.122">10.4230/LIPIcs.ICALP.2021.122</a>
</li>
<li>
<span class="authors">Antonio Casares, Thomas Colcombet, and Nathanaël Fijalkow</span>
<span class="title">Optimal Transformations of Games and Automata Using Muller Conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.123">10.4230/LIPIcs.ICALP.2021.123</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Monika Henzinger, Sagar Sudhir Kale, and Alexander Svozil</span>
<span class="title">Faster Algorithms for Bounded Liveness in Graphs and Game Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.124">10.4230/LIPIcs.ICALP.2021.124</a>
</li>
<li>
<span class="authors">Luca Ciccone and Luca Padovani</span>
<span class="title">Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.125">10.4230/LIPIcs.ICALP.2021.125</a>
</li>
<li>
<span class="authors">Lorenzo Clemente and Michał Skrzypczak</span>
<span class="title">Deterministic and Game Separability for Regular Languages of Infinite Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.126">10.4230/LIPIcs.ICALP.2021.126</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Arthur Jaquard</span>
<span class="title">A Complexity Approach to Tree Algebras: the Bounded Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.127">10.4230/LIPIcs.ICALP.2021.127</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński, Sławomir Lasota, and Łukasz Orlikowski</span>
<span class="title">Improved Lower Bounds for Reachability in Vector Addition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.128">10.4230/LIPIcs.ICALP.2021.128</a>
</li>
<li>
<span class="authors">Wojciech Czerwiński, Antoine Mottet, and Karin Quaas</span>
<span class="title">New Techniques for Universality in Unambiguous Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.129">10.4230/LIPIcs.ICALP.2021.129</a>
</li>
<li>
<span class="authors">Dominik D. Freydenberger and Liat Peterfreund</span>
<span class="title">The Theory of Concatenation over Finite Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.130">10.4230/LIPIcs.ICALP.2021.130</a>
</li>
<li>
<span class="authors">Sergey Goncharov</span>
<span class="title">Uniform Elgot Iteration in Foundations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.131">10.4230/LIPIcs.ICALP.2021.131</a>
</li>
<li>
<span class="authors">Alexandre Goy, Daniela Petrişan, and Marc Aiguier</span>
<span class="title">Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.132">10.4230/LIPIcs.ICALP.2021.132</a>
</li>
<li>
<span class="authors">Erich Grädel and Lovro Mrkonjić</span>
<span class="title">Elementary Equivalence Versus Isomorphism in Semiring Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.133">10.4230/LIPIcs.ICALP.2021.133</a>
</li>
<li>
<span class="authors">Martin Grohe and Sandra Kiefer</span>
<span class="title">Logarithmic Weisfeiler-Leman Identifies All Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.134">10.4230/LIPIcs.ICALP.2021.134</a>
</li>
<li>
<span class="authors">Gabriel Istrate, Cosmin Bonchiş, and Adrian Crăciun</span>
<span class="title">Kernelization, Proof Complexity and Social Choice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.135">10.4230/LIPIcs.ICALP.2021.135</a>
</li>
<li>
<span class="authors">Yangjia Li and Dominique Unruh</span>
<span class="title">Quantum Relational Hoare Logic with Expectations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.136">10.4230/LIPIcs.ICALP.2021.136</a>
</li>
<li>
<span class="authors">Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier</span>
<span class="title">Playing Stochastically in Weighted Timed Games to Emulate Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.137">10.4230/LIPIcs.ICALP.2021.137</a>
</li>
<li>
<span class="authors">Antoine Mottet, Tomáš Nagy, Michael Pinsker, and Michał Wrona</span>
<span class="title">Smooth Approximations and Relational Width Collapses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.138">10.4230/LIPIcs.ICALP.2021.138</a>
</li>
<li>
<span class="authors">Lê Thành Dũng (Tito) Nguyễn, Camille Noûs, and Pierre Pradic</span>
<span class="title">Comparison-Free Polyregular Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.139">10.4230/LIPIcs.ICALP.2021.139</a>
</li>
<li>
<span class="authors">Paweł Parys</span>
<span class="title">Higher-Order Model Checking Step by Step</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.140">10.4230/LIPIcs.ICALP.2021.140</a>
</li>
<li>
<span class="authors">Ian Pratt-Hartmann</span>
<span class="title">Fluted Logic with Counting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.141">10.4230/LIPIcs.ICALP.2021.141</a>
</li>
<li>
<span class="authors">Todd Schmid, Tobias Kappé, Dexter Kozen, and Alexandra Silva</span>
<span class="title">Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.142">10.4230/LIPIcs.ICALP.2021.142</a>
</li>
<li>
<span class="authors">Han Xu and Zhenjiang Hu</span>
<span class="title">Analytical Differential Calculus with Integration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICALP.2021.143">10.4230/LIPIcs.ICALP.2021.143</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