{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:15:12Z","timestamp":1725455712549},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584490"},{"type":"electronic","value":"9783540487999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0020425","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:21:02Z","timestamp":1131844862000},"page":"74-88","source":"Crossref","is-referenced-by-count":0,"title":["Fast increment registers"],"prefix":"10.1007","author":[{"given":"Soma","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark R.","family":"Tuttle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, and Rudiger Reischuk. Achievable cases in an asynchronous environment. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 337\u2013346, October 1987.","DOI":"10.1109\/SFCS.1987.5"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, and Rudiger Reischuk. Renaming in an asynchronous environment. Journal of the ACM, July 1990.","DOI":"10.1145\/79147.79158"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"James Aspnes, Maurice P. Herlihy, and Nir Shavit. Counting networks and multi-processor coordination. In Proceedings of the 23th ACM Symposium on Theory of Computing, May 1991.","DOI":"10.1145\/103418.103421"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/6306.6308","volume":"4","author":"M. Herlihy","year":"1986","unstructured":"Maurice Herlihy. A quorum-consensus replication method for abstract data types. ACM Transactions on Computer Systems, 4(1):32\u201353, February 1986.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. P. Herlihy","year":"1991","unstructured":"Maurice 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"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Maurice Herlihy. Randomized wait-free concurrent objects. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pages 11\u201322. ACM, August 1991.","DOI":"10.1145\/112600.112602"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01784885","volume":"3","author":"J. Y. Halpern","year":"1989","unstructured":"Joesph Y. Halpern and Ronald Fagin. Modelling knowledge and action in distributed systems. Distributed Computing, 3(4):159\u2013179, 1989.","journal-title":"Distributed Computing"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J. Y. Halpern","year":"1990","unstructured":"Joseph Y. Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549\u2013587, July 1990.","journal-title":"Journal of the ACM"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Maurice P. Herlihy and Mark R. Tuttle. Wait-free computation in messagepassing systems: Preliminary report. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 347\u2013362. ACM, August 1990.","DOI":"10.1145\/93385.93439"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. P. Herilhy","year":"1990","unstructured":"Maurice P. Herilhy and Jeannette 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"},{"issue":"7","key":"6_CR11","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558\u2013564, July 1978.","journal-title":"Communications of the ACM"},{"issue":"9","key":"6_CR12","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690, September 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR13","unstructured":"Leslie Lamport. The part-time parliament. Technical Report 49, DEC Systems Research Center, September 1989."},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01762112","volume":"3","author":"Y. Moses","year":"1988","unstructured":"Yoram Moses and Mark R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3(1):121\u2013169, 1988.","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"C. H. Papadimitriou","year":"1979","unstructured":"Christos H. Papadimitriou. The serializability of concurrent database updates. Journal of the ACM, 26(4):631\u2013653, October 1979.","journal-title":"Journal of the ACM"},{"key":"6_CR16","unstructured":"Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. Technical report, Cornell University, Computer Science Department, November 1987."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T05:41:18Z","timestamp":1549258878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584490","9783540487999"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0020425","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}