Wait-free consensus with infinite arrivals

DOI10.1145/509907.509983zbMath1192.68850OpenAlexW2101207953MaRDI QIDQ3579245

James Aspnes, Jatin Shah, Gauri Shah

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1029

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20)

Related Items (8)

Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ Computing with infinitely many processes ⋮ Relationships between broadcast and shared memory in reliable anonymous distributed systems ⋮ Anonymous and fault-tolerant shared-memory computing ⋮ The computational power of population protocols ⋮ Randomized protocols for asynchronous consensus ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention ⋮ The epigenetic consensus problem

This page was built for publication: Wait-free consensus with infinite arrivals