New Topics in Distributed Algorithms

April 8^th, 2010 - EPFL, Switzerland

Speakers include:

• Hagit Attiya (Technion, Israel and EPFL, Switzerland)
• Rida Bazzi (Arizona State University, USA)
• Michael Bender (Stony Brook U. and Tokutek, USA)
• Christian Cachin (IBM Zurich, Switzerland)
• Wei Chen (Microsoft Research Asia, China)
• Bogdan Chlebus (University of Colorado Denver, USA)
• Carole Delporte-Gallet (LIAFA-Université Paris-Diderot, France)
• Antonio Fernández (Universidad Rey Juan Carlos, Spain)
• Roy Friedman (Technion, Israel)
• Danny Hendler (Ben-Gurion University, Israel)
• Anne-Marie Kermarrec (INRIA Rennes Bretagne Atlantique, France)
• Dariusz Kowalski (University of Liverpool, UK)
• Maged Michael (IBM Watson Research Center, USA)
• Marina Papatriantafilou (Chalmers University of Technology, Sweden)
• Franck Petit (LIP6, University Paris 6, France)
• Luis Rodrigues (INESC-ID/ IST, Portugal)
• Eric Ruppert (York University, Canada)
• Jan Vitek (Purdue University, USA)

Venue

Program

Time	Speaker	Affiliations	Title
9:00	Bogdan Chlebus	University of Colorado	Quantum Distributed Computing
9:20	Rida Bazzi	Arizona State University	Runtime Updates in Distributed Systems
9:40	Marina Papatriantafilou	Chalmers University of Technology	Overlays with preferences: Approximation algorithms for matching with preference lists
10:00	Anne-Marie Kermarrec	INRIA Bretagne Atlantique	Decentralizing and personalizing navigation in the Web 2.0
10:20	Wei Chen	MSR China	Compact routing in power-law graphs
Break
11:00	Antonio Fernández	Universidad Rey Juan Carlos	Routing for Energy Minimization in the Speed Scaling Model
11:20	Darek Kowalski	University of Liverpool	Towards the best wireless model ever - from algorithmic perspective
11:40	Dan Alistarh	EPFL	How Efficient is Robust Gossip?
12:00	Luis Rodrigues	INES-ID/IST	Observable Non-Sybil Quorum Construction in One-Hop Wireless Ad Hoc Networks
12:20	Franck Petit	LIP6	Deaf, Dumb, and Chatting Asynchronous Robots. Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot
Lunch
14:40	Eric Ruppert	York University	Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
15:00	Maysam Yabandeh	EPFL	Obfuscated Byzantine Fault Tolerance
15:20	Carole Delporte-Gallet	LIAFA, U. Paris Diderot	The disagreement power of an adversary
15:40	Christian Cachin	IBM Zurich	Intrusion-Safe Services
16:00	Hagit Attiya	Technion and EPFL	Good fences make good neighbors (and correct programs)
Break
16:40	Maged Michael	IBM Watson Research Center	Software Lock Elision for Read-Only Critical Sections in Java
17:00	Vincent Gramoli	EPFL and U. of Neuchatel	Elastic Transactions in Concurrent Programs
17:20	Michael Bender	Stony Brooks U. and Totutek	Performance of Fractal-Tree Databases
17:40	Aleksandar Dragojevic	EPFL	Predicting the Scalability of an STM: A Pragmatic Approach
18:00	Danny Hendler	Ben Gurion University	Scheduling-based Transactional Memory

Organization

---

last update: March 24th, 2010