Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th SIROCCO 2019: L'Aquila, Italy
- Keren Censor-Hillel, Michele Flammini:
Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings. Lecture Notes in Computer Science 11639, Springer 2019, ISBN 978-3-030-24921-2
Invited Talks
- Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. 3-18 - Paola Flocchini:
On Sense of Direction and Mobile Agents. 19-33
Regular Papers
- Alkida Balliu
, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela:
Locality of Not-so-Weak Coloring. 37-51 - Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák:
Near-Gathering of Energy-Constrained Mobile Agents. 52-65 - Joffroy Beauquier, Janna Burman, Peter Davies, Fabien Dufoulon:
Optimal Multi-broadcast with Beeps Using Group Testing. 66-80 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Tracking Routes in Communication Networks. 81-93 - Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau:
Positional Encoding by Robots with Non-rigid Movements. 94-108 - Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary, Buddhadeb Sau:
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights. 109-123 - Sebastian Brandt, Manuela Fischer, Jara Uitto:
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory. 124-138 - Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. 139-153 - Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Alfredo Navarra:
Asynchronous Rendezvous with Different Maps. 154-169 - Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. 170-184 - Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende:
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model. 185-199 - Yann Disser, Sören Schmitt:
Evacuating Two Robots from a Disk: A Second Cut. 200-214 - Anne-Laure Ehresmann, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny:
Distributed Pattern Formation in a Ring. 215-229 - Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
On Distributed Merlin-Arthur Decision Protocols. 230-245 - Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Anonymous Read/Write Memory: Leader Election and De-anonymization. 246-261 - Thorsten Götte, Kristian Hinnenthal, Christian Scheideler:
Faster Construction of Overlay Networks. 262-276 - Masahiro Shibata, Norikazu Kawata, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings. 277-292 - Gadi Taubenfeld:
Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects. 293-308 - Volker Turau:
Making Randomized Algorithms Self-stabilizing. 309-324
Brief Announcements
- Bertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn:
How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant Patterning. 327-331 - Chen Avin, Ingo van Duijn, Stefan Schmid:
Self-adjusting Linear Networks. 332-335 - Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya:
Mutual Visibility for Asynchronous Robots. 336-339 - Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. 340-344 - Jannik Castenow, Christina Kolb, Christian Scheideler:
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. 345-348 - Adam Heriban, Sébastien Tixeuil:
Mobile Robots with Uncertain Visibility Sensors. 349-352 - Koki Inoue, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault. 353-356 - Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume:
Explicit and Tight Bounds of the Convergence Time of Average-Based Population Protocols. 357-360 - Oscar Morales-Ponce:
Visiting Infinitely Often the Unit Interval While Minimizing the Idle Time of High Priority Segments. 361-365
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
