Log in

Workshop on Randomized Algorithms
for Distributed Computing and Networks (RADICON)

21 July 2014, Rennes, France

The workshop is organized by the INRIA team ASAP, and its goal is to bring together experts in the area of randomized distributed algorithms in order to discuss problems in the area, present recent results, and identify new research challenges. This workshop is part of RADCON, a joint research project between ASAP and the University of Calgary.

Location: The workshop will take place at IRISA/INRIA Rennes, in the main amphitheater.

Registration: Attendance to the workshop is free, but registration is required as the maximum number of participants is limited. To register please send an email to ggiakkou@irisa.fr

Invited Speakers



8:55 Welcome
9:00 Sifters, consensus, and leader election
by James Aspnes
9:45 Are lock-free algorithms practically wait-free?
by Dan Alistarh
10:30 Coffee break
11:00 Randomized mutual exclusion in O(1) RMRs
by Philipp Woelfel
11:45 Sitting on a fence: Strong non-commutativity and memory ordering
by Hagit Attiya
12:30 Buffet lunch
14:00 Balls into bins via local search
by Thomas Sauerwald
14:45 Neighbourhood load balancing in graphs
by Petra Berenbrink
15:30 Coffee break
16:00 Distributed connectivity decomposition
by Keren Censor-Hillel
16:45 TBD: Three Backoff Dilemmas 
by Michael Bender & Seth Gilbert
17:30 End

Event: Trip to Mont Saint-Michel, Sunday 20/7

Left to right: George Giakkoupis, Hagit Attiya, Thomas Sauerwald, James Aspnes, Keren Censor-Hillel.