lecture notes in computer science 9135 - springer978-3-662-47666... · 2017-08-26 · lecture notes...
Post on 31-Jan-2020
0 Views
Preview:
TRANSCRIPT
Lecture Notes in Computer Science 9135
Commenced Publication in 1973Founding and Former Series Editors:Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
David Hutchison, UKJosef Kittler, UKJohn C. Mitchell, USABernhard Steffen, GermanyDemetri Terzopoulos, USAGerhard Weikum, Germany
Takeo Kanade, USAJon M. Kleinberg, USAFriedemann Mattern, SwitzerlandMoni Naor, IsraelC. Pandu Rangan, IndiaDoug 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, City University of Hong Kong
Jeannette M.Wing, Microsoft Research, Redmond, WA, USA
More information about this series at http://www.springer.com/series/7407
Magnús M. Halldórsson • Kazuo IwamaNaoki Kobayashi • Bettina Speckmann (Eds.)
Automata, Languages,and Programming42nd International Colloquium, ICALP 2015Kyoto, Japan, July 6–10, 2015Proceedings, Part II
123
EditorsMagnús M. HalldórssonReykjavik UniversityReykjavikIceland
Kazuo IwamaKyoto UniversityKyotoJapan
Naoki KobayashiThe University of TokyoTokyoJapan
Bettina SpeckmannTechnische Universiteit EindhovenEindhovenThe Netherlands
ISSN 0302-9743 ISSN 1611-3349 (electronic)Lecture Notes in Computer ScienceISBN 978-3-662-47665-9 ISBN 978-3-662-47666-6 (eBook)DOI 10.1007/978-3-662-47666-6
Library of Congress Control Number: 2015941869
LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues
Springer Heidelberg New York Dordrecht London© Springer-Verlag Berlin Heidelberg 2015This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of thematerial 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 informationstorage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology nowknown or hereafter developed.The use of general descriptive names, registered names, trademarks, service marks, etc. in this publicationdoes not imply, even in the absence of a specific statement, that such names are exempt from the relevantprotective laws and regulations and therefore free for general use.The publisher, the authors and the editors are safe to assume that the advice and information in this book arebelieved to be true and accurate at the date of publication. Neither the publisher nor the authors or the editorsgive a warranty, express or implied, with respect to the material contained herein or for any errors oromissions that may have been made.
Printed on acid-free paper
Springer-Verlag GmbH Berlin Heidelberg is part of Springer Science+Business Media(www.springer.com)
Preface
ICALP 2015, the 42nd edition of the International Colloquium on Automata, Lan-guages and Programming, was held in Kyoto, Japan during July 6–10, 2015. ICALP isa series of annual conferences of the European Association for Theoretical ComputerScience (EATCS), which first took place in 1972. This year, the ICALP programconsisted of the established track A (focusing on algorithms, automata, complexity, andgames) and track B (focusing on logic, semantics, and theory of programming), andof the recently introduced track C (focusing on foundations of networking).
In response to the call for papers, the Program Committee received 507 submissions,the highest ever: 327 for track A, 115 for track B, and 65 for track C. Out of these, 143papers were selected for inclusion in the scientific program: 89 papers for Track A, 34for Track B, and 20 for Track C. The selection was made by the Program Committeesbased on originality, quality, and relevance to theoretical computer science. The qualityof the manuscripts was very high indeed, and many deserving papers could not beselected.
The EATCS sponsored awards for both a best paper and a best student paper foreach of the three tracks, selected by the Program Committees. The best paper awardswere given to the following papers:
– Track A: Aaron Bernstein and Clifford Stein. “Fully Dynamic Matching in BipartiteGraphs”
– Track B: Jarkko Kari and Michal Szabados. “An Algebraic Geometric Approach toNivat’s Conjecture”
– Track C: Yiannis Giannakopoulos and Elias Koutsoupias. “Selling Two Goodsoptimally”
The best student paper awards, for papers that are solely authored by students, weregiven to the following papers:
– Track A: Huacheng Yu. “An Improved Combinatorial Algorithm for BooleanMatrix Multiplication”
– Track A: Radu Curticapean. “Block Interpolation: A Framework for Tight Expo-nential-Time Counting Complexity”
– Track B: Georg Zetzsche. “An Approach to Computing Downward Closures”
Track A gave out two student paper awards this year because of the very highquality of the two winning papers.
The conference was co-located with LICS 2015, the 30th ACM/IEEE Symposiumon Logic in Computer Science.
Apart from the contributed talks, ICALP 2015 included invited presentations byKen-ichi Kawarabayashi, Valerie King, Thomas Moscibroda, Anca Muscholl, PeterO’Hearn, of which the latter two were joint with LICS. Additionally, it containedtutorial sessions by Piotr Indyk, Andrew Pitts, and Geoffrey Smith, all joint with LICS,
and a masterclass on games by Ryuhei Uehara. Abstracts of their talks are included inthese proceedings as well. The program of ICALP 2015 also included presentationof the EATCS Award 2015 to Christos Papadimitriou.
This volume of the proceedings contains all contributed papers presented at theconference in Track A. A companion volume contains all contributed papers presentedin Track B and Track C together with the papers and abstracts of the invited speakers.The following workshops were held as satellite events of ICALP/LICS 2015:HOPA 2015 — Workshop on the Verification of Higher-Order ProgramsLCC 2015 — 16th International Workshop on Logic and Computational ComplexityNLCS 2015 — Third Workshop on Natural Language and Computer ScienceLOLA 2015 — Workshop on Syntax and Semantics for Low-Level LanguagesQCC 2015 — Workshop on Quantum Computational ComplexityWRAWN 2015 — 6th Workshop on Realistic Models for Algorithms in Wireless
NetworksYR-ICALP 2015 — Young Researchers Forum on Automata, Languages and
Programming
We wish to thank all authors who submitted extended abstracts for consideration,the Program Committees for their scholarly effort, and all referees who assisted theProgram Committees in the evaluation process.
We thank the sponsors (ERATO Kawarabayashi Large Graph Project; MEXTGrant-in-Aid for Scientific Research on Innovative Areas “Exploring the Limits ofComputation”; Research Institute for Mathematical Sciences, Kyoto University; andTateisi Science and Technology Foundation) for their support.
We are also grateful to all members of the Organizing Committee and to theirsupport staff.
Thanks to Andrei Voronkov and Shai Halevi for writing the conference manage-ment systems EasyChair andWeb-Submission-and-Review software, which were usedin handling the submissions and the electronic Program Committee meeting, as well asin assisting in the assembly of the proceedings.
Last but not least, we would like to thank Luca Aceto, the president of EATCS, forhis generous advice on the organization of the conference.
May 2015 Magnús M. HalldórssonKazuo Iwama
Naoki KobayashiBettina Speckmann
VI Preface
Organization
Program Committee
Track A
Peyman Afshani Aarhus University, DenmarkHee-Kap Ahn POSTECH, South KoreaHans Bodlaender Utrecht University, The NetherlandsKarl Bringmann Max-Planck Institut für Informatik, GermanySergio Cabello University of Ljubljana, SloveniaKen Clarkson IBM Almaden Research Center, USAÉric Colin de Verdière École Normale Supérieure Paris, FranceStefan Dziembowski University of Warsaw, PolandDavid Eppstein University of California at Irvine, USADimitris Fotakis National Technical University of Athens, GreecePaul Goldberg University of Oxford, UKMohammadTaghi
HajiaghayiUniversity of Maryland at College Park, USA
Jesper Jansson Kyoto University, JapanAndrei Krokhin Durham University, UKAsaf Levin Technion, IsraelInge Li Gørtz Technical University of Denmark, DenmarkPinyan Lu Microsoft Research Asia, ChinaFrédéric Magniez Université Paris Diderot, FranceKazuhisa Makino Kyoto University, JapanElvira Mayordomo Universidad de Zaragoza, SpainUlrich Meyer Goethe University Frankfurt am Main, GermanyWolfgang Mulzer Free University Berlin, GermanyViswanath Nagarajan University of Michigan, USAVicky Papadopoulou European University Cyprus, CyprusMichał Pilipczuk University of Bergen, NorwayLiam Roditty Bar-Ilan University, IsraelIgnaz Rutter Karlsruhe Institute of Technology, GermanyRocco Servedio Columbia University, USAJens Schmidt TU Ilmenau, GermanyBettina Speckmann TU Eindhoven, The NetherlandsCsaba D. Tóth California State University Northridge, USATakeaki Uno National Institute of Informatics, JapanErik Jan van Leeuwen Max-Planck Institut für Informatik, GermanyRob van Stee University of Leicester, UKIvan Visconti University of Salerno, Italy
Track B
Andreas Abel Chalmers and Gothenburg University, SwedenAlbert Atserias Universitat Politècnica de Catalunya, SpainChristel Baier TU Dresden, GermanyLars Birkedal Aarhus University, DenmarkLuís Caires Universidade Nova de Lisboa, PortugalJames Cheney University of Edinburgh, UKWei Ngan Chin National University of Singapore, SingaporeUgo Dal Lago University of Bologna, ItalyThomas Ehrhard CNRS and Université Paris Diderot, FranceZoltán Ésik University of Szeged, HungaryXinyu Feng University of Science and Technology of China, ChinaWan Fokkink VU University Amsterdam, The NetherlandsShin-ya Katsumata Kyoto University, JapanNaoki Kobayashi The University of Tokyo, JapanEric Koskinen New York University, USAAntonín Kučera Masaryk University, Czech RepublicOrna Kupferman Hebrew University, IsraelAnnabelle Mclver Macquarie University, AustraliaDale Miller Inria Saclay, FranceMarkus Müller-Olm University of Münster, GermanyAndrzej Murawski University of Warwick, UKJoel Ouaknine University of Oxford, UKPrakash Panangaden McGill University, CanadaPawel Parys University of Warsaw, PolandReinhard Pichler TU Vienna, AustriaSimona Ronchi Della Rocca University of Turin, ItalyJeremy Siek Indiana University, USA
Track C
Ioannis Caragiannis University of Patras, GreeceKatarina Cechlarova Pavol Jozef Safarik University, SlovakiaShiri Chechik Tel Aviv University, IsraelYuval Emek Technion, IsraelSándor Fekete TU Braunschweig, GermanyPierre Fraigniaud CNRS, Université Paris Diderot, FranceLeszek Gąsieniec University of Liverpool, UKAristides Gionis Aalto University, FinlandMagnús M. Halldórsson Reykjavik University, IcelandMonika Henzinger Universität Wien, AustriaBhaskar Krishnamachari University of Southern California, USAFabian Kuhn University of Freiburg, GermanyMichael Mitzenmacher Harvard University, USAMassimo Merro University of Verona, Italy
VIII Organization
Gopal Pandurangan University of Houston, USAPino Persiano University of Salerno, ItalyR. Ravi Carnegie Mellon University, USAYmir Vigfusson Emory University, USARoger Wattenhofer ETH Zürich, SwitzerlandMasafumi Yamashita Kyushu University, Japan
Organizing Committee
Masahito Hasegawa Kyoto University, JapanAtushi Igarashi Kyoto University, JapanKazuo Iwama Kyoto University, JapanKazuhisa Makino Kyoto University, Japan
Financial Sponsors
ERATO Kawarabayashi Large Graph ProjectMEXT Grant-in-Aid for Scientific Research on Innovative Areas: “Exploring theLimits of Computation”Research Institute for Mathematical Sciences, Kyoto UniversityTateisi Science and Technology Foundation
Additional Reviewers
Abboud, AmirAbdulla, ParoshAbed, FidaaAbraham, IttaiAilon, NirAjwani, DeepakAlbers, SusanneAlmeida, JorgeAlt, HelmutAlur, RajeevAlvarez, VictorAlvarez-Jarreta, JorgeAmbainis, AndrisAminof, BenjaminAnagnostopoulos, ArisAndoni, AlexandrAngelidakis, HarisAnshelevich, ElliotAntoniadis, Antonios
Arai, HiromiAronov, BorisAsada, KazuyukiAspnes, JamesAubert, ClémentAugustine, JohnAuletta, VincenzoAustrin, PerAvin, ChenAvni, GuyBaelde, DavidBaillot, PatrickBansal, NikhilBanyassady, BaharehBarnat, JiriBarth, StephanBarto, LiborBasavaraju, ManuBassily, Raef
Organization IX
Baswana, SurenderBateni, MohammadhosseinBatu, TugkanBaum, MoritzBéal, Marie-PierreBeigi, SalmanBeimel, AmosBen-Amran, AmrBerenbrink, PetraBernáth, AttilaBerthé, ValérieBes, AlexisBesser, BertBevern, René VanBi, JingguoBienstock, DanielBille, PhilipBilò, VittorioBizjak, AlesBjörklund, HenrikBlais, EricBläsius, ThomasBlömer, JohannesBogdanov, AndrejBojanczyk, MikolajBollig, BenediktBonfante, GuillaumeBonnet, EdouardBourhis, PierreBousquet, NicolasBoyar, JoanBozzelli, LauraBradfield, JulianBrandes, PhilippBrandt, SebastianBraverman, VladimirBresolin, DavideBrzuska, ChristinaBrânzei, SiminaBucciarelli, AntonioBuchbinder, NivBuchin, KevinBulatov, AndreiCai, Jin-YiCai, ZhuohongCanonne, Clement
Cao, YixinCarayol, ArnaudCarmi, PazCaron, PascalCaskurlu, BugraCassez, FranckCastagnos, GuilhemCastellani, IlariaCastelli Aleardi, LucaCenzer, DouglasChakrabarty, DeeparnabChalermsook, ParinyaChan, T.-H. HubertChan, Timothy M.Chattopadhyay, ArkadevChekuri, ChandraChen, Ho-LinChen, WeiChen, XiChen, XujinChitnis, RajeshChlamtac, EdenChlebikova, JankaCho, Dae-HyeongChonev, VentsislavChristodoulou, GeorgeCicalese, FerdinandoCimini, MatteoClairambault, PierreClaude, FranciscoClemente, LorenzoCleve, RichardCloostermans, BoukeCohen-Addad, VincentColumbus, TobiasCording, Patrick HaggeCoretti, SandroCormode, GrahamCornelsen, SabineCosentino, AlessandroCoudron, MatthewCrouch, MichaelCygan, MarekCzerwiński, WojciechCzumaj, ArturDachman-Soled, Dana
X Organization
Dahlgaard, SørenDalmau, VictorDantchev, StefanDaruki, SamiraDas, AnupamDasler, PhilipDatta, SamirDaum, SebastianDawar, AnujDe Bonis, AnnalisaDe Caro, AngeloDe, AnindyaDehghani, SinaDeligkas, ArgyriosDell, HolgerDemangeon, RomainDemri, StéphaneDenzumi, ShuheiDiakonikolas, IliasDibbelt, JulianDietzfelbinger, MartinDinsdale-Young, ThomasDinur, ItaiDisser, YannDobrev, StefanDoerr, CarolaDöttling, NicoDotu, IvanDoty, DavidDräger, KlausDrucker, AndrewDuan, RanDubslaff, ClemensDuetting, Paulvan Duijn, IngoDuncan, RossDurand, ArnaudDurand-Lose, JérômeDürr, ChristophDvorák, WolfgangDyer, MartinEfthymiou, CharilaosEirinakis, PavlosElbassioni, KhaledElmasry, AmrEmanuele, Viola
Emmi, MichaelEmura, KeitaEnglert, MatthiasEpelman, MarinaEpstein, LeahErgun, FundaErickson, AlejandroEsfandiari, HosseinFahrenberg, UliFarinelli, AlessandroFaust, SebastianFawzi, OmarFefferman, BillFeldman, MoranFeldmann, Andreas EmilFeng, YuanFernique, ThomasFerraioli, DiodatoFijavz, GasperFilinski, AndrzejFilmus, YuvalFilos-Ratsikas, ArisFind, Magnus GausdalFirsov, DenisFleiner, TamasFoerster, Klaus-TychoFomin, FedorFontes, LilaForbes, Michael A.Forejt, VojtechFormenti, EnricoFrançois, NathanaëlFränzle, MartinFrascaria, DarioFriedrich, TobiasFu, HongfeiFuchs, FabianFuchsbauer, GeorgFukunaga, TakuroFuller, BenjaminFunk, DarylFürer, MartinGabizon, ArielGaboardi, MarcoGacs, PeterGaertner, Bernd
Organization XI
Galanis, AndreasGalčík, FrantišekGanguly, SumitGanor, AnatGanty, PierreGarg, NaveenGaspers, SergeGawrychowski, PawelGazda, MaciejGehrke, MaiGemsa, AndreasGeorgiadis, LoukasGerhold, Marcusvan Glabbeek, RobGöller, StefanGoncharov, SergeyGöös, MikaGopalan, ParikshitGorbunov, SergeyGouveia, JoãoGrandjean, EtienneGrandoni, FabrizioGreen Larsen, KasperGrigoriev, AlexanderGrohe, MartinGroote, Jan FrisoGrossi, RobertoGrunert, RomainGuessarian, IrèneGuiraud, YvesGuo, HengGupta, AnupamHadfield, StuartHague, MatthewHahn, Ernst MoritzHaitner, IftachHalevi, ShaiHamann, MichaelHampkins, JoelHansen, Kristoffer ArnsfeltHar-Peled, SarielHarrow, AramHastad, JohanHatano, KoheiHaverkort, HermanHe, Meng
Heindel, TobiasHendriks, DimitriHenze, MatthiasHermelin, DannyHerranz, JavierHeunen, ChrisHeydrich, SandyHlineny, PetrHoffmann, FrankHoffmann, JanHofheinz, DennisHofman, PiotrHolm, JacobHolmgren, JustinHong, Seok-HeeHoule, Michael E.Høyer, PeterHsu, JustinHuang, ShenweiHuang, ZengfengHuang, ZhiyiHwang, Yoonhovan Iersel, LeoIm, SungjinImmerman, NeilInaba, KazuhiroIovino, VincenzoIshii, ToshimasaItaliano, Giuseppe F.Ito, TakehiroIvan, SzabolcsIwata, YoichiIzumi, TaisukeJaberi, RaedJaiswal, RageshJancar, PetrJanin, DavidJansen, Bart M.P.Jansen, KlausJayram, T.S.Jeavons, PeterJeffery, StaceyJerrum, MarkJeż, ŁukaszJhanwar, Mahabir PrasadJohnson, Matthew
XII Organization
Johnson, Matthew P.Jones, MarkJones, NeilJordan, CharlesJørgensen, Allan GrønlundJovanovic, AleksandraJukna, StasysKakimura, NaonoriKalaitzis, ChristosKamiyama, NaoyukiKanade, VarunKanazawa, MakotoKane, DanielKanellopoulos, PanagiotisKantor, ErezKanté, Mamadou MoustaphaKaplan, HaimKarhumaki, JuhaniKari, JarkkoKärkkäinen, JuhaKashefi, ElhamKatajainen, JyrkiKatz, MatthewKawachi, AkinoriKazana, TomaszKelk, StevenKeller, BarbaraKeller, OrgadKenter, SebastianKerenidis, IordanisKhan, MaleqKhani, RezaKhoussainov, BakhadyrKida, TakuyaKiefer, StefanKijima, ShujiKim, Eun JungKim, HeunaKim, Min-GyuKim, RingiKim, Sang-SubKishida, KoheiKiyomi, MasashiKlauck, HartmutKlavík, PavelKlima, Ondrej
Klin, BartekKnauer, ChristianKobayashi, YusukeKollias, KonstantinosKolmogorov, VladimirKomusiewicz, ChristianKönig, BarbaraKönig, MichaelKonrad, ChristianKontogiannis, SpyrosKopczynski, ErykKopelowitz, TsviKopparty, SwastikKorman, MatiasKortsarz, GuyKorula, NitishKostitsyna, IrinaKotek, TomerKothari, RobinKovacs, AnnamariaKozen, DexterKraehmann, DanielKral, DanielKralovic, RastislavKratsch, DieterKratsch, StefanKrcal, JanKrenn, StephanKretinsky, JanKreutzer, Stephanvan Kreveld, MarcKriegel, KlausKrinninger, SebastianKrishna, Shankara NarayananKrishnaswamy, RavishankarKrizanc, DannyKrumke, SvenKrysta, PiotrKulkarni, RaghavKumar, AmitKumar, MrinalKünnemann, MarvinKuperberg, GregKuroda, SatoruKurz, AlexanderKyropoulou, Maria
Organization XIII
Labourel, ArnaudLachish, OdedŁącki, JakubLagerqvist, VictorLamani, AnissaLammich, PeterLampis, MichaelLanese, IvanLange, MartinLasota, SławomirLaudahn, MoritzLaura, LuigiLaurent, MoniqueLauriere, MathieuLavi, RonLazic, RankoLe Gall, FrancoisLe, Quang LocLe, Ton ChanhLecerf, GregoireLee, JamesLee, TroyLengler, JohannesLeonardos, NikosLeung, HingLevy, Paul BlainLewenstein, MosheLewis, Andrew E.M.Li, GuoqiangLi, JianLi, LiangLi, YiLi, YuanLi, ZhentaoLiaghat, VahidLianeas, ThanasisLiang, HongjinLiu, JingchengLiu, ShengliLiu, ZhengyangLivnat, AdiLodi, AndreaLöding, ChristofLoff, BrunoLöffler, MaartenLohrey, Markus
Lokshtanov, DanielLopez-Ortiz, AlejandroLovett, ShacharLucier, BrendanLuxen, DennisMahabadi, SepidehMahmoody, MohammadMakarychev, KonstantinMakarychev, YuryManeth, SebastianManlove, DavidManokaran, RajsekarManthey, BodoManuel, AmaldevMardare, RaduMartens, WimMasuzawa, ToshimitsuMatsuda, TakahiroMatulef, KevinMatuschke, JannikMay, AlexanderMayr, RichardMcGregor, AndrewMegow, NicoleMeier, FlorianMeir, OrMertzios, Georgede Mesmay, ArnaudMestre, JulianMichail, OthonMichalewski, HenrykMignosi, FilippoMihalák, MatúšMisra, NeeldharaMitsou, ValiaMnich, MatthiasMogelberg, RasmusMohar, BojanMoitra, AnkurMonemizadeh, MortezaMontanaro, AshleyMorihata, AkimasaMorin, PatMorizumi, HirokiMoruz, GabrielMoseley, Benjamin
XIV Organization
Mousset, FrankMucha, MarcinMueller, TobiasMüller, DavidMüller-Hannemann, MatthiasMurakami, KeisukeMurano, AnielloMusco, ChristopherMustafa, NabilNadathur, GopalanNagano, KiyohitoNakazawa, KojiNanongkai, DanuponNarayanan, HariharanNavarra, AlfredoNavarro, GonzaloNayyeri, AmirNederhof, Mark-JanNederlof, JesperNewman, AlanthaNguyen, HuyNguyen, Kim ThangNguyen, Viet HungNiazadeh, RadNicholson, Patrick K.Niedermann, BenjaminNielsen, Jesper BuusNielsen, Jesper SindahlNies, AndréNikolov, AleksandarNishimura, HarumichiNitaj, AbderrahmaneNöllenburg, MartinNordhoff, BenediktNovotný, PetrObremski, MaciejOchremiak, JoannaOh, EunjinOkamoto, YoshioOliveira, IgorOnak, KrzysztofOrdóñez Pereira, AlbertoOren, SigalOrlandi, ClaudioOtachi, YotaOtt, Sebastian
Otto, MartinOveis Gharan, ShayanOzeki, KentaOzols, MarisPadro, CarlesPagani, MichelePagh, RasmusPaluch, KatarzynaPanagiotou, KonstantinosPanigrahi, DebmalyaPaolini, LucaParter, MeravPasquale, FrancescoPaul, ChristophePedersen, Christian Nørgaard StormPelc, AndrzejPenna, PaoloPerdrix, SimonPerelli, GiuseppePersiano, GiuseppePettie, SethPeva, BlanchardPhilip, GeevarghesePhillips, JeffPiccolo, MauroPietrzak, KrzysztofPilaud, VincentPiliouras, GeorgiosPilipczuk, MarcinPinto, Joao SousaPiterman, NirPlace, ThomasPoelstra, AndrewPokutta, SebastianPolak, LiborPolishchuk, ValentinPountourakis, EmmanouilPrencipe, GiuseppePruhs, KirkPrutkin, RomanQin, ShengchaoQuas, AnthonyRabehaja, TahiryRäcke, HaraldRaghavendra, PrasadRaghothaman, Mukund
Organization XV
Raman, RajivRaskin, Jean-FrancoisRazenshteyn, IlyaRegev, OdedRehak, VojtechReis, Gisellevan Renssen, AndréReshef, YakirReyzin, LeonidReyzin, LevRiba, ColinRicherby, DavidRiely, JamesRiveros, CristianRobere, RobertRobinson, PeterRoeloffzen, MarcelRöglin, HeikoRote, GünterRotenberg, EvaRoth, AaronRothvoss, Thomasde Rougemont, MichelRümmele, StefanSabel, DavidSabok, MarcinSacchini, Jorge LuisSach, BenjaminSaha, AnkanSaha, ChandanSaitoh, ToshikiSakavalas, DimitrisSalvati, SylvainSanchez Villaamil, FernandoSangnier, ArnaudSankowski, PiotrSankur, OcanSaptharishi, RamprasadSaraswat, VijaySatti, Srinivasa RaoSaurabh, SaketSawant, AnshulScharf, LudmilaSchieber, BaruchSchlotter, IldikóSchneider, Stefan
Schnitger, GeorgSchoenebeck, GrantSchrijvers, OkkeSchweitzer, PascalSchweller, RobertSchwitter, RolfSchöpp, UlrichScquizzato, MicheleSeddighin, SaeedSegev, DannySeidel, JochenSeiferth, PaulSekar, ShreyasSen, SiddharthaSenizergues, GeraudSerre, OlivierSeshadhri, C.Seto, KazuhisaSeurin, YannickShepherd, BruceSherstov, AlexanderShi, YaoyunShinkar, IgorShioura, AkiyoshiSiebertz, SebastianSingh, MohitSitters, ReneSivignon, IsabelleSkorski, MaciejSkrzypczak, MichałSkutella, MartinSmith, AdamSoares Barbosa, RuiSobocinski, PawelSolan, EilonSommer, ChristianSon, WanbinSorensen, TylerSorge, ManuelSottile, FrankSpalek, RobertSpoerhase, JoachimSrba, JiriSrivastava, PiyushStaals, FrankStampoulis, Antonis
XVI Organization
Staton, SamStefankovic, DanielStein, CliffordStein, YannikStenman, JariStephan, FrankStirling, ColinStokes, KlaraStolz, DavidStrasser, BenStreicher, ThomasSun, HeSun, XiaoruiSuomela, JukkaSvendsen, KasperSviridenko, MaximSwamy, ChaitanyaTakahashi, YasuhiroTakazawa, KenjiroTalebanfard, NavidTamaki, SuguruTan, Li-YangTan, TonyTang, BoTanigawa, Shin-IchiTasson, ChristineTavenas, SébastienTeillaud, MoniqueTelelis, OrestisThaler, JustinThapper, JohanThomas, RekhaTing, HingfungTiwary, HansTorán, JacoboTov, RoeiTovey, CraigTreinen, RalfTriandopoulos, NikosTrung, Ta QuangTsukada, TakeshiTulsiani, MadhurTuosto, EmilioTzamos, ChristosUchizawa, KeiUeno, Shuichi
Uitto, JaraUllman, JonUllman, JonathanUmboh, SeeunUnno, HiroshiUno, YushiUramoto, TakeoUrrutia, FlorentVagvolgyi, SandorVahlis, YevgeniyValiron, BenoîtVanden Boom, MichaelVdovina, AlinaVeith, DavidVenkatasubramanian, SureshVenkitasubramaniam,
MuthuramakrishnanVentre, CarmineVereshchagin, NikolayVidick, ThomasVijayaraghavan, AravindanVildhøj, Hjalte WedelVinayagamurthy, DhinakaranVishnoi, NisheethVitanyi, PaulVivek, SrinivasVondrak, JanVoudouris, AlexandrosWahlström, MagnusWalter, TobiasWalukiewicz, IgorWasa, KunihiroWatanabe, OsamuWee, HoeteckWegner, FranziskaWei, ZheweiWeichert, VolkerWeinberg, S. MatthewWeinstein, OmriWenner, AlexanderWerneck, RenatoWexler, TomWhite, ColinWichs, DanielWiese, AndreasWillard, Ross
Organization XVII
Williams, RyanWilliamson, DavidWilson, DavidWimmer, KarlWinslow, AndrewWoeginger, Gerhard J.Wojtczak, Dominikde Wolf, RonaldWolff, AlexanderWong, Prudence W.H.Woodruff, DavidWootters, MaryWorrell, JamesWrochna, MarcinWu, XiaodiWu, ZhilinXiao, TaoXie, NingXu, JinhuiYamakami, TomoyukiYamamoto, MasakiYamauchi, YukikoYang, Kuan
Yaroslavtsev, GrigoryYehudayoff, AmirYodpinyanee, AnakYogev, EylonYoon, Sang-DukYoshida, YuichiYun, AaramYuster, RaphaelZampetakis, EmmanouilZanuttini, BrunoZemor, GillesZhang, ChihaoZhang, JialinZhang, QinZhang, ShengyuZhou, GelinZhou, YuanŽivný, StanislavZois, GeorgiosZorzi, Margheritavan Zwam, StefanZwick, Uri
XVIII Organization
Towards the Graph Minor Theoremsfor Directed Graphs
Ken-ichi Kawarabayashi1(B) and Stephan Kreutzer2
1 National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, Japank keniti@nii.ac.jp
2 Technical University Berlin, Sekr TEL 7-3, Ernst-Reuter Platz 7, 10587Berlin, Germany
stephan.kreutzer@tu-berlin.de
Abstract. Two key results of Robertson and Seymour’s graph minortheory are:1. a structure theorem stating that all graphs excluding some fixed
graph as a minor have a tree decomposition into pieces that arealmost embeddable in a fixed surface.
2. the k-disjoint paths problem is tractable when k is a fixed constant:given a graph G and k pairs (s1, t1), . . . , (sk, tk) of vertices of G,decide whether there are k mutually vertex disjoint paths of G, theith path linking si and ti for i = 1, . . . , k.
In this talk, we shall try to look at the corresponding problems fordigraphs.
Concerning the first point, the grid theorem, originally proved in 1986by Robertson and Seymour in Graph Minors V, is the basis (even for thewhole graph minor project). In the mid-90s, Reed and Johnson, Robert-son, Seymour and Thomas (see [13,26]), independently, conjectured ananalogous theorem for directed graphs, i.e. the existence of a functionf : N → N such that every digraph of directed treewidth at least f(k)contains a directed grid of order k. In an unpublished manuscript from2001, Johnson, Robertson, Seymour and Thomas give a proof of thisconjecture for planar digraphs. But for over a decade, this was the mostgeneral case proved for the conjecture.
We are finally able to confirm the Reed, Johnson, Robertson, Sey-mour and Thomas conjecture in full generality. As a consequence of ourresults we are able to improve results in Reed et al. in 1996 [27] to disjointcycles of length at least l. This would be the first but a significant steptoward the structural goals for digraphs (hence towards the first point).
Concerning the second point, in [19] we contribute to the disjointpaths problem using the directed grid theorem. We show that the fol-lowing can be done in polynomial time:
K.-I. Kawarabayashi—This work was supported by JST ERATO KawarabayashiLarge Graph Project and by Mitsubishi Foundation.S. Kreutzer—This project has received funding from the European Research Council(ERC) under the European Unions Horizon 2020 research and innovation programme(grant agreement No 648527).
XX K.-i. Kawarabayashi and S. Kreutzer
Suppose that we are given a digraph G and k terminal pairs(s1, t1), (s2, t2), . . . , (sk, tk), where k is a fixed constant. In polynomialtime, either– we can find k paths P1, . . . , Pk such that Pi is from si to ti for
i = 1, . . . , k and every vertex in G is in at most four of the paths, or– we can conclude that G does not contain disjoint paths P1, . . . , Pk
such that Pi is from si to ti for i = 1, . . . , k.To the best of our knowledge, this is the first positive result for thegeneral directed disjoint paths problem (and hence for the second point).Note that the directed disjoint paths problem is NP-hard even for k = 2.Therefore, this kind of results is the best one can hope for.
We also report some progress on the above two points.
Dynamic Graphs: Time, Spaceand Communication
Valerie King(B)
University of Victoria, Victoria, Canadaval@uvic.ca
Abstract. A dynamic graph is a graph which experiences a sequenceof local updates, typically in the form of edge insertions and deletions.A dynamic graph algorithm for a graph property is a data structurewhich processes a sequence of updates while answering queries about aproperty. The concern of dynamic graph algorithms is primarily time, tominimize the update and query time. A graph streaming algorithm is aone-time computation of a graph property, where the input is reportedone edge or one node and adjacent edges at a time. The concern of astreaming algorithm is space, to use memory nearly linear in the numberof nodes and sublinear in the number of edges. In distributed comput-ing, each node in a graph has only local information about the graphstructure. Each must make a decision which may affect a global prop-erty of the graph, based on this information and messages received fromits neighbors. The concern is communication, to minimize the number ofbits communicated and time in terms of the number of communicationrounds.
This talk will report on a convergence of these approaches, resultingin a dynamic data structure for answering connectivity queries in a graphin worst case update and query time polylogarithmic in the size of thegraph and sublinear space, and the first distributed algorithm to builda spanning forest which requires substantially less communication thanedges in the graph. The talk will also discuss future directions for workin this area.
Automated Synthesis of Distributed Controllers
Anca Muscholl(B)
LaBRI, University of Bordeaux, Bordeaux, Franceanca@labri.fr
Abstract. Synthesis is a particularly challenging problem for concur-rent programs. At the same time it is a very promising approach, sinceconcurrent programs are difficult to get right, or to analyze with tra-ditional verification techniques. This paper gives an introduction todistributed synthesis in the setting of Mazurkiewicz traces, and its appli-cations to decentralized runtime monitoring.
Incentive Networks
Thomas Moscibroda(B)
Microsoft Research and Tsinghua University, Beijing, Chinamoscitho@microsoft.com
1 Extended Abstract
Crowdsourcing and human-computing systems that mobilize people’s work havebecome the method of choice to quickly and efficiently solve many tasks. Com-mercial offerings such as Gigwalk or Amazon’s Mechanical Turk allow usersto recruit people to complete tasks. Crowdsourcing is commonly used to obtainlarge-scale user data, such as environmental data, application traces, to generatemaps, or for labelling. A key challenge in successfully deploying any such systemis how to incentivize people to participate and contribute as much as possible. Infact, this challenge is very common in systems that rely on user contributions.For instance, social forums, file-sharing services, public computing projects (e.g.SETI@Home), or collaborative reference works often suffer from the well-knownbootstrapping problem. These systems can become self-sustaining once the scaleof participation exceeds a certain threshold, but below this threshold, they maynot by themselves provide sufficient inherent benefit for users.
In my talk, I will discuss the algorithmic foundations of two types of network-based incentive structures that can be used to encourage users to participate inand contribute to a system: Incentive Trees [1,4] and Incentive Networks [5].
Incentive Trees. Incentive Trees are tree-based mechanisms in which (i) eachparticipant is rewarded for contributing to the system, and (ii) a participant canmake referrals and thereby solicit new participants to also join the system andcontribute to it. The mechanism incentivizes solicitations by making a solici-tor’s reward depend on the contributions (and recursively also on their furthersolicitations, etc) made by such solicitees. An Incentive Tree mechanism is analgorithm that determines how much reward each participant receives based onall the participants’ contributions as well as the structure of the solicitation tree.Incentive Trees have been widely used in various domains and under differentnames, e.g., in referral trees, multi-level marketing schemes [2], affiliate market-ing, MIT’s winning strategy in the Red Balloon Challenge [6], and even in theform of the infamous illegal Pyramid Schemes.
Using an axiomatic approach, we seek to understand the possibilities andlimitations of incentive trees. Our goal is to characterize what desirable prop-erties are achievable; and to design incentive tree mechanisms that achieve abest possible set of such properties. The key challenge is to find mechanismsthat simultaneously guarantee contribution and solicitation incentive, while alsopreventing strategic attacks, such as multi-identity attacks. As it turns out, theset of desirable properties that are mutually satisfiable is robust with regard to awide set of modeling assumptions. For the two most basic models, I will present
XXIV T. Moscibroda
key impossibility results, as well as mechanisms that are “optimal” in the sensethat they achieve a maximally satisfiable subset of desirable properties. Interest-ingly, the algorithmic structure of these optimal solutions is unusual and revealsnew insights into the structure of incentive trees.
Incentive Networks. Incentive Networks are a different concept: They can beused to maximize the users’ contribution when participation has already beenestablished. Consider a basic economic incentive system, in which each partici-pant receives a reward according to his own contribution to the system. Examplesof such basic systems are endless: Jobs with hourly wages, membership savingsrewards (buy 10 coffee, get one free), loyalty or airplane mileage programs, etc.In each of these systems, a user receives a reward based on his own contribution.
In this talk, I will discuss an alternative to the above basic economic system:Incentive Networks. In an incentive network, a participant’s reward depends notonly on his own contribution; but also in part on the contributions made byhis social contacts or friends. The concept is exceedingly natural and practical:Instead of receiving pay only for your own work, in an incentive network youare rewarded for your own work plus your friend’s work. So, for example, eachworker is paid per hour of his own work, plus an additional amount for eachhour of his friends’ work. Or, in a membership rewards program, a coffee shopoffers rewards to a customer whenever she consumes a cup of coffee, as well aswhenever one of her designated friends does.
I will show that the key parameter effecting the efficiency of such an IncentiveNetwork-based reward system depends on the participant?s directed altruism [3].Directed altruism is the extent to which someone is willing to work if his workresults in a payment to his friend, rather than to himself. Specifically, we char-acterize the condition under which an Incentive Network-based economy is moreefficient than the basic “pay-for-your-contribution” economy, and we quantify thesavings when using incentive networks. I will discuss the impact of the networktopology and exogenous parameters on the efficiency of incentive networks. Theresults suggest that in many real-world practical settings, Incentive Network-based reward systems or compensation structures could be more efficient thanthe ubiquitous “pay-for-your-contribution” schemes.
References
1. Douceur, J., Moscibroda, T.: Lottery Trees: motivational deployment of networkedsystems. In: Proc. of SIGCOMM (2007)
2. Emek, Y., Karidi, R., Tennenholtz, M., Zohar, A.: Mechanisms for multi-level mar-keting. In: Proc. of 12th ACM Conference on Electronic Commerce (EC) (2011)
3. Leider, S., Mobius, M., Rosenblat, T., Do, Q.: Directed altruism and enforced reci-procity in social networks. The Quarterly Journal of Economics (2009)
4. Lv, Y., Moscibroda, T.: Fair and resilient incentive tree mechanisms. In: Proc. of32nd ACM Symposium on Principles of Distributed Computing (PODC) (2013)
5. Lv, Y., Moscibroda, T.: Incentive networks. In: Proc. of 29th AAAI Conference onArtificial Intelligence (AAAI) (2014)
6. Pickard, G., Pan, W., Rahwan, I., Cebrian, M., Crane, R., Madan, A., Pentland, A.:Time Critical Social Mobilization. Science (2011)
Fast Algorithms for Structured Sparsity
Piotr Indyk(B)
Massachusetts Institute of Technology, Cambridge, USAindyk@mit.edu
Abstract. Sparse representations of signals (i.e., representations thathave only few non-zero or large coefficients) have emerged as power-ful tools in signal processing theory, algorithms, machine learning andother applications. However, real-world signals often exhibit rich struc-ture beyondmere sparsity. For example, a natural image, once representedin the wavelet domain, often has the property that its large coefficientsoccupy a subtree of the wavelet hierarchy, as opposed to arbitrary posi-tions. A general approach to capturing this type of additional structureis to model the support of the signal of interest (i.e., the set of indices oflarge coefficients) as belonging to a particular family of sets. Computinga sparse representation of the signal then corresponds to the problem offinding the support from the family that maximizes the sum of the squaresof the selected coefficients. Such a modeling approach has proved to bebeneficial in a number of applications including compression, de-noising,compressive sensing and machine learning. However, the resulting opti-mization problem is often computationally difficult or intractable, whichis undesirable in many applications where large signals and datasets arecommonplace.
In this talk, I will outline some of the past and more recent algorithmsfor finding structured sparse representations of signals, including piece-wise constant approximations, tree-sparse approximations and graph-sparse approximations. The algorithms borrow several techniques fromcombinatorial optimization (e.g., dynamic programming), graph theory,and approximation algorithms. For many problems the algorithms oftenrun in (nearly) linear time, which makes them applicable to very largedatasets.
Computational Complexity of Puzzlesand Games
Ryuhei Uehara(B)
School of Information Science, Japan Advanced Institute of Science and Technology,Asahidai 1-1, Nomi, Ishikawa, Japan
uehara@jaist.ac.jp
Abstract. A computation consists of algorithm of basic operations.When you consider an algorithm, you assume, say, the standard RAMmodel, that has “usual” arithmetic operations. On the other hand, whenyou consider an algorithm on a DNA computer, your basic operationsare duplication and inversion on a string. Then you need to considercompletely different algorithms, and their computational complexity alsochanges. That is, when we discuss computational complexity of a prob-lem, it strongly depends on the set of basic operations you use. Whenyou enjoy a puzzle, you have to find an algorithm by combining reason-able basic operations to its goal. (Some puzzles require to find the basicoperations themselves, but we do not consider such puzzles in this talk.)From the viewpoint of theoretical computer science, puzzles give us someinsight to computation and computational complexity classes in variousway.
Some puzzles and games give reasonable characterizations to com-putational complexity classes. For example, “pebble game” is a classicmodel that gives some complexity classes in a natural way, and “con-straint logic” is recent model that succeeds to solve a long standing openproblem due to Martin Gardner that asks the computational complexityof sliding block puzzles. Such puzzles gives us “typical” and characteri-zation and “intuitive” understanding for some computational complexityclasses.
On the other hand, there are some puzzles and games that give non-trivial interesting aspects of computational complexity classes. For exam-ple, consider ”14-15 puzzle” which is classic well known sliding puzzle.By parity, we can determine if one arrangement can be slid to the otherin linear time. Moreover, we can always find a way for sliding betweenthem in quadratic time. However, interestingly, finding the optimal solu-tion is NP-complete in general. I also introduce a relatively new notion ofthe reconfiguration problem. This series of new problems will give somenew notion of computational complexity classes.
Contents – Part II
Invited Talks
Towards the Graph Minor Theorems for Directed Graphs . . . . . . . . . . . . . . 3Ken-Ichi Kawarabayashi and Stephan Kreutzer
Automated Synthesis of Distributed Controllers . . . . . . . . . . . . . . . . . . . . . 11Anca Muscholl
Track B: Logic, Semantics, Automata and Theory of Programming
Games for Dependent Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31Samson Abramsky, Radha Jagadeesan, and Matthijs Vákár
Short Proofs of the Kneser-Lovász Coloring Principle. . . . . . . . . . . . . . . . . 44James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Crãciun,and Gabriel Istrate
Provenance Circuits for Trees and Treelike Instances . . . . . . . . . . . . . . . . . 56Antoine Amarilli, Pierre Bourhis, and Pierre Senellart
Language Emptiness of Continuous-Time Parametric Timed Automata . . . . . 69Nikola Beneš, Peter Bezdek, Kim G. Larsen, and Jirí Srba
Analysis of Probabilistic Systems via Generating Functions and PadéApproximation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
Michele Boreale
On Reducing Linearizability to State Reachability . . . . . . . . . . . . . . . . . . . 95Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza
The Complexity of Synthesis from Probabilistic Components. . . . . . . . . . . . 108Krishnendu Chatterjee, Laurent Doyen, and Moshe Y. Vardi
Edit Distance for Pushdown Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . 121Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen,and Jan Otop
Solution Sets for Equations over Free Groups Are EDT0L Languages . . . . . 134Laura Ciobanu, Volker Diekert, and Murray Elder
Limited Set quantifiers over Countable Linear Orderings. . . . . . . . . . . . . . . 146Thomas Colcombet and A.V. Sreejith
Reachability Is in DynFO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick,and Thomas Zeume
Natural Homology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171Jérémy Dubut, Éric Goubault, and Jean Goubault-Larrecq
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations,and Reachability for Branching Markov Decision Processes . . . . . . . . . . . . 184
Kousha Etessami, Alistair Stewart, and Mihalis Yannakakis
Trading Bounds for Memory in Games with Counters. . . . . . . . . . . . . . . . . 197Nathanaël Fijalkow, Florian Horn, Denis Kuperberg,and Michał Skrzypczak
Decision Problems of Tree Transducers with Origin . . . . . . . . . . . . . . . . . . 209Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier,and Jean-Marc Talbot
Incompleteness Theorems, Large Cardinals, and Automataover Infinite Words. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222
Olivier Finkel
The Odds of Staying on Budget . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234Christoph Haase and Stefan Kiefer
From Sequential Specifications to Eventual Consistency . . . . . . . . . . . . . . . 247Radha Jagadeesan and James Riely
Fixed-Dimensional Energy Games Are in Pseudo-Polynomial Time . . . . . . . 260Marcin Jurdzinski, Ranko Lazic, and Sylvain Schmitz
An Algebraic Geometric Approach to Nivat’s Conjecture . . . . . . . . . . . . . . 273Jarkko Kari and Michal Szabados
Nominal Kleene Coalgebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286Dexter Kozen, Konstantinos Mamouras, Daniela Petris�an,and Alexandra Silva
On Determinisation of Good-for-Games Automata . . . . . . . . . . . . . . . . . . . 299Denis Kuperberg and Michał Skrzypczak
Owicki-Gries Reasoning for Weak Memory Models . . . . . . . . . . . . . . . . . . 311Ori Lahav and Viktor Vafeiadis
On the Coverability Problem for Pushdown Vector Addition Systemsin One Dimension. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324
Jérome Leroux, Grégoire Sutre, and Patrick Totzke
XXVIII Contents – Part II
Compressed Tree Canonization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 337Markus Lohrey, Sebastian Maneth, and Fabian Peternek
Parsimonious Types and Non-uniform Computation . . . . . . . . . . . . . . . . . . 350Damiano Mazza and Kazushige Terui
Baire Category Quantifier in Monadic Second Order Logic . . . . . . . . . . . . . 362Henryk Michalewski and Matteo Mio
Liveness of Parameterized Timed Networks. . . . . . . . . . . . . . . . . . . . . . . . 375Benjamin Aminof, Sasha Rubin, Florian Zuleger, and Francesco Spegni
Symmetric Strategy Improvement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388Sven Schewe, Ashutosh Trivedi, and Thomas Varghese
Effect Algebras, Presheaves, Non-locality and Contextuality . . . . . . . . . . . . 401Sam Staton and Sander Uijlen
On the Complexity of Intersecting Regular, Context-Free,and Tree Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 414
Joseph Swernofsky and Michael Wehar
Containment of Monadic Datalog Programs via Bounded Clique-Width . . . . 427Mikołaj Bojanczyk, Filip Murlak, and Adam Witkowski
An Approach to Computing Downward Closures . . . . . . . . . . . . . . . . . . . . 440Georg Zetzsche
How Much Lookahead Is Needed to Win Infinite Games?. . . . . . . . . . . . . . 452Felix Klein and Martin Zimmermann
Track C: Foundations of Networked Computation: Models,Algorithms and Information Management
Symmetric Graph Properties Have Independent Edges . . . . . . . . . . . . . . . . 467Dimitris Achlioptas and Paris Siminelakis
Polylogarithmic-Time Leader Election in Population Protocols . . . . . . . . . . 479Dan Alistarh and Rati Gelashvili
Core Size and Densification in Preferential Attachment Networks . . . . . . . . 492Chen Avin, Zvi Lotker, Yinon Nahum, and David Peleg
Maintaining Near-Popular Matchings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 504Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang,Telikepalli Kavitha, and Lisa Wagner
Contents – Part II XXIX
Ultra-Fast Load Balancing on Scale-Free Networks . . . . . . . . . . . . . . . . . . 516Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger,and Thomas Sauerwald
Approximate Consensus in Highly Dynamic Networks: The Roleof Averaging Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528
Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak
The Range of Topological Effects on Communication. . . . . . . . . . . . . . . . . 540Arkadev Chattopadhyay and Atri Rudra
Secretary Markets with Local Information . . . . . . . . . . . . . . . . . . . . . . . . . 552Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin,and Peihan Miao
A Simple and Optimal Ancestry Labeling Scheme for Trees . . . . . . . . . . . . 564Søren Dahlgaard, Mathias Bæk Tejs Knudsen, and Noy Rotbart
Interactive Communication with Unknown Noise Rate . . . . . . . . . . . . . . . . 575Varsha Dani, Mahnush Movahedi, Jared Saia, and Maxwell Young
Fixed Parameter Approximations for k-Center Problems in Low HighwayDimension Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 588
Andreas Emil Feldmann
A Unified Framework for Strong Price of Anarchy in Clustering Games. . . . 601Michal Feldman and Ophir Friedler
On the Diameter of Hyperbolic Random Graphs. . . . . . . . . . . . . . . . . . . . . 614Tobias Friedrich and Anton Krohmer
Tight Bounds for Cost-Sharing in Weighted Congestion Games . . . . . . . . . . 626Martin Gairing, Konstantinos Kollias, and Grammateia Kotsialou
Distributed Broadcast Revisited: Towards Universal Optimality . . . . . . . . . . 638Mohsen Ghaffari
Selling Two Goods Optimally . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 650Yiannis Giannakopoulos and Elias Koutsoupias
Adaptively Secure Coin-Flipping, Revisited . . . . . . . . . . . . . . . . . . . . . . . . 663Shafi Goldwasser, Yael Tauman Kalai, and Sunoo Park
Optimal Competitiveness for the Rectilinear Steiner ArborescenceProblem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 675
Erez Kantor and Shay Kutten
XXX Contents – Part II
Normalization Phenomena in Asynchronous Networks . . . . . . . . . . . . . . . . 688Amin Karbasi, Johannes Lengler, and Angelika Steger
Broadcast from Minicast Secure Against General Adversaries . . . . . . . . . . . 701Pavel Raykov
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 713
Contents – Part II XXXI
Contents – Part I
Track A: Algorithms, Complexity and Games
Statistical Randomized Encodings: A Complexity Theoretic View . . . . . . . . 1Shweta Agrawal, Yuval Ishai, Dakshita Khurana,and Anat Paskin-Cherniavsky
Tighter Fourier Transform Lower Bounds . . . . . . . . . . . . . . . . . . . . . . . . . 14Nir Ailon
Quantifying Competitiveness in Paging with Locality of Reference . . . . . . . 26Susanne Albers and Dario Frascaria
Approximation Algorithms for Computing Maximin Share Allocations . . . . . 39Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad,and Amin Saberi
Envy-Free Pricing in Large Markets: Approximating Revenueand Welfare . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
Elliot Anshelevich, Koushik Kar, and Shreyas Sekar
Batched Point Location in SINR Diagrams via Algebraic Tools . . . . . . . . . . 65Boris Aronov and Matthew J. Katz
On the Randomized Competitive Ratio of Reordering Buffer Managementwith Non-uniform Costs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, and Yuval Rabani
Serving in the Dark Should Be Done Non-uniformly . . . . . . . . . . . . . . . . . 91Yossi Azar and Ilan Reuven Cohen
Finding the Median (Obliviously) with Bounded Space . . . . . . . . . . . . . . . . 103Paul Beame, Vincent Liew, and Mihai Patras�cu
Approximation Algorithms for Min-Sum k-Clusteringand Balanced k-Median . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour,and Rohit Sivakumar
Solving Linear Programming with Constraints Unknown . . . . . . . . . . . . . . . 129Xiaohui Bei, Ning Chen, and Shengyu Zhang
Deterministic Randomness Extraction from Generalized and DistributedSantha-Vazirani Sources . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
Salman Beigi, Omid Etesami, and Amin Gohari
Limitations of Algebraic Approaches to Graph Isomorphism Testing . . . . . . 155Christoph Berkholz and Martin Grohe
Fully Dynamic Matching in Bipartite Graphs . . . . . . . . . . . . . . . . . . . . . . . 167Aaron Bernstein and Cliff Stein
Feasible Interpolation for QBF Resolution Calculi . . . . . . . . . . . . . . . . . . . 180Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla
Simultaneous Approximation of Constraint Satisfaction Problems. . . . . . . . . 193Amey Bhangale, Swastik Kopparty, and Sushant Sachdeva
Design of Dynamic Algorithms via Primal-Dual Method. . . . . . . . . . . . . . . 206Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano
What Percentage of Programs Halt? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219Laurent Bienvenu, Damien Desfontaines, and Alexander Shen
The Parity of Set Systems Under Random Restrictions with Applicationsto Exponential Time Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
Andreas Björklund, Holger Dell, and Thore Husfeldt
Spotting Trees with Few Leaves . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243Andreas Björklund, Vikram Kamat, Łukasz Kowalik, and Meirav Zehavi
Constraint Satisfaction Problems over the Integers with Successor . . . . . . . . 256Manuel Bodirsky, Barnaby Martin, and Antoine Mottet
Hardness Amplification and the Approximate Degreeof Constant-Depth Circuits. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 268
Mark Bun and Justin Thaler
Algorithms and Complexity for Turaev-Viro Invariants . . . . . . . . . . . . . . . . 281Benjamin A. Burton, Clément Maria, and Jonathan Spreer
Big Data on the Rise? – Testing Monotonicity of Distributions . . . . . . . . . . 294Clément L. Canonne
Unit Interval Editing Is Fixed-Parameter Tractable . . . . . . . . . . . . . . . . . . . 306Yixin Cao
Streaming Algorithms for Submodular Function Maximization. . . . . . . . . . . 318Chandra Chekuri, Shalmoli Gupta, and Kent Quanrud
XXXIV Contents – Part I
Multilinear Pseudorandom Functions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331Aloni Cohen and Justin Holmgren
Zero-Fixing Extractors for Sub-Logarithmic Entropy. . . . . . . . . . . . . . . . . . 343Gil Cohen and Igor Shinkar
Interactive Proofs with Approximately Commuting Provers . . . . . . . . . . . . . 355Matthew Coudron and Thomas Vidick
Popular Matchings with Two-Sided Preferences and One-Sided Ties . . . . . . 367Ágnes Cseh, Chien-Chung Huang, and Telikepalli Kavitha
Block Interpolation: A Framework for Tight Exponential-TimeCounting Complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 380
Radu Curticapean
On Convergence and Threshold Properties of Discrete Lotka-VolterraPopulation Protocols . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 393
Jurek Czyzowicz, Leszek Ga�sieniec, Adrian Kosowski,Evangelos Kranakis, Paul G. Spirakis, and Przemysław Uznanski
Scheduling Bidirectional Traffic on a Path. . . . . . . . . . . . . . . . . . . . . . . . . 406Yann Disser, Max Klimm, and Elisabeth Lübbecke
On the Problem of Approximating the Eigenvalues of Undirected Graphsin Probabilistic Logspace . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 419
Dean Doron and Amnon Ta-Shma
On Planar Boolean CSP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 432Zdenek Dvorák and Martin Kupec
On Temporal Graph Exploration. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444Thomas Erlebach, Michael Hoffmann, and Frank Kammer
Mind Your Coins: Fully Leakage-Resilient Signatureswith Graceful Degradation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456
Antonio Faonio, Jesper Buus Nielsen, and Daniele Venturi
A (1+e)-Embedding of Low Highway Dimension Graphs into BoundedTreewidth Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469
Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann,and Ian Post
Lower Bounds for the Graph Homomorphism Problem . . . . . . . . . . . . . . . . 481Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov,and Ivan Mihajlin
Contents – Part I XXXV
Parameterized Single-Exponential Time Polynomial Space Algorithmfor Steiner Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 494
Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan,and Saket Saurabh
Relative Discrepancy Does not Separate Informationand Communication Complexity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 506
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante,Mathieu Laurière, and Jérémie Roland
A Galois Connection for Valued Constraint Languages of Infinite Size. . . . . 517Peter Fulla and Stanislav Zivny
Approximately Counting H-Colourings Is #BIS-Hard . . . . . . . . . . . . . . . . . 529Andreas Galanis, Leslie Ann Goldberg, and Mark Jerrum
Taylor Polynomial Estimator for Estimating Frequency Moments. . . . . . . . . 542Sumit Ganguly
ETR-Completeness for Decision Versions of Multi-player (Symmetric)Nash Equilibria. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 554
Jugal Garg, Ruta Mehta, Vijay V. Vazirani, and Sadra Yazdanbod
Separate, Measure and Conquer: Faster Polynomial-Space Algorithmsfor Max 2-CSP and Counting Dominating Sets . . . . . . . . . . . . . . . . . . . . . 567
Serge Gaspers and Gregory B. Sorkin
Submatrix Maximum Queries in Monge Matrices Are Equivalentto Predecessor Search . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 580
Paweł Gawrychowski, Shay Mozes, and Oren Weimann
Optimal Encodings for Range Top-k, Selection, and Min-Max . . . . . . . . . . . 593Paweł Gawrychowski and Patrick K. Nicholson
2-Vertex Connectivity in Directed Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 605Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura,and Nikos Parotsidis
Ground State Connectivity of Local Hamiltonians . . . . . . . . . . . . . . . . . . . 617Sevag Gharibian and Jamie Sikora
Uniform Kernelization Complexity of Hitting Forbidden Minors . . . . . . . . . 629Archontia C. Giannopoulou, Bart M.P. Jansen, Daniel Lokshtanov,and Saket Saurabh
Counting Homomorphisms to Square-Free Graphs, Modulo 2 . . . . . . . . . . . 642Andreas Göbel, Leslie Ann Goldberg, and David Richerby
XXXVI Contents – Part I
Approximately Counting Locally-Optimal Structures . . . . . . . . . . . . . . . . . 654Leslie Ann Goldberg, Rob Gysel, and John Lapinskas
Proofs of Proximity for Context-Free Languages and Read-OnceBranching Programs (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . . . . 666
Oded Goldreich, Tom Gur, and Ron D. Rothblum
Fast Algorithms for Diameter-Optimally Augmenting Paths. . . . . . . . . . . . . 678Ulrike Große, Joachim Gudmundsson, Christian Knauer,Michiel Smid, and Fabian Stehn
Hollow Heaps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 689Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan,and Uri Zwick
Linear-Time List Recovery of High-Rate Expander Codes. . . . . . . . . . . . . . 701Brett Hemenway and Mary Wootters
Finding 2-Edge and 2-Vertex Strongly Connected Componentsin Quadratic Time. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 713
Monika Henzinger, Sebastian Krinninger, and Veronika Loitzenbauer
Improved Algorithms for Decremental Single-Source Reachabilityon Directed Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 725
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Weighted Reordering Buffer Improved via Variants of KnapsackCovering Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 737
Sungjin Im and Benjamin Moseley
Local Reductions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 749Hamid Jahanjou, Eric Miles, and Emanuele Viola
Query Complexity in Expectation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 761Jedrzej Kaniewski, Troy Lee, and Ronald de Wolf
Near-Linear Query Complexity for Graph Inference . . . . . . . . . . . . . . . . . . 773Sampath Kannan, Claire Mathieu, and Hang Zhou
A QPTAS for the Base of the Number of Crossing-Free Structureson a Planar Point Set. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 785
Marek Karpinski, Andrzej Lingas, and Dzmitry Sledneu
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. . . . . . 797Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi
Lower Bounds for Sums of Powers of Low Degree Univariates . . . . . . . . . . 810Neeraj Kayal, Pascal Koiran, Timothée Pecatte, and Chandan Saha
Contents – Part I XXXVII
Approximating CSPs Using LP Relaxation . . . . . . . . . . . . . . . . . . . . . . . . 822Subhash Khot and Rishi Saket
Comparator Circuits over Finite Bounded Posets . . . . . . . . . . . . . . . . . . . . 834Balagopal Komarath, Jayalal Sarma, and K.S. Sunil
Algebraic Properties of Valued Constraint Satisfaction Problem . . . . . . . . . . 846Marcin Kozik and Joanna Ochremiak
Towards Understanding the Smoothed Approximation Ratioof the 2-Opt Heuristic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 859
Marvin Künnemann and Bodo Manthey
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy . . . . . 872Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli
Replacing Mark Bits with Randomness in Fibonacci Heaps . . . . . . . . . . . . . 886Jerry Li and John Peebles
A PTAS for the Weighted Unit Disk Cover Problem . . . . . . . . . . . . . . . . . 898Jian Li and Yifei Jin
Approximating the Expected Values for Combinatorial OptimizationProblems Over Stochastic Points . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 910
Lingxiao Huang and Jian Li
Deterministic Truncation of Linear Matroids . . . . . . . . . . . . . . . . . . . . . . . 922Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan,and Saket Saurabh
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set . . . . 935Daniel Lokshtanov, M.S. Ramanujan, and Saket Saurabh
An Optimal Algorithm for Minimum-Link Rectilinear Pathsin Triangulated Rectilinear Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 947
Joseph S.B. Mitchell, Valentin Polishchuk, Mikko Sysikaski,and Haitao Wang
Amplification of One-Way Information Complexity via Codesand Noise Sensitivity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 960
Marco Molinaro, David P. Woodruff, and Grigory Yaroslavtsev
A (2+e)-Approximation Algorithm for the Storage Allocation Problem . . . . . 973Tobias Mömke and Andreas Wiese
Shortest Reconfiguration Paths in the Solution Spaceof Boolean Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 985
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak,and Venkatesh Raman
XXXVIII Contents – Part I
Computing the Fréchet Distance Between Polygons with Holes . . . . . . . . . . 997Amir Nayyeri and Anastasios Sidiropoulos
An Improved Private Mechanism for Small Databases . . . . . . . . . . . . . . . 1010Aleksandar Nikolov
Binary Pattern Tile Set Synthesis Is NP-Hard. . . . . . . . . . . . . . . . . . . . . . 1022Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz,and Shinnosuke Seki
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functionsin Terms of Fourier Sparsity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1035
Swagato Sanyal
Condensed Unpredictability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1046Maciej Skórski, Alexander Golovnev, and Krzysztof Pietrzak
Sherali-Adams Relaxations for Valued CSPs . . . . . . . . . . . . . . . . . . . . . . 1058Johan Thapper and Stanislav Zivny
Two-Sided Online Bipartite Matching and Vertex Cover: Beatingthe Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1070
Yajun Wang and Sam Chiu-wai Wong
The Simultaneous Communication of Disjointness with Applicationsto Data Streams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1082
Omri Weinstein and David P. Woodruff
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication. . . . 1094Huacheng Yu
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1107
Contents – Part I XXXIX
top related