{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:05Z","timestamp":1749825845368},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_25","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"232-241","source":"Crossref","is-referenced-by-count":2,"title":["Group Mutual Exclusion Algorithms Based on Ticket Orders"],"prefix":"10.1007","author":[{"given":"Masataka","family":"Takamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihide","family":"Igarashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"25_CR1","volume-title":"Bakery algorithms","author":"U. Abraham","year":"2001","unstructured":"U. Abraham, \u201cBakery algorithms\u201d, Technical Report, Dept. of Mathematics, Ben Gurion University, Beer-Sheva, Israel, 2001."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"J. H. Anderson, \u201cLamport on mutual exclusion: 27 years of planting seeds\u201d, Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, pp.3\u201312, 2001.","DOI":"10.1145\/383962.383967"},{"key":"25_CR3","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"H. Attiya and J. Welch, \u201cDistributed Computing: Fundamentals, Simulations and Advanced Topics\u201d, McGraw-Hill, New York, 1998."},{"key":"25_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, \u201cSolution of a problem in concurrent programming control\u201d, Communications of the ACM, vol.8, p.569, 1965.","journal-title":"Communications of the ACM"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"M. J. Fischer, N. A. Lynch, J. E. Burns, and A. Borodi, \u201cResource allocation with immunity to limited process failure\u201d, 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico: 234\u2013254, 1979.","DOI":"10.1109\/SFCS.1979.37"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"V. Hadzilacos, \u201cA note on group mutual exclusion\u201d, Proceedings of 12th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, pp.100\u2013106, 2001.","DOI":"10.1145\/383962.383997"},{"key":"25_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-45627-9_23","volume-title":"Proceedings of SOFSEM\u20192001","author":"P. Jayanti","year":"2001","unstructured":"P. Jayanti, K. Tan, G. Friedland, and A. Katz, \u201cBounded Lamport\u2019s bakery algorithm\u201d, Proceedings of SOFSEM\u20192001, Lecture Notes in Computer Science, vol.2234, Springer-Verlag, Berlin, pp.261\u2013270, 2001."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/PL00008918","volume":"13","author":"Y.-J. Joung","year":"2000","unstructured":"Yuh-Jzer Joung, \u201cAsynchronous group mutual exclusion\u201d, Distributed Computing, vol.13, pp.189\u2013206, 2000.","journal-title":"Distributed Computing"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s004460100069","volume":"15","author":"Y.-J. Joung","year":"2002","unstructured":"Yuh-Jzer Joung, \u201cThe congenial talking philosophers problem in computer networks\u201d, Distributed Computing, vol.15, pp.155\u2013175, 2002.","journal-title":"Distributed Computing"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"P. Keane and M. Moir, \u201cA simple local-spin group mutual exclusion algorithm\u201d, IEEE Transactions on Parallel and Distributed Systems, vol.12, 2001.","DOI":"10.1109\/71.940743"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"L. Lamport, \u201cA new solution of Dijkstra\u2019s concurrent programming problem\u201d, Communications of the ACM, vol.17, pp.453\u2013455, 1974.","journal-title":"Communications of the ACM"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, \u201cThe mutual exclusion problem. Part II: Statement and solutions\u201d, J. of the ACM, vol. 33, pp.327\u2013348, 1986.","journal-title":"J. of the ACM"},{"key":"25_CR13","volume-title":"Distributed Algorithms","author":"N. A. Lynch","year":"1996","unstructured":"N. A. Lynch, \u201cDistributed Algorithms\u201d, Morgan Kaufmann, San Francisco, California, 1996."},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.4036\/iis.2002.187","volume":"8","author":"M. Omori","year":"2002","unstructured":"M. Omori, K. Obokata, K. Motegi and Y. Igarashi, \u201cAnalysis of some lockout avoidance algorithms for the \u03ba-exclusion problem\u201d, Interdisciplinary Information Sciences, vol.8, pp.187\u2013192, 2002.","journal-title":"Interdisciplinary Information Sciences"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G. L. Peterson","year":"1981","unstructured":"G. L. Peterson, \u201cMyths about the mutual exclusion problem\u201d, Information Processing Letters, vol.12, pp.115\u2013116, 1981.","journal-title":"Information Processing Letters"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"G. L. Peterson and M. J. Fischer, \u201cEconomical solutions for the critical section problem in a distributed system\u201d, Proceedings of the 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado, pp.91\u201397, 1977.","DOI":"10.1145\/800105.803398"},{"key":"25_CR17","first-page":"246","volume":"E86-D","author":"M. Takamura","year":"2003","unstructured":"M. Takamura and Y. Igarashi, \u201cSimple mutual exclusion algorithms based on bounded tickets on the asynchronous shared memory model\u201d, IEICE Transactions on Information and Systems, vol.E86-D, pp.246\u2013254, 2003.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"K. Vidyasankar, \u201cA highly concurrent group mutual l-exclusion algorithm\u201d, Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, Monterey, California, p.130, 2002.","DOI":"10.1145\/571825.571846"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0020-0190(02)00355-1","volume":"85","author":"K. Vidyasankar","year":"2003","unstructured":"K. Vidyasankar, \u201cA simple group mutual l-exclusion algorithm\u201d, Information Processing Letters, vol.85, pp.79\u201385, 2003.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:18Z","timestamp":1556935758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}