{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:45Z","timestamp":1759335945670,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:48Z","timestamp":1330253808000},"page":"35-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficient atomic snapshots using lattice agreement"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ophir","family":"Rachman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt and N. Shavit, \u201cAtomic Snapshots of Shared Memory,\u201d proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 1\u201314.","DOI":"10.21236\/ADA222765"},{"key":"3_CR2","unstructured":"E. Aharonson and H. Attiya, \u201cCounting Network with Arbitrary Fan-Out,\u201d proceedings of the 3rd Annual ACM-SIAM Symp. on Discrete Algorithms, Orlando, Florida, January 1992, pp. 104\u2013113."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Komlos and E. Szemeredi, \u201cAn O(n log n) sorting network,\u201d proceedings of the 15th ACM Symposium on the Theory of Computing, 1\u20139, 1983.","DOI":"10.1145\/800061.808726"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"J. H. Anderson, \u201cComposite Registers,\u201d proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 15\u201329.","DOI":"10.1145\/93385.93396"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"J. Aspnes, \u201cTime-and Space-Efficient Randomized Consensus,\u201d proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, 1990, pp. 325\u2013331.","DOI":"10.1145\/93385.93433"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M. P. Herlihy, \u201cWait-Free Data Structures in the Asynchronous PRAM Model,\u201d proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, 1990, pp. 340\u2013349.","DOI":"10.1145\/97444.97701"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"J. Aspnes, M. P. Herlihy and N. Shavit, \u201cCounting Networks and Multi-Processor Coordination,\u201d proceedings of the 23rd annual Symposium on Theory of Computing, 1991, pp. 348\u2013358.","DOI":"10.21236\/ADA237475"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"H. Attiya, D. Dolev and N. Shavit, \u201cBounded polynomial randomized consensus,\u201d proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, 1989, pp. 281\u2013293.","DOI":"10.21236\/ADA213808"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"H. Attiya, N. A. Lynch and N. Shavit, \u201cAre wait-free algorithms fast?\u201d proceedings of the 31st IEEE Symposium on on Foundations of Computer Science 1990, pp. 55\u201364.","DOI":"10.21236\/ADA232829"},{"key":"3_CR10","unstructured":"T. Chandra and C. Dwork, personal communication."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, \u201cTowards a Complexity Hierarchy of Wait-Free Concurrent Objects,\u201d proceeding of the 3rd IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 730\u2013737.","DOI":"10.1109\/SPDP.1991.218190"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"B. Chor and L. Moscovici, \u201cSolvability in Asynchronous Environments,\u201d proceedings of the 30th IEEE Symposium on on Foundations of Computer Science 1989, pp. 422\u2013427.","DOI":"10.1109\/SFCS.1989.63513"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"B. Chor and L. Nelson, proceedings of the 10th ACM Symp. on Principles of Distributed Computing, 1991, pp. 37\u201349.","DOI":"10.1145\/112600.112604"},{"key":"3_CR14","unstructured":"C. Dwork, personal communication."},{"key":"3_CR15","unstructured":"C. Dwork, M. P. Herlihy, S. A. Plotkin, and O. Waarts, \u201cTime-Lapse Snapshots,\u201d proceedings of Israel Symposium on the Theory of Computing and Systems, 1992, to appear."},{"key":"3_CR16","unstructured":"R. Gawlick, N. Lynch and N. Shavit, \u201cConcurrent Timestamping Made Simple,\u201d proceedings of Israel Symposium on the Theory of Computing and Systems, 1992, to appear."},{"issue":"No.1","key":"3_CR17","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. P. Herlihy","year":"1991","unstructured":"Herlihy, M. P. \u201cWait-free synchronization,\u201d ACM Transactions on Programming Languages and Systems, Vol. 13, No. 1 (Jan. 1991), pp. 124\u2013149.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy, \u201cRandomized Wait-Free Objects,\u201d proceedings of the 10th ACM Symp. on Principles of Distributed Computing, 1991, pp. 11\u201321.","DOI":"10.1145\/112600.112602"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"M. Herlihy and M. Tuttle, \u201cWait-Free Computation in Message-Passing Systems,\u201d proceedings of the 9th ACM Symp. on Principles of Distributed Computing, 1990, pp. 347\u2013362.","DOI":"10.1145\/93385.93439"},{"issue":"No.3","key":"3_CR20","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. P. Herlihy","year":"1990","unstructured":"M. P. Herlihy and J. M. Wing, \u201cLinearizability: A correctness condition for concurrent objects,\u201d ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3 (July 1990), pp. 463\u2013492.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR21","first-page":"229","volume-title":"Lecture Notes in Computer Science #579","author":"L. M. Kirousis","year":"1991","unstructured":"L. M. Kirousis, P. Spirakis and Ph. Tsigas, \u201cReading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity,\u201d proceedings of the 5th International Workshop on Distributed Algorithms, Delphi, Greece, October 1991 (S. Toueg, P. Spirakis and L. Kirousis, eds.), pp. 229\u2013241, Lecture Notes in Computer Science #579, Springer-Verlag."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"M. Klugerman and G. Plaxton, \u201cSmall-Depth Counting Networks,\u201d Proceedings of the 24th ACM Symp. on Theory of Computing, 1992, pp. 417\u2013428.","DOI":"10.1145\/129712.129752"},{"key":"3_CR23","unstructured":"J. Tromp and P. M. B. Vitanyi, \u201cRandomized Wait-Free Test-and-Set,\u201d manuscript, November 1990."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:46:20Z","timestamp":1742593580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_3"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}