The strong at-most-once problem

DOI10.1007/978-3-642-33651-5_27zbMATH Open1377.68041OpenAlexW1548457274MaRDI QIDQ4909425FDOQ4909425

Authors: Sotirios Kentros, Chadi Kari, Aggelos Kiayias 

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_27

Recommendations

• Solving the at-most-once problem with nearly optimal effectiveness
• At-Most-Once Semantics in Asynchronous Shared Memory
• Fast randomized consensus using shared memory
• Approximate shared-memory counting despite a strong adversary
• Cooperative asynchronous update of shared memory

Mathematics Subject Classification ID

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

Cited In (5)

• Solving the at-most-once problem with nearly optimal effectiveness
• The Max-Atom Problem and Its Relevance
• The assignment problem
• At-Most-Once Semantics in Asynchronous Shared Memory
• Doing-it-all with bounded work and communication

This page was built for publication: The strong at-most-once problem

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