Efficient asynchronous distributed symmetry breaking

DOI10.1145/195058.195136zbMath1344.68028OpenAlexW2001347343MaRDI QIDQ2817612

Baruch Awerbuch, Mark A. Smith, Lenore J. Cowen

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195136

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

On chromatic sums and distributed resource allocation ⋮ Distributed transactional memory for metric-space networks ⋮ Rapid convergence of a local load balancing algorithm for asynchronous rings

This page was built for publication: Efficient asynchronous distributed symmetry breaking