{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:42Z","timestamp":1725750582720},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_18","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"254-268","source":"Crossref","is-referenced-by-count":7,"title":["Atomic Snapshots in O(log3 n) Steps Using Randomized Helping"],"prefix":"10.1007","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keren","family":"Censor-Hillel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"18_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":"18_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":"1","key":"18_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2108242.2108244","volume":"59","author":"J. Aspnes","year":"2012","unstructured":"Aspnes, J., Attiya, H., Censor-Hillel, K.: Polylogarithmic concurrent data structures from monotone circuits. J. ACM\u00a059(1), 2:1\u20132:24 (2012)","journal-title":"J. ACM"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Attiya, H., Censor-Hillel, K., Ellen, F.: Faster than optimal snapshots (for a while). In: 2012 ACM Symposium on Principles of Distributed Computing, pp. 375\u2013384 (July 2012)","DOI":"10.1145\/2332432.2332507"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Attiya, H., Censor-Hillel, K., Hendler, D.: Lower bounds for restricted-use objects. In: Twenty-Fourth ACM Symposium on Parallel Algorithms and Architectures, pp. 172\u2013181 (June 2012)","DOI":"10.1145\/2312005.2312037"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Herlihy, M.: Wait-free data structures in the asynchronous PRAM model. In: Second Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 340\u2013349 (July 1990)","DOI":"10.1145\/97444.97701"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","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. SIAM J. Comput.\u00a031(2), 642\u2013664 (2001)","journal-title":"SIAM J. Comput."},{"key":"18_CR8","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.: Linear-time snapshot 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":"2","key":"18_CR9","doi-asserted-by":"publisher","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. SIAM Journal on Computing\u00a030(2), 438\u2013456 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:48:55Z","timestamp":1558118935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}