{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:24:08Z","timestamp":1777965848157,"version":"3.51.4"},"publisher-location":"Berlin\/Heidelberg","reference-count":28,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540555536","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035175","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:20:01Z","timestamp":1138202401000},"page":"154-170","source":"Crossref","is-referenced-by-count":14,"title":["Time-lapse snapshots"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge A.","family":"Plotkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orli","family":"Waarts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, On Achieving Consensus Using a Shared Memory, Proc. 7 ACM Symposium on Principles of Distributed Computing, pp.291\u2013302, 1988.","DOI":"10.1145\/62546.62594"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic Snapshots of Shared Memory, Proc. 9 ACM Symposium on Principles of Distributed Computing, pp. 1\u201313, 1990.","DOI":"10.1145\/93385.93394"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"J. Anderson, Composite Registers, Proc. 9 ACM Symposium on Principles of Distributed Computing, pp. 15\u201330, August 1990.","DOI":"10.1145\/93385.93396"},{"key":"15_CR4","unstructured":"J. Anderson, and B. Groselj, Beyond Atomic Registers: Bounded Wait-free Implementations of Non-trivial Objects, Proc. 5th International Workshop on Distributed Algorithms, Delphi, Greece, October 1991."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"J. Aspnes, Time-and Space-Efficient Randomized Consensus, to appear in the Journal of Algorithms. An earlier version appears in Proc. 9 ACM Symposium on Principles of Distributed Computing, pp. 325\u2013331, 1990.","DOI":"10.1145\/93385.93433"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M.P. Herlihy Wait-Free Data Structures in the Asynchronous PRAM Model, Proc. 2nd Annual Symposium on Parallel Algorithms and Architectures, July 1990, pages 340\u2013349, Crete, Greece.","DOI":"10.1145\/97444.97701"},{"issue":"3","key":"15_CR7","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0196-6774(90)90021-6","volume":"11","author":"J. Aspnes","year":"1990","unstructured":"J. Aspnes and M.P. Herlihy, Fast Randomized Consensus using Shared Memory, Journal of Algorithms, 11(3):441\u2013461, 1990.","journal-title":"Journal of Algorithms"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"H. Attiya, D. Dolev, and N. Shavit, Bounded Polynomial Randomized Consensus, Proc. 8 ACM Symposium on Principles of Distributed Computing, pp. 281\u2013294, 1989.","DOI":"10.1145\/72981.73001"},{"key":"15_CR9","unstructured":"H. Attiya, N. Lynch, and N. Shavit, Are Wait-Free Algorithms Fast?, Proc. 9 IEEE Symposium on Foundations of Computer Science, pp. 363\u2013375, 1990. Expanded version: Technical Memo MIT\/LCS\/TM-423, Laboratory for Computer Science, MIT, February 1990."},{"key":"15_CR10","unstructured":"G. Bracha and O. Rachman, Approximated Counters and Randomized Consensus, Technical Report Technion 662, 1990."},{"key":"15_CR11","unstructured":"G. Bracha and O. Rachman, Randomized Consensus in Expected O(n2 log n), Proc. 5th International Workshop on Distributed Algorithms, Greece, 1991."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"J.E. Burns and G.L. Peterson, Constructing Multi-reader Atomic Values from Non-atomic Values, Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 222\u2013231, 1987.","DOI":"10.1145\/41840.41859"},{"issue":"1","key":"15_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy and L. Lamport, Distributed Snapshots: Determining Global States of Distributed Systems, Acm Trans. on Computer Systems 3:1,1985, pp. 63\u201375.","journal-title":"Acm Trans. on Computer Systems"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and M. Li, On processor coordination using asynchronous hardware, Proc. 6th ACM Symposium on Principles of Distributed Computing, pages 86\u201397, 1987.","DOI":"10.1145\/41840.41848"},{"key":"15_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/365559.365617","volume":"8","author":"E. W. Dijkstra","year":"1965","unstructured":"E. W. Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM 8:165, 1965.","journal-title":"Communications of the ACM"},{"issue":"1","key":"15_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, and L Stockmeyer. On the minimal synchronism needed for distributed consensus, Journal of the ACM 34:1, pp. 77\u201397, January, 1987.","journal-title":"Journal of the ACM"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"D. Dolev and N. Shavit, Bounded Concurrent Time-Stamp Systems are Constructible!, Proc. 21 ACM Symposium on Theory of Computing, pp. 454\u2013465, 1989.","DOI":"10.21236\/ADA213853"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"C. Dwork and O. Waarts, Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible!, IBM Research Report RJ 8425, October 1991. Also, to appear in Proc. 24 ACM Symposium on Theory of Computing, 1992.","DOI":"10.1145\/129712.129776"},{"issue":"1","key":"15_CR19","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"M.P. Herlihy. Wait-free Synchronization, ACM Transactions on Programming Languages and Systems, 13(1): 124\u2013149, January 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"15_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, Linearizability: A Correctness Condition for Concurrent Objects, ACM Transactions on Programming Languages and Systems, 12(3):463\u2013492, July 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Li, Bounded Time Stamps, Proc. 28 IEEE Symposium on Foundations of Computer Science, 1987.","DOI":"10.1109\/SFCS.1987.10"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Pinhasov, A Concurrent Time-Stamp Scheme which is Linear in Time and Space, manuscript, 1991.","DOI":"10.1007\/3-540-56188-9_7"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"L. M. Kirousis, P. Spirakis and P. Tsigas, Reading Many Variables in One Atomic Operation Solutions With Linear or Sublinear Complexity, Proc. 5th International Workshop on Distributed Algorithms, 1991.","DOI":"10.1109\/71.296315"},{"issue":"11","key":"15_CR24","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1145\/359863.359878","volume":"20","author":"L. Lamport","year":"1977","unstructured":"L. Lamport, Concurrent reading and writing. Communications of the ACM, 20(11):806\u2013811, November 1977.","journal-title":"Communications of the ACM"},{"issue":"2","key":"15_CR25","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, The Mutual Exclusion Problem, Part I: A Theory of Interprocess Communication, J. ACM 33(2), pp. 313\u2013326, 1986.","journal-title":"J. ACM"},{"issue":"1","key":"15_CR26","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/357195.357198","volume":"5","author":"G. Peterson","year":"1983","unstructured":"G. Peterson, Concurrent Reading While Writing, ACM Transactions on Programming Languages and Systems 5(1), pp. 46\u201355, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR27","unstructured":"M. Saks, N. Shavit, and H. Woll, Optimal Time Randomized Consensus \u2014 Making Resilient Algorithms Fast in Practice, Symposium on Discrete Algorithms, pp. 351\u2013362, 1990."},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"J. Tromp, How to Construct an Atomic Variable, Proc. 3rd International Workshop on Distributed Algorithms, LNCS 392, 1989.","DOI":"10.1007\/3-540-51687-5_51"}],"container-title":["Lecture Notes in Computer Science","Theory of Computing and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035175.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:13:17Z","timestamp":1607551997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540555536"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0035175","relation":{},"subject":[]}}