Coordination Without Prior Agreement

DOI10.1145/3087801.3087807zbMath1380.68069OpenAlexW2737388943MaRDI QIDQ5368980

Gadi Taubenfeld

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

shared memorymutual exclusionagreementrenaminganonymous registermemory-anonymous algorithmsunnamed register

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

A visit to mutual exclusion in seven dates ⋮ Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ Leader-based de-anonymization of an anonymous read/write memory ⋮ The computational structure of progress conditions and shared objects ⋮ Mutual exclusion in fully anonymous shared memory systems ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms ⋮ The epigenetic consensus problem

This page was built for publication: Coordination Without Prior Agreement