Sotiris Kentros, Chadi Kari, Aggelos Kiayias. The Strong At-Most-Once Problem. In Marcos K. Aguilera, editor, Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings. Volume 7611 of Lecture Notes in Computer Science, pages 386-400, Springer, 2012. [doi]
@inproceedings{KentrosKK12,
title = {The Strong At-Most-Once Problem},
author = {Sotiris Kentros and Chadi Kari and Aggelos Kiayias},
year = {2012},
doi = {10.1007/978-3-642-33651-5_27},
url = {http://dx.doi.org/10.1007/978-3-642-33651-5_27},
researchr = {https://researchr.org/publication/KentrosKK12},
cites = {0},
citedby = {0},
pages = {386-400},
booktitle = {Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings},
editor = {Marcos K. Aguilera},
volume = {7611},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-33650-8},
}