Program

Saturday June 30:

08:00 Registration

08:30-09:20 Chair: Guy Even

Invited talk : Boaz Patt-Shamir. No Piece Missing: Online Set Packing

09:20-09:45 Coffee break

09:45-11:00 Chair: Magnus M. Halldorsson

Ioannis Caragiannis and Christos Kalaitzis. Space lower bounds for low-stretch greedy embeddings

Shiri Chechik and David Peleg. The Fault Tolerant Capacitated k-Center Problem

Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten and David Peleg. Notions of Connectivity in Overlay Networks

11:00-11:10 Break

11:10-12:00 Chair: Pierre Fraigniaud

Amotz Bar-Noy, Ben Baumer and Dror Rawitz. Changing of the Guards: Strip Cover with Duty Cycling

Henning Hasemann, Juho Hirvonen, Joel Rybicki and Jukka Suomela. Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring

12:00-13:30 Lunch

13:30-14:45 Chair: Amos Korman

Peter Pietrzyk, Peter Kling and Friedhelm Meyer auf der Heide. An Algorithm for Online Facility Leasing

Martin Biely, Peter Robinson and Ulrich Schmid. Agreement in Directed Dynamic Networks

Majid Khabbazian, Stephane Durocher and Alireza Haghnegahdar. Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position

14:45-15:15 Coffee break

15:15-16:30 Chair: Toshimitsu Masuzawa

Evangelos Kranakis, Lata Narayanan, Fraser MacQuarrie, Oscar Morales Ponce and Mohsen Eftekhari Hesari. Strong Connectivity of Sensor Networks with Double Antennae

Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Haisheng Tan and Francis C.M. Lau. Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model

Eyjólfur Ingi Ásgeirsson, Magnus M. Halldorsson and Pradipta Mitra. Wireless Network Stability in the SINR Model

17:00-18:00 Business Meeting

18:00-21:00 Reception

Sunday July 1:

08:30-09:20 Chair: Shay Kutten

SIROCCO Prize Lecture: Roger Wattenhofer. Distributed Complexity Theory.

09:20-09:45 Coffee break

09:45-11:00 Chair: Friedhelm Meyer auf der Heide

Heger Arfaoui and Pierre Fraigniaud. What can be computed without communications?

Vittorio Bilo', Michele Flammini and Vasco Gallotti. On Bidimensional Congestion Games

Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco and Luca Moscardelli. Mobile Network Creation Games

11:00-11:10 Break

11:10-12:00 Chair:

Carole Delporte-Gallet, Hugues Fauconnier and Hung Tran-The. Homonyms with forgeable identifiers

Xavier Vilaça, Oksana Denysyuk and Luis Rodrigues. Asynchrony and Collusion in the N-party BAR Transfer Problem

12:00-13:30 Lunch

13:30-18:45 Excursion: Reykjanes and Blue Lagoon

18:45 Dinner party

Monday July 2:

08:30-10:10 Chair: Andrzej Pelc

Dan Alistarh, Hagit Attiya, Rachid Guerraoui and Corentin Travers. Early Deciding Synchronous Renaming in O(log f) Rounds or Less

Jérémie Chalopin, Métivier Yves and Thomas Morsellino. On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems

Andreas Larsson and Philippas Tsigas. Self-stabilizing (k,r)-clustering in Clock Rate-limited Systems

Michel Raynal and Julien Stainer. Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors

10:10-10:45 Coffee break

10:45-12:00 Chair: Fukuhito Ooshita

Samir Elouasbi and Andrzej Pelc. Time of anonymous rendezvous in trees: Determinism vs. randomization

Stéphane Devismes, Pascal Lafourcade, Karine Altisen and Antoine Gerbaud. Analysis of Random Walks using Tabu Lists

Stefan Dobrev, Rastislav Královič and Euripides Markou. Online Graph Exploration with Advice

12:00-13:30 Lunch

13:30-14:45 Chair: Ralf Klasing

Balasingham Balamohan, Stefan Dobrev, Paola Flocchini and Nicola Santoro. Asynchronous exploration of an unknown anonymous dangerous graph with O(1) pebbles

Iftah Gamzu and Moti Medina. Improved Approximation for Orienting Mixed Graphs

Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa. Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks

14:45-15:10 Coffee break

15:10-16:00 Chair: Rastislav Královic

Giovanni Viglietta, Giuseppe Prencipe and Linda Pagli. Getting Close Without Touching

Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing and Alfredo Navarra. Gathering of Robots on Anonymous Grids without multiplicity detection