{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:21Z","timestamp":1742913321038,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_27","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"258-273","source":"Crossref","is-referenced-by-count":3,"title":["At-Most-Once Semantics in Asynchronous Shared Memory"],"prefix":"10.1007","author":[{"given":"Sotirios","family":"Kentros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nicolaou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"27_CR1","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":"1","key":"27_CR2","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":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/jagm.1996.0003","volume":"20","author":"J.F. Buss","year":"1996","unstructured":"Buss, J.F., Kanellakis, P.C., Ragde, P., Shvartsman, A.A.: Parallel algorithms with processor failures and delays. Journal of Algorithms\u00a020(1), 45\u201386 (1996)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"27_CR4","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_CR5","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)"},{"issue":"2","key":"27_CR6","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_CR7","doi-asserted-by":"crossref","unstructured":"Goldman, K.J., Lynch, N.A.: Modelling shared state in a shared action model. In: Logic in Computer Science, pp. 450\u2013463 (1990)","DOI":"10.21236\/ADA221279"},{"key":"27_CR8","doi-asserted-by":"crossref","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) (2001)","DOI":"10.1007\/PL00008930"},{"key":"27_CR9","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_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5210-6","volume-title":"Fault-Tolerant Parallel Computaion","author":"P.C. Kanellakis","year":"1997","unstructured":"Kanellakis, P.C., Shvartsman, A.A.: Fault-Tolerant Parallel Computaion. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"27_CR11","first-page":"311","volume-title":"Proc. of the 16th annual ACM Symp. on Par. in Alg. and Arch. (SPAA 2004)","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Shvartsman, A.A.: Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. In: Proc. of the 16th annual ACM Symp. on Par. in Alg. and Arch. (SPAA 2004), pp. 311\u2013320. ACM Press, New York (2004)"},{"issue":"2","key":"27_CR12","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_CR13","unstructured":"Lampson, B.W., Lynch, N.A., S-Andersen, J.F.: Correctness of at-most-once message delivery protocols. In: Proc. of the IFIP TC6\/WG6.1 6th International Conference on Formal Description Techniques(FORTE 1993), pp. 385\u2013400 (1994)"},{"issue":"10","key":"27_CR14","doi-asserted-by":"crossref","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":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/42392.42399","volume":"31","author":"B. Liskov","year":"1988","unstructured":"Liskov, B.: Distributed programming in argus. Commun. ACM\u00a031(3), 300\u2013312 (1988)","journal-title":"Commun. ACM"},{"issue":"2","key":"27_CR16","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_CR17","unstructured":"Lynch, N., Tuttle, M.: An introduction to input\/output automata. CWI-Quarterly, 219\u2013246 (1989)"},{"key":"27_CR18","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)"},{"key":"27_CR19","first-page":"255","volume-title":"Proc. of the 22nd annual Symp. on Principles of Distributed Computing (PODC 2003)","author":"G. Malewicz","year":"2003","unstructured":"Malewicz, G.: A work-optimal deterministic algorithm for the asynchronous certified write-all problem. In: Proc. of the 22nd annual Symp. on Principles of Distributed Computing (PODC 2003), pp. 255\u2013264. ACM Press, New York (2003)"},{"issue":"4","key":"27_CR20","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."},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/32.4620","volume":"14","author":"F. Panzieri","year":"1988","unstructured":"Panzieri, F., Shrivastava, S.: Rajdoot: A remote procedure call mechanism supporting orphan detection and killing. IEEE Transactions on Software Engineering\u00a014(1), 30\u201337 (1988)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"27_CR22","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"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Watson, R.W.: The delta-t transport protocol: Features and experience. In: Proc. of the 14th Conf. on Local Computer Networks, pp. 399\u2013407 (1989)","DOI":"10.1109\/LCN.1989.65288"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T18:03:34Z","timestamp":1552154614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}