Tue, Oct 2
|
|
17:30 - 19:00
|
REGISTRATION
|
| 19:00 - |
WELCOME RECEPTION |
| |
Wed, Oct 3
|
08:00 - 09:00
|
REGISTRATION
|
09:00 -
09:15
|
WELCOME
|
09:15 -
10:15
|
Invited Lecture,
Gerard LeLann
|
10:15 -
10:35
|
BREAK
|
10:35 -
11:50
|
Session 1
|
|
|
10:35
|
Yong-Jik Kim and James Anderson
A Time Complexity Bound for Adaptive Mutual Exclusion
Winner of Best Student Paper Award |
|
|
11:00
|
Yuh-Jzer Joung
Quorum-Based Algorithms for Group Mutual Exclusion |
|
|
11:25
|
Paolo Boldi and Sebastiano Vigna
An Effective Characterization of Computability in Anonymou Networks |
11:50 -
13:50
|
LUNCH
|
13:50 -
14:40
|
Session 2
|
|
|
13:50
|
John Douceur and Roger Wattenhofer
Competitive Hill-Climbing Strategies for Replica Placement in a
Distributed File System |
|
|
14:15
|
Dahlia Malkhi, Elan Pavlov and Yaron Sella
Optimal Unconditional Information Diffusion |
14:40 -
15:00
|
BREAK
|
15:00 -
16:15
|
Session 3
|
|
|
15:00
|
Neeraj Mittal and Vijay Garg
Computation Slicing: Techniques and Theory |
|
|
15:25
|
Ricardo Jimenez-Peris, marta
Patino-Martinez, Gustavo
Alonso and Sergio Arevalo
A Low-Latency Non-Blocking Commit Service |
|
|
15:50
|
Marcos Aguilera, Carole
Delporte-Gallet, Hugues Fauconnier
and Sam Toueg
Stable Leader Election |
16:30
|
BUSINESS MEETING
|
| |
Thu, Oct 4
|
| 08:00 - 09:00 |
REGISTRATION |
09:00 -
10:15
|
Session 4
|
|
|
09:00
|
Zhiying Liang and Lisa Higham
Self-Stabilizing Minimum Spanning Tree Construction on
Message-Passing Networks |
|
|
09:25
|
Maurice Herlihy and Srikanta Tirthapura
Self Stabilizing Distributed Queuing |
|
|
09:50
|
Faith Fich and Colette Johnen
A Space Optimal,
Deterministic, Self-Stabilizing, Leader Election
Algorithm for Unidirectional Rings |
10:15 -
10:35
|
BREAK
|
10:35 -
11:50
|
Session 5
|
|
|
10:35
|
Marie Duflot, Laurent Fribourg and Claudine Picaronny
Randomized Finite-State Distributed Algorithms As Markov Chains |
|
|
11:00
|
Michiko Inoue, Shinya Umetani, Toshimitsu Masuzawa and
Hideo Fujiwara
Adaptive Long-Lived O(k^2)-Renaming with O(k^2) Steps |
|
|
11:25
|
Maurice Herlihy, Sergio Rajsbaum and Mark Tuttle
A New Synchronous Lower Bound for Set Agreement |
11:50 -
13:50
|
LUNCH
|
13:50 -
14:40
|
Session 6, Brief
Announcements
|
|
|
13:50
|
Mikel Larrea, Antonio Fernandez and Sergio Arevalo
On the Impossibility of Implementing Perpetual Failure in Partially
Synchronous Systems |
|
|
14.00
|
Felix Gaertner and Stefan Pleisch
(Im)Possibilities of Predicate Detection in Crash-Affected Systems |
|
|
14:10
|
Felix Gaertner and Hagen Voelzer
Defining Redundancy in Fault-Tolerant Systems |
|
|
14:20
|
Ernesto Jimenez, Antonio Fernandez and Vicente Cholvi
A Parameterized Algorithm that Implements
Sequential, Causal and
Cache Memory Consistency |
|
|
14:30
|
Sen Moriya and Tadashi Araragi
Dynamic Snapshot Algorithm and Partial Rollback Algorithm for
Internet Agents |
14:40 -
15:00
|
BREAK
|
|
15:00 - 16:15
|
Session 7
|
|
|
15.00
|
Chryssis Georgiou, Alexander Russell and Alex Shvartsman
The Complexity of Synchronous Iterative Do-All with Crashes |
|
|
15:25
|
Stefan Dobrev, Paola
Flocchini, Giuseppe Prencipe and
Nicolo Santoro
Mobile Search for a Black Hole in Anonymous Rings |
|
|
15:50
|
Jaap-Henk Hoepman
Randomised Mutual Search |
|
17:30 -
|
TOUR AND BANQUET
|
| |
Fri, Oct 5
|
| 08:30 - 09:00 |
REGISTRATION |
|
09:00 - 10:00
|
Invited Lecture, David Peleg
(slides)
|
|
10:00 - 10:20
|
BREAK
|
|
10:20 - 11:35
|
Session 8
|
|
|
10:20
|
David Peleg and Uri Pincas
The Average Hop Count Measure for Virtual Path Layouts
|
|
|
10:45
|
Lali Barriere, Pierre
Fraigniaud, Evangelos Kranakis and Danny Krizanc
Efficient Routing in Networks with Long Range Contacts
|
|
|
11:10
|
I. Chatzigiannakis, S. Nikoletseas and P. Spirakis
An Efficient Communication Strategy for Ad-hoc Mobile Networks
|
|
11:35 - 11:45
|
BREAK (no coffee)
|
11:45 -
13:00
|
Session 9
|
|
|
11:45
|
Timothy Harris
A Pragmatic Implementation of Non-Blocking Linked Lists
|
|
|
12:10
|
Ted Herman and Toshimitsu Masuzawa
Stabilizing Replicated Search Trees
|
|
|
12:35
|
Panagiota Fatourou and Maurice Herlihy
Adding Networks
|
