45thInternationalColloquiumon Automata,Languages,and ... › ... › LIPIcs-ICALP-2018-0.pdf ·...

45th International Colloquium onAutomata, Languages, andProgramming

ICALP 2018, Prague, Czech Republic, July 9–13, 2018

Edited by

Ioannis ChatzigiannakisChristos KaklamanisDániel MarxDonald Sannella

LIPIcs – Vo l . 107 – ICALP 2018 www.dagstuh l .de/ l ip i c s

EditorsIoannis Chatzigiannakis Christos KaklamanisDepartment of Computer, Control, Department of Computer Engineering and Informaticsand Management Engineering University of Patras andSapienza University of Rome CTI “Diophantus”ichatz@dis.uniroma1.it ckakl@cti.gr

Dániel Marx Donald SannellaInstitute for Computer Science and Control School of InformaticsHungarian Academy of Sciences University of Edinburghdmarx@cs.bme.hu dts@inf.ed.ac.uk

ACM Classification 2012Theory of computation

ISBN 978-3-95977-076-7

Published online and open access bySchloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern,Germany. Online available at http://www.dagstuhl.de/dagpub/978-3-95977-076-7.

Publication dateJuly, 2018

Bibliographic information published by the Deutsche NationalbibliothekThe Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailedbibliographic data are available in the Internet at http://dnb.d-nb.de.

LicenseThis work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0):http://creativecommons.org/licenses/by/3.0/legalcode.In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the workunder the following conditions, without impairing or restricting the authors’ moral rights:

Attribution: The work must be attributed to its authors.

The copyright is retained by the corresponding authors.

Digital Object Identifier: 10.4230/LIPIcs.ICALP.2018.0

ISBN 978-3-95977-076-7 ISSN 1868-8969 http://www.dagstuhl.de/lipics

107:iii

LIPIcs – Leibniz International Proceedings in Informatics

LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumesare published according to the principle of Open Access, i.e., they are available online and free of charge.

Editorial Board

Luca Aceto (Chair, Gran Sasso Science Institute and Reykjavik University)Susanne Albers (TU München)Chris Hankin (Imperial College London)Deepak Kapur (University of New Mexico)Michael Mitzenmacher (Harvard University)Madhavan Mukund (Chennai Mathematical Institute)Anca Muscholl (University Bordeaux)Catuscia Palamidessi (INRIA)Raimund Seidel (Saarland University and Schloss Dagstuhl – Leibniz-Zentrum für Informatik)Thomas Schwentick (TU Dortmund)Reinhard Wilhelm (Saarland University)

ISSN 1868-8969

http://www.dagstuhl.de/lipics

ICALP 2018

Contents

PrefaceIoannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella 0:xv–0:xvi

Organization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0:xvii–0:xxv

List of Authors. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .0:xxvii–0:xlvii

Invited Papers

Consistent Distributed Memory Services: Resilience and EfficiencyTheophanis Hadjistasi and Alexander A. Schwarzmann . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:1–1:19

Sparsity – an Algorithmic PerspectiveJaroslav Nešetřil . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2:1–2:1

Probability Theory from a Programming PerspectiveSam Staton . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:1–3:1

Lower Bounds by Algorithm Design: A Progress ReportRichard Ryan Williams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1–4:1

Track A: Algorithms, Complexity, and Games

Power of d Choices with Simple TabulationAnders Aamand, Mathias Bæk Tejs Knudsen, and Mikkel Thorup . . . . . . . . . . . . . . . . 5:1–5:14

One-Way Trail OrientationsAnders Aamand, Niklas Hjuler, Jacob Holm, and Eva Rotenberg . . . . . . . . . . . . . . . . . 6:1–6:13

Dynamic Matching: Reducing Integral Algorithms to Approximately-MaximalFractional Algorithms

Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, and David Wajc . . . . . . . . . . . . . 7:1–7:16

Tighter Connections Between Formula-SAT and Shaving LogsAmir Abboud and Karl Bringmann . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8:1–8:18

New Approximation Algorithms for (1,2)-TSPAnna Adamaszek, Matthias Mnich, and Katarzyna Paluch . . . . . . . . . . . . . . . . . . . . . . . 9:1–9:14

Union of Hypercubes and 3D Minkowski Sums with Random SizesPankaj K. Agarwal, Haim Kaplan, and Micha Sharir . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10:1–10:15

Noise-Tolerant Testing of High Entanglement of FormationRotem Arnon-Friedman and Henry Yuen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11:1–11:12

A Complete Dichotomy for Complex-Valued HolantcMiriam Backens . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12:1–12:14

45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).Editors: Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella

Leibniz International Proceedings in InformaticsSchloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

107:vi Contents

Tight Bounds on Online Checkpointing AlgorithmsAchiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller,Eyal Ronen, and Adi Shamir . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13:1–13:13

Fast Reed-Solomon Interactive Oracle Proofs of ProximityEli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev . . . . . . . . . . . . . . . 14:1–14:17

NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-LogarithmicallyMany Colors

Amey Bhangale . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15:1–15:11

Sublinear Algorithms for MAXCUT and Correlation ClusteringAditya Bhaskara, Samira Daruki, and Suresh Venkatasubramanian . . . . . . . . . . . . . . . 16:1–16:14

Parameterized Intractability of Even Set and Shortest Vector Problem fromGap-ETH

Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., and Pasin Manurangsi . . 17:1–17:15

Rollercoasters and CaterpillarsTherese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea,Dirk Nowotka, and Jeffrey Shallit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18:1–18:15

New algorithms for Steiner tree reoptimizationDavide Bilò . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19:1–19:14

Efficient Shortest Paths in Scale-Free Networks with Underlying HyperbolicGeometry

Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann,Felix Montenegro-Retana, and Marianne Thieffry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20:1–20:14

Approximate Convex Hull of Data StreamsAvrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, and Lin F. Yang 21:1–21:13

Small Bias Requires Large FormulasAndrej Bogdanov . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22:1–22:12

Geodesic Obstacle Representation of GraphsProsenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani,Pat Morin, and Luis Fernando Schultz Xavier da Silveira . . . . . . . . . . . . . . . . . . . . . . . . 23:1–23:13

The Bottleneck Complexity of Secure Multiparty ComputationElette Boyle, Abhishek Jain, Manoj Prabhakaran, and Ching-Hua Yu . . . . . . . . . . . . . 24:1–24:16

Revisiting Frequency Moment Estimation in Random Order StreamsVladimir Braverman, Emanuele Viola, David P. Woodruff, and Lin F. Yang . . . . . 25:1–25:14

Proportional Approval Voting, Harmonic k-median, and Negative AssociationJarosław Byrka, Piotr Skowron, and Krzysztof Sornat . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26:1–26:14

Fine-Grained Derandomization: From Problem-Centric to Resource-CentricComplexity

Marco L. Carmosino, Russell Impagliazzo, and Manuel Sabin . . . . . . . . . . . . . . . . . . . . 27:1–27:16

Ranking with Fairness ConstraintsL. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi . . . . . . . . . . . . . . . . . . . . . . . 28:1–28:15

Contents 107:vii

Interpolating between k-Median and k-Center: Approximation Algorithms forOrdered k-Median

Deeparnab Chakrabarty and Chaitanya Swamy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29:1–29:14

Generalized Center Problems with OutliersDeeparnab Chakrabarty and Maryam Negahbani . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30:1–30:14

Orthogonal Point Location and Rectangle Stabbing Queries in 3-dTimothy M. Chan, Yakov Nekrich, Saladi Rahul, and Konstantinos Tsakalidis . . . . 31:1–31:14

Spanning Tree Congestion and Computation of Generalized Győri-LovászPartition

L. Sunil Chandran, Yun Kuen Cheung, and Davis Issac . . . . . . . . . . . . . . . . . . . . . . . . . . 32:1–32:14

Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-CaseTime Barrier

Moses Charikar and Shay Solomon . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33:1–33:14

On Estimating Edit Distance: Alignment, Dimension Reduction, and EmbeddingsMoses Charikar, Ofir Geri, Michael P. Kim, and William Kuszmaul . . . . . . . . . . . . . 34:1–34:14

How Hard Is It to Satisfy (Almost) All Roommates?Jiehua Chen, Danny Hermelin, Manuel Sorge, and Harel Yedidsion . . . . . . . . . . . . . . 35:1–35:15

A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear FormulasSuryajith Chillara, Nutan Limaye, and Srikanth Srinivasan . . . . . . . . . . . . . . . . . . . . . . 36:1–36:13

Restricted Max-Min Fair AllocationSiu-Wing Cheng and Yuchen Mao . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37:1–37:13

Improved Approximation for Node-Disjoint Paths in Grids with Sources on theBoundary

Julia Chuzhoy, David H. K. Kim, and Rachit Nimavat . . . . . . . . . . . . . . . . . . . . . . . . . . . 38:1–38:14

Optimal Hashing in External MemoryAlex Conway, Martín Farach-Colton, and Philip Shilane . . . . . . . . . . . . . . . . . . . . . . . . . 39:1–39:14

Lovász Meets Weisfeiler and LemanHolger Dell, Martin Grohe, and Gaurav Rattan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40:1–40:14

Sample-Optimal Identity Testing with High ProbabilityIlias Diakonikolas, Themis Gouleakis, John Peebles, and Eric Price . . . . . . . . . . . . . . 41:1–41:14

Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF inTruly-Subcubic Time

Ran Duan and Hanlin Ren . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42:1–42:12

Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse GraphsRan Duan, Kaifeng Lyu, and Yuanhang Xie . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43:1–43:14

Improved Time Bounds for All Pairs Non-decreasing Paths in General DigraphsRan Duan, Yong Gu, and Le Zhang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44:1–44:14

Edit Distance between Unrooted Trees in Cubic TimeBartłomiej Dudek and Paweł Gawrychowski . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45:1–45:14

ICALP 2018

107:viii Contents

A Note on Two-Colorability of Nonuniform HypergraphsLech Duraj, Grzegorz Gutowski, and Jakub Kozik . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46:1–46:13

Additive Non-Approximability of Chromatic Number in Proper Minor-ClosedClasses

Zdeněk Dvořák and Ken-ichi Kawarabayashi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47:1–47:12

How to Navigate Through Obstacles?Eduard Eiben and Iyad Kanj . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48:1–48:13

Faster Algorithms for Integer Programs with Block StructureFriedrich Eisenbrand, Christoph Hunkenschröder, and Kim-Manuel Klein . . . . . . . . 49:1–49:13

On the Probe Complexity of Local Computation AlgorithmsUriel Feige, Boaz Patt-Shamir, and Shai Vardi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50:1–50:14

Fully-Dynamic Bin Packing with Little RepackingBjörn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh,Amit Kumar, Sören Riechers, and David Wajc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51:1–51:24

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) WithOne-Sided Error

Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, and Maximilian Wötzel . . . . . . . . 52:1–52:14

Parameterized Low-Rank Binary Matrix ApproximationFedor V. Fomin, Petr A. Golovach, and Fahad Panolan . . . . . . . . . . . . . . . . . . . . . . . . . . 53:1–53:16

Towards Blackbox Identity Testing of Log-Variate CircuitsMichael A. Forbes, Sumanta Ghosh, and Nitin Saxena . . . . . . . . . . . . . . . . . . . . . . . . . . . 54:1–54:16

Finding Cliques in Social Networks: A New Distribution-Free ModelJacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, and Nicole Wein . . . . . . . . . . 55:1–55:15

A PTAS for a Class of Stochastic Dynamic ProgramsHao Fu, Jian Li, and Pan Xu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56:1–56:14

Semi-Supervised Algorithms for Approximately Optimal and Accurate ClusteringBuddhima Gamlath, Sangxia Huang, and Ola Svensson . . . . . . . . . . . . . . . . . . . . . . . . . . 57:1–57:14

High Probability Frequency Moment SketchesSumit Ganguly and David P. Woodruff . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58:1–58:15

Quasi-PTAS for Scheduling with Precedences using LP HierarchiesShashwat Garg . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59:1–59:13

ARRIVAL: Next Stop in CLSBernd Gärtner, Thomas Dueholm Hansen, Pavel Hubáček, Karel Král,Hagar Mosaad, and Veronika Slívová . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60:1–60:13

Improved Bounds for Shortest Paths in Dense Distance GraphsPaweł Gawrychowski and Adam Karczmarz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61:1–61:15

Towards Unified Approximate Pattern Matching for Hamming and L1 DistancePaweł Gawrychowski and Przemysław Uznański . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62:1–62:13

A Faster Construction of Greedy Consensus TreesPaweł Gawrychowski, Gad M. Landau, Wing-Kin Sung, and Oren Weimann . . . . . 63:1–63:14

Contents 107:ix

A Faster FPTAS for #KnapsackPaweł Gawrychowski, Liran Markin, and Oren Weimann . . . . . . . . . . . . . . . . . . . . . . . . 64:1–64:13

Towards Optimal Approximate Streaming Pattern Matching by MatchingMultiple Patterns in Multiple Streams

Shay Golan, Tsvi Kopelowitz, and Ely Porat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65:1–65:16

Gray Codes and Symmetric ChainsPetr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, and Kaja Wille . . . . . . . . . . . 66:1–66:14

An Improved Isomorphism Test for Bounded-Tree-Width GraphsMartin Grohe, Daniel Neuen, Pascal Schweitzer, and Daniel Wiebking . . . . . . . . . . . 67:1–67:14

A Polynomial-Time Approximation Algorithm for All-Terminal NetworkReliability

Heng Guo and Mark Jerrum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68:1–68:12

Perfect Simulation of the Hard Disks Model by Partial Rejection SamplingHeng Guo and Mark Jerrum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69:1–69:10

Non-Preemptive Flow-Time Minimization via RejectionsAnupam Gupta, Amit Kumar, and Jason Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70:1–70:13

Maximizing Profit with Convex Costs in the Random-order ModelAnupam Gupta, Ruta Mehta, and Marco Molinaro . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71:1–71:14

Generic Single Edge Fault Tolerant Exact Distance OracleManoj Gupta and Aditi Singh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72:1–72:15

An Exponential Separation Between MA and AM Proofs of ProximityTom Gur, Yang P. Liu, and Ron D. Rothblum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73:1–73:15

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular FacesRohit Gurjar, Thomas Thierauf, and Nisheeth K. Vishnoi . . . . . . . . . . . . . . . . . . . . . . . . 74:1–74:14

Synchronization Strings: Channel Simulations and Interactive Coding forInsertions and Deletions

Bernhard Haeupler, Amirbehshad Shahrasbi, and Ellen Vitercik . . . . . . . . . . . . . . . . . . 75:1–75:14

Synchronization Strings: List Decoding for Insertions and DeletionsBernhard Haeupler, Amirbehshad Shahrasbi, and Madhu Sudan . . . . . . . . . . . . . . . . . . 76:1–76:14

Approximate Sparse Linear RegressionSariel Har-Peled, Piotr Indyk, and Sepideh Mahabadi . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77:1–77:14

A Polynomial Time Algorithm to Compute Geodesics in CAT(0) CubicalComplexes

Koyo Hayashi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78:1–78:14

Online Vertex-Weighted Bipartite Matching: Beating 1 − 1e with Random Arrivals

Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang . . . . . . . . . . . . . . . . 79:1–79:14

Finding Branch-Decompositions of Matroids, Hypergraphs, and MoreJisu Jeong, Eun Jung Kim, and Sang-il Oum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80:1–80:14

Optimally Sorting Evolving DataJuan Jose Besa, William E. Devanny, David Eppstein, Michael T. Goodrich, andTimothy Johnson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81:1–81:13

ICALP 2018

107:x Contents

Generalized Comparison Trees for Point-Location ProblemsDaniel M. Kane, Shachar Lovett, and Shay Moran . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82:1–82:13

Stabilizing Weighted GraphsZhuan Khye Koh and Laura Sanità . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83:1–83:13

Spectrally Robust Graph IsomorphismAlexandra Kolla, Ioannis Koutis, Vivek Madan, and Ali Kemal Sinop . . . . . . . . . . . . 84:1–84:13

A Parameterized Strongly Polynomial Algorithm for Block Structured IntegerPrograms

Martin Koutecký, Asaf Levin, and Shmuel Onn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85:1–85:14

Finer Tight Bounds for Coloring on Clique-WidthMichael Lampis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86:1–86:14

A Centralized Local Algorithm for the Sparse Spanning Graph ProblemChristoph Lenzen and Reut Levi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87:1–87:14

Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SATSixue Liu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88:1–88:13

Stable-Matching Voronoi Diagrams: Combinatorial Complexity and AlgorithmsGill Barequet, David Eppstein, Michael T. Goodrich, and Nil Mamano . . . . . . . . . . . 89:1–89:14

Improved Algorithms for Adaptive Compressed SensingVasileios Nakos, Xiaofei Shi, David P. Woodruff, and Hongyang Zhang . . . . . . . . . . . 90:1–90:14

Approximate Low-Weight Check Codes and Circuit Lower Bounds for NoisyGround States

Chinmay Nirkhe, Umesh Vazirani, and Henry Yuen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91:1–91:11

Fully Dynamic MIS in Uniformly Sparse GraphsKrzysztof Onak, Baruch Schieber, Shay Solomon, and Nicole Wein . . . . . . . . . . . . . . . 92:1–92:14

Strictly Balancing Matrices in Polynomial Time Using Osborne’s IterationRafail Ostrovsky, Yuval Rabani, and Arman Yousefi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93:1–93:11

Parameterized Algorithms for Zero Extension and Metric Labelling ProblemsFelix Reidl and Magnus Wahlström . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94:1–94:14

An Operational Characterization of Mutual Information in AlgorithmicInformation Theory

Andrei Romashchenko and Marius Zimand . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95:1–95:14

Privacy Preserving Clustering with ConstraintsClemens Rösner and Melanie Schmidt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96:1–96:14

NC Algorithms for Weighted Planar Perfect Matching and Related ProblemsPiotr Sankowski . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97:1–97:16

Computing Tutte PathsAndreas Schmid and Jens M. Schmidt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98:1–98:14

A New Approximation Guarantee for Monotone Submodular FunctionMaximization via Discrete Convexity

Tasuku Soma and Yuichi Yoshida . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99:1–99:14

Contents 107:xi

Ring Packing and Amortized FHEW BootstrappingDaniele Miccianco and Jessica Sorrell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100:1–100:14

Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exactand Approximate Recovery

Anand Louis and Rakesh Venkat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .101:1–101:15

Load Thresholds for Cuckoo Hashing with Overlapping BlocksStefan Walzer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102:1–102:10

Brief Announcement: On Secure m-Party Computation, Commuting PermutationSystems and Unassisted Non-Interactive MPC

Navneet Agarwal, Sanat Anand, and Manoj Prabhakaran . . . . . . . . . . . . . . . . . . . . . . . . . 103:1–103:4

Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter)Shallow-Light Steiner Network

Amy Babay, Michael Dinitz, and Zeyu Zhang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104:1–104:4

Brief Announcement: Zero-Knowledge Protocols for Search ProblemsBen Berger and Zvika Brakerski . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105:1–105:5

Brief Announcement: Relaxed Locally Correctable Codes in ComputationallyBounded Channels

Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, and Samson Zhou . . . . . . . 106:1–106:4

Brief Announcement: Approximation Schemes for Geometric Coverage ProblemsSteven Chaplick, Minati De, Alexander Ravsky, and Joachim Spoerhase . . . . . . . . . . 107:1–107:4

Brief Announcement: Bayesian Auctions with Efficient QueriesJing Chen, Bo Li, Yingkai Li, and Pinyan Lu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108:1–108:4

Brief Announcement: Hamming Distance Completeness and Sparse MatrixMultiplication

Daniel Graf, Karim Labib, and Przemysław Uznański . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109:1–109:4

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVSDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, andMeirav Zehavi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110:1–110:4

Brief Announcement: Erasure-Resilience Versus Tolerance to ErrorsSofya Raskhodnikova and Nithin Varma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111:1–111:3

Brief Announcement: Bounded-Degree Cut is Fixed-Parameter TractableMingyu Xiao and Hiroshi Nagamochi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112:1–112:6

Track B: Logic, Semantics, Automata and Theory of Programming

Almost Sure ProductivityAlejandro Aguirre, Gilles Barthe, Justin Hsu, and Alexandra Silva . . . . . . . . . . . . . . . 113:1–113:15

O-Minimal Invariants for Linear LoopsShaull Almagor, Dmitry Chistikov, Joël Ouaknine, and James Worrell . . . . . . . . . . . 114:1–114:14

Topological Sorting with Regular ConstraintsAntoine Amarilli and Charles Paperman . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .115:1–115:14

ICALP 2018

107:xii Contents

On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed SurfaceAlbert Atserias, Stephan Kreutzer, and Marc Noy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116:1–116:14

Bisimulation Invariant Monadic-Second Order Logic in the FiniteAchim Blumensath and Felix Wolf . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117:1–117:13

Binary Reachability of Timed Pushdown Automata via Quantifier Eliminationand Cyclic Order Atoms

Lorenzo Clemente and Sławomir Lasota . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118:1–118:14

Unboundedness Problems for Languages of Vector Addition SystemsWojciech Czerwiński, Piotr Hofman, and Georg Zetzsche . . . . . . . . . . . . . . . . . . . . . . . . . 119:1–119:15

Reachability and Distances under Multiple ChangesSamir Datta, Anish Mukherjee, Nils Vortmeier, and Thomas Zeume . . . . . . . . . . . . . 120:1–120:14

When is Containment Decidable for Probabilistic Automata?Laure Daviaud, Marcin Jurdziński, Ranko Lazić, Filip Mazowiecki,Guillermo A. Pérez, and James Worrell . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121:1–121:14

On the Complexity of Infinite Advice StringsGaëtan Douéneau-Tabot . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122:1–122:13

Resynchronizing Classes of Word RelationsMaría Emilia Descotte, Diego Figueira, and Gabriele Puppis . . . . . . . . . . . . . . . . . . . . .123:1–123:13

Reachability Switching GamesJohn Fearnley, Martin Gairing, Matthias Mnich, and Rahul Savani . . . . . . . . . . . . . . 124:1–124:14

Costs and Rewards in Priced Timed AutomataMartin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, and James Worrell 125:1–125:14

First-Order Interpretations of Bounded Expansion ClassesJakub Gajarský, Stephan Kreutzer, Jaroslav Nešetřil, Patrice Ossona de Mendez,Michał Pilipczuk, Sebastian Siebertz, and Szymon Toruńczyk . . . . . . . . . . . . . . . . . . . . . 126:1–126:14

Randomized Sliding Window Algorithms for Regular LanguagesMoses Ganardi, Danny Hucke, and Markus Lohrey . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .127:1–127:13

Aperiodic points in Z2-subshiftsAnael Grandjean, Benjamin Hellouin de Menibus, and Pascal Vanier . . . . . . . . . . . . 128:1–128:13

Semicomputable GeometryMathieu Hoyrup, Diego Nava Saucedo, and Don M. Stull . . . . . . . . . . . . . . . . . . . . . . . . 129:1–129:13

On Computing the Total Variation Distance of Hidden Markov ModelsStefan Kiefer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130:1–130:13

To Infinity and BeyondInes Klimann . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .131:1–131:12

On the Identity Problem for the Special Linear Group and the Heisenberg GroupSang-Ki Ko, Reino Niskanen, and Igor Potapov . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .132:1–132:15

Gaifman Normal Forms for Counting Extensions of First-Order LogicDietrich Kuske and Nicole Schweikardt . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .133:1–133:14

Contents 107:xiii

Polynomial Vector Addition Systems With StatesJérôme Leroux . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .134:1–134:13

Reducing CMSO Model Checking to Highly Connected GraphsDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, and Meirav Zehavi . . . . . . . . 135:1–135:14

An Optimal Bound on the Solution Sets of One-Variable Word Equations and itsConsequences

Dirk Nowotka and Aleksi Saarela . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136:1–136:13

Separating Without Any AmbiguityThomas Place and Marc Zeitoun . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .137:1–137:14

A Superpolynomial Lower Bound for the Size of Non-Deterministic Complementof an Unambiguous Automaton

Mikhail Raskin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138:1–138:11

The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACEGéraud Sénizergues and Armin Weiß . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139:1–139:14

Unambiguous Languages Exhaust the Index HierarchyMichał Skrzypczak . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 140:1–140:14

The Beta-Bernoulli process and algebraic effectsSam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman,Cameron E. Freer, and Daniel M. Roy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .141:1–141:15

Uniformization Problems for Synchronizations of Automatic Relations on WordsSarah Winter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .142:1–142:13

Track C: Foundations of Networked Computation: Models,Algorithms, and Information Management

Congestion-Free Rerouting of Flows on DAGsSaeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, andSebastian Wiederrecht . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143:1–143:13

Practical and Provably Secure Onion RoutingMegumi Ando, Anna Lysyanskaya, and Eli Upfal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .144:1–144:14

Resolving SINR Queries in a Dynamic SettingBoris Aronov, Gali Bar-On, and Matthew J. Katz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145:1–145:13

Uniform Mixed Equilibria in Network Congestion Games with Link FailuresVittorio Bilò, Luca Moscardelli, and Cosimo Vinci . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146:1–146:14

Byzantine Gathering in Polynomial TimeSébastien Bouchard, Yoann Dieudonné, and Anissa Lamani . . . . . . . . . . . . . . . . . . . . . .147:1–147:15

Temporal Vertex Cover with a Sliding Time WindowEleni C. Akrida, George B. Mertzios, Paul G. Spirakis, and Viktor Zamaraev . . . . 148:1–148:14

On the Complexity of Sampling Vertices Uniformly from a GraphFlavio Chierichetti and Shahrzad Haddadan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .149:1–149:13

ICALP 2018

107:xiv Contents

The Price of Stability of Weighted Congestion GamesGeorge Christodoulou, Martin Gairing, Yiannis Giannakopoulos, andPaul G. Spirakis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .150:1–150:16

Demand-Independent Optimal TollsRiccardo Colini-Baldeschi, Max Klimm, and Marco Scarsini . . . . . . . . . . . . . . . . . . . . . 151:1–151:14

Greedy Algorithms for Online Survivable Network DesignSina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, andSaeed Seddighin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152:1–152:14

Algorithms for Noisy Broadcast with ErasuresOfer Grossman, Bernhard Haeupler, and Sidhanth Mohanty . . . . . . . . . . . . . . . . . . . . . .153:1–153:12

Efficient Black-Box Reductions for Separable Cost SharingTobias Harks, Martin Hoefer, Anja Huber, and Manuel Surek . . . . . . . . . . . . . . . . . . . . 154:1–154:15

Price of Anarchy for Mechanisms with Risk-Averse AgentsThomas Kesselheim and Bojana Kodric . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155:1–155:14

Polynomial Counting in Anonymous Dynamic Networks with Applications toAnonymous Dynamic Algebraic Computations

Dariusz R. Kowalski and Miguel A. Mosteiro . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156:1–156:14

The Unfortunate-Flow ProblemOrna Kupferman and Gal Vardi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157:1–157:14

Spanning Trees With Edge Conflicts and Wireless ConnectivityMagnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, and Tigran Tonoyan . . . . 158:1–158:15

Eigenvector Computation and Community Detection in Asynchronous GossipModels

Frederik Mallmann-Trenn, Cameron Musco, and Christopher Musco . . . . . . . . . . . . . 159:1–159:14

(∆ + 1) Coloring in the Congested Clique ModelMerav Parter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .160:1–160:14

CacheShuffle: A Family of Oblivious ShufflesSarvar Patel, Giuseppe Persiano, and Kevin Yeo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .161:1–161:13

Brief Announcement: MapReduce Algorithms for Massive TreesMohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan,MohammadTaghi Hajiaghayi, and Vahab Mirrokni . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162:1–162:4

Brief Announcement: Give Me Some Slack: Efficient Network MeasurementsRan Ben Basat, Gil Einziger, and Roy Friedman . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163:1–163:5

Brief Announcement: Towards an Abstract Model of User Retention DynamicsEli Ben-Sasson and Eden Saig . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 164:1–164:4

Brief Announcement: Energy Constrained Depth First SearchShantanu Das, Dariusz Dereniowski, and Przemysław Uznański . . . . . . . . . . . . . . . . . . 165:1–165:5

Preface

This volume contains the papers presented at ICALP 2018, the 45th edition of the Inter-national Colloquium on Automata, Languages and Programming, held in Prague, CzechRepublic during July 9–13, 2018. ICALP is a series of annual conferences of the EuropeanAssociation for Theoretical Computer Science (EATCS), which first took place in 1972. Thisyear, the ICALP program consisted of three tracks:

Track A: Algorithms, Complexity, and Games,Track B: Logic, Semantics, Automata and Theory of Programming,Track C: Foundations of Networked Computation: Models, Algorithms, and InformationManagement.

In response to the call for papers, a total 502 submissions were received: 346 for track A,96 for track B, and 60 for track C. Each submission was assigned to at least three ProgramCommittee members, aided by many subreviewers. Out of these, the committee decidedto accept 147 papers for inclusion in the scientific program: 98 papers for Track A, 30 forTrack B, and 19 for Track C. The selection was made by the Program Committees basedon originality, quality, and relevance to theoretical computer science. The quality of themanuscripts was very high, and many deserving papers could not be selected.

This year ICALP also solicitated brief announcements of work in progress with substantialinterest for the community. In total 14 brief announcements were accepted for publication:10 for Track A and 4 for Track C. The selection of the brief announcements was made by theProgram Committees.

The EATCS sponsored awards for both a best paper and a best student paper for each ofthe three tracks, selected by the Program Committees.

The best paper awards were given to the following papers:

Track A: Heng Guo and Mark Jerrum. “A polynomial-time approximation algorithm forall-terminal network reliability”.Track B: Dirk Nowotka and Aleksi Saarela. “An optimal bound on the solution sets ofone-variable word equations and its consequences”.Track C: Dariusz Kowalski and Miguel A. Mosteiro. “Polynomial Counting in AnonymousDynamic Networks with Applications to Anonymous Dynamic Algebraic Computations”.

The best student paper awards, for papers that are solely authored by students, weregiven to the following papers:

Track A: Shashwat Garg. “Quasi-PTAS for Scheduling with Precedences using LPHierarchies”.Track B: Sarah Winter. “Uniformization problems for synchronizations of automaticrelations on words”.

Apart from the contributed talks and the brief announcements, ICALP 2018 includedinvited presentations by Jaroslav Nešetřil, Alexander Schwarzmann, Sam Staton and RyanWilliams. This volume of the proceedings contains all contributed papers and brief announce-ments presented at the conference together with the papers and abstracts of the invitedspeakers.

The program of ICALP 2018 also included presentation of the EATCS Award 2018 toNoam Nisan, the Gödel Prize 2018 to Oded Regev, the Presburger Award 2018 to Aleksander

107:xvi Preface

Mądry, and the EATCS Distinguished Dissertation Award to Bas Ketsman, Ilya Razenshteynand Aviad Rubinstein.

The program also included a memorial session for Maurice Nivat, the founder of ICALPand EATCS, who passed away in September 2017.

Six satellite events of ICALP were held on 9 July, 2018:

Modern Online Algorithms (MOLI)Game Solving: Theory and PracticeParameterized Approximation Algorithms Workshop (PAAW)InfinityAlgorithmic Aspects of Temporal GraphsConstrained Recognition Problems

The Summer School on Algorithms and Lower Bounds was organized immediately beforeICALP during 6-9 July, 2018, with a follow-up workshop on Monday afternoon. The workshopwas a satellite ICALP workshop devoted to presentations by selected participants of theschool.

The Summer School on Discrete Mathematics was organized after the conference during16-20 July, 2018. The event was organized by the Institute of Mathematics of the CzechAcademy of Sciences and the Computer Science Institute of Charles University.

We wish to thank all authors who submitted extended abstracts for consideration, theProgram Committees for their scholarly effort, and all referees who assisted the ProgramCommittees in the evaluation process. We are also grateful to Anna Kotěšovcová fromCONFORG and to Jiří Sgall, Andreas Emil Feldmann, Tomáš Masařík, Michal Opler, JiříFiala and Jan Musílek and all the support staff of the Organizing Committee from CharlesUniversity for organizing ICALP 2018.

We are grateful for generous support from AVAST and RSJ companies which includedboth travel grants for young women researchers and students and a direct support of theconference. We thank the School of Computer Science (Charles University, Faculty ofMathematics and Physics) and Center of Excellence - Institute for Theoretical ComputerScience (project P202/12/G061 of Czech Science Foundation) for their support.

We would like to thank Jiří Sgall for his continuous support and Paul Spirakis, thepresident of EATCS, for his generous advice on the organization of the conference.

July 2018 Ioannis ChatzigiannakisChristos KaklamanisDániel MarxDonald Sannella

Organization

Program Committee

Track A

Dániel Marx Hungarian Academy of Sciences, ChairAlexandr Andoni Columbia University, USANikhil Bansal Eindhoven University of Technology, NetherlandsMarkus Bläser Saarland University, GermanyGlencora Borradaile Oregon State University, USASergio Cabello University of Ljubljana, SloveniaJoseph Cheriyan University of Waterloo, CanadaLeah Epstein University of Haifa, IsraelSamuel Fiorini Université libre de Bruxelles, BelgiumCraig Gentry IBM Research, USAKasper Green Larsen Aarhus University, DanmarkGiuseppe F. Italiano Università di Roma “Tor Vergata”, ItalyBart M.P. Jansen Eindhoven University of Technology, NetherlandsPetteri Kaski Aalto University, FinlandMichal Koucký Charles University, Czech RepublicElias Koutsoupias Oxford, UKRobert Krauthgamer Weizmann Institute, IsraelStephan Kreutzer TU Berlin, GermanyTroy Lee Nanyang Technological University, SingaporeMoshe Lewenstein Bar-Ilan University, IsraelMonaldo Mastrolilli IDSIA, SwitzerlandAnkur Moitra MIT, USASeffi Naor Technion, IsraelSeth Pettie University of Michigan, USAMichał Pilipczuk University of Warsaw, PolandAlon Rosen Herzliya Interdisciplinary Center, IsraelGünter Rote Freie Universität Berlin, GermanyBarna Saha University of Massachusetts Amherst, USAAnastasios Sidiropoulos University of Illinois at Chicago, USADaniel Štefankovič University of Rochester, USAMaxim Sviridenko Yahoo Research, USAVirginia Vassilevska Williams MIT, USAGerhard Woeginger RWTH Aachen, GermanyRonald de Wolf CWI and University of Amsterdam, NetherlandsStanislav Živný Oxford, UK

Track BDonald Sannella Univ of Edinburgh, UK, ChairNathalie Bertrand IRISA/INRIA Rennes, FranceMikołaj Bojańczyk Warsaw University, PolandUdi Boker Interdisciplinary Center Herzliya, Israel

107:xviii Organization

Yuxin Deng East China Normal University, ChinaFloris Geerts Univ Antwerp, BelgiumDan Ghica Univ Birmingham, UKAlexey Gotsman IMDEA, SpainJan Hoffmann CMU, USANaoki Kobayashi Univ Tokyo, JapanMartin Lange Univ Kassel, GermanyDirk Pattinson Australian National Univ, AustraliaFemke van Raamsdonk VU Amsterdam, NetherlandsJean-François Raskin Univ libre de Bruxelles, BelgiumVladimiro Sassone Univ Southampton, UKThomas Schwentick TU Dortmund, GermanyAlex Simpson Univ Ljubljana, SloveniaJiří Srba Aalborg Univ, DenmarkMirco Tribastone IMT Lucca, ItalyTomáš Vojnar Brno Univ of Technology, Czech RepublicIgor Walukiewicz CNRS and Univ Bordeaux, FranceScott Weinstein Univ Pennsylvania, USA

Track C

Christos Kaklamanis CTI “Diophantus” and University of Patras, Greece, ChairSusanne Albers TU Munich, GermanyLuca Becchetti Sapienza University of Rome, ItalyIoannis Caragiannis University of Patras, GreeceAndrea Clementi University of Rome “Tor Vergata”, ItalyMichele Flammini Gran Sasso Sci Inst and Univ of L’Aquila, ItalyPierre Fraigniaud CNRS and Université Paris Diderot, FranceAristides Gionis Aalto University, FinlandSudipto Guha University of Pennsylvania, USATomasz Jurdzinski University of Wroclaw, PolandEvangelos Kranakis Carleton University, CanadaDanny Krizanc Wesleyan University, USAKatrina Ligett California Institute of Technology, USA and Hebrew University, IsraelMarios Mavronicolas University of Cyprus, CyprusKobbi Nissim Georgetown University, USAMarina Papatriantafilou Chalmers University of Technology, SwedenAndrzej Pelc Université du Québec en Outaouais, CanadaDavid Peleg Weizmann Institute of Science, IsraelGeppino Pucci University of Padova, ItalyChristian Scheideler Paderborn University, GermanyRoger Wattenhofer ETH Zurich, Switzerland

Organization 107:xix

Organizing Committee

Jiří Sgall Charles University, Czech Republic, Conference ChairAnna Kotěšovcová CONFORG, Czech RepublicAndreas Emil Feldmann Charles University, Czech RepublicTomáš Masařík Charles University, Czech RepublicMichal Opler Charles University, Czech RepublicJiří Fiala Charles University, Czech RepublicJan Musílek Charles University, Czech Republic

Financial Sponsors

ICALP 2018

107:xx Organization

Additional Reviewers

Anders Aamand Mohammad Ali Abam Amir AbboudRupam Acharyya Anil Ada Raghavendra AddankiPeyman Afshani Divesh Aggarwal Manindra AgrawalSaba Ahmadi S. Akshay Xavier AllamigeonShaull Almagor Josh Alman Noga AlonHelmut Alt Joel Alwen Andris AmbainisNima Anari Leonardo Aniello Simon ApersItai Arad Myrto Arapinis Srinivasan ArunachalamKazuyuki Asada Gilad Asharov Andrei AsinowskiCigdem Aslay Sepehr Assadi Chen AttiasChen Avin Yossi Azar Haris AzizYakov Babichenko Arturs Backurs Saikrishna BadrinarayananEric Balkanski Marshall Ball Alkida BalliuJános Balogh Stephanie Balzer Jørgen Bang-JensenBahareh Banyassady Amotz Bar-Noy Ran Ben BasatFelix Baschenis Mohammadhossein Bateni Tugkan BatuPaul Beame Djamal Belazzougui Paul BellAlexander Belov Omri Ben-Eliezer Souha Ben-RayanaNikola Benes Iddo Bentov Suman Kalyan BeraSebastian Berndt Aaron Bernstein Ivona BezakovaAditya Bhaskara Sayan Bhattacharya Marcin BienkowskiPhilip Bille Davide Bilò Vittorio BilòAhmad Biniaz Nir Bitansky Henrik BjörklundJaroslaw Blasiok Ivan Bliznets Achim BlumensathHans L. Bodlaender Greg Bodwin Magnus BordewichRalph Bottesch Patricia Bouyer Zvika BrakerskiCornelius Brand Vladimir Braverman Thomas BrihayeKarl Bringmann Sabine Broda Gerth Stølting BrodalJoshua Brody Vaclav Brozek Kevin BuchinBoris Bukh Sam Buss Jaroslaw ByrkaKarthik C. S. Yang Cai Clément CanonneArnaud Carayol Clément Carbonnel Timothy CarpenterMatteo Ceccarello Keren Censor-Hillel Amit ChakrabartiDeeparnab Chakrabarty Diptarka Chakraborty Sourav ChakrabortyParinya Chalermsook Jeremie Chalopin T-H. Hubert ChanTimothy M. Chan Karthekeyan Chandrasekaran Hsien-Chih ChangYi-Jun Chang Melissa Chase Arkadev ChattopadhyayShiri Chechik Jiecao Chen Sitan ChenXi Chen Yijia Chen Yu-Fang ChenSiu-Wing Cheng Victor Chepoi Dmitry ChistikovRajesh Chitnis Eden Chlamtac Keerti ChoudharyGeorge Christodoulou Lorenzo Clemente Jonas CleveRaphaël Clifford Adrien Le Coënt Avi CohenEdith Cohen Ilan Cohen Vincent Cohen-AddadThomas Colcombet Denis Cornaz Ágnes Cseh

Organization 107:xxi

Radu Curticapean Łukasz Czajka Artur CzumajDana Dachman-Soled Hadassa Daltrophe Ankush DasAnupam Das Laure Daviaud Anuj DawarAnindya De Éric Colin de Verdière Giorgio DelzannoStéphane Demri Michael Dinitz Michael Gene DobbinsDavid Doty Ran Duan Vida DujmovicAdrian Dumitrescu Romaric Dunignau Martin DyerRüdiger Ehlers Eduard Eiben Friedrich EisenbrandDavid Eisenstat Khaled Elbassioni Lior EldarJörg Endrullis Matthias Englert Hossein EsfandiariGuy Even Esther Ezra Yuri FaenzaYaron Fairstein Jittat Fakcharoenphol Carlo FantozziBill Fefferman Uriel Feige Moran FeldmanAndreas Emil Feldmann Michael Feldmann Stefan FelsnerHenning Fernau Diego Figueira Nathanaël FijalkowEmmanuel Filiot Aris Filos-Ratsikas Arnold FiltserFrancesca Fiorenzi Johannes Fischer Orr FischerTamás Fleiner Krzysztof Fleszar Till FluschnikFedor Fomin Casper Benjamin Freksen Dominik D. FreydenbergerTobias Friedrich Alan Frieze Zachary FriggstadVincent Froese Radoslav Fulek Peter FullaBenjamin Fuller Peter Gacs Travis GagieAndreas Galanis Nicolas Gama Venkata GandikotaPierre Ganty Sumegha Garg Paul GastinOlivier Gauwin Pawel Gawrychowski Gilles GeeraertsSamir Genaim Georgios Georgiadis Loukas GeorgiadisShayan Oveis Gharan Panos Giannopoulos Hugo GimbertAlex Gittens Vasilis Gkatzelis Shay GolanLeslie Ann Goldberg Paul Goldberg Elazar GoldenbergIsaac Goldstein Stefan Göller Petr GolovachAlexander Golovnev Michael T. Goodrich Sivakanth GopiThorsten Götte Lee-Ad Gottlieb Themis GouleakisFabrizio Grandoni Roland Grappe Alexander GrigorievAlex Bredariol Grilo Martin Grohe Allan GrønlundRoberto Grossi Luciano Gualà Bruno GuillonHeng Guo Jiong Guo Krystal GuoAnupam Gupta Manoj Gupta Sushmita GuptaTom Gur Venkatesan Guruswami Julian GutierrezTorben Hagerup Mohammadtaghi Hajiaghayi Nir HalmanSamuel Haney Kristoffer Arnsfelt Hansen Thomas Dueholm HansenNicolas Hanusse Sariel Har-Peled Tero HarjuTobias Harks David Harris Prahladh HarshaTim Hartmann Carmit Hazay Brett HemenwayJacob Hendricks Frédéric Herbreteau Kieran HerleyDanny Hermelin John Hershberger Hiroshi HiraiDenis Hirschfeldt Petr Hlineny Rebecca HobergDorit Hochbaum Martin Hoefer Frank HoffmannMichael Hoffmann Stepan Holub Stefan HougardyMathieu Hoyrup Justin Hsu Chien-Chung HuangDawei Huang Zhiyi Huang Pavel Hubáček

ICALP 2018

107:xxii Organization

Vincent Hugot Norbert Hundeshagen Christoph HunkenschröderThore Husfeldt Tony Huynh John IaconoZvonko Iljazovic Neil Immerman Piotr IndykVincenzo Iovino Zahra Jafargholi Ragesh JaiswalDavid Janin David N. Jansen T.S. JayramMark Jerrum Artur Jeż Łukasz JeżShaofeng Jiang Adrian Johnstone Peter JonssonHossein Jowhari Chiraag Juvekar Volker KaibelChristos Kalaitzis Sagar Kale Gautam KamathLior Kamma Frank Kammer Daniel KaneIyad Kanj Erez Kantor Michael KapralovAikaterini Karanasiou Jarkko Kari Juha KärkkäinenZohar Karnin Takashi Katoh Isabella KaufmannTelikepalli Kavitha Ken-Ichi Kawarabayashi Steven KelkMarcel Keller Hans Kellerer Dominik KempaDaniel Kernberger Thomas Kesselheim Shahbaz KhanSamir Khuller Stefan Kiefer Daniel KiferEunjung Kim Sándor Kisfaludi-Bak Kim-Manuel KleinPhilip Klein Robert Kleinberg Boris KlemzMax Klimm Jan Willem Klop Katharina KlostJens Knoop Dušan Knop Yusuke KobayashiTomasz Kociumaka Ioannis Kokkinis Sudeshna KolayChristina Kolb Balagopal Komarath Christian KonradSpyros Kontogiannis Tsvi Kopelowitz Swastik KoppartyGuy Kortsarz Yiannis Koutis Karel KrálJan Kratochvil Klaus Kriegel S KrishnaJean Krivine Robert Kübler Oliver KullmannAmit Kumar Mrinal Kumar Ravi KumarMarvin Künnemann Denis Kuperberg Salvatore La TorreThijs Laarhoven Anthony Labarre Arnaud LabourelBundit Laekhanukit Michael Lampis Patrick LandwehrJulien Lange Stefan Langerman Elmar LangetepeSophie Laplante Kim S. Larsen Sławomir LasotaSilvio Lattanzi Philip Lazos Hung LeEuiwoong Lee Karoliina Lehtinen Steffen LemppOndrej Lengal Jérôme Leroux Stefano LeucciPeter Leupold Reut Levi Asaf LevinMaxwell Levit Avivit Levy Nathan LhoteJason Li Jerry Li Jian LiRay Li Yuanzhi Li Nutan LimayeDidier Lime Andrea Lincoln Steven LindellNathan Lindzey Andre Linhares Quanquan LiuChristof Löding Maarten Löffler Markus LohreyDaniel Lokshtanov Federico Lombardi Julian LossAnand Louis Shachar Lovett Hsueh-I LuPinyan Lu Jack H Lutz James F. LynchVladimir Lysikov Ramanujan M. S. Mohammad MahdianMichael Mahoney Hemanta Maji Konstantin MakarychevYury Makarychev Pasquale Malacaria Andreas MalettiDavid Manlove Giovanni Manzini Andrea Margheri

Organization 107:xxiii

Nicolas Markey Euripides Markou Francisco MartinsTomas Masopust Antonis Matakos Bastien MaubertManuel Mauro Richard Mayr Arya MazumdarAndrew McGregor Moti Medina Mohammad Syed MeesumKurt Mehlhorn Ruta Mehta Manor MendelMassimo Merro Julian Mestre Pierre-étienne MeunierTom Meyerovitch Theresa Migler-Vondollen Matúš MihalákMarius Mikučionis Martin Milanič Kevin MilansCarl Miller Tillmann Miltzow Pranabendu MisraJoseph Mitchell Matthias Mnich Ali MohadesRolf H. Möhring Tobias Mömke Benjamin MooreCris Moore Pat Morin Ben MoseleyDana Moshkovitz Elchanan Mossel Shay MozesWolfgang Mulzer Kamesh Munagala Ian MunroCameron Musco Christopher Musco Torsten MützeDaniel Nagaj Viswanath Nagarajan Anand NatarajanGuyslain Naves Amir Nayyeri Amir NayyeriMark-Jan Nederhof Jesper Nederlof Joe NeemanOfer Neiman Adrian Neumann Ilan NewmanVan Chan Ngo Huy Nguyen Denis NicoleMatthias Niewerth Filip Niksic Gali NotiKrzysztof Nowicki Marc Noy Timm OertelAlexander Okhotin Igor Carboni Oliveira Rafael OliveiraDennis Olivetti Feyishayo Olukoya Krzysztof OnakAurélien Ooms Sebastian Ordyniak Mikhail OstrovskiiYota Otachi Joël Ouaknine Youssouf OualhadjSang-Il Oum Megan Owen Kenta OzekiRasmus Pagh Linda Pagli Dominik PajakIgor Pak Konstantinos Panagiotou Anurag PandeyGopal Pandurangan Debmalya Panigrahi Periklis PapakonstantinouNikos Parotsidis Merav Parter Anat Paskin-CherniavskyFrancesco Pasquale Erik Paul Subhabrata PaulLehilton L. C. Pedrosa Chris Peikert Pan PengRichard Peng Guillermo Perez Pablo Pérez-LanteroWill Perkins Jeff Phillips Astrid PieterseAndrea Pietracaprina Oleg Pikhurko Marcin PilipczukJean-Eric Pin Thomas Place Wojciech PlandowskiVladimir Podolskii Ely Porat Gustavo PostaM. Praveen Eric Price Kirk PruhsPavel Pudlak Simon Puglisi Manish PurohitYouming Qiao Daowen Qiu Karin QuaasBalaji Raghavachari Ajitha Rajan Rajmohan RajaramanGovind Ramnarayan Narad Rampersad Sofya RaskhodnikovaJulian Rathke Gaurav Rattan Malin RauDror Rawitz Jean-Florent Raymond Ilya RazenshteynVojtech Rehak Daniel Reichman Ahmed RezineBruce Richter Havana Rika Andrej RisteskiLiam Roditty Heiko Röglin Lars RohwedderDana Ron Adi Rosén Peter RossmanithJurriaan Rot Marc Roth Ron Rothblum

ICALP 2018

107:xxiv Organization

Thomas Rothvoss Reuben Rowe Eric RowlandMichał Różański Polina Rozenshtein Atri RudraAleksi Saarela Sushant Sachdeva S. Cenk SahinalpKen Sakayori Michael Saks Ario SalmasiLaura Sanita Piotr Sankowski Ocan SankurRahul Santhanam Ramprasad Saptharishi Thatchaphol SaranurakJayalal Sarma Kanthi Sarpatwar Tetsuya SatoSrinivasa Rao Satti Ignasi Sau Thomas SauerwaldNitin Saurabh Saket Saurabh Zdenek SawaRaghuvansh Saxena Guillaume Scerri Michael SchapiraNadja Scharf Sven Schewe Stefan SchmidGeorg Schnitger Tselil Schramm Dominique SchroederRoy Schwartz Chris Schwiegelshohn Giacomo ScornavaccaElizabeth Scott Adam Sealfon Erel Segal-HaleviDanny Segev Ilya Sergey C. SeshadhriAlexander Setzer Asaf Shapira Micha SharirDon Sheehy Tetsuo Shibuya Igor ShinkarTong-Wook Shinn Aaron Sidford Sebastian SiebertzRodrigo Silveira Francesco Silvestri Ryoma Sin’YaAlistair Sinclair Kritika Singhal Rene SittersAlexander Skopalik Michał Skrzypczak Shay SolomonChristian Sommer Fu Song Aikaterini SotirakiChristopher Spinrath Sophie Spirkl Joachim SpoerhaseVijay Sridhar Akshayaram Srinivasan Aravind SrinivasanNikhil Srivastava B Srivathsan Tatiana StarikovskayaDamien Stehle Fabian Stehn Florian SteinbergNoah Stephens-Davidowitz Sebastian Stiller Thomas SturmMartin Sulzmann Scott Summers Aarthi SundaramToshio Suzuki Ola Svensson Avishay TalNavid Talebanfard Ohad Talmon Suguru TamakiLi-Yang Tan Jakub Tarnawski Yael Tauman KalaiJustin Thaler Sharma V. Thankachan Johan ThapperDimitrios Thilikos Dilys Thomas Francesco TiezziSimone Tini Andreas Tönnis Tigran TonoyanPatrick Totzke Henry Towsner Ohad TrabelsiElias Tsakas Max Tschaikowski Philippas TsigasTakeshi Tsukada Iddo Tzameret Marc UetzYuya Uezato Seeun William Umboh Rohit VaishAli Vakilian Leo van Iersel Erik Jan van LeeuwenRob van Stee Anke van Zuylen Shai VardiPrashant Vasudevan Yann Vaxès Rahul VazeLászló A. Végh Santosh Vempala Carmine VentreNikolay Vereshchagin José Verschae Aravindan VijayaraghavanCosimo Vinci Sundar Vishwanathan Jan VondrakNils Vortmeier Satyanarayana Vusirikala Nikhil VyasMagnus Wahlström Erik Waingarten David WajcJohannes Waldmann Erik Walsberg Di WangYuyi Wang Justin Ward Pascal WeilOren Weimann Omri Weinstein Mathias WellerStefan Weltge Anthony Widjaja Lin Andreas Wiese

Organization 107:xxv

Max Willert Jack Williams Ryan WilliamsKarl Wimmer Sarah Winter Philipp WoelfelDominik Wojtczak Bruno Woltzenlogel Paleo David P. WoodruffJames Worrell Marcin Wrochna David WuPei Wu Zhilin Wu Christian Wulff-NilsenNing Xie Lin F. Yang Mu YangGrigory Yaroslavtsev Yitong Yin Yuichi YoshidaNeal Young Huacheng Yu Or ZamirMeirav Zehavi Marc Zeitoun Georg ZetzscheHanmeng Zhan Hantao Zhang Jie ZhangBaigong Zheng Vassilis Zikas Charilaos Zisopoulos

ICALP 2018

List of Authors

Anders AamandBARC, University of Copenhagen,Universitetsparken 1, Copenhagen, Denmarkaa@di.ku.dkhttps://orcid.org/0000-0002-0402-0514

Amir AbboudIBM Almaden Research Center, San Jose,USAamir.abboud@ibm.com

Nathanael L. AckermanHarvard Univ

Anna AdamaszekUniversity of Copenhagen, Denmarkanad@di.ku.dk

Navneet AgarwalIndian Institute of Technology Bombaynavneet@cse.iitb.ac.in

Pankaj K. AgarwalDepartment of Computer Science, DukeUniversity, Durham, NC 27708, USApankaj@cs.duke.edu

Alejandro AguirreIMDEA Software Institute, Madrid, Spain

Saeed Akhoondian AmiriMax-Planck Institute of Informatics,Germanysamiri@mpi-inf.mpg.de

Eleni C. AkridaDepartment of Computer Science, Universityof Liverpool, UKEleni.Akrida@liverpool.ac.ukhttps://orcid.org/0000-0002-1126-1623

Shaull AlmagorDepartment of Computer Science, OxfordUniversity, UKshaull.almagor@cs.ox.ac.uk

Antoine AmarilliLTCI, Télécom ParisTech, UniversitéParis-Saclay

Sanat AnandIndian Institute of Technology Bombaysanat@cse.iitb.ac.in

Megumi AndoComputer Science Department, BrownUniversity, Providence, RI 02912 USAmando@cs.brown.edu

Moab ArarTel Aviv University, Tel Aviv, Israel

Rotem Arnon-FriedmanETH Zürich, Switzerlandrotema@itp.phys.ethz.ch

Boris AronovDepartment of Computer Science andEngineering, Tandon School of Engineering,New York University, Brooklyn, NY 11201,USAboris.aronov@nyu.edu

Albert AtseriasUniversitat Politècnica de Catalunya,Barcelona, atserias@cs.upc.edu

Amy BabayJohns Hopkins University, Baltimore, MD,USAbabay@cs.jhu.edu

Miriam BackensDepartment of Computer Science, Universityof Oxford, UKmiriam.backens@cs.ox.ac.uk

Achiya Bar-OnDepartment of Mathematics, Bar-IlanUniversity, Ramat Gan, Israelabo1000@gmail.com

Gali Bar-OnDepartment of Computer Science,Ben-Gurion University of the Negev,Beer-Sheva 84105, Israelgalibar@post.bgu.ac.il

107:xxviiiAuthors

Gill BarequetTechnion - Israel Inst. of Technology, Haifa,Israelbarequet@cs.technion.ac.il

Gilles BartheIMDEA Software Institute, Madrid, Spain

MohammadHossein BateniGoogle Research, New York

Soheil BehnezhadUniversity of Maryland

Ran Ben BasatTechnion, Haifa, Israelsran@cs.technion.ac.il

Eli Ben-SassonDepartment of Computer Science, Technion,Haifa, Israeleli@cs.technion.ac.ilhttps://orcid.org/0000-0002-0708-0483

Iddo BentovCornell University, Ithaca, NY, USAiddo333@gmail.com

Ben BergerWeizmann Institute of Science, Rehovot,Israelben.berger@weizmann.ac.il

Juan Jose BesaDept. of Computer Science, Univ. ofCalifornia, Irvine, Irvine, CA 92697 USAjjbesavi@uci.eduhttps://orcid.org/0000-0002-5676-7011

Amey BhangaleWeizmann Institute of Science, Rehovot,Israelamey.bhangale@weizmann.ac.il

Aditya BhaskaraSchool of Computing, University of Utah,USAbhaskara@cs.utah.edu

Arnab BhattacharyyaIndian Institute of Science, Bangalore, Indiaarnabb@iisc.ac.in

Therese BiedlSchool of Computer Science, University ofWaterloo, Canadabiedl@uwaterloo.ca

Davide BilòDepartment of Humanities and SocialSciences, University of Sassari, Via Roma151, 07100 Sassari (SS), Italydavide.bilo@uniss.ithttps://orcid.org/0000-0003-3169-4300

Vittorio BilòDepartment of Mathematics and Physics,University of Salento, Lecce, Italyvittorio.bilo@unisalento.it

Ahmad BiniazSchool of Computer Science, University ofWaterloo, Canadaahmad.biniaz@gmail.com

Jeremiah BlockiDepartment of Computer Science, PurdueUniversity, West Lafayette, Indiana, USAjblocki@purdue.edu

Avrim BlumTTI-Chicago, Chicago, United Statesavrim@ttic.edu

Achim BlumensathMasaryk University Brnoblumens@fi.muni.cz

Thomas BläsiusHasso Plattner Institute, University ofPotsdam, Potsdam, Germanythomas.blaesius@hpi.de

Andrej BogdanovDepartment of Computer Science andEngineering and , Institute of TheoreticalComputer Science and Communications,Chinese University of Hong Kongandrejb@cse.cuhk.edu.hk

Prosenjit BoseSchool of Computer Science, CarletonUniversity, Ottawa, Canadajit@scs.carleton.ca

Authors 107:xxix

Sébastien BouchardSorbonne Universités, UPMC Univ Paris 06,CNRS, INRIA, LIP6 UMR 7606, Paris,Francesebastien.bouchard@lip6.fr

Elette BoyleIDC Herzliyaelette.boyle@idc.ac.il

Zvika BrakerskiWeizmann Institute of Science, Rehovot,Israelzvika.brakerski@weizmann.ac.il

Vladimir BravermanJohns Hopkins University, Baltimore, UnitedStatesvova@cs.jhu.edu

Karl BringmannMax Planck Institute for Informatics,Saarland Informatics Campus, Saarbrücken,Germanykbringma@mpi-inf.mpg.de

Jarosław ByrkaUniversity of Wrocław, Wrocław, Polandjby@cs.uni.wroc.pl

Mathias Bæk Tejs KnudsenUniversity of Copenhagen and Supwiz,Copenhagen, Denmarkmathias@tejs.dkhttps://orcid.org/0000-0001-5308-9609

Karthik C. S.Weizmann Institute of Science, Rehovot,Israelkarthik.srikanta@weizmann.ac.il

Paz CarmiDepartment of Computer Science,Ben-Gurion University of the Negev,Beer-Sheva, Israelcarmip@cs.bgu.ac.il

Marco L. CarmosinoDepartment of Computer Science, Universityof California San Diego, La Jolla, CA, USAmarco@ntime.org

L. Elisa CelisÉcole Polytechnique Fédérale de Lausanne(EPFL), Switzerland

Deeparnab ChakrabartyDepartment of Computer Science,Dartmouth College, 9 Maynard St, Hanover,NH, USAdeeparnab@dartmouth.edu

Timothy M. ChanDept. of Computer Science, University ofIllinois at Urbana-Champaign, USAtmc@illinois.edu

L. Sunil ChandranDepartment of Computer Science andAutomation, Indian Institute of Science,Indiasunil@csa.iisc.ernet.in

Steven ChaplickLehrstuhl für Informatik I, UniversitätWürzburg, Germanysteven.chaplick@uni-wuerzburg.dehttps://orcid.org/0000-0003-3501-4608

Moses CharikarDepartment of Computer Science, StanfordUniversity, Stanford, CA, USAmoses@cs.stanford.edu

Shiri ChechikTel Aviv University, Tel Aviv, Israel

Jiehua ChenBen-Gurion University of the Negev, BeerSheva, Israeljiehua.chen2@gmail.com

Jing ChenDepartment of Computer Science, StonyBrook University, Stony Brook, NY 11794,USAjingchen@cs.stonybrook.edu

Siu-Wing ChengDepartment of Computer Science andEngineering, HKUST, Hong Kongscheng@cse.ust.hkhttps://orcid.org/0000-0002-3557-9935

ICALP 2018

107:xxx Authors

Yun Kuen CheungMax Planck Institute for Informatics,Saarland Informatics Campus, Germanyycheung@mpi-inf.mpg.dehttps://orcid.org/0000-0002-9280-0149

Flavio ChierichettiDipartimento di Informatica, SapienzaUniversity, Rome, Italyflavio@di.uniroma1.ithttps://orcid.org/0000-0001-8261-9058

Suryajith ChillaraDepartment of CSE, IIT Bombay, Mumbai,Indiasuryajith@cse.iitb.ac.in

Dmitry ChistikovCentre for Discrete Mathematics and itsApplications (DIMAP) & , Department ofComputer Science, University of Warwick,UKd.chistikov@warwick.ac.uk

George ChristodoulouDepartment of Computer Science, Universityof Liverpool, Liverpool, UKG.Christodoulou@liverpool.ac.uk

Julia ChuzhoyToyota Technological Institute at Chicago,6045 S. Kenwood Ave., Chicago, Illinois60637, USAcjulia@ttic.edu

Lorenzo ClementeUniversity of Warsawclementelorenzo@gmail.comhttps://orcid.org/0000-0003-0578-9103

Sarel CohenTel Aviv University, Tel Aviv, Israel

Riccardo Colini-BaldeschiCore Data Science Group, Facebook Inc., 1Rathbone Place, London, W1T 1FB, UKrickuz@fb.comhttps://orcid.org/0000-0001-5739-1178

Alex ConwayRutgers University, New Brunswick, NJ,USAalexander.conway@rutgers.edu

Robert CummingsSchool of Computer Science, University ofWaterloo, Canadarcummings000@gmail.com

Wojciech CzerwińskiUniversity of Warsaw, Polandhttps://orcid.org/0000-0002-6169-868X

Samira DarukiExpedia Research, USAsdaruki@expedia.com

Shantanu DasLIS, Aix-Marseille University, University ofToulon, CNRS, Marseille, Franceshantanu.das@lif.univ-mrs.fr

Samir DattaChennai Mathematical Institute & UMIReLaX, Chennai, Indiasdatta@cmi.ac.in

Laure DaviaudUniversity of Warwick, Coventry, UKL.Daviaud@warwick.ac.uk

Minati DeDepartment of Mathematics, IndianInstitute of Technology Delhi, Indiaminati@maths.iitd.ac.in

Sina DehghaniUniversity of Maryland, College Park, MD20742, USA

Holger DellSaarland University and Cluster ofExcellence (MMCI), Saarbrücken, Germanyhdell@mmci.uni-saarland.dehttps://orcid.org/0000-0001-8955-0786

Mahsa DerakhshanUniversity of Maryland

Dariusz DereniowskiFaculty of Electronics, Telecommunicationsand Informatics, Gdańsk University ofTechnology, Gdańsk, Polandderen@eti.pg.edu.plhttps://orcid.org/0000-0003-4000-4818

María Emilia DescotteLaBRI, Université de Bordeaux

Authors 107:xxxi

William E. DevannyDept. of Computer Science, Univ. ofCalifornia, Irvine, Irvine, CA 92697 USAwdevanny@uci.edu

Ilias DiakonikolasUSC, Los Angeles, CA, USAdiakonik@usc.edu

Yoann DieudonnéLaboratoire MIS & Université de PicardieJules Verne, Amiens, Franceyoann.dieudonne@u-picardie.fr

Michael DinitzJohns Hopkins University, Baltimore, MD,USAmdinitz@cs.jhu.edu

Itai DinurComputer Science Department, Ben-GurionUniversity, Beer Sheva, Israeldinuri@cs.bgu.ac.il

Gaëtan Douéneau-TabotÉcole Normale Supérieure Paris-Saclay,Université Paris-Saclay, Cachan, Francegaetan.doueneau@ens-paris-saclay.fr

Ran DuanInstitute for Interdisciplinary InformationSciences, Tsinghua University, Chinaduanran@mail.tsinghua.edu.cn

Bartłomiej DudekInstitute of Computer Science, University ofWrocław, Polandbartlomiej.dudek@cs.uni.wroc.pl

Szymon DudyczUniversity of Wroclaw, Polandszymon.dudycz@gmail.com

Vida DujmovicSchool of Computer Science and ElectricalEngineering, University of Ottawa, Ottawa,Canadavida.dujmovic@uottawa.ca

Orr DunkelmanComputer Science Department, University ofHaifa, Haifa, Israelorrd@cs.haifa.ac.ilhttps://orcid.org/0000-0001-5799-2635

Lech DurajTheoretical Computer Science Department,Faculty of Mathematics and ComputerScience, Jagiellonian University, Kraków,Polandlech.duraj@uj.edu.pl

Zdeněk DvořákCharles University, Malostranske namesti 25,11800 Prague, Czech Republicrakdver@iuuk.mff.cuni.czhttps://orcid.org/0000-0002-8308-9746

Soheil EhsaniUniversity of Maryland, College Park, MD20742, USA

Eduard EibenDepartment of Informatics, University ofBergen, Bergen, Norwayeduard.eiben@uib.nohttps://orcid.org/0000-0003-2628-3435

Gil EinzigerNokia Bell Labs, Kfar Saba, Israelgil.einziger@nokia.com

Friedrich EisenbrandEPFL, 1015 Lausanne, Switzerlandfriedrich.eisenbrand@epfl.ch

David EppsteinDept. of Computer Science, Univ. ofCalifornia, Irvine, Irvine, CA 92697 USAeppstein@uci.edu

Martín Farach-ColtonRutgers University, New Brunswick, NJ,USAfarach@rutgers.edu

John FearnleyUniversity of Liverpool, UKjohn.fearnley@liverpool.ac.uk

Uriel FeigeWeizmann Institute of Science, Rehovot,Israeluriel.feige@weizmann.ac.il

Björn FeldkordPaderborn University, Paderborn, Germany

ICALP 2018

107:xxxii Authors

Matthias FeldottoPaderborn University, Paderborn, Germany

Hendrik FichtenbergerTU Dortmund, Dortmund, Germanyhendrik.fichtenberger@tu-dortmund.dehttps://orcid.org/0000-0003-3246-5323

Diego FigueiraCNRS, LaBRI, Université de Bordeaux

Fedor V. FominDepartment of Informatics, University ofBergen, NorwayFedor.Fomin@uib.nohttps://orcid.org/0000-0003-1955-4612

Michael A. ForbesUniversity of Illinois at Urbana-Champaign,USAmiforbes@illinois.edu

Jacob FoxDepartment of Mathematics, StanfordUniversity, Stanford, CA 94305, USAjacobfox@stanford.edu

Cameron E. FreerBorelian

Cedric FreibergerHasso Plattner Institute, University ofPotsdam, Potsdam, Germanycedric.freiberger@student.hpi.de

Roy FriedmanTechnion, Haifa, Israelroy@cs.technion.ac.il

Tobias FriedrichHasso Plattner Institute, University ofPotsdam, Potsdam, Germanytobias.friedrich@hpi.de

Martin FränzleDepartment of Computing Science,University of Oldenburg, Germanymartin.fraenzle@informatik.uni-oldenburg.de

Hao FuInstitute for Interdisciplinary InformationSciences, Tsinghua University, Beijng, Chinafu-h13@mails.tsinghua.edu.cn

Martin GairingDepartment of Computer Science, Universityof Liverpool, Liverpool, UKgairing@liverpool.ac.uk

Jakub GajarskýTechnical University Berlin, Germany

Buddhima GamlathÉcole Polytechnique Fédérale de Lausanne,Lausanne, Switzerlandbuddhima.gamlath@epfl.ch

Moses GanardiUniversität Siegen, Germanyganardi@eti.uni-siegen.de

Venkata GandikotaDepartment of Computer Science, JohnsHopkins University, Baltimore, Maryland,USAgv@jhu.edu

Sumit GangulyIndian Institute of Technology, Kanpur,Indiasganguly@cse.iitk.ac.in

Shashwat GargEindhoven University of Technology,Netherlandss.garg@tue.nl

Paweł GawrychowskiInstitute of Computer Science, University ofWrocław, Polandgawry@cs.uni.wroc.pl

Ofir GeriDepartment of Computer Science, StanfordUniversity, Stanford, CA, USAofirgeri@cs.stanford.edu

Sumanta GhoshDepartment of Computer Science, IITKanpur, Indiasumghosh@cse.iitk.ac.in

Suprovat GhoshalIndian Institute of Science, Bangalore, Indiasuprovat@iisc.ac.in

Authors 107:xxxiii

Yiannis GiannakopoulosDepartment of Mathematics, TU Munich,Munich, GermanyYiannis.Giannakopoulos@tum.dehttps://orcid.org/0000-0003-2382-1779

Shay GolanBar Ilan University, Ramat Gan, Israelgolansh1@cs.biu.ac.il

Petr A. GolovachDepartment of Informatics, University ofBergen, NorwayPetr.Golovach@uib.nohttps://orcid.org/0000-0002-2619-2990

Michael T. GoodrichDept. of Computer Science, Univ. ofCalifornia, Irvine, Irvine, CA 92697 USAgoodrich@uci.edu

Themis GouleakisCSAIL,MIT, Cambridge, MA, USAtgoule@mit.edu

Daniel GrafDepartment of Computer Science, ETHZürich, Switzerlanddaniel.graf@inf.ethz.ch

Anael GrandjeanLaboratoire d’Algorithmique, Complexité etLogique, Université Paris-Est Créteil, Franceanael.grandjean@u-pec.fr

Petr GregorDepartment of Theoretical ComputerScience and Mathematical Logic, CharlesUniversity, Prague, Czech Republicgregor@ktiml.mff.cuni.cz

Elena GrigorescuDepartment of Computer Science, PurdueUniversity, West Lafayette, Indiana, USAelena-g@purdue.edu

Martin GroheRWTH Aachen University, Aachen, Germanygrohe@informatik.rwth-aachen.dehttps://orcid.org/0000-0002-0292-9142

Ofer GrossmanEECS Departent, MIT, Cambridge, MA,USAofer.grossman@gmail.com

Yong GuInstitute for Interdisciplinary InformationSciences, Tsinghua University, Beijing, Chinaguyong12@mails.tsinghua.edu.cn

Heng GuoSchool of Informatics, University ofEdinburgh, Informatics Forum, Edinburgh,EH8 9AB, United Kingdomhguo@inf.ed.ac.ukhttps://orcid.org/0000-0001-8199-5596

Anupam GuptaCarnegie Mellon University, Pittsburgh, USAanupamg@cs.cmu.edu

Manoj GuptaIIT Gandhinagar, Gandhinagar, Indiagmanoj@iitgn.ac.in

Tom GurUC Berkeley, Berkeley, USAtom.gur@berkeley.edu

Rohit GurjarCalifornia Institute of Technology, USA

Guru GuruganeshCarnegie Mellon University, Pittsburgh, USA

Grzegorz GutowskiTheoretical Computer Science Department,Faculty of Mathematics and ComputerScience, Jagiellonian University, Kraków,Polandgrzegorz.gutowski@uj.edu.plhttps://orcid.org/0000-0003-3313-1237

Bernd GärtnerDepartment of Computer Science, ETHZürich, Switzerlandgaertner@inf.ethz.ch

Shahrzad HaddadanDipartimento di Informatica, SapienzaUniversity, Rome, Italyshahrzad.haddadan@uniroma1.ithttps://orcid.org/0000-0002-7702-8250

ICALP 2018

107:xxxivAuthors

Theophanis HadjistasiUniversity of Connecticut, Storrs CT, USAtheo@uconn.edu

Bernhard HaeuplerComputer Science Department, CarnegieMellon University, Pittsburgh, PA, USAhaeupler@cs.cmu.edu

MohammadTaghi HajiaghayiUniversity of Maryland, College Park, MD20742, USA

Magnús M. HalldórssonSchool of Computer Science, ReykjavikUniversity, Icelandmmh@ru.is

Thomas Dueholm HansenDepartment of Computer Science, Universityof Copenhagen, Denmarkdueholm@di.ku.dk

Sariel Har-PeledDepartment of Computer Science, Universityof Illinois, Urbana, IL, USAsariel@illinois.edu

Tobias HarksUniversität Augsburg, Institut fürMathematik, Augsburg, Germanytobias.harks@math.uni-augsburg.de

Koyo HayashiDepartment of Mathematical Informatics,University of Tokyo, Tokyo 113-8656, Japankoyo_hayashi@mist.i.u-tokyo.ac.jp

Benjamin Hellouin de MenibusLaboratoire de Recherche en Informatique,Université Paris-Sud, CNRS,CentraleSupélec, Université Paris-Saclay,Francehellouin@lri.frhttps://orcid.org/0000-0001-5194-929X

Danny HermelinBen-Gurion University of the Negev, BeerSheva, Israelhermelin@bgu.ac.il

Niklas HjulerUniversity of Copenhagen, Copenhagen,Denmarkniklashjuler@gmail.comhttps://orcid.org/0000-0002-0815-670X

Rani HodDepartment of Mathematics, Bar-IlanUniversity, Ramat Gan, Israelrani.hod@math.biu.ac.il

Martin HoeferGoethe-Universität Frankfurt am Main,Institut für Informatik, Frankfurt am Main,Germanymhoefer@cs.uni-frankfurt.de

Piotr HofmanUniversity of Warsaw, Polandhttps://orcid.org/0000-0001-9866-3723

Jacob HolmUniversity of Copenhagen, Copenhagen,Denmarkjaho@di.ku.dkhttps://orcid.org/0000-0001-6997-9251

Yinon HoreshTechnion - Israel Institute of Technology,Haifa, Israelynon980@gmail.com

Mathieu HoyrupUniversité de Lorraine, CNRS, Inria, LORIA,F-54000 Nancy, Francemathieu.hoyrup@inria.fr

Justin HsuUniversity College London, London, UK

Sangxia HuangSony Mobile Communications, Lund, Swedenhuang.sangxia@gmail.com

Zhiyi HuangDepartment of Computer Sicence, TheUniversity of Hong Kong, Hong Kongzhiyi@cs.hku.hk

Anja HuberUniversität Augsburg, Institut fürMathematik, Augsburg, Germanyanja.huber@math.uni-augsburg.de

Authors 107:xxxv

Pavel HubáčekComputer Science Institute, CharlesUniversity, Prague, Czech Republichubacek@iuuk.mff.cuni.cz

Danny HuckeUniversität Siegen, Germanyhucke@eti.uni-siegen.de

Christoph HunkenschröderEPFL, 1015 Lausanne, Switzerlandchristoph.hunkenschroder@epfl.ch

Russell ImpagliazzoDepartment of Computer Science, Universityof California San Diego, La Jolla, CA, USArussell@cs.ucsd.edu

Piotr IndykDepartment of Computer Science, MIT,Cambridge, MA, USAindyk@mit.edu

Davis IssacMax Planck Institute for Informatics,Saarland Informatics Campus, Germanydissac@mpi-inf.mpg.dehttps://orcid.org/0000-0001-5559-7471

Abhishek JainJohns Hopkins Universityabhishek@cs.jhu.edu

Jisu JeongDepartment of Mathematical Sciences,KAIST, Daejeon, Koreajisujeong89@gmail.com

Mark JerrumSchool of Mathematical Sciences, QueenMary, University of London, Mile End Road,London, E1 4NS, United Kingdomm.jerrum@qmul.ac.ukhttps://orcid.org/0000-0003-0863-7279

Timothy JohnsonDept. of Computer Science, Univ. ofCalifornia, Irvine, Irvine, CA 92697 USAtujohnso@uci.edu

Marcin JurdzińskiUniversity of Warwick, Coventry, UKMarcin.Jurdzinski@warwick.ac.uk

Sven JägerInstitut für Mathematik, TechnischeUniversität Berlin, Germanyjaeger@math.tu-berlin.de

Daniel M. KaneDepartment of Computer Science andEngineering/Department of Mathematics,University of California, San Diegodakane@ucsd.eduhttps://orcid.org/0000-0002-5884-3487

Iyad KanjSchool of Computing, DePaul University,Chicago, USAikanj@cs.depaul.edu

Haim KaplanSchool of Computer Science, Tel AvivUniversity, Tel Aviv 69978, Israelhaimk@tau.ac.il

Adam KarczmarzUniversity of Warsaw, Polanda.karczmarz@mimuw.edu.pl

Matthew J. KatzDepartment of Computer Science,Ben-Gurion University of the Negev,Beer-Sheva 84105, Israelmatya@cs.bgu.ac.il

Maximilian KatzmannHasso Plattner Institute, University ofPotsdam, Potsdam, Germanymaximilian.katzmann@hpi.de

Ken-ichi KawarabayashiNational Institute of Informatics, 2-1-2Hitotsubashi, Chiyoda-ku, Tokyo 101-8430,Japank_keniti@nii.ac.jphttps://orcid.org/0000-0001-6056-4287

Nathan KellerDepartment of Mathematics, Bar-IlanUniversity, Ramat Gan, Israelnkeller@math.biu.ac.il

Thomas KesselheimUniversity of Bonn, Institute of ComputerScience, Bonn, Germanythomas.kesselheim@uni-bonn.de

ICALP 2018

107:xxxviAuthors

Stefan KieferUniversity of Oxford, United Kingdom

David H. K. KimComputer Science Department, University ofChicago, 1100 East 58th Street, Chicago,Illinois 60637, USAhongk@cs.uchicago.edu

Eun Jung KimUniversité Paris-Dauphine, PSL ResearchUniversity, CNRS, Paris, Franceeun-jung.kim@dauphine.fr

Michael P. KimDepartment of Computer Science, StanfordUniversity, Stanford, CA, USAmpk@cs.stanford.edu

Kim-Manuel KleinEPFL, 1015 Lausanne, Switzerlandkim-manuel.klein@epfl.ch

Ines KlimannUniv Paris Diderot, Sorbonne Paris Cité,IRIF, UMR 8243 CNRS, F-75013 Paris,Franceklimann@irif.fr

Max KlimmSchool of Business and Economics, HUBerlin, Spandauer Str. 1, 10099 Berlin,Germanymax.klimm@hu-berlin.dehttps://orcid.org/0000-0002-9061-2267

Sang-Ki KoKorea Electronics Technology Institute,South Koreasangkiko@keti.re.kr

Bojana KodricMPI for Informatics and Saarland University,Saarbrücken, Germanybojana@mpi-inf.mpg.de

Zhuan Khye KohDepartment of Combinatorics andOptimization, University of Waterloo,Waterloo, Canadazkkoh@uwaterloo.ca

Alexandra KollaDepartment of Computer Science, Universityof Colorado at Boulderalexandra.kolla@colorado.edu

Tsvi KopelowitzBar Ilan University, Ramat Gan, Israelkopelot@gmail.com

Guy KortsarzRutgers University, Camden, NJ, USAguyk@camden.rutgers.edu

Martin KouteckýTechnion - Israel Institute of Technology,Haifa, Israel, and , Charles University,Prague, Czech Republickoutecky@technion.ac.ilhttps://orcid.org/0000-0002-7846-0053

Ioannis KoutisDepartment of Computer Science, NewJersey Institute of Technologyioannis.koutis@njit.edu

Dariusz R. KowalskiComputer Science Department, University ofLiverpool, Liverpool, UKD.Kowalski@liverpool.ac.uk

Jakub KozikTheoretical Computer Science Department,Faculty of Mathematics and ComputerScience, Jagiellonian University, Kraków,Polandjakub.kozik@uj.edu.pl

Stephan KreutzerTechnical University Berlinstephan.kreutzer@tu-berlin.de

Karel KrálComputer Science Institute, CharlesUniversity, Prague, Czech Republickralka@iuuk.mff.cuni.cz

Amit KumarIIT Delhi, New Delhi, India

Ananya KumarCarnegie Mellon University, Pittsburgh,United Statesskywalker94@gmail.com

Authors 107:xxxvii

Orna KupfermanSchool of Computer Science and Engineering,The Hebrew University, Israel

Dietrich KuskeTechnische Universität Ilmenau, Germanydietrich.kuske@tu-ilmenau.de

William KuszmaulDepartment of Computer Science, StanfordUniversity, Stanford, CA, USAkuszmaul@cs.stanford.edu

Karim LabibDepartment of Computer Science, ETHZürich, Switzerlandlabibk@student.ethz.ch

Anissa LamaniLaboratoire MIS & Université de PicardieJules Verne, Amiens, Franceanissa.lamani@u-picardie.fr

Michael LampisUniversité Paris-Dauphine, PSL ResearchUniversity, CNRS, UMR 7243 , LAMSADE,75016, Paris, Francemichail.lampis@dauphine.fr

Gad M. LandauUniversity of Haifa, Israellandau@cs.haifa.ac.il

Harry LangJohns Hopkins University, Baltimore, UnitedStateshlang8@math.jhu.edu

Sławomir LasotaUniversity of Warsawsl@mimuw.edu.plhttps://orcid.org/0000-0001-8674-4470

Ranko LazićUniversity of Warwick, Coventry, UKR.S.Lazic@warwick.ac.uk

Christoph LenzenMax Planck Institute for Informatics,Saarbrücken, Germanyclenzen@mpi-inf.mpg.de

Jérôme LerouxUniv.Bordeaux, CNRS, Bordeaux-INP,Talence, Francejerome.leroux@labri.fr

Reut LeviWeizmann Institute of Science, Rehovot,Israelreut.levi@weizmann.ac.ilhttps://orcid.org/0000-0003-3167-1766

Asaf LevinTechnion - Israel Institute of Technology,Haifa, Israellevinas@ie.technion.ac.il

Bo LiDepartment of Computer Science, StonyBrook University, Stony Brook, NY 11794,USAboli2@cs.stonybrook.edu

Jason LiCarnegie Mellon University

Jian LiInstitute for Interdisciplinary InformationSciences, Tsinghua University, Beijng, ChinaCorrespondingauthorlijian83@mail.tsinghua.edu.cn

Yingkai LiDepartment of Computer Science, StonyBrook University, Stony Brook, NY 11794,USAyingkli@cs.stonybrook.edu

Vahid LiaghatFacebook, Building 25, 190 Jefferson Dr,Menlo Park, CA 94025, USA

Nutan LimayeDepartment of CSE, IIT Bombay, Mumbai,Indianutan@cse.iitb.ac.in

Sixue LiuDepartment of Computer Science, PrincetonUniversity , 35 Olden Street, Princeton, NJ08540, USAsixuel@cs.princeton.edu

ICALP 2018

107:xxxviiiAuthors

Yang P. LiuMIT, Cambridge, MAyangpatil@gmail.com

Markus LohreyUniversität Siegen, Germanylohrey@eti.uni-siegen.de

Daniel LokshtanovDepartment of Informatics, University ofBergen, Norwaydaniello@uib.no

Anand LouisIndian Institute of Science, Bangalore, Indiaanandl@iisc.ac.in

Shachar LovettDepartment of Computer Science andEngineering, University of California, SanDiegoslovett@cs.ucsd.eduhttps://orcid.org/0000-0003-4552-1443

Pinyan LuInstitute for Theoretical Computer Science,Shanghai University of Finance andEconomics, Shanghai 200433, Chinalu.pinyan@mail.shufe.edu.cn

Anna LubiwSchool of Computer Science, University ofWaterloo, Canadaalubiw@uwaterloo.ca

Anna LysyanskayaComputer Science Department, BrownUniversity, Providence, RI 02912 USAanna@cs.brown.edu

Kaifeng LyuInstitute for Interdisciplinary InformationSciences, Tsinghua University, Beijing, Chinalkf15@mails.tsinghua.edu.cn

Vivek MadanDepartment of Computer Science, Universityof Illinois, Urbana-Champaignvmadan2@illinois.edu

Sepideh MahabadiData Science Institute, Columbia University,New York, NY, USAmahabadi@mit.edu

Frederik Mallmann-TrennCSAIL, MIT, USmallmann@mit.edu

Nil MamanoUniversity of California, Irvine, U.Snmamano@uci.edu

Florin ManeaDepartment of Computer Science, KielUniversity, D-24098 Kiel, Germanyflm@zs.uni-kiel.de

Pasin ManurangsiUniversity of California, Berkeley, USApasin@berkeley.edu

Yuchen MaoDepartment of Computer Science andEngineering, HKUST, Hong Kongymaoad@cse.ust.hkhttps://orcid.org/0000-0002-1075-344X

Liran MarkinUniversity of Haifa, Israelliran.markin@gmail.com

Filip MazowieckiUniversité de Bordeaux, Bordeaux, Francefilip.mazowiecki@u-bordeaux.fr

Saeed MehrabiSchool of Computer Science, CarletonUniversity, Ottawa, Canadasaeed.mehrabi@carleton.ca

Ruta MehtaUniversity of Illinois Urbana-Champaign,Champaign, USArutameht@illinois.edu

George B. MertziosDepartment of Computer Science, DurhamUniversity, UKGeorge.Mertzios@durham.ac.ukhttps://orcid.org/0000-0001-7182-585X

Daniele MicciancoDepartment of Computer Science andEngineering, University of California - SanDiego, CA, USAdaniele@cs.ucsd.edu

Authors 107:xxxix

Vahab MirrokniGoogle Research, New York

Pradipta MitraGoogle Research, New York, USAppmitra@gmail.com

Matthias MnichUniversität Bonn, Germany , and MaastrichtUniversity, The Netherlandsmmnich@uni-bonn.dehttps://orcid.org/0000-0002-4721-5354

Sidhanth MohantyComputer Science Department, CarnegieMellon University, Pittsburgh, PA, USAsidhanth@cmu.edu

Marco MolinaroPUC-Rio, Rio de Janeiro, Brazilmmolinaro@inf.puc-rio.br

Fabrizio MontecchianiDepartment of Engineering, University ofPerugia, Perugia, Italyfabrizio.montecchiani@unipg.it

Felix Montenegro-RetanaHasso Plattner Institute, University ofPotsdam, Potsdam, Germanyfelix.montenegro-retana@student.hpi.de

Shay MoranInstitute for Advanced Study, Princetonshaymoran@ias.eduhttps://orcid.org/0000-0002-8662-2737

Pat MorinSchool of Computer Science, CarletonUniversity, Ottawa, Canadamorin@scs.carleton.ca

Hagar MosaadDepartment of Computer Science andEngineering, German University in Cairo,Egypthagar.omar@student.guc.edu.eg

Luca MoscardelliDepartment of Economic Studies, Universityof Chieti-Pescara, Pescara, Italyluca.moscardelli@unich.it

Miguel A. MosteiroComputer Science Department, PaceUniversity, New York, NY, USAmmosteiro@pace.edu

Anish MukherjeeChennai Mathematical Institute, Chennai,Indiaanish@cmi.ac.in

Cameron MuscoCSAIL, MIT, UScnmusco@mit.edu

Christopher MuscoCSAIL, MIT, UScpmusco@mit.edu

Torsten MützeInstitut für Mathematik, TechnischeUniversität Berlin, Germanymuetze@math.tu-berlin.de

Hiroshi NagamochiDepartment of Applied Mathematics andPhysics, Graduate School of Informatics,Kyoto University, Japannag@amp.i.kyoto-u.ac.jp

Vasileios NakosHarvard University, Cambridge, USAvasileiosnakos@g.harvard.edu

Maryam NegahbaniDepartment of Computer Science,Dartmouth College, 9 Maynard St, Hanover,NH, USAmaryam@cs.dartmouth.edu

Yakov NekrichCheriton School of Computer Science,University of Waterloo, Canadayakov.nekrich@googlemail.com

Daniel NeuenRWTH Aachen University, Aachen, Germanyneuen@informatik.rwth-aachen.de

Jaroslav NešetřilComputer Science Institute, CharlesUniversity, Prague, Czech Republicnesetril@iuuk.mff.cuni.cz

ICALP 2018

107:xl Authors

Rachit NimavatToyota Technological Institute at Chicago,6045 S. Kenwood Ave., Chicago, Illinois60637, USAnimavat@ttic.edu

Chinmay NirkheElectrical Engineering and ComputerSciences, University of California, Berkeley ,387 Soda Hall Berkeley, CA 94720, U.S.Anirkhe@cs.berkeley.edu

Reino NiskanenDepartment of Computer Science, Universityof Liverpool, UKr.niskanen@liverpool.ac.uk

Dirk NowotkaDepartment of Computer Science, KielUniversity, D-24098 Kiel, Germanydn@zs.uni-kiel.de

Marc NoyUniversitat Politècnica de Catalunya,Barcelona, marc.noy@upc.edu

Krzysztof OnakIBM Research, TJ Watson Research Center,Yorktown Heights, New York, USA

Shmuel OnnTechnion - Israel Institute of Technology,Haifa, Israelonn@ie.technion.ac.il

Patrice Ossona de MendezCAMS (CNRS, UMR 8557), Paris, France

Rafail OstrovskyDepartment of Computer Science, Universityof California Los Angeles, USArafail@cs.ucla.edu

Joël OuaknineMax Planck Institute for Software Systems,Germany & , Department of ComputerScience, Oxford University, UKjoel@mpi-sws.org

Sang-il OumDepartment of Mathematical Sciences,KAIST, Daejeon, Koreasangil@kaist.edu

Katarzyna PaluchWroclaw University, Polandabraka@cs.uni.wroc.plhttps://orcid.org/0000-0002-7504-6340

Fahad PanolanDepartment of Informatics, University ofBergen, NorwayFahad.Panolan@uib.nohttps://orcid.org/0000-0001-6213-8687

Charles PapermanUniversité de Lille

Merav ParterWeizmann IS, Rehovot, Israelmerav.parter@weizmann.ac.il

Sarvar PatelGoogle LLC, Mountain View, USAsarvar@google.com

Boaz Patt-ShamirTel Aviv University, Tel Aviv, Israelboaz@tau.ac.il

John PeeblesCSAIL,MIT, Cambridge, MA, USAjpeebles@mit.edu

Giuseppe PersianoGoogle LLC, Mountain View, USA andUniversità di Salerno, Salerno, Italygiuper@gmail.com

Michał PilipczukUniversity of Warsaw, Warsaw, Poland

Thomas PlaceLaBRI, University of Bordeaux and IUF,France

Ely PoratBar Ilan University, Ramat Gan, Israelporately@cs.biu.ac.il

Igor PotapovDepartment of Computer Science, Universityof Liverpool, UKpotapov@liverpool.ac.uk

Manoj PrabhakaranIndian Institute of Technology Bombaymp@cse.iitb.ac.in

Authors 107:xli

Eric PriceUT Austin, Austin, TX, USAecprice@cs.utexas.edu

Gabriele PuppisCNRS, LaBRI, Université de Bordeaux

Guillermo A. PérezUniversité libre de Bruxelles, Brussels,Belgiumgperezme@ulb.ac.behttps://orcid.org/0000-0002-1200-4952

Yuval RabaniThe Rachel and Selim Benin School ofComputer Science and Engineering, TheHebrew University of Jerusalem, Israelyrabani@cs.huji.ac.il

Saladi RahulDept. of Computer Science, University ofIllinois at Urbana-Champaign, USAsaladi@uiuc.edu

M. S. RamanujanAlgorithms and Complexity Group, TUWien, Austriaramanujan@ac.tuwien.ac.at

M. S. RamanujanUniversity of Warwick, United KingdomR.Maadapuzhi-Sridharan@warwick.ac.uk

Sofya RaskhodnikovaBoston University, Boston, USAsofya@bu.edu

Mikhail RaskinLaBRI, University of Bordeaux, 351, coursde la Libération F-33405 Talence cedex,Franceraskin@mccme.ruhttps://orcid.org/0000-0002-6660-5673

Gaurav RattanRWTH Aachen University, Aachen, Germanygrohe@informatik.rwth-aachen.dehttps://orcid.org/0000-0002-5095-860X

Alexander RavskyPidstryhach Institute for Applied Problemsof Mechanics and Mathematics, NationalAcademy of Science of Ukraine, Lviv,Ukraineoravsky@mail.ru

Felix ReidlRoyal Holloway, University of London,TW20 0EX, UKFelix.Reidl@rhul.ac.uk

Hanlin RenInstitute for Interdisciplinary InformationSciences, Tsinghua University, Chinarhl16@mails.tsinghua.edu.cn

Michael RiabzevTechnion - Israel Institute of Technology,Haifa, Israelriabzevmichael@gmail.com

Sören RiechersPaderborn University, Paderborn, Germany

Andrei RomashchenkoLIRMM, Univ Montpellier, CNRS,Montpellier, France; on leave from IITP RASandrei.romashchenko@lirmm.fr

Eyal RonenComputer Science Department, TheWeizmann Institute, Rehovot, Israeleyal.ronen@weizmann.ac.il

Eva RotenbergTechnical University of Denmark, Lyngby,Denmarkerot@dtu.dkhttps://orcid.org/0000-0001-5853-7909

Ron D. RothblumMIT and Northeastern University,Cambridge, MAronr@mit.edu

Tim RoughgardenDepartment of Computer Science, StanfordUniversity, Stanford, CA 94305, USA

Daniel M. RoyUniv. Toronto

ICALP 2018

107:xlii Authors

Clemens RösnerDepartment of Theoretical ComputerScience, University of Bonn, Germanyroesner@cs.uni-bonn.de

Aleksi SaarelaDepartment of Mathematics and Statistics,University of Turku, 20014 Turku, Finlandamsaar@utu.fihttps://orcid.org/0000-0002-6636-2317

Manuel SabinComputer Science Division, University ofCalifornia Berkeley, Berkeley, CA, USAmsabin@berkeley.edu

Eden SaigDepartment of Computer Science, Technion,Haifa, Israeledens@cs.technion.ac.ilhttps://orcid.org/0000-0002-0810-2218

Laura SanitàDepartment of Combinatorics andOptimization, University of Waterloo,Waterloo, Canadalsanita@uwaterloo.ca

Piotr SankowskiInstitute of Informatics, University ofWarsawsank@mimuw.edu.pl

Diego Nava SaucedoUniversité de Lorraine, CNRS, Inria, LORIA,F-54000 Nancy, Francediego.nava-saucedo@wanadoo.fr

Saket SaurabhInstitute of Mathematical Sciences, HBNI,India and UMI ReLaxsaket@imsc.res.in

Rahul SavaniUniversity of Liverpool, UKrahul.savani@liverpool.ac.uk

Joe SawadaSchool of Computer Science, University ofGuelph, Canadajsawada@uoguelph.ca

Nitin SaxenaDepartment of Computer Science, IITKanpur, Indianitin@cse.iitk.ac.in

Marco ScarsiniDipartimento di Economia e Finanza, LUISS,Viale Romania 32, 00197 Roma, Italymarco.scarsini@luiss.ithttps://orcid.org/0000-0001-6473-794X

Baruch SchieberIBM Research, TJ Watson Research Center,Yorktown Heights, New York, USA

Andreas SchmidMax Planck Institute for Informatics,Saarbrücken, Germanyaschmid@mpi-inf.mpg.de

Stefan SchmidUniversity of Vienna, Austriastefan_schmid@univie.ac.at

Jens M. SchmidtTechnische Universität Ilmenau, Ilmenau,Germanyjens.schmidt@tu-ilmenau.de

Melanie SchmidtDepartment of Theoretical ComputerScience, University of Bonn, Germanymelanieschmidt@uni-bonn.de

Alexander A. SchwarzmannUniversity of Connecticut, Storrs CT, USAass@uconn.edu

Nicole SchweikardtHumboldt-Universität zu Berlin, Germanyschweikn@informatik.hu-berlin.de

Pascal SchweitzerTechnische Universität Kaiserslautern,Kaiserslautern, Germanyschweitzer@cs.uni-kl.de

Saeed SeddighinUniversity of Maryland, College Park, MD20742, USA

C. SeshadhriDepartment of Computer Science, Universityof California, Santa Cruz, CA 95064, USA

Authors 107:xliii

Amirbehshad ShahrasbiCarnegie Mellon University, Pittsburgh, PA,USAshahrasbi@cs.cmu.edu

Jeffrey ShallitSchool of Computer Science, University ofWaterloo, Canadashallit@cs.uwaterloo.ca

Adi ShamirComputer Science Department, TheWeizmann Institute, Rehovot, Israeladi.shamir@weizmann.ac.il

Micha SharirSchool of Computer Science, Tel AvivUniversity, Tel Aviv 69978, Israelmichas@tau.ac.il

Roohani SharmaInstitute of Mathematical Sciences, HBNI,India and UMI ReLaxroohani@imsc.res.in

Xiaofei ShiCarnegie Mellon University, Pittsburgh, USAxiaofeis@andrew.cmu.edu

Philip ShilaneDell EMC, Newtown, PA, USAshilane@dell.com

Mahsa ShirmohammadiCNRS & LIS, Francemahsa.shirmohammadi@lis-lab.fr

Sebastian SiebertzUniversity of Warsaw, Warsaw, Poland

Alexandra SilvaUniversity College London, London, UK

Luis Fernando Schultz Xavier da SilveiraSchool of Computer Science and ElectricalEngineering, University of Ottawa, Ottawa,Canadaschultz@ime.usp.br

Aditi SinghIIT Gandhinagar, Gandhinagar, Indiaaditi.singh@iitgn.ac.in

Ali Kemal SinopTOBB University of Economics andTechnology, Ankara, Turkeyasinop@gmail.com

Piotr SkowronUniversity of Warsaw, Warsaw, Polandp.skowron@mimuw.edu.pl

Michał SkrzypczakUniversity of Warsaw, Banacha 2, 02-097Warsaw, Polandmskrzypczak@mimuw.edu.plhttps://orcid.org/0000-0002-9647-4993

Veronika SlívováComputer Science Institute, CharlesUniversity, Prague, Czech Republicslivova@iuuk.mff.cuni.cz

Shay SolomonIBM Research, T. J. Watson ResearchCenter, Yorktown Heights, New York, USA

Tasuku SomaThe University of Tokyo, Tokyo, Japantasuku_soma@mist.i.u-tokyo.ac.jphttps://orcid.org/0000-0001-9519-2487

Manuel SorgeBen-Gurion University of the Negev, BeerSheva, Israelsorge@post.bgu.ac.il

Krzysztof SornatUniversity of Wrocław, Wrocław, Polandkrzysztof.sornat@cs.uni.wroc.pl

Jessica SorrellDepartment of Computer Science andEngineering, University of California, SanDiego, CA, USAjlsorrel@cs.ucsd.edu

Paul G. SpirakisDepartment of Computer Science, Universityof Liverpool, UK, Department of ComputerEngineering & Informatics, University ofPatras, GreeceP.Spirakis@liverpool.ac.ukhttps://orcid.org/0000-0001-5396-3749

ICALP 2018

107:xliv Authors

Joachim SpoerhaseLehrstuhl für Informatik I, UniversitätWürzburg, Germany and Institute ofComputer Science, University of Wrocław,Polandjoachim.spoerhase@uni-wuerzburghttps://orcid.org/0000-0002-2601-6452

Srikanth SrinivasanDepartment of Mathematics, IIT Bombay,Mumbai, Indiasrikanth@math.iitb.ac.in

Sam StatonDepartment of Computer Science, Universityof Oxford, Oxford OX1 3QD UKsam.staton@cs.ox.ac.uk

Cliff SteinColumbia University, New York, USA

Dario SteinUniv. Oxford

Damian StraszakÉcole Polytechnique Fédérale de Lausanne(EPFL), Switzerland

Don M. StullUniversité de Lorraine, CNRS, Inria, LORIA,F-54000 Nancy, Francedonald.stull@inria.fr

Madhu SudanHarvard University, Cambridge, MA, USAmadhu@cs.harvard.edu

Wing-Kin SungNational University of Singapore, Singaporeksung@comp.nus.edu.sg

Manuel SurekUniversität Augsburg, Institut fürMathematik, Augsburg, Germanymanuel.surek@math.uni-augsburg.de

Ola SvenssonÉcole Polytechnique Fédérale de Lausanne,Lausanne, Switzerlandola.svensson@epfl.ch

Mani SwaminathanDepartment of Computing Science,University of Oldenburg, Germanymani.swaminathan@informatik.uni-oldenburg.de

Chaitanya SwamyDept. of Combinatorics and Optimization,Univ. Waterloo, Waterloo, ON N2L 3G1,Canadacswamy@uwaterloo.ca

Géraud SénizerguesLABRI, Bordeaux, Francegeraud.senizergues@u-bordeaux.fr

Zhihao Gavin TangDepartment of Computer Sicence, TheUniversity of Hong Kong, Hong Kongzhtang@cs.hku.hk

Marianne ThieffryHasso Plattner Institute, University ofPotsdam, Potsdam, Germanymarianne.thieffry@student.hpi.de

Thomas ThieraufAalen University, Germany

Mikkel ThorupBARC, University of Copenhagen,Universitetsparken 1, Copenhagen, Denmarkmikkel2thorup@gmail.comhttps://orcid.org/0000-0001-5237-1709

Tigran TonoyanSchool of Computer Science, ReykjavikUniversity, Icelandttonoyan@gmail.com

Szymon ToruńczykUniversity of Warsaw, Warsaw, Poland

Konstantinos TsakalidisDept. of Computer and Information Science,Tandon School of Engineering, New YorkUniversity, USAkt79@nyu.edu

Eli UpfalComputer Science Department, BrownUniversity, Providence, RI 02912 USAeli@cs.brown.edu

Authors 107:xlv

Przemysław UznańskiDepartment of Computer Science, ETHZürich, Switzerlandprzemyslaw.uznanski@inf.ethz.ch

Pascal VanierLaboratoire d’Algorithmique, Complexité etLogique, Université Paris-Est Créteil, Francepascal.vanier@lacl.fr

Gal VardiSchool of Computer Science and Engineering,The Hebrew University, Israel

Shai VardiCalifornia Institute of Technology, Pasadena,CA, USAsvardi@caltech.edu

Nithin VarmaBoston University, Boston, USAnvarma@bu.edu

Yadu VasudevIndian Institute of Technology Madras,Chennai, Indiayadu@cse.iitm.ac.inhttps://orcid.org/0000-0001-7918-7194

Umesh VaziraniElectrical Engineering and ComputerSciences, University of California, Berkeley ,387 Soda Hall Berkeley, CA 94720, U.S.Avazirani@cs.berkeley.edu

Rakesh VenkatHebrew University of Jerusalem, Israelrakesh@cs.huji.ac.il

Suresh VenkatasubramanianSchool of Computing, University of Utah,USAsuresh@cs.utah.edu

Cosimo VinciDepartment of Information EngineeringComputer Science and Mathematics,University of L’Aquila, L’Aquila, Italy -Gran Sasso Science Institute, L’Aquila, Italycosimo.vinci@univaq.it

Emanuele ViolaNortheastern Universityviola@ccs.neu.edu

Nisheeth K. VishnoiÉcole Polytechnique Fédérale de Lausanne(EPFL), Switzerland

Ellen VitercikCarnegie Mellon University, Pittsburgh, PA,USAvitercik@cs.cmu.edu

Nils VortmeierTU Dortmund University, Dortmund,Germanynils.vortmeier@tu-dortmund.de

Magnus WahlströmRoyal Holloway, University of London,TW20 0EX, UKMagnus.Wahlstrom@rhul.ac.uk

David WajcCarnegie Mellon University, Pittsburgh, USA

Stefan WalzerTechnische Universität Ilmenau, Germanystefan.walzer@tu-ilmenau.dehttps://orcid.org/0000-0002-6477-0106

Fan WeiDepartment of Mathematics, StanfordUniversity, Stanford, CA 94305, USA

Oren WeimannUniversity of Haifa, Israeloren@cs.haifa.ac.il

Nicole WeinEECS, Massachusetts Institute ofTechnology, Cambridge, MA 02139, USA

Armin WeißUniversität Stuttgart, FMI, Germanyarmin.weiss@fmi.uni-stuttgart.de

Daniel WiebkingRWTH Aachen University, Aachen, Germanywiebking@informatik.rwth-aachen.de

Sebastian WiederrechtTU Berlin, Germanysebastian.wiederrecht@tu-berlin.de

ICALP 2018

107:xlvi Authors

Kaja WilleInstitut für Mathematik, TechnischeUniversität Berlin, Germanywille@math.tu-berlin.de

Richard Ryan WilliamsMIT EECS and CSAIL, 32 Vassar St,Cambridge, MA 02139 USArrw@mit.eduhttps://orcid.org/0000-0003-2326-2233

Sarah WinterRWTH Aachen University, Germanywinter@cs.rwth-aachen.de

Felix WolfTechnische Universität Darmstadt, InstituteTEMF, Graduate School of ExcellenceComputational Engineeringwolf@gsc.tu-darmstadt.de

David P. WoodruffCarnegie Mellon University, School ofComputing, Pittsburg, USAdwoodruf@cs.cmu.edu

James WorrellUniversity of Oxford, Oxford, UKJames.Worrell@cs.ox.ac.ukhttps://orcid.org/0000-0001-8151-2443

Xiaowei WuDepartment of Computing, The Hong KongPolytechnic University, Hong Kongwxw0711@gmail.com

Maximilian WötzelBGSMath and UPC Barcelona, Barcelona,Spainmaximilian.wotzel@upc.eduhttps://orcid.org/0000-0001-7591-0998

Mingyu XiaoSchool of Computer Science and Engineering,University of Electronic Science andTechnology of China, Chengdu, Chinamyxiao@gmail.comhttps://orcid.org/0000-0002-1012-2373

Yuanhang XieInstitute for Interdisciplinary InformationSciences, Tsinghua University, Beijing, Chinaxieyh15@mails.tsinghua.edu.cn

Pan XuDepartment of Computer Science, Universityof Maryland, College Park, USApanxu@cs.umd.edu

Hongseok YangKAIST

Lin F. YangPrinceton University, Princeton, UnitedStateslin.yang@princeton.edu

Harel YedidsionBen-Gurion University of the Negev, BeerSheva, Israelyedidsio@post.bgu.ac.il

Kevin YeoGoogle LLC, Mountain View, USAkwlyeo@google.com

Yuichi YoshidaNational Institute of Informatics, PreferredInfrastructure, Tokyo, Japanyyoshida@nii.ac.jphttps://orcid.org/0000-0001-8919-8479

Arman YousefiDepartment of Computer Science, Universityof California Los Angeles, USAarmany@cs.ucla.edu

Ching-Hua YuUniversity of Illinois at Urbana-Champaigncyu17@illinois.edu

Henry YuenElectrical Engineering and ComputerSciences, University of California, Berkeley ,387 Soda Hall Berkeley, CA 94720, U.S.Ahyuen@cs.berkeley.edu

Viktor ZamaraevDepartment of Computer Science, DurhamUniversity, UKViktor.Zamaraev@durham.ac.ukhttps://orcid.org/0000-0001-5755-4141

Meirav ZehaviDepartment of Computer Science,Ben-Gurion University, Israelmeiravze@bgu.ac.il

Authors 107:xlvii

Marc ZeitounLaBRI, University of Bordeaux, France

Georg ZetzscheIRIF (Université Paris-Diderot & CNRS),Francehttps://orcid.org/0000-0002-6421-4388

Thomas ZeumeTU Dortmund University, Dortmund,Germanythomas.zeume@tu-dortmund.de

Hongyang ZhangCarnegie Mellon University, Pittsburgh, USAhongyanz@cs.cmu.edu

Le ZhangInstitute for Interdisciplinary InformationSciences, Tsinghua University, Beijing, Chinale-zhang12@mails.tsinghua.edu.cn

Yuhao ZhangDepartment of Computer Sicence, TheUniversity of Hong Kong, Hong Kongyhzhang2@cs.hku.hk

Zeyu ZhangJohns Hopkins University, Baltimore, MD,USAzyzhang92@gmail.com

Samson ZhouDepartment of Computer Science, PurdueUniversity, West Lafayette, Indiana, USAsamsonzhou@gmail.com

Marius ZimandDepartment of Computer and InformationSciences, Towson University, Baltimore, MD

ICALP 2018

45thInternationalColloquiumon Automata,Languages,and ... › ... › LIPIcs-ICALP-2018-0.pdf ·...

Documents

Transcript of 45thInternationalColloquiumon Automata,Languages,and ... › ... › LIPIcs-ICALP-2018-0.pdf ·...

Automata & languages

Automata. Summary Deterministic Automata Languages Stochastic Automata Other Automata Formalisms Automata with input and output Protocol Representation.

Automata theory and formal languages

March 13,2018

BBM401 Automata Theory and Formal Languages › ... › lec01-introductionToAutomataTh… · BBM401 Automata Theory and Formal Languages 1 BBM401 Automata Theory and Formal Languages.

Chapter 1 Automata 2 - ETH Z · Overview • Motivation • State Machines • Alphabets and Strings • Finite Automata • Languages, Regular Languages • Designing Finite Automata

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITYlblum/flac/Lectures_pdf/Lecture1.pdf · FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY . 15-453 . FORMAL LANGUAGES, ... Office Hours . Lenore

Chapter 2 Languages and Automata

Finite Automata - Informatics 2A: Lecture 3 · Languages and Automata Some formal de nitions Determinization 1 Languages and Automata What is a ‘language’? Finite automata: recap

CSC 473 Automata, Grammars & Languages 9/29/10 · CSC 473 Automata, Grammars & Languages 9/29/10 Lecture 03 1 C SC 473 Automata, Grammars & Languages Automata, Grammars and Languages

Languages and Finite Automata

C SC 473 Automata, Grammars & Languages Automata, Grammars and Languages Discourse 01 Introduction.

COMP209 Automata and Formal Languages Section 1 Introductioncgi.csc.liv.ac.uk/~ped/teachadmin/COMP209/Automata-and-Comput… · COMP209 Automata and Formal Languages Section 1 Introduction.

C SC 473 Automata, Grammars & Languages Automata, Grammars and Languages Discourse 04 Context-Free Grammars and Pushdown Automata.

Topics Automata Theory Grammars and Languages Complexities Formal Languages and Automata Theory1.

Automata and Formal Languages - IDC · Automata and Formal Languages ... Introduction, basic tools, ... • Formal languages – Regular languages – Context free languages. 6

Languages Automata (Slides)

Theory of Automata Formal Languages

Automata, Grammars and Languages

Automata, Grammars and Languages - University of Arizona · CSC 473 Automata, Grammars & Languages 10/7/10 1 C SC 473 Automata, Grammars & Languages Automata, Grammars and Languages