Computing on an anonymous ring

Authors:
Chagit Attiya;Marc Snir;Manfred Warmuth
Affiliations:
Department of Mathematics and Computer Science, Hebrew University, Givat Ram, Jerusalem, Israel;Department of Mathematics and Computer Science, Hebrew University, Givat Ram, Jerusalem, Israel;Department of Computer Science, University of California, Santa Cruz, Ca
Venue:
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Year:
1985

Electing a leader in a synchronous ring

Journal of the ACM (JACM)
Gap theorems for distributed computing

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
On the bit complexity of distributed computations in a ring with a leader

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The effects of link failures on computations in asynchronous rings

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Computing on an anonymous network

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A trade-off between information and communication in broadcast protocols

Journal of the ACM (JACM)
Self-stabilizing symmetry breaking in constant-space (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two lower bounds in asynchronous distributed computation

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Hi-index	0.01