LIPIcs, Volume 168, ICALP 2020

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