Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings PDF
Preview Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
Leszek Antoni Gąsieniec Jesper Jansson Christos Levcopoulos (Eds.) S S o C R A 1 5 6 Fundamentals 1 1 S C of Computation Theory N L 22nd International Symposium, FCT 2019 Copenhagen, Denmark, August 12–14, 2019 Proceedings 123 Lecture Notes in Computer Science 11651 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board Members David Hutchison, UK Takeo Kanade, USA Josef Kittler, UK Jon M. Kleinberg, USA Friedemann Mattern, Switzerland John C. Mitchell, USA Moni Naor, Israel C. Pandu Rangan, India Bernhard Steffen, Germany Demetri Terzopoulos, USA Doug Tygar, USA Advanced Research in Computing and Software Science Subline of Lecture Notes in Computer Science Subline Series Editors Giorgio Ausiello, University of Rome ‘La Sapienza’, Italy Vladimiro Sassone, University of Southampton, UK Subline Advisory Board Susanne Albers, TU Munich, Germany Benjamin C. Pierce, University of Pennsylvania, USA Bernhard Steffen, University of Dortmund, Germany Deng Xiaotie, Peking University, Beijing, China Jeannette M. Wing, Microsoft Research, Redmond, WA, USA More information about this series at http://www.springer.com/series/7407 ą Leszek Antoni G sieniec (cid:129) Jesper Jansson (cid:129) Christos Levcopoulos (Eds.) Fundamentals of Computation Theory 22nd International Symposium, FCT 2019 – Copenhagen, Denmark, August 12 14, 2019 Proceedings 123 Editors Leszek AntoniGąsieniec Jesper Jansson University of Liverpool Hong KongPolytechnic University Liverpool, UK Hong Kong,China Christos Levcopoulos LundUniversity Lund,Sweden ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-030-25026-3 ISBN978-3-030-25027-0 (eBook) https://doi.org/10.1007/978-3-030-25027-0 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerNatureSwitzerlandAG2019 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface This volume contains the papers presented at the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019), held in Copenhagen, Denmark, during August 12–14, 2019. FCTisabiennialconferencethatcirculatesbetweenvariousEuropeancountrieson aregularbasis.ThefirstFCTconferencetookplaceinPoznan-Kórnik,Polandin1977, and the most recent ones in Liverpool, UK (FCT 2013), Gdańsk, Poland (FCT 2015), and Bordeaux, France (FCT 2017). FCT focuses on theoretical computer science; in particular, algorithms, complexity, and formal methods. FCT2019received45submissions.Eachsubmissionwasreviewedbyatleastthree Program Committee members, in many cases with the assistance of external expert reviewers. After a thorough review process followed by a discussion phase, 21 of the submitted papers were accepted for presentation at the conference. InvitedtalksweregivenatFCT2019byLiborBarto(CharlesUniversity),Bernard Chazelle (Princeton University), Kousha Etessami (University of Edinburgh), and Torben Hagerup (Universityof Augsburg).The papers describing theinvited talksare included in these proceedings. The Program Committee selected the following paper for the best paper award, as well as the best student paper award: (cid:129) BireswarDas,ShivduttSharma,andP.R.Vaidyanathan:“SuccinctRepresentation of Finite Groups” Tobeeligibleforthebeststudentpaperaward,atleastoneoftheauthorshadtobea full-timestudentatthetimeofthesubmission,andthestudent(s)wererequiredtohave made a significant contribution to the paper. We would like to thank the FCT Steering Committee, the FCT 2019 Organizing Committee, the invited speakers, all authors who submitted their work, the FCT 2019 Program Committee members, and the external reviewers. We also thank Jyrki Katajainen for all his help with practical matters when, due to unforeseen circum- stances, he became unable to act as the Program Committee chair and Organizing Committee chair, and we were asked by the Steering Committee to step in. Further- more, we would like to thank Springer for publishing the proceedings, and the Easy- Chair conference management system for simplifying the entire process of reviewing the submitted papers and generating the proceedings. Finally, we acknowledge the support of the Department of Computer Science at the University of Copenhagen (DIKU) and the European Association for Theoretical Computer Science (EATCS). August 2019 Leszek Gąsieniec Jesper Jansson Christos Levcopoulos Organization Steering Committee Bogdan Chlebus University of Colorado, USA Marek Karpinski (Chair) University of Bonn, Germany Andrzej Lingas Lund University, Sweden Miklos Santha CNRS and Paris Diderot University, France Eli Upfal Brown University, USA Program Committee Marthe Bonamy CNRS, LaBRI, University of Bordeaux, France Irene Finocchi Sapienza University of Rome, Italy LeszekGąsieniec(Co-chair) University of Liverpool, UK William Harris Galois Inc., USA Mika Hirvensalo University of Turku, Finland Štěpán Holub Charles University, Czech Republic Jesper Jansson (Co-chair) The Hong Kong Polytechnic University, SAR China Jyrki Katajainen University of Copenhagen, Denmark (Original chair) Ralf Klasing CNRS, LaBRI, University of Bordeaux, France Rastislav Kralovic Comenius University, Bratislava, Slovakia Stefan Kratsch University of Bonn, Germany Erik Jan van Leeuwen Utrecht University, The Netherlands Christos Levcopoulos Lund University, Sweden (Co-chair) Florin Manea Kiel University, Germany Toby Murray University of Melbourne, Australia Aris Pagourtzis National Technical University of Athens, Greece Nitin Saxena Indian Institute of Technology, Kanpur, India Jeffrey Shallit University of Waterloo, Canada Jesper Larsson Träff TU Wien (Vienna University of Technology), Austria Peter Widmayer ETH Zurich, Switzerland Organizing Committee Thomas Hildebrandt(Chair) University of Copenhagen, Denmark Nanna Højholt University of Copenhagen, Denmark Jyrki Katajainen University of Copenhagen, Denmark (Original chair) viii Organization Additional Reviewers Andronikos, Theodore Mampentzidis, Konstantinos Arseneva, Elena Mann, Stephen Aspnes, James Mayordomo, Elvira Balaji, Nikhil Meer, Klaus Casel, Katrin Miyauchi, Atsushi Chatterjee, Prerona Muskalla, Sebastian Chau, Vincent Nagao, Atsuki Chlebus, Bogdan Nakanishi, Masaki Choi, Jee Niskanen, Reino Cunial, Fabio Ochem, Pascal Czumaj, Artur Papaspyrou, Nikolaos Damaschke, Peter Pilipczuk, Marcin Das, Bireswar Pinna, G. Michele De, Minati Pitassi, Toniann Delbot, François Robinson, Peter Escobar, Santiago Ruzicka, Pavel Foucaud, Florent Saarela, Aleksi Ganian, Robert Sakavalas, Dimitris Gawrychowski, Pawel Smith, Shaden Goto, Keisuke Snoeyink, Jack Heinrich, Marc Sommer, Frank Himmel, Anne-Sophie Srivastav, Abhinav Kim, Hyunjin Suderland, Martin Kociumaka, Tomasz T. P., Sandhya Lauria, Massimo Thapen, Neil Lingas, Andrzej Thierauf, Thomas Lucarelli, Giorgio Villagra, Marcos Mahajan, Meena Yamakami, Tomoyuki Algorithms for Some Classes of Infinite-State MDPs and Stochastic Games (Abstract of Invited Talk) Kousha Etessami Schoolof Informatics, University of Edinburgh,Edinburgh,UK [email protected] Abstract.Iwillsurveyabodyofworkdevelopedoverthepast15yearsorso, on algorithms for, and the computational complexity of, analyzing and model checking some important families of countably infinite state Markov chains, Markovdecisionprocesses(MDPs),andstochasticgames.Iwillalsohighlight someoftheopenquestionsremaininginthisarea,includingsomealgorithmic questions regarding arithmetic circuits. Contents Invited Papers Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps. . . 3 Libor Barto Some Observations on Dynamic Random Walks and Network Renormalization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Bernard Chazelle Highly Succinct Dynamic Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . 29 Torben Hagerup Formal Methods Winning Strategies for Streaming Rewriting Games. . . . . . . . . . . . . . . . . . . 49 Christian Coester, Thomas Schwentick, and Martin Schuster NominalSyntaxwithAtomSubstitutions:Matching,Unification,Rewriting... 64 Jesús Domínguez and Maribel Fernández Two Characterizations of Finite-State Dimension . . . . . . . . . . . . . . . . . . . . 80 Alexander Kozachinskiy and Alexander Shen Largest Common Prefix of a Regular Tree Language. . . . . . . . . . . . . . . . . . 95 Markus Lohrey and Sebastian Maneth Complexity On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111 Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky Deterministic Preparation of Dicke States. . . . . . . . . . . . . . . . . . . . . . . . . . 126 Andreas Bärtschi and Stephan Eidenbenz Optimal Channel Utilization with Limited Feedback . . . . . . . . . . . . . . . . . . 140 Gianluca De Marco, Tomasz Jurdziński, and Dariusz R. Kowalski Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 Titus Dose
The list of books you might like
