Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
d Abstract) Marcos K. Aguilera1 , Eli Gafni1,2 , and Leslie Lamport1 1 Microsoft Research Silicon Valley 2 UCLA We propose and solve a synchronization problem called the mailbox pr...
Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport