{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:51:04Z","timestamp":1694638264299},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,16]],"date-time":"2010-02-16T00:00:00Z","timestamp":1266278400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00446-010-0094-4","type":"journal-article","created":{"date-parts":[[2010,2,15]],"date-time":"2010-02-15T14:39:53Z","timestamp":1266244793000},"page":"197-214","source":"Crossref","is-referenced-by-count":3,"title":["On quorum systems for group resources allocation"],"prefix":"10.1007","volume":"22","author":[{"given":"Yuh-Jzer","family":"Joung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,16]]},"reference":[{"issue":"5","key":"94_CR1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/71.598279","volume":"8","author":"D. Agrawal","year":"1997","unstructured":"Agrawal D., E\u011fecio\u011flu \u00d6., El Abbadi A.: Analysis of quorum-based protocols for distributed (k+1)-exclusion. IEEE Trans. Parallel Distrib. Syst. 8(5), 533\u2013537 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"94_CR2","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TPDS.2007.1072","volume":"18","author":"R. Atreya","year":"2007","unstructured":"Atreya R., Mittal N., Peri S.: A quorum-based group mutual exclusion algorithm for a distributed system with dynamic group set. IEEE Trans. Parallel Distrib. Syst. 18(10), 1345\u20131360 (2007)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"94_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01786230","volume":"1","author":"D. Barbara","year":"1986","unstructured":"Barbara D., Garcia-Molina H.: Mutual exclusion in partitioned distributed systems. Distrib. Comput. 1, 119\u2013132 (1986)","journal-title":"Distrib. Comput."},{"issue":"10","key":"94_CR4","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1109\/TC.1987.1676860","volume":"36","author":"D. Barbara","year":"1987","unstructured":"Barbara D., Garcia-Molina H.: The reliability of voting mechanisms. IEEE Trans. Comput. 36(10), 1197\u20131208 (1987)","journal-title":"IEEE Trans. Comput."},{"key":"94_CR5","volume-title":"Hypergraphs, North-Holland Mathematical Library, vol. 45","author":"C. Berge","year":"1989","unstructured":"Berge C.: Hypergraphs, North-Holland Mathematical Library, vol. 45. Elsevier, North Holland, Amsterdam (1989)"},{"key":"94_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BF01904851","volume":"16","author":"B. Bollob\u00e1s","year":"1965","unstructured":"Bollob\u00e1s B.: On generalized graphs. Acta Math. Acad. Sci. Hungaricae 16, 447\u2013452 (1965)","journal-title":"Acta Math. Acad. Sci. Hungaricae"},{"key":"94_CR7","doi-asserted-by":"crossref","unstructured":"Cantarell, S., Datta, A.K., Petit, F., Villain, V.: Token based group mutual exclusion for asynchronous rings. In: Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS), pp. 691\u2013694. IEEE Computer Society Press (2001)","DOI":"10.1109\/ICDSC.2001.919001"},{"issue":"12","key":"94_CR8","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1109\/71.970560","volume":"12","author":"G. Cao","year":"2001","unstructured":"Cao G., Singhal M.: A delay-optimal quorum-based mutual exclusion algorithm for distributed systems. IEEE Trans. Parallel Distrib. Syst. 12(12), 1256\u20131268 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"94_CR9","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy K.M., Misra J.: The drinking philosophers problem. ACM Trans. Program. Languages Syst. 6(4), 632\u2013646 (1984)","journal-title":"ACM Trans. Program. Languages Syst."},{"key":"94_CR10","doi-asserted-by":"crossref","unstructured":"Chedid, F.B.: A group quorum system of degree $${1+\\sqrt{1+n\/m}}$$ . In: Proceedings of 8th International Conference on Distributed Computing and Networking (ICDCN), Lecture Notes in Computer Science, vol. 4308, pp. 70\u201381. Springer (2006)","DOI":"10.1007\/11947950_8"},{"issue":"9","key":"94_CR11","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"Dijkstra E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"issue":"2","key":"94_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra E.W.: Hierarchical ordering of sequential processes. Acta Inform. 1(2), 115\u2013138 (1971)","journal-title":"Acta Inform."},{"issue":"6","key":"94_CR13","doi-asserted-by":"crossref","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T. Eiter","year":"1995","unstructured":"Eiter T., Gottlob G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"key":"94_CR14","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure (preliminary report). In: 20th Annual Symposium on Foundations of Computer Science, pp. 234\u2013254. IEEE (1979)","DOI":"10.1109\/SFCS.1979.37"},{"key":"94_CR15","unstructured":"Frankl, P.: Extremal set systems. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol. 2, Elsevier and The MIT Press (1995)"},{"key":"94_CR16","doi-asserted-by":"crossref","unstructured":"Fujita, S., Yamashita, M., Ae, T.: Distributed k-mutual exclusion problem and k-coteries. In: Proceedings of the 2nd International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, vol. 557, pp. 22\u201331 (1991)","DOI":"10.1007\/3-540-54945-5_45"},{"issue":"4","key":"94_CR17","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"Garcia-Molina H., Barbara D.: How to assign votes in a distributed system. J. ACM 32(4), 841\u2013860 (1985)","journal-title":"J. ACM"},{"key":"94_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0097-3165(92)90016-N","volume":"61","author":"L. Gargano","year":"1992","unstructured":"Gargano L., K\u00f6rner J., Vaccaro U.: Qualitative independence and Sperner problems for directed graphs. J. Comb. Theory Ser. A 61, 173\u2013192 (1992)","journal-title":"J. Comb. Theory Ser. A"},{"key":"94_CR19","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V.: A note on group mutual exclusion. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press (2001)","DOI":"10.1145\/383962.383997"},{"issue":"9","key":"94_CR20","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1109\/71.954617","volume":"12","author":"T. Harada","year":"2001","unstructured":"Harada T., Yamashita M.: Coterie join operation and tree structured k-coteries. IEEE Trans. Parallel Distrib. Syst. 12(9), 865\u2013874 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"7","key":"94_CR21","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1109\/TPDS.2004.23","volume":"15","author":"T. Harada","year":"2004","unstructured":"Harada T., Yamashita M.: K-coteries for tolerating network 2-partition. IEEE Trans. Parallel Distrib. Syst. 15(7), 666\u2013672 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"94_CR22","volume-title":"An introduction to the theory of numbers","author":"G.H. Hardy","year":"1965","unstructured":"Hardy G.H., Wright E.M.: An introduction to the theory of numbers. Clarendon Press, Oxford (1965)"},{"key":"94_CR23","doi-asserted-by":"crossref","unstructured":"Huang, S.T., Jiang, J.R., Kuo, Y.C.: K-coteries for fault tolerant K entries to a critical section. In: Proceedings of the 13th International Conference on Distributed Computing Systems, pp. 74\u201381. IEEE Computer Society Press (1993)","DOI":"10.1109\/ICDCS.1993.287721"},{"issue":"10","key":"94_CR24","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/TPDS.2002.1041879","volume":"13","author":"J. Jiang","year":"2002","unstructured":"Jiang J., Lai T.H., Soundarajan N.: On distributed dynamic channel allocation in mobile cellular networks. IEEE Trans. Parallel Distrib. Syst. 13(10), 1024\u20131037 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"94_CR25","doi-asserted-by":"crossref","unstructured":"Jiang, J.R.: A fault-tolerant h-out of-k mutual exclusion algorithm using cohorts coteries for distributed systems. In: Proceedings of the 5th International Conference on Parallel and Distributed Computing: Applications and Technologies (PDCAT), Lecture Notes in Computer Science, vol. 3320, pp. 267\u2013273. Springer (2004)","DOI":"10.1007\/978-3-540-30501-9_57"},{"key":"94_CR26","unstructured":"Jiang, J.R., Huang, S.T.: Obtaining nondominated k-coteries for fault-tolerant distributed k-mutual exclusion. In: Proceedings of the International Conference on Parallel and Distributed Systems, pp. 582\u2013587. IEEE Press (1994)"},{"key":"94_CR27","doi-asserted-by":"crossref","unstructured":"Joung, Y.J.: The congenial talking philosophers problem in computer networks (extended abstract). In: Proceedings of the 13th International Symposium on DIStributed Computing (DISC), Lecture Notes in Computer Science, vol. 1693, pp. 195\u2013209. Springer (1999)","DOI":"10.1007\/3-540-48169-9_14"},{"issue":"4","key":"94_CR28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/PL00008918","volume":"13","author":"Y.J. Joung","year":"2000","unstructured":"Joung Y.J.: Asynchronous group mutual exclusion. Distrib. Comput. 13(4), 189\u2013206 (2000)","journal-title":"Distrib. Comput."},{"issue":"5","key":"94_CR29","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1109\/TPDS.2003.1199064","volume":"14","author":"Y.J. Joung","year":"2003","unstructured":"Joung Y.J.: Quorum-based algorithms for group mutual exclusion. IEEE Trans. Parallel Distrib. Syst. 14(5), 463\u2013476 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"94_CR30","doi-asserted-by":"crossref","unstructured":"Joung, Y.J.: On quorum systems for group resources with bounded capacity. In: Proceedings of the 18th International Symposium on DIStributed Computing (DISC), Lecture Notes in Computer Science, vol. 3274, pp. 86\u2013101. Springer (2004)","DOI":"10.1007\/978-3-540-30186-8_7"},{"issue":"5","key":"94_CR31","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/12.223674","volume":"42","author":"H. Kakugawa","year":"1993","unstructured":"Kakugawa H., Fujita S., Yamashita M., Ae T.: Availability of k-coterie. IEEE Trans. Comput. 42(5), 553\u2013558 (1993)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"94_CR32","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(94)90014-0","volume":"49","author":"H. Kakugawa","year":"1994","unstructured":"Kakugawa H., Fujita S., Yamashita M., Ae T.: A distributed k-mutual exclusion algorithm using k-coterie. Inform. Process. Lett. 49(4), 213\u2013218 (1994)","journal-title":"Inform. Process. Lett."},{"issue":"8","key":"94_CR33","first-page":"1487","volume":"37","author":"H. Kakugawa","year":"1996","unstructured":"Kakugawa H., Yamashita M.: Local coteries and a distributed resource allocation algorithm. Trans. Informa. Process. Soc. Jpn. 37(8), 1487\u20131496 (1996)","journal-title":"Trans. Informa. Process. Soc. Jpn."},{"key":"94_CR34","doi-asserted-by":"crossref","unstructured":"Keane, P., Moir, M.: A simple local-spin group mutual exclusion algorithm. In: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 23\u201332. ACM Press (1999)","DOI":"10.1145\/301308.301319"},{"key":"94_CR35","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(92)90100-9","volume":"59","author":"J. K\u00f6rner","year":"1992","unstructured":"K\u00f6rner J., Simonyi G.: A Sperner-type theorem and qualitative independence. J. Comb. Theory Ser. A 59, 90\u2013103 (1992)","journal-title":"J. Comb. Theory Ser. A"},{"key":"94_CR36","doi-asserted-by":"crossref","unstructured":"Kumar, A., Rabinovich, M., Sinha, R.K.: A performance study of general grid structures for replicated data. In: 13th International Conference on Distributed Computing Systems, pp. 178\u2013185. IEEE Computer Society Press (1993)","DOI":"10.1109\/ICDCS.1993.287710"},{"issue":"1","key":"94_CR37","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(96)00089-0","volume":"59","author":"Y.C. Kuo","year":"1996","unstructured":"Kuo Y.C., Huang S.T.: A simple scheme to construct k-coteries with $${O(\\sqrt{N})}$$ uniform quorum sizes. Inform. Process. Lett. 59(1), 31\u201336 (1996)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"94_CR38","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/71.588618","volume":"8","author":"Y.C. Kuo","year":"1997","unstructured":"Kuo Y.C., Huang S.T.: A geometric approach for constructing coteries and k-coteries. IEEE Trans. Parallel Distrib. Syst. 8(4), 402\u2013411 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"94_CR39","doi-asserted-by":"crossref","unstructured":"Kuo, Y.C., Lee, H.C.: A lightweight group mutual k-exclusion algorithm using bi-j-arbiters. In: Proceedings of the 19th International Conference on Distributed Computing (DISC), Lecture Notes in Computer Science, vol. 3724, pp. 509\u2013510. Springer (2005)","DOI":"10.1007\/11561927_45"},{"key":"94_CR40","unstructured":"Lann, G.L.: Distributed systems: Towards a formal approach. In: IFIP Congress, pp. 155\u2013160 (1977)"},{"key":"94_CR41","doi-asserted-by":"crossref","unstructured":"Lawi, A., Oda, K., Yoshida, T.: A quorum based group k-mutual exclusion algorithm for open distributed environments. In: Proceedings of the 3rd International Symposium on Parallel and Distributed Processing and Applications (ISPA), pp. 119\u2013125 (2005)","DOI":"10.1007\/11576235_16"},{"key":"94_CR42","doi-asserted-by":"crossref","unstructured":"Lawi, A., Oda, K., Yoshida, T.: Quorum based distributed conflict resolution algorithm for bounded capacity resources. In: Proceedings of the ISPA 2006 International Workshops: Frontiers of High Performance Computing and Networking, Lecture Notes in Computer Science, vol. 4331, pp. 135\u2013144. Springer (2006)","DOI":"10.1007\/11942634_15"},{"issue":"3","key":"94_CR43","doi-asserted-by":"crossref","first-page":"221","DOI":"10.2307\/1967920","volume":"23","author":"H.F. MacNeish","year":"1922","unstructured":"MacNeish H.F.: Euler squares. Ann. Math. 2nd Ser. 23(3), 221\u2013227 (1922)","journal-title":"Ann. Math. 2nd Ser."},{"issue":"2","key":"94_CR44","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa M.: A $${\\sqrt{N}}$$ algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145\u2013159 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"6","key":"94_CR45","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1137\/S0097539797325235","volume":"29","author":"D. Malkhi","year":"2000","unstructured":"Malkhi D., Reiter M.K., Wool A.: The load and availability of Byzantine quorum systems. SIAM J. Comput. 29(6), 1889\u20131906 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"94_CR46","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-3975(97)00303-4","volume":"193","author":"Y. Manabe","year":"1998","unstructured":"Manabe Y., Baldoni R., Raynal M., Aoyagi S.: k-arbiter: A safe and general scheme for h-out of-k mutual exclusion. Theor. Comput. Sci. 193(1-2), 97\u2013112 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"94_CR47","doi-asserted-by":"crossref","unstructured":"Manabe, Y., Park, J.: A quorum-based extended group mutual exclusion algorithm without unnecessary blocking. In: Proceedings of the 10th International Conference on Parallel and Distributed Systems (ICPADS), pp. 341\u2013348. IEEE Computer Society (2004)","DOI":"10.1109\/ICPADS.2004.1316113"},{"issue":"1-3","key":"94_CR48","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.tcs.2003.08.003","volume":"310","author":"Y. Manabe","year":"2004","unstructured":"Manabe Y., Tajima N.: (h, k)-arbiters for h-out-of-k mutual exclusion problem. Theor. Comput. Sci. 310(1-3), 379\u2013392 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"94_CR49","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/S0097539795281232","volume":"27","author":"M. Naor","year":"1998","unstructured":"Naor M., Wool A.: The load, capacity, and availability of quorum systems. SIAM J. Comput. 27(2), 423\u2013447 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"94_CR50","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0164-1212(96)00042-8","volume":"37","author":"M.L. Neilsen","year":"1997","unstructured":"Neilsen M.L.: Properties of nondominated K-coteries. J. Syst. Softw. 37(1), 91\u201396 (1997)","journal-title":"J. Syst. Softw."},{"issue":"5","key":"94_CR51","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/71.159041","volume":"3","author":"M.L. Neilsen","year":"1992","unstructured":"Neilsen M.L., Mizuno M.: Coterie join algorithm. IEEE Trans. Parallel Distrib. Syst. 3(5), 582\u2013590 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"94_CR52","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(94)00039-5","volume":"50","author":"M.L. Neilsen","year":"1994","unstructured":"Neilsen M.L., Mizuno M.: Nondominated k-coteries for multiple mutual exclusion. Inf. Process. Lett. 50(5), 247\u2013252 (1994) Erratum in Inf. Process. Lett. 60(6), 319 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"94_CR53","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0020-0190(96)00199-8","volume":"60","author":"M.N. Neilsen","year":"1996","unstructured":"Neilsen M.N., Mizuno M.: Erratum to Nondominated k-coteries for multiple mutual exclusion. Inf. Process. Lett. 60(6), 319 (1996)","journal-title":"Inf. Process. Lett."},{"key":"94_CR54","unstructured":"Pedoe, D.: An Introduction to Projective Geometry. International series of monographs in pure and applied mathematics; 33, Pergamon Press (1963)"},{"issue":"2","key":"94_CR55","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/inco.1995.1169","volume":"123","author":"D. Peleg","year":"1995","unstructured":"Peleg D., Wool A.: The availability of quorum systems. Inform. Comput. 123(2), 210\u2013223 (1995)","journal-title":"Inform. Comput."},{"issue":"2","key":"94_CR56","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s004460050027","volume":"10","author":"D. Peleg","year":"1997","unstructured":"Peleg D., Wool A.: Crumbling walls: A class of practical and efficient quorum systems. Distrib. Comput. 10(2), 87\u201397 (1997)","journal-title":"Distrib. Comput."},{"key":"94_CR57","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0166-218X(83)90072-0","volume":"6","author":"S. Poljak","year":"1983","unstructured":"Poljak S., Pultr A., R\u00f6dl V.: On qualitatively independent partitions and related problems. Discrete Appl. Math. 6, 193\u2013205 (1983)","journal-title":"Discrete Appl. Math."},{"key":"94_CR58","doi-asserted-by":"crossref","first-page":"475","DOI":"10.21136\/CMJ.1980.101696","volume":"30","author":"S. Poljak","year":"1980","unstructured":"Poljak S., R\u00f6dl V.: Orthogonal partitions and covering of graphs. Czechoslovak Math. J. 30, 475\u2013485 (1980)","journal-title":"Czechoslovak Math. J."},{"key":"94_CR59","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0097-3165(89)90081-2","volume":"51","author":"S. Poljak","year":"1989","unstructured":"Poljak S., Tuza Z.: On the maximum number of qualitatively independent partitions. J. Comb. Theory Ser. A 51, 111\u2013116 (1989)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"94_CR60","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s11036-005-4460-6","volume":"11","author":"A. Rangnekar","year":"2006","unstructured":"Rangnekar A., Sivalingam K.M.: QoS aware multi-channel scheduling for IEEE 802.15.3 networks. Mobile Netw. Appl. 11(1), 47\u201362 (2006)","journal-title":"Mobile Netw. Appl."},{"key":"94_CR61","volume-title":"Algorithms for Mutual Exclusion","author":"M. Raynal","year":"1986","unstructured":"Raynal M.: Algorithms for Mutual Exclusion. MIT Press, Cambridge, MA (1986)"},{"key":"94_CR62","doi-asserted-by":"crossref","unstructured":"Raynal, M.: A distributed solution to the k-out of-m resources allocation problem. In: Proceedings of the International Conference on Computing and Information (ICCI), pp. 599\u2013609. Springer-Verlag (1991)","DOI":"10.1007\/3-540-54029-6_209"},{"issue":"2","key":"94_CR63","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/122120.122123","volume":"25","author":"M. Raynal","year":"1991","unstructured":"Raynal M.: A simple taxonomy for distributed mutual exclusion algorithms. ACM Operat. Syst. Rev. SIGOPS 25(2), 47\u201350 (1991)","journal-title":"ACM Operat. Syst. Rev. SIGOPS"},{"key":"94_CR64","unstructured":"R\u00e9nyi A.: Probability Theory. Elsevier\/North-Holland (1970)"},{"issue":"1","key":"94_CR65","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart G., Agrawala A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9\u201317 (1981)","journal-title":"Commun. ACM"},{"issue":"3","key":"94_CR66","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/24068.28052","volume":"5","author":"B.A. Sanders","year":"1987","unstructured":"Sanders B.A.: The information structure of distributed mutual exclusion algorithms. ACM Trans. Comput. Syst. 5(3), 284\u2013299 (1987)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"94_CR67","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0920-5489(02)00105-8","volume":"25","author":"P.C. Saxena","year":"2003","unstructured":"Saxena P.C., Rai J.: A survey of permission-based distributed mutual exclusion algorithms. Comput. Standards Interf. 25(2), 159\u2013181 (2003)","journal-title":"Comput. Standards Interf."},{"issue":"1","key":"94_CR68","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/jpdc.1993.1048","volume":"18","author":"M. Singhal","year":"1993","unstructured":"Singhal M.: A taxonomy of distributed mutual exclusion. J. Parallel Distrib. Comput. 18(1), 94\u2013101 (1993)","journal-title":"J. Parallel Distrib. Comput."},{"key":"94_CR69","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"Sperner E.: Ein Satz \u00fcber die Untermengen einer endlichen Menge. Math. Zeitschrift 27, 544\u2013548 (1928)","journal-title":"Math. Zeitschrift"},{"issue":"5","key":"94_CR70","first-page":"968","volume":"82","author":"S.C. Sung","year":"1999","unstructured":"Sung S.C., Manabe Y.: Coterie for generalized mutual exclusion problem. IEICE Trans. Inform. Syst. 82(5), 968\u2013972 (1999)","journal-title":"IEICE Trans. Inform. Syst."},{"issue":"2","key":"94_CR71","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0020-0190(02)00355-1","volume":"85","author":"K. Vidyasankar","year":"2003","unstructured":"Vidyasankar K.: A simple group l-exclusion algorithm. Inform. Process. Lett. 85(2), 79\u201385 (2003)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"94_CR72","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1049\/ip-cdt:20000162","volume":"147","author":"K.P. Wu","year":"2000","unstructured":"Wu K.P., Joung Y.J.: Asynchronous group mutual exclusion in ring networks. IEE Proc Comput. Digit. Tech. 147(1), 1\u20138 (2000)","journal-title":"IEE Proc Comput. Digit. Tech."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0094-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0094-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0094-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T01:32:37Z","timestamp":1634952757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0094-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,16]]},"references-count":72,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0094-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,16]]}}}