Sciweavers

JACM
2008
90views more  JACM 2008»
15 years 10 days ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum