{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:37:09Z","timestamp":1725892629977},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681397"},{"type":"electronic","value":"9783540681403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11947950_35","type":"book-chapter","created":{"date-parts":[[2007,2,26]],"date-time":"2007-02-26T12:26:54Z","timestamp":1172492814000},"page":"319-330","source":"Crossref","is-referenced-by-count":5,"title":["The Complexity of Updating Multi-writer Snapshot Objects"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faith","family":"Ellen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"J.H. Anderson","year":"1994","unstructured":"Anderson, J.H.: Multi-writer composite registers. Distributed Computing\u00a07(4), 175\u2013195 (1994)","journal-title":"Distributed Computing"},{"issue":"2","key":"35_CR3","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1137\/S0097539700366000","volume":"31","author":"H. Attiya","year":"2001","unstructured":"Attiya, H., Fouren, A.: Adaptive and efficient algorithms for lattice agreement and renaming. SICOMP\u00a031(2), 642\u2013664 (2001)","journal-title":"SICOMP"},{"issue":"2","key":"35_CR4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/S0097539795279463","volume":"27","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Rachman, O.: Atomic snapshots in O(n log n) operations. SICOMP\u00a027(2), 319\u2013340 (1998)","journal-title":"SICOMP"},{"key":"35_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley-Interscience, Hoboken (2004)","edition":"2"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F.E., Ruppert, E.: A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots. In: STOC 2003, pp. 259\u2013268 (2003)","DOI":"10.1145\/780542.780582"},{"key":"35_CR7","unstructured":"Fatourou, P., Fich, F.E., Ruppert, E.: A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots (2006) (manuscript)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.: Single-Scanner Multi-Writer Snapshot Implementations are Fast. In: PODC 2006, pp. 228\u2013237 (2006)","DOI":"10.1145\/1146381.1146416"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-30577-4_3","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"F.E. Fich","year":"2005","unstructured":"Fich, F.E.: How Hard is it to Take a Snapshot? In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol.\u00a03381, pp. 28\u201337. Springer, Heidelberg (2005)"},{"issue":"5","key":"35_CR10","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the Space Complexity of Randomized Synchronization. JACM\u00a045(5), 843\u2013862 (1998)","journal-title":"JACM"},{"issue":"2\u20133","key":"35_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F.E. Fich","year":"2003","unstructured":"Fich, F.E., Ruppert, E.: Hundreds of Impossibility Results for Distributed Computing. Distributed Computing\u00a016(2\u20133), 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. TOPLAS\u00a012(3), 463\u2013492 (1990)","journal-title":"TOPLAS"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0020429","volume-title":"Distributed Algorithms","author":"M. Inoue","year":"1994","unstructured":"Inoue, M., Chen, W., Masuzawa, T., Tokura, N.: Linear time snapshots using multi-writer multi-reader registers. In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 130\u2013140. Springer, Heidelberg (1994)"},{"issue":"5","key":"35_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF01185868","volume":"28","author":"A. Israeli","year":"1995","unstructured":"Israeli, A., Shaham, A., Shirazi, A.: Linear-time snapshot implementations in unbalanced systems. Mathematical Systems Theory\u00a028(5), 469\u2013486 (1995)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"35_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0020-0190(97)00189-0","volume":"65","author":"A. Israeliand","year":"1998","unstructured":"Israeliand, A., Shirazi, A.: The time complexity of updating snapshot memories. Information Processing Letters\u00a065(1), 33\u201340 (1998)","journal-title":"Information Processing Letters"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: f-Arrays: Implementation and Applications. PODC 2002, 270\u2013279 (2002)","DOI":"10.1145\/571825.571875"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: An Optimal Multi-Writer Snapshot Algorithm. STOC 2005, 723\u2013732 (2005)","DOI":"10.1145\/1060590.1060697"},{"issue":"2","key":"35_CR18","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P. Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SICOMP\u00a030(2), 438\u2013456 (2000)","journal-title":"SICOMP"},{"issue":"7","key":"35_CR19","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/71.296315","volume":"5","author":"L.M. Kirousis","year":"1994","unstructured":"Kirousis, L.M., Spirakis, P., Tsigas, P.: Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. IEEE Trans. on Parallel and Distributed Systems\u00a05(7), 688\u2013696 (1994)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"35_CR20","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"35_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0304-3975(00)00412-6","volume":"269","author":"Y. Riany","year":"2001","unstructured":"Riany, Y., Shavit, N., Touitou, D.: Towards a Practical Snapshot Algorithm. Theoretical Computer Science\u00a0269, 163\u2013201 (2001)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11947950_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:06Z","timestamp":1619507946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11947950_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681397","9783540681403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11947950_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}