LIPIcs, Volume 198, ICALP 2021

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