Structural Information and Communication Complexity: 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015, Post-Proceedings PDF
Preview Structural Information and Communication Complexity: 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015, Post-Proceedings
Christian Scheideler (Ed.) S c h e i d e l e Structural Information r ( E 9 d . 3 and Communication ) 4 9 S C Complexity N L 22nd International Colloquium, SIROCCO 2015 LNCS 9439 Montserrat, Spain, July 14–16, 2015 Post-Proceedings CS ot r mu mc t uu nr a icl aI n t if oo nr m C oa t m i o pn le a xn i td y 123 Lecture Notes in Computer Science 9439 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen EditorialBoard David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zürich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany Moreinformationaboutthisseriesathttp://www.springer.com/series/7407 Christian Scheideler (Ed.) Structural Information and Communication Complexity 22nd International Colloquium, SIROCCO 2015 Montserrat, Spain, July 14–16, 2015 Post-Proceedings ABC Editor ChristianScheideler DepartmentofComputerScience UniversityofPaderborn Paderborn Germany ISSN0302-9743 ISSN1611-3349 (electronic) LectureNotesinComputerScience ISBN978-3-319-25257-5 ISBN978-3-319-25258-2 (eBook) DOI10.1007/978-3-319-25258-2 LibraryofCongressControlNumber:2015950867 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues SpringerChamHeidelbergNewYorkDordrechtLondon (cid:2)c SpringerInternationalPublishingSwitzerland2015 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe materialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,broad- casting,reproduction onmicrofilmsorinanyotherphysicalway,andtransmissionorinformationstorage andretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynowknown orhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher, theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbook arebelievedtobetrueandaccurateatthedateofpublication. Neitherthepublishernortheauthorsorthe editorsgiveawarranty,expressorimplied,withrespecttothematerialcontainedhereinorforanyerrorsor omissionsthatmayhavebeenmade. Printedonacid-freepaper SpringerInternationalPublishingAGSwitzerlandispartofSpringerScience+BusinessMedia (www.springer.com) Preface This volume contains the papers presented at SIROCCO 2015, the 22nd International Colloquium on Structural Information and Communication Com- plexity, heldduring July 14-16,2015,inMontserrat.Financial supportwas pro- vided by the Catalan Society of Mathematics and the Spanish Royal Society of Mathematics. SIROCCO is devoted to the study of the interplay between communica- tion and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints. Special emphasis is givento innovativeapproachesand fundamental understanding, in addition to efforts to optimize current designs. SIROCCO has a tradition of interesting and productive scientific meetings in a relaxed and pleasant atmosphere, attracting leading researchers in a variety of fields in which communication and knowledge play a significantrole. This time, there were 78 submissions from 26 countries. Each submission was reviewed by at least three Program Committee members with the help of external review- ers, and the committee decided to accept 30 papers after electronic discussions. Of these papers, the papers“Under the Hood of the Bakery Algorithm: Mutual ExclusionasaMatterofPriority”byKatiaPatkinandYoramMosesand“Ran- domized OBDD-BasedGraph Algorithms”by Marc Bury won the Best Student Paper Awards. The program also includes six keynotes from Michel Raynal, Miquel Angel Fiol, Nati Linial, Saket Navlakha, Bernhard Haeupler, and Amos Korman. As the program chair of SIROCCO 2015, I would very much like to thank the Program Committee for all of their hard work during the paper selection process, which ran on a very tight schedule this time. I am also grateful to the external reviewers for their valuable and insightful comments and to EasyChair for providing a system that was indeed easy to use. Also many thanks to the invited speakers for accepting my invitations and giving very interesting and inspiringtalks.Finally,IamverygratefultothechairoftheSteeringCommittee, Shay Kutten, for his valuable advice, and the OrganizingCommittee headed by Xavier Munoz for their time and effort to ensure a successful meeting. Without all of these people it wouldnothavebeen possibleto comeup with sucha great event. August 2015 Christian Scheideler Organization Program Committee James Aspnes Yale University, USA Ioannis Chatzigiannakis Sapienza University of Rome, Italy Andrea Clementi University of Rome Tor Vergata, Italy Colin Cooper King’s College London, UK Faith Ellen University of Toronto, Canada Robert Els¨asser University of Salzburg, Austria Yuval Emek Technion, Israel Sa´ndor Fekete Technical University of Braunschweig, Germany Pascal Felber University of Neuchatel, Switzerland Pierre Fraigniaud CNRS and University Paris Diderot, France Taisuke Izumi Nagoya Institute of Technology, Japan Adrian Kosowski Inria Paris, France Christoph Lenzen MPI Saarbru¨cken, Germany Boaz Patt-Shamir Tel Aviv University, Israel Sriram Pemmaraju University of Iowa, USA Seth Pettie University of Michigan, USA Sergio Rajsbaum UNAM, Mexico Andrea Richa Arizona State University, USA Harald R¨acke TU Mu¨nchen, Germany Nicola Santoro Carleton University, Canada Christian Scheideler University of Paderborn, Germany Christian Schindelhauer University of Freiburg, Germany Philippas Tsigas Chalmers University of Technology, Sweden Roger Wattenhofer ETH Zu¨rich, Switzerland Philipp Woelfel University of Calgary, Canada Additional Reviewers Aghazadeh, Zahra Brahma, Siddhartha Avin, Chen Carmel, Yuval Bal, Deepak Casteigts, Arnaud Bampas, Evangelos Cord-Landwehr, Andreas Barenboim, Leonid Czygrinow, Andrzej Becchetti, Luca Das, Shantanu Berenbrink, Petra Denysyuk, Oksana Bonato, Anthony Di Luna, Giuseppe Antonio VIII Organization Eren, Tolga Natale, Emanuele Even, Guy Navarra, Alfredo Fekete, Sa´ndor Ortolf, Christian Gasieniec, Leszek Palfrader, Peter Gavoille, Cyril Panagopoulou,Panagiota Georgiou, Chryssis Pasquale, Francesco Georgiou, Konstantinos Pavlogiannis,Andreas Godard, Emmanuel Pelc, Andrzej Hadzilacos, Vassos Peleg, David Haeupler, Bernhard Podlipyan, Pavel Hegeman, James Rivera, Nicol´as Ilcinkas, David Rivi`ere, Etienne Jakoby, Andreas Rossi, Gianluca Jurdzinski, Tomasz Ruppert, Eric Klasing, Ralf Ro´z˙an´ski, Micha(cid:3)l Kuhn, Fabian Scalosub, Gabriel Labourel, Arnaud Schmidt, Christiane Larrea, Mikel Stauffer, Alexandre Leucci, Stefano Sutra, Pierre Lotker, Zvi Tanigawa, Shin-Ichi Mallmann-Trenn, Frederik Trinker, Horst Markou, Euripides Uznan´ski, Przemys(cid:3)law Martin, Russell Vaccaro, Ugo Mercier, Hugues Viglietta, Giovanni Michail, Othon Westermann, Matthias Miller, Avery Yamauchi, Yukiko Monaco, Gianpiero Contents Communication Patterns and Input Patterns in Distributed Computing (Invited Talk)......................................... 1 Michel Raynal Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach................................ 16 Ofer Feinerman and Amos Korman Node Labels in Local Decision ..................................... 31 Pierre Fraigniaud, Juho Hirvonen, and Jukka Suomela Exact Bounds for Distributed Graph Colouring ...................... 46 Joel Rybicki and Jukka Suomela Essential Traffic Parameters for Shared Memory Switch Performance ... 61 Patrick Eugster, Alex Kesselman, Kirill Kogan, Sergey Nikolenko, and Alexander Sirotkin Scheduling Multipacket Frames with Frame Deadlines ................ 76 L(cid:2)ukasz Jez˙, Yishay Mansour, and Boaz Patt-Shamir A Randomized Algorithm for Online Scheduling with Interval Conflicts........................................................ 91 Marcin Bienkowski, Artur Kraska, and Pawel(cid:2) Schmidt Online Admission Control and Embedding of Service Chains .......... 104 Tam´as Lukovszki and Stefan Schmid Optimizing Spread of Influence in Social Networks via Partial Incentives ................................................ 119 Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, and Ugo Vaccaro Approximation Algorithms for Multi-budgeted Network Design Problems ....................................................... 135 Georgios Stamoulis Simple Distributed Δ+1 Coloring in the SINR Model................ 149 Fabian Fuchs and Roman Prutkin Nearly Optimal Local Broadcasting in the SINR Model with Feedback ................................................... 164 Leonid Barenboim and David Peleg Byzantine Gathering in Networks .................................. 179 S´ebastien Bouchard, Yoann Dieudonn´e, and Bertrand Ducourthial X Contents Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t<n/3, O(n2) Messages, and Constant Time... 194 Achour Most´efaoui and Michel Raynal A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Extended Abstract) ........ 209 Leonid Barenboim, Michael Elkin, and Cyril Gavoille Path-Fault-TolerantApproximate Shortest-PathTrees ................ 224 Annalisa D’Andrea, Mattia D’Emidio, Daniele Frigioni, Stefano Leucci, and Guido Proietti A Faster Computation of All the Best Swap Edges of a Tree Spanner ... 239 Davide Bil`o, Feliciano Colella, Luciano Gual`a, Stefano Leucci, and Guido Proietti Randomized OBDD-Based Graph Algorithms........................ 254 Marc Bury On Fast and Robust Information Spreading in the Vertex-Congest Model .......................................................... 270 Keren Censor-Hillel and Tariq Toukan Information Spreading by Mobile Particles on a Line ................. 285 Jurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco, and Dominik Pajak (cid:3) On Space and Time Complexity of Loosely-Stabilizing Leader Election ........................................................ 299 Taisuke Izumi Wait-Free Gathering Without Chirality ............................. 313 Quentin Bramas and S´ebastien Tixeuil Treasure Hunt with Advice........................................ 328 Dennis Komm, Rastislav Kr´aloviˇc, Richard Kra´loviˇc, and Jasmin Smula Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ... 342 Klaus-Tycho F¨orster, Rijad Nuridini, Jara Uitto, and Roger Wattenhofer Collaborative Exploration by Energy-ConstrainedMobile Robots ...... 357 Shantanu Das, Dariusz Dereniowski, and Christina Karousatou Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model ........................... 370 Jarkko Kari, Martin Matamala, Ivan Rapaport, and Ville Salo
The list of books you might like
