The Strong At-Most-Once Problem

DOI10.1007/978-3-642-33651-5_27zbMath1377.68041OpenAlexW1548457274MaRDI QIDQ4909425

Aggelos Kiayias, Chadi Kari, Sotirios Kentros

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

Mathematics Subject Classification ID

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

Related Items (3)

Solving the at-most-once problem with nearly optimal effectiveness ⋮ The assignment problem ⋮ Doing-it-all with bounded work and communication

This page was built for publication: The Strong At-Most-Once Problem