default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23. SIROCCO 2016: Helsinki, Finland
- Jukka Suomela
:
Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Helsinki, Finland, July 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9988, 2016, ISBN 978-3-319-48313-9
Message Passing
- Othon Michail, Paul G. Spirakis:
How Many Cooks Spoil the Soup? 3-18 - Yuval Emek, Jara Uitto:
Dynamic Networks of Finite State Machines. 19-34 - Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? 35-48 - Shay Moran, Makrand Sinha, Amir Yehudayoff:
Fooling Pairs in Randomized Communication Complexity. 49-59 - Orr Fischer, Rotem Oshman, Uri Zwick:
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity. 60-74 - Gopal Pandurangan, David Peleg, Michele Scquizzato:
Message Lower Bounds via Efficient Network Synchronization. 75-91 - Lewis Tseng:
Recent Results on Fault-Tolerant Consensus in Message-Passing Networks. 92-108
Shared Memory
- Armando Castañeda, Pierre Fraigniaud, Eli Gafni, Sergio Rajsbaum, Matthieu Roy:
Asynchronous Coordination Under Preferences and Constraints. 111-126 - James Aspnes, Keren Censor-Hillel, Eitan Yaakobi:
Concurrent Use of Write-Once Memory. 127-142 - Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi:
In the Search for Optimal Concurrency. 143-158 - Gal Amram:
The F-Snapshot Problem. 159-176 - Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum, Michel Raynal:
t-Resilient Immediate Snapshot Is Impossible. 177-191
Mobile Agents
- Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka, Dominik Pajak:
Linear Search by a Pair of Distinct-Speed Robots. 195-211 - Samir Elouasbi, Andrzej Pelc:
Deterministic Meeting of Sniffing Agents in the Plane. 212-227 - Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, Lukasz Kuszner:
Distributed Evacuation in Graphs with Multiple Exits. 228-241 - Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Universal Systems of Oblivious Mobile Robots. 242-257 - Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. 258-274 - Jurek Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter:
Communication Problems for Mobile Agents Exchanging Energy. 275-288
Data Dissemination and Routing
- Kokouvi Hounkanli, Andrzej Pelc:
Asynchronous Broadcasting with Bivalent Beeps. 291-306 - Alkida Balliu, Pierre Fraigniaud, Zvi Lotker, Dennis Olivetti:
Sparsifying Congested Cliques and Core-Periphery Networks. 307-322 - Sebastian Daum, Fabian Kuhn, Yannic Maus:
Rumor Spreading with Bounded In-Degree. 323-339 - Manuel Lafond, Lata Narayanan, Kangkang Wu:
Whom to Befriend to Influence People. 340-357 - Philipp Brandes, Marcin Kardas, Marek Klonowski, Dominik Pajak, Roger Wattenhofer:
Approximating the Size of a Radio Network in Beeping Model. 358-373 - Guy Even, Matthias Rost, Stefan Schmid:
An Approximation Algorithm for Path Computation and Function Placement in SDNs. 374-390 - Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Transiently Consistent SDN Updates: Being Greedy is Hard. 391-406
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-11-11 21:16 CET 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:
