Solving the at-most-once problem with nearly optimal effectiveness

Sotiris Kentros, Aggelos Kiayias. Solving the at-most-once problem with nearly optimal effectiveness. In Cyril Gavoille, Pierre Fraigniaud, editors, Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011. pages 229-230, ACM, 2011. [doi]

@inproceedings{KentrosK11,
  title = {Solving the at-most-once problem with nearly optimal effectiveness},
  author = {Sotiris Kentros and Aggelos Kiayias},
  year = {2011},
  doi = {10.1145/1993806.1993847},
  url = {http://doi.acm.org/10.1145/1993806.1993847},
  researchr = {https://researchr.org/publication/KentrosK11},
  cites = {0},
  citedby = {0},
  pages = {229-230},
  booktitle = {Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011},
  editor = {Cyril Gavoille and Pierre Fraigniaud},
  publisher = {ACM},
  isbn = {978-1-4503-0719-2},
}