Wait-free consensus with infinite arrivals

DOI10.1145/509907.509983zbMATH Open1192.68850OpenAlexW2101207953MaRDI QIDQ3579245FDOQ3579245

Authors: James Aspnes, Gauri Shah, Jatin 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

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

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579245)