LIPIcs, Volume 132, ICALP 2019

Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi LIPIcs, Volume 132, ICALP'19, Complete Volume 10.4230/LIPIcs.ICALP.2019
Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICALP.2019.0
Michal Feldman Auction Design under Interdependent Values (Invited Talk) 10.4230/LIPIcs.ICALP.2019.1
Martin Grohe Symmetry and Similarity (Invited Talk) 10.4230/LIPIcs.ICALP.2019.2
Ola Svensson Approximately Good and Modern Matchings (Invited Talk) 10.4230/LIPIcs.ICALP.2019.3
Frits Vaandrager Automata Learning and Galois Connections (Invited Talk) 10.4230/LIPIcs.ICALP.2019.4
Mihalis Yannakakis Fixed Point Computation Problems and Facets of Complexity (Invited Talk) 10.4230/LIPIcs.ICALP.2019.5
Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, and Elham Kashefi Complexity-Theoretic Limitations on Blind Delegated Quantum Computation 10.4230/LIPIcs.ICALP.2019.6
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemysław Uznański, and Daniel Wolleb-Graf Faster Algorithms for All-Pairs Bounded Min-Cuts 10.4230/LIPIcs.ICALP.2019.7
Amir Abboud Fine-Grained Reductions and Quantum Speedups for Dynamic Programming 10.4230/LIPIcs.ICALP.2019.8
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, and Günter Rote Geometric Multicut 10.4230/LIPIcs.ICALP.2019.9
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, and Kasper Green Larsen Lower Bounds for Multiplication via Network Coding 10.4230/LIPIcs.ICALP.2019.10
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Prafullkumar Tale Path Contraction Faster Than 2^n 10.4230/LIPIcs.ICALP.2019.11
Noga Alon, Shiri Chechik, and Sarel Cohen Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles 10.4230/LIPIcs.ICALP.2019.12
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein Algorithms and Hardness for Diameter in Dynamic Graphs 10.4230/LIPIcs.ICALP.2019.13
Alexandr Andoni, Clifford Stein, and Peilin Zhong Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity 10.4230/LIPIcs.ICALP.2019.14
Alexandr Andoni, Tal Malkin, and Negev Shekel Nosatzki Two Party Distribution Testing: Communication and Security 10.4230/LIPIcs.ICALP.2019.15
Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, and Ronald de Wolf Two New Results About Quantum Exact Learning 10.4230/LIPIcs.ICALP.2019.16
Sepehr Assadi and Shay Solomon When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time 10.4230/LIPIcs.ICALP.2019.17
Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White, and David P. Woodruff Robust Communication-Optimal Distributed Clustering Algorithms 10.4230/LIPIcs.ICALP.2019.18
Kyriakos Axiotis and Christos Tzamos Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms 10.4230/LIPIcs.ICALP.2019.19
Yair Bartal, Nova Fandina, and Ofer Neiman Covering Metric Spaces by Few Trees 10.4230/LIPIcs.ICALP.2019.20
Giulia Bernardini, Paweł Gawrychowski, Nadia Pisanti, Solon P. Pissis, and Giovanna Rosone Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication 10.4230/LIPIcs.ICALP.2019.21
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič The Complexity of Approximating the Matching Polynomial in the Complex Plane 10.4230/LIPIcs.ICALP.2019.22
Therese Biedl and Philipp Kindermann Finding Tutte Paths in Linear Time 10.4230/LIPIcs.ICALP.2019.23
Andreas Björklund, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi Approximate Counting of k-Paths: Deterministic and in Polynomial Space 10.4230/LIPIcs.ICALP.2019.24
Andreas Björklund and Ryan Williams Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors 10.4230/LIPIcs.ICALP.2019.25
Andreas Björklund, Petteri Kaski, and Ryan Williams Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction 10.4230/LIPIcs.ICALP.2019.26
Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning 10.4230/LIPIcs.ICALP.2019.27
Alex B. Grilo A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round 10.4230/LIPIcs.ICALP.2019.28
Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, and Benoît Larose Dismantlability, Connectedness, and Mixing in Relational Structures 10.4230/LIPIcs.ICALP.2019.29
Mark Bun, Nikhil S. Mande, and Justin Thaler Sign-Rank Can Increase Under Intersection 10.4230/LIPIcs.ICALP.2019.30
Angel A. Cantu, Austin Luchsinger, Robert Schweller, and Tim Wylie Covert Computation in Self-Assembled Circuits 10.4230/LIPIcs.ICALP.2019.31
Igor Carboni Oliveira Randomness and Intractability in Kolmogorov Complexity 10.4230/LIPIcs.ICALP.2019.32
Shantanav Chakraborty, András Gilyén, and Stacey Jeffery The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation 10.4230/LIPIcs.ICALP.2019.33
Jérémie Chalopin, Victor Chepoi, Shay Moran, and Manfred K. Warmuth Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes 10.4230/LIPIcs.ICALP.2019.34
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, and Toniann Pitassi Query-To-Communication Lifting for BPP Using Inner Product 10.4230/LIPIcs.ICALP.2019.35
Xue Chen and Eric Price Estimating the Frequency of a Clustered Signal 10.4230/LIPIcs.ICALP.2019.36
Kuan Cheng, Zhengzhong Jin, Xin Li, and Ke Wu Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes 10.4230/LIPIcs.ICALP.2019.37
Siu-Wing Cheng and Yuchen Mao Restricted Max-Min Allocation: Approximation and Integrality Gap 10.4230/LIPIcs.ICALP.2019.38
Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, and Dimitrios Myrisiotis Circuit Lower Bounds for MCSP from Local Pseudorandom Generators 10.4230/LIPIcs.ICALP.2019.39
Eden Chlamtáč, Michael Dinitz, and Thomas Robinson The Norms of Graph Spanners 10.4230/LIPIcs.ICALP.2019.40
Vincent Cohen-Addad and Jason Li On the Fixed-Parameter Tractability of Capacitated Clustering 10.4230/LIPIcs.ICALP.2019.41
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, and Jason Li Tight FPT Approximations for k-Median and k-Means 10.4230/LIPIcs.ICALP.2019.42
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, and Philipp Loick Information-Theoretic and Algorithmic Thresholds for Group Testing 10.4230/LIPIcs.ICALP.2019.43
Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, and James Worrell On Reachability Problems for Low-Dimensional Matrix Semigroups 10.4230/LIPIcs.ICALP.2019.44
Graham Cormode, Jacques Dark, and Christian Konrad Independent Sets in Vertex-Arrival Streams 10.4230/LIPIcs.ICALP.2019.45
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, and Yuancheng Yu Approximation Algorithms for Min-Distance Problems 10.4230/LIPIcs.ICALP.2019.46
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, and Nicole Wein Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems 10.4230/LIPIcs.ICALP.2019.47
Ran Duan, Ce Jin, and Hongxun Wu Faster Algorithms for All Pairs Non-Decreasing Paths Problem 10.4230/LIPIcs.ICALP.2019.48
Guillaume Ducoffe Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs 10.4230/LIPIcs.ICALP.2019.49
Josep Díaz, Lefteris Kirousis, Sofia Kokonezi, and John Livieratos Algorithmically Efficient Syntactic Characterization of Possibility Domains 10.4230/LIPIcs.ICALP.2019.50
Julian Dörfler, Christian Ikenmeyer, and Greta Panova On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions 10.4230/LIPIcs.ICALP.2019.51
Talya Eden, Dana Ron, and Will Rosenbaum The Arboricity Captures the Complexity of Sampling Edges 10.4230/LIPIcs.ICALP.2019.52
Alina Ene and Huy L. Nguyen A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint 10.4230/LIPIcs.ICALP.2019.53
Alina Ene and Huy L. Nguyen Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint 10.4230/LIPIcs.ICALP.2019.54
Massimo Equi, Roberto Grossi, Veli Mäkinen, and Alexandru I. Tomescu On the Complexity of String Matching for Graphs 10.4230/LIPIcs.ICALP.2019.55
John Fearnley, Spencer Gordon, Ruta Mehta, and Rahul Savani Unique End of Potential Line 10.4230/LIPIcs.ICALP.2019.56
Miron Ficak, Marcin Kozik, Miroslav Olšák, and Szymon Stankiewicz Dichotomy for Symmetric Boolean PCSPs 10.4230/LIPIcs.ICALP.2019.57
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, and David Zuckerman Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions 10.4230/LIPIcs.ICALP.2019.58
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals 10.4230/LIPIcs.ICALP.2019.59
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi Decomposition of Map Graphs with Applications 10.4230/LIPIcs.ICALP.2019.60
Tobias Friedrich and Ralf Rothenberger The Satisfiability Threshold for Non-Uniform Random 2-SAT 10.4230/LIPIcs.ICALP.2019.61
Ankit Garg, Nikhil Gupta, Neeraj Kayal, and Chandan Saha Determinant Equivalence Test over Finite Fields and over Q 10.4230/LIPIcs.ICALP.2019.62
Naveen Garg, Anupam Gupta, Amit Kumar, and Sahil Singla Non-Clairvoyant Precedence Constrained Scheduling 10.4230/LIPIcs.ICALP.2019.63
Dmitry Gavinsky, Troy Lee, Miklos Santha, and Swagato Sanyal A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity 10.4230/LIPIcs.ICALP.2019.64
Paul W. Goldberg and Alexandros Hollender The Hairy Ball Problem is PPAD-Complete 10.4230/LIPIcs.ICALP.2019.65
Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, and Avishay Tal AC^0[p] Lower Bounds Against MCSP via the Coin Problem 10.4230/LIPIcs.ICALP.2019.66
Anupam Gupta, Guru Guruganesh, Binghui Peng, and David Wajc Stochastic Online Metric Matching 10.4230/LIPIcs.ICALP.2019.67
Venkatesan Guruswami, Lingfei Jin, and Chaoping Xing Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields 10.4230/LIPIcs.ICALP.2019.68
Yassine Hamoudi and Frédéric Magniez Quantum Chebyshev’s Inequality and Applications 10.4230/LIPIcs.ICALP.2019.69
Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, and Ravi Sundaram Retracting Graphs to Cycles 10.4230/LIPIcs.ICALP.2019.70
Falko Hegerfeld and Stefan Kratsch On Adaptive Algorithms for Maximum Matching 10.4230/LIPIcs.ICALP.2019.71
Pavel Hrubeš, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, and Amir Yehudayoff Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits 10.4230/LIPIcs.ICALP.2019.72
Zhiyi Huang and Xue Zhu Scalable and Jointly Differentially Private Packing 10.4230/LIPIcs.ICALP.2019.73
Klaus Jansen and Lars Rohwedder Local Search Breaks 1.75 for Graph Balancing 10.4230/LIPIcs.ICALP.2019.74
Klaus Jansen, Alexandra Lassota, and Lars Rohwedder Near-Linear Time Algorithm for n-fold ILPs via Color Coding 10.4230/LIPIcs.ICALP.2019.75
Ce Jin An Improved FPTAS for 0-1 Knapsack 10.4230/LIPIcs.ICALP.2019.76
Vladimir Kolmogorov Testing the Complexity of a Valued CSP Language 10.4230/LIPIcs.ICALP.2019.77
Mrinal Kumar, Rafael Oliveira, and Ramprasad Saptharishi Towards Optimal Depth Reductions for Syntactically Multilinear Circuits 10.4230/LIPIcs.ICALP.2019.78
Adam Kurpisz Sum-Of-Squares Bounds via Boolean Function Analysis 10.4230/LIPIcs.ICALP.2019.79
William Kuszmaul Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation 10.4230/LIPIcs.ICALP.2019.80
Bingkai Lin A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem 10.4230/LIPIcs.ICALP.2019.81
Jannik Matuschke, Ulrike Schmidt-Kraepelin, and José Verschae Maintaining Perfect Matchings at Low Cost 10.4230/LIPIcs.ICALP.2019.82
Arturo I. Merino and José A. Soto The Minimum Cost Query Problem on Matroids with Uncertainty Areas 10.4230/LIPIcs.ICALP.2019.83
Ian Mertz, Toniann Pitassi, and Yuanhao Wei Short Proofs Are Hard to Find 10.4230/LIPIcs.ICALP.2019.84
Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, and Sumedha Uniyal A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints 10.4230/LIPIcs.ICALP.2019.85
Benjamin Moseley Scheduling to Approximate Minimization Objectives on Identical Machines 10.4230/LIPIcs.ICALP.2019.86
Nabil H. Mustafa Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set 10.4230/LIPIcs.ICALP.2019.87
Joseph (Seffi) Naor, Seeun William Umboh, and David P. Williamson Tight Bounds for Online Weighted Tree Augmentation 10.4230/LIPIcs.ICALP.2019.88
Merav Parter and Eylon Yogev Optimal Short Cycle Decomposition in Almost Linear Time 10.4230/LIPIcs.ICALP.2019.89
Konstantinos Panagiotou and Matija Pasch Satisfiability Thresholds for Regular Occupation Problems 10.4230/LIPIcs.ICALP.2019.90
Akbar Rafiey, Arash Rafiey, and Thiago Santos Toward a Dichotomy for Approximation of H-Coloring 10.4230/LIPIcs.ICALP.2019.91
Venkatesan Guruswami and Andrii Riazanov Beating Fredman-Komlós for Perfect k-Hashing 10.4230/LIPIcs.ICALP.2019.92
Thomas Sauerwald and Luca Zanetti Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities 10.4230/LIPIcs.ICALP.2019.93
Xiaoming Sun, David P. Woodruff, Guang Yang, and Jialin Zhang Querying a Matrix Through Matrix-Vector Products 10.4230/LIPIcs.ICALP.2019.94
Mikkel Thorup, Or Zamir, and Uri Zwick Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps 10.4230/LIPIcs.ICALP.2019.95
Thomas Watson Amplification with One NP Oracle Query 10.4230/LIPIcs.ICALP.2019.96
David P. Woodruff and Guang Yang Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams 10.4230/LIPIcs.ICALP.2019.97
Chaoping Xing and Chen Yuan Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph 10.4230/LIPIcs.ICALP.2019.98
Joran van Apeldoorn and András Gilyén Improvements in Quantum SDP-Solving with Applications 10.4230/LIPIcs.ICALP.2019.99
Bader Abu Radi and Orna Kupferman Minimizing GFG Transition-Based Automata (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.100
Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, and Carlo Sartiani A Type System for Interactive JSON Schema Inference (Extended Abstract) 10.4230/LIPIcs.ICALP.2019.101
Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, and Mahsa Shirmohammadi On the Complexity of Value Iteration (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.102
Pablo Barceló, Chih-Duo Hong, Xuan-Bach Le, Anthony W. Lin, and Reino Niskanen Monadic Decomposability of Regular Relations (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.103
Pablo Barceló, Diego Figueira, and Miguel Romero Boundedness of Conjunctive Regular Path Queries (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.104
Paul C. Bell Polynomially Ambiguous Probabilistic Automata on Restricted Languages (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.105
Mikołaj Bojańczyk, Sandra Kiefer, and Nathan Lhote String-to-String Interpretations With Polynomial-Size Output (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.106
Paul Brunet and Alexandra Silva A Kleene Theorem for Nominal Automata (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.107
Titouan Carette, Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart Completeness of Graphical Languages for Mixed States Quantum Mechanics (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.108
Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, and Markus L. Schmid Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.109
Laura Ciobanu and Murray Elder Solutions Sets to Systems of Equations in Hyperbolic Groups Are EDT0L in PSPACE (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.110
Ugo Dal Lago, Francesco Gavazzo, and Akira Yoshimizu Differential Logical Relations, Part I: The Simply-Typed Case (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.111
Anuj Dawar, Erich Grädel, and Wied Pakusa Approximations of Isomorphism and Logics with Linear-Algebraic Operators (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.112
Holger Dell, Marc Roth, and Philip Wellnitz Counting Answers to Existential Questions (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.113
Dani Dorfman, Haim Kaplan, and Uri Zwick A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.114
Kousha Etessami, Emanuel Martinov, Alistair Stewart, and Mihalis Yannakakis Reachability for Branching Concurrent Stochastic Games (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.115
Marie Fortin FO = FO^3 for Linear Orders with Monotone Binary Relations (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.116
Martin Grohe and Sandra Kiefer A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.117
Mehran Hosseini, Joël Ouaknine, and James Worrell Termination of Linear Loops over the Integers (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.118
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke Büchi Objectives in Countable MDPs (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.119
Christof Löding and Anton Pirogov Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.120
Antonio Molina Lovett and Jeffrey Shallit Optimal Regular Expressions for Permutations (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.121
Anca Muscholl and Gabriele Puppis Equivalence of Finite-Valued Streaming String Transducers Is Decidable (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.122
Lê Thành Dũng Nguyễn and Pierre Pradic From Normal Functors to Logarithmic Space Queries (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.123
Matthieu Picantin Automatic Semigroups vs Automaton Semigroups (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.124
Jean-Éric Pin and Christophe Reutenauer A Mahler’s Theorem for Word Functions (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.125
Thomas Place and Marc Zeitoun On All Things Star-Free (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.126
Martin Raszyk, David Basin, and Dmitriy Traytel From Nondeterministic to Multi-Head Deterministic Finite-State Transducers (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.127
Pierre-Alain Reynier and Didier Villevalois Sequentiality of String-to-Context Transducers (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.128
Sylvain Schmitz The Parametric Complexity of Lossy Counter Machines (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.129
Henning Urbat and Stefan Milius Varieties of Data Languages (Track B: Automata, Logic, Semantics, and Theory of Programming) 10.4230/LIPIcs.ICALP.2019.130
Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis, and Viktor Zamaraev How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? 10.4230/LIPIcs.ICALP.2019.131
Matthias Bonne and Keren Censor-Hillel Distributed Detection of Cliques in Dynamic Networks 10.4230/LIPIcs.ICALP.2019.132
Ioannis Caragiannis and Angelo Fanelli On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies 10.4230/LIPIcs.ICALP.2019.133
Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters Temporal Cliques Admit Sparse Spanners 10.4230/LIPIcs.ICALP.2019.134
Keren Censor-Hillel and Mikaël Rabie Distributed Reconfiguration of Maximal Independent Sets 10.4230/LIPIcs.ICALP.2019.135
Aris Anagnostopoulos, Ilan R. Cohen, Stefano Leonardi, and Jakub Łącki Stochastic Graph Exploration 10.4230/LIPIcs.ICALP.2019.136
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, and Sunil Shende Energy Consumption of Group Search on a Line 10.4230/LIPIcs.ICALP.2019.137
Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, and Paul G. Spirakis Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem 10.4230/LIPIcs.ICALP.2019.138
Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny, and Denis Pankratov Exploration of High-Dimensional Grids by Finite Automata 10.4230/LIPIcs.ICALP.2019.139
Yuval Emek, Shay Kutten, Ron Lavi, and William K. Moses Jr. Deterministic Leader Election in Programmable Matter 10.4230/LIPIcs.ICALP.2019.140
Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, and Jakob T. Spooner Two Moves per Time Step Make a Difference 10.4230/LIPIcs.ICALP.2019.141
Mohsen Ghaffari and Ali Sayyadi Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication 10.4230/LIPIcs.ICALP.2019.142
Siddharth Gupta, Adrian Kosowski, and Laurent Viennot Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond 10.4230/LIPIcs.ICALP.2019.143
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, and Pascal Pfister Optimal Strategies for Patrolling Fences 10.4230/LIPIcs.ICALP.2019.144
Sungjin Im, Benjamin Moseley, Kirk Pruhs, and Manish Purohit Matroid Coflow Scheduling 10.4230/LIPIcs.ICALP.2019.145
Amos Korman and Yoav Rodeh Multi-Round Cooperative Search Games with Multiple Players 10.4230/LIPIcs.ICALP.2019.146
Dariusz R. Kowalski and Miguel A. Mosteiro Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader 10.4230/LIPIcs.ICALP.2019.147
Frederik Mallmann-Trenn, Yannic Maus, and Dominik Pajak Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol 10.4230/LIPIcs.ICALP.2019.148
Shunhao Oh, Anuja Meetoo Appavoo, and Seth Gilbert Periodic Bandits and Wireless Network Selection 10.4230/LIPIcs.ICALP.2019.149
Christian Scheideler and Alexander Setzer On the Complexity of Local Graph Transformations 10.4230/LIPIcs.ICALP.2019.150
Daniel Schmand, Marc Schröder, and Alexander Skopalik Network Investment Games with Wardrop Followers 10.4230/LIPIcs.ICALP.2019.151