{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T19:40:08Z","timestamp":1745178008118,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_27","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"386-400","source":"Crossref","is-referenced-by-count":3,"title":["The Strong At-Most-Once Problem"],"prefix":"10.1007","author":[{"given":"Sotirios","family":"Kentros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chadi","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Morrison, A.: Common2 extended to stacks and unbounded concurrency. In: PODC, pp. 218\u2013227. ACM (2006)","DOI":"10.1145\/1146381.1146415"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: PODC, pp. 159\u2013170. ACM (1993)","DOI":"10.1145\/164051.164071"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-15763-9_9","volume-title":"Distributed Computing","author":"D. Alistarh","year":"2010","unstructured":"Alistarh, D., Attiya, H., Gilbert, S., Giurgiu, A., Guerraoui, R.: Fast Randomized Test-and-Set and Renaming. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 94\u2013108. Springer, Heidelberg (2010)"},{"issue":"5","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/S0097539794319126","volume":"26","author":"R.J. Anderson","year":"1997","unstructured":"Anderson, R.J., Woll, H.: Algorithms for the certified write-all problem. SIAM J. Computing\u00a026(5), 1277\u20131283 (1997)","journal-title":"SIAM J. Computing"},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/2080.357392","volume":"2","author":"A.D. Birrell","year":"1984","unstructured":"Birrell, A.D., Nelson, B.J.: Implementing remote procedure calls. ACM Trans. Comput. Syst.\u00a02(1), 39\u201359 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s004460050013","volume":"9","author":"S. Chaudhuri","year":"1995","unstructured":"Chaudhuri, S., Coan, B.A., Welch, J.L.: Using adaptive timeouts to achieve at-most-once message delivery. Distrib. Comput.\u00a09(3), 109\u2013117 (1995)","journal-title":"Distrib. Comput."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R.: Cooperative asynchronous update of shared memory. In: STOC, pp. 733\u2013739 (2005)","DOI":"10.1145\/1060590.1060698"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11523468_18","volume-title":"Automata, Languages and Programming","author":"G. Crescenzo Di","year":"2005","unstructured":"Di Crescenzo, G., Kiayias, A.: Asynchronous Perfectly Secure Communication over One-Time Pads. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 216\u2013227. Springer, Heidelberg (2005)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Drucker, A., Kuhn, F., Oshman, R.: The communication complexity of distributed task allocation. In: PODC, pp. 67\u201376. ACM (2012)","DOI":"10.1145\/2332432.2332443"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"27_CR12","unstructured":"Fitzi, M., Nielsen, J.B., Wolf, S.: How to share a key. In: Allerton Conference on Communication, Control, and Computing (2007)"},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/PL00008930","volume":"14","author":"J. Groote","year":"2001","unstructured":"Groote, J., Hesselink, W., Mauw, S., Vermeulen, R.: An algorithm for the asynchronous write-all problem based on process collision. Distributed Computing\u00a014(2), 75\u201381 (2001)","journal-title":"Distributed Computing"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013, 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Hillel, K.C.: Multi-sided shared coins and randomized set-agreement. In: Proc. of the 22nd ACM Symp. on Parallel Algorithms and Architectures (SPAA 2010), pp. 60\u201368 (2010)","DOI":"10.1145\/1810479.1810490"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Fault-Tolerant Parallel Computaion. Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4757-5210-6"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-25959-3_9","volume-title":"Distributed Computing and Networking","author":"S. Kentros","year":"2012","unstructured":"Kentros, S., Kiayias, A.: Solving the At-Most-Once Problem with Nearly Optimal Effectiveness. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol.\u00a07129, pp. 122\u2013137. Springer, Heidelberg (2012)"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-04355-0_27","volume-title":"Distributed Computing","author":"S. Kentros","year":"2009","unstructured":"Kentros, S., Kiayias, A., Nicolaou, N., Shvartsman, A.A.: At-Most-Once Semantics in Asynchronous Shared Memory. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 258\u2013273. Springer, Heidelberg (2009)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Shvartsman, A.A.: Writing-all deterministically and optimally using a nontrivial number of asynchronous processors. ACM Transactions on Algorithms\u00a04(3) (2008)","DOI":"10.1145\/1367064.1367073"},{"issue":"2","key":"27_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst.\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"27_CR21","unstructured":"Lampson, B.W., Lynch, N.A., S-Andersen, J.F.: Correctness of at-most-once message delivery protocols. In: FORTE, pp. 385\u2013400 (1993)"},{"issue":"10","key":"27_CR22","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1109\/TSE.1985.231860","volume":"11","author":"K.-J. Lin","year":"1985","unstructured":"Lin, K.-J., Gannon, J.D.: Atomic remote procedure call. IEEE Trans. Softw. Eng.\u00a011(10), 1126\u20131135 (1985)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"27_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1145\/103720.103722","volume":"9","author":"B. Liskov","year":"1991","unstructured":"Liskov, B., Shrira, L., Wroclawski, J.: Efficient at-most-once messages based on synchronized clocks. ACM Trans. Comput. Syst.\u00a09(2), 125\u2013142 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"27_CR24","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers (1996)"},{"issue":"4","key":"27_CR25","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/S0097539703428014","volume":"34","author":"G. Malewicz","year":"2005","unstructured":"Malewicz, G.: A work-optimal deterministic algorithm for the certified write-all problem with a nontrivial number of asynchronous processors. SIAM J. Comput.\u00a034(4), 993\u20131024 (2005)","journal-title":"SIAM J. Comput."},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1006\/jagm.1994.1017","volume":"16","author":"C. Martel","year":"1994","unstructured":"Martel, C., Subramonian, R.: On the complexity of certified write-all algorithms. J. Algorithms\u00a016, 361\u2013387 (1994)","journal-title":"J. Algorithms"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-40026-5_11","volume-title":"Distributed Computing","author":"M. Merritt","year":"2000","unstructured":"Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 164\u2013178. Springer, Heidelberg (2000)"},{"issue":"4","key":"27_CR28","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/358468.358478","volume":"25","author":"A.Z. Spector","year":"1982","unstructured":"Spector, A.Z.: Performing remote operations efficiently on a local computer network. Commun. ACM\u00a025(4), 246\u2013260 (1982)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T19:21:26Z","timestamp":1745176886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}