default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21. SIROCCO 2014: Takayama, Japan
- Magnús M. Halldórsson:
Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings. Lecture Notes in Computer Science 8576, Springer 2014, ISBN 978-3-319-09619-3
Invited Presentations
- Sebastian Kniesburges, Christine Markarian, Friedhelm Meyer auf der Heide, Christian Scheideler:
Algorithmic Aspects of Resource Management in the Cloud. 1-13 - Rotem Oshman:
Communication Complexity Lower Bounds in Distributed Message-Passing. 14-17 - Gopal Pandurangan
:
Distributed Algorithmic Foundations of Dynamic Networks. 18-22
Best Student Paper
- Jurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie:
The Beachcombers' Problem: Walking and Searching with Mobile Robots. 23-36
Shared Memory and Multiparty Communication
- Damien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer:
Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems. 37-53 - Bo Zhang, Binoy Ravindran, Roberto Palmieri:
Distributed Transactional Contention Management as the Traveling Salesman Problem. 54-67 - Rodolfo Conde, Sergio Rajsbaum:
The Complexity Gap between Consensus and Safe-Consensus - (Extended Abstract). 68-82 - Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. 83-95
Network Optimization
- Miklós Molnár, Sylvain Durand, Massinissa Merabet:
Approximation of the Degree-Constrained Minimum Spanning Hierarchies. 96-107 - Matthew P. Johnson, Ou Liu, George Rabanca:
Secluded Path via Shortest Path. 108-120
CONGEST Algorithms and Lower Bounds
- Alexandra Hochuli, Stephan Holzer, Roger Wattenhofer:
Distributed Approximation of Minimum Routing Cost Trees. 121-136 - Taisuke Izumi:
Randomized Lower Bound for Distributed Spanning-Tree Verification. 137-148 - James W. Hegeman, Sriram V. Pemmaraju:
Lessons from the Congested Clique Applied to MapReduce. 149-164
Wireless networks
- Zhaoquan Gu, Qiang-Sheng Hua, Yuexuan Wang, Francis Chi-Moon Lau:
Oblivious Rendezvous in Cognitive Radio Networks. 165-179 - Fabian Fuchs, Dorothea Wagner:
Local Broadcasting with Arbitrary Transmission Power in the SINR Model. 180-193
Aggregation and Creation Games in Networks
- Sebastian Abshoff, Friedhelm Meyer auf der Heide:
Continuous Aggregation in Dynamic Ad-Hoc Networks. 194-209 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Network Creation Games with Traceroute-Based Strategies. 210-223
Patrolling and Barrier Coverage
- Jurek Czyzowicz, Evangelos Kranakis, Dominik Pajak, Najmeh Taleb:
Patrolling by Robots Equipped with Visibility. 224-234 - Mohsen Eftekhari Hesari, Paola Flocchini, Lata Narayanan, Jaroslav Opatrny, Nicola Santoro:
Distributed Barrier Coverage with Relocatable Sensors. 235-249
Exploration
- David Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade:
Exploration of Constantly Connected Dynamic Graphs Based on Cactuses. 250-262 - Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer:
How Many Ants Does It Take to Find the Food? 263-278 - Jérémie Chalopin, Emmanuel Godard, Antoine Naudin:
What Do We Need to Know to Elect in Networks with Unknown Participants? 279-294
Rendezvous
- Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. 295-310 - Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. 311-326
Mobile Agents
- Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees. 327-342 - Christian Ortolf, Christian Schindelhauer:
A Recursive Approach to Multi-robot Exploration of Trees. 343-354 - Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia:
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. 355-370
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 2025-11-22 03:45 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:
