Abstract is missing.
- Algorithmic Aspects of Resource Management in the CloudSebastian Kniesburges, Christine Markarian, Friedhelm Meyer auf der Heide, Christian Scheideler. 1-13 [doi]
- Communication Complexity Lower Bounds in Distributed Message-PassingRotem Oshman. 14-17 [doi]
- Distributed Algorithmic Foundations of Dynamic NetworksGopal Pandurangan. 18-22 [doi]
- The Beachcombers' Problem: Walking and Searching with Mobile RobotsJurek Czyzowicz, Leszek Gasieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie. 23-36 [doi]
- Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing SystemsDamien Imbs, Sergio Rajsbaum, Michel Raynal, Julien Stainer. 37-53 [doi]
- Distributed Transactional Contention Management as the Traveling Salesman ProblemBo Zhang, Binoy Ravindran, Roberto Palmieri. 54-67 [doi]
- The Complexity Gap between Consensus and Safe-Consensus - (Extended Abstract)Rodolfo Conde, Sergio Rajsbaum. 68-82 [doi]
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and DeterminismFlorent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca. 83-95 [doi]
- Approximation of the Degree-Constrained Minimum Spanning HierarchiesMiklós Molnár, Sylvain Durand, Massinissa Merabet. 96-107 [doi]
- Secluded Path via Shortest PathMatthew P. Johnson, Ou Liu, George Rabanca. 108-120 [doi]
- Distributed Approximation of Minimum Routing Cost TreesAlexandra Hochuli, Stephan Holzer, Roger Wattenhofer. 121-136 [doi]
- Randomized Lower Bound for Distributed Spanning-Tree VerificationTaisuke Izumi. 137-148 [doi]
- Lessons from the Congested Clique Applied to MapReduceJames W. Hegeman, Sriram V. Pemmaraju. 149-164 [doi]
- Oblivious Rendezvous in Cognitive Radio NetworksZhaoquan Gu, Qiang-Sheng Hua, Yuexuan Wang, Francis Chi-Moon Lau. 165-179 [doi]
- Local Broadcasting with Arbitrary Transmission Power in the SINR ModelFabian Fuchs, Dorothea Wagner. 180-193 [doi]
- Continuous Aggregation in Dynamic Ad-Hoc NetworksSebastian Abshoff, Friedhelm Meyer auf der Heide. 194-209 [doi]
- Network Creation Games with Traceroute-Based StrategiesDavide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti. 210-223 [doi]
- Patrolling by Robots Equipped with VisibilityJurek Czyzowicz, Evangelos Kranakis, Dominik Pajak, Najmeh Taleb. 224-234 [doi]
- Distributed Barrier Coverage with Relocatable SensorsMohsen Eftekhari Hesari, Paola Flocchini, Lata Narayanan, Jaroslav Opatrny, Nicola Santoro. 235-249 [doi]
- Exploration of Constantly Connected Dynamic Graphs Based on CactusesDavid Ilcinkas, Ralf Klasing, Ahmed Mouhamadou Wade. 250-262 [doi]
- How Many Ants Does It Take to Find the Food?Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer. 263-278 [doi]
- What Do We Need to Know to Elect in Networks with Unknown Participants?Jérémie Chalopin, Emmanuel Godard, Antoine Naudin. 279-294 [doi]
- Rendezvous of Distance-Aware Mobile Agents in Unknown GraphsShantanu Das 0001, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski. 295-310 [doi]
- Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted NetworksDariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner. 311-326 [doi]
- Move-Optimal Partial Gathering of Mobile Agents in Asynchronous TreesMasahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa. 327-342 [doi]
- A Recursive Approach to Multi-robot Exploration of TreesChristian Ortolf, Christian Schindelhauer. 343-354 [doi]
- Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty HostEvangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis, Matoula Petrolia. 355-370 [doi]