{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:20Z","timestamp":1760202560044},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-40026-5_11","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T19:59:07Z","timestamp":1181678347000},"page":"164-178","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Computing with Infinitely Many Processes"],"prefix":"10.1007","author":[{"given":"Michael","family":"Merritt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"issue":"l","key":"11_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322290.322302","volume":"29","author":"B+82_J. E. Burns","year":"1982","unstructured":"[B+82]_J. E. Burns, P. Jackson, N. A. Lynch, M. J. Fischer, and G. L. Peterson. Data requirements for implementation of Af-process mutual exclusion using a single shared variable. Journal of the ACM, 29(l):183\u2013205, 1982","journal-title":"Journal of the ACM"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J. N. Burns","year":"1993","unstructured":"J. N. Burns and N. A. Lynch. Bounds on shared-memory for mutual exclusion. Information and Computation, 107(2): 171\u2013184, December 1993.","journal-title":"Information and Computation"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"M. Choy and A.K. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1): 1\u201317, 1994.","journal-title":"Distributed Computing"},{"issue":"9","key":"11_CR4","doi-asserted-by":"publisher","first-page":"569","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(9):569, 1965.","journal-title":"Communications of the ACM"},{"issue":"l","key":"11_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/59287.59292","volume":"ll","author":"F+89_M. J. Fischer","year":"1989","unstructured":"[F+89]_M. J. Fischer, N. A. Lynch, J. E. Burns, and A. Borodin. Distributed FIFO allocation of identical resources using small shared space. ACM Trans, on Programming Languages and Systems, ll(l):90\u2013114, January 1989.","journal-title":"ACM Trans, on Programming Languages and Systems"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374\u2013382, 1985.","journal-title":"Journal of the ACM"},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0020-0190(87)90210-9","volume":"25","author":"S. A. Friedberg","year":"1987","unstructured":"S. A. Friedberg and G. L. Peterson. An efficient solution to the mutual exclusion problem using weak semaphores. Information Processing Letters, 25(5):343\u2013347, 1987.","journal-title":"Information Processing Letters"},{"key":"11_CR8","unstructured":"E. Gafni and E. Koutsoupias. On uniform protocols. \n                  http:\/\/www.cs.ucla.edu\/~eli\/eli.html\n                  \n                , 1998."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport. A fast mutual exclusion algorithm. ACM Trans, on Computer Systems, 5(1):1\u201311, 1987.","journal-title":"ACM Trans, on Computer Systems"},{"key":"11_CR10","first-page":"163","volume":"4","author":"M. C. Loui","year":"1987","unstructured":"M. C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163\u2013183, 1987.","journal-title":"Advances in Computing Research"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0190(93)90015-2","volume":"45","author":"M. Merritt","year":"1993","unstructured":"M. Merritt and G. Taubenfeld. Speeding Lamport\u2019s fast mutual exclusion algorithm. Information Processing Letters, 45:137\u2013142, 1993. (Also published as an AT&T technical memorandum in May 1991.)","journal-title":"Information Processing Letters"},{"key":"11_CR12","unstructured":"G. L. Peterson. New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester, February 1980 (Corrected, Nov. 1994)."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"E. Styer and G. L. Peterson. Tight bounds for shared memory symmetric mutual exclusion problems. In Proc. 8th PODC, pages 177\u2013191, 1989.","DOI":"10.1145\/72981.72993"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"J-H. Yang and J.H. Anderson. Time bounds for mutual exclusion and related problems. In Proc. 26th ACM Symp. on Theory of Computing, May 1994.","DOI":"10.1145\/195058.195139"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:45:16Z","timestamp":1578523516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_11"}},"subtitle":["under assumptions on concurrency and participation (Extended abstract)"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}