{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:38:00Z","timestamp":1752673080454,"version":"3.40.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095806"},{"type":"electronic","value":"9783319095813"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09581-3_2","type":"book-chapter","created":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T11:20:14Z","timestamp":1406978414000},"page":"9-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Leader Election in Rings with Homonyms"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Hung","family":"Tran-The","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,3]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1137\/0218002","volume":"18","author":"K Abrahamson","year":"1989","unstructured":"Abrahamson, K., Adler, A., Gelbart, R., Higham, L., Kirkpatrick, D.: The bit complexity of randomized leader election on a ring. SIAM J. Comput. 18(1), 12\u201329 (1989)","journal-title":"SIAM J. Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC \u201980, pp. 82\u201393. ACM, New York (1980)","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Ar\u00e9valo, S., Anta, A.F., Imbs, D., Jim\u00e9nez, E., Raynal, M.: Failure detectors in homonymous distributed systems (with an application to consensus). In: ICDCS, pp. 275\u2013284 (2012)","DOI":"10.1109\/ICDCS.2012.13"},{"key":"2_CR5","unstructured":"Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: ISTCS, pp. 16\u201326 (1996)"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1145\/63264.63403","volume":"11","author":"JE Burns","year":"1989","unstructured":"Burns, J.E., Pachl, J.K.: Uniform self-stabilizing rings. ACM Trans. Program. Lang. Syst. 11(2), 330\u2013344 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00446-012-0163-y","volume":"25","author":"J Chalopin","year":"2012","unstructured":"Chalopin, J., Godard, E., M\u00e9tivier, Y.: Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distrib. Comput. 25(4), 297\u2013311 (2012)","journal-title":"Distrib. Comput."},{"issue":"1","key":"2_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2012-747","volume":"120","author":"J Chalopin","year":"2012","unstructured":"Chalopin, J., M\u00e9tivier, Y., Morsellino, T.: Enumeration and leader election in partially anonymous and multi-hop broadcast networks. Fundam. Inform. 120(1), 1\u201327 (2012)","journal-title":"Fundam. Inform."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"D Chaum","year":"1991","unstructured":"Chaum, D., van Heyst, E.: Group signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257\u2013265. Springer, Heidelberg (1991)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.-M., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: PODC, pp. 21\u201330. ACM (2011)","DOI":"10.1145\/1993806.1993810"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-25959-3_6","volume-title":"Distributed Computing and Networking","author":"C Delporte-Gallet","year":"2012","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Byzantine agreement with homonyms in synchronous systems. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol. 7129, pp. 76\u201390. Springer, Heidelberg (2012)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-31104-8_15","volume-title":"Structural Information and Communication Complexity","author":"C Delporte-Gallet","year":"2012","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Homonyms with forgeable identifiers. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 171\u2013182. Springer, Heidelberg (2012)"},{"issue":"11","key":"2_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"4","key":"2_CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FUN-2004-59402","volume":"59","author":"S Dobrev","year":"2004","unstructured":"Dobrev, S., Pelc, A.: Leader election in rings with nonunique labels. Fundam. Inform. 59(4), 333\u2013347 (2004)","journal-title":"Fundam. Inform."},{"issue":"5","key":"2_CR15","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/358506.358517","volume":"25","author":"R Franklin","year":"1982","unstructured":"Franklin, R.: On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun. ACM 25(5), 336\u2013337 (1982)","journal-title":"Commun. ACM"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/169683.174161","volume":"15","author":"S-T Huang","year":"1993","unstructured":"Huang, S.-T.: Leader election in uniform rings. ACM Trans. Program. Lang. Syst. 15(3), 563\u2013573 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-35668-1_24","volume-title":"Distributed Computing and Networking","author":"S Kutten","year":"2013","unstructured":"Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., Trehan, A.: Sublinear bounds for randomized leader election. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 348\u2013362. Springer, Heidelberg (2013)"},{"issue":"6\u20137","key":"2_CR18","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.tcs.2008.10.010","volume":"410","author":"M Mavronicolas","year":"2009","unstructured":"Mavronicolas, M., Michael, L., Spirakis, P.G.: Computing on a partially eponymous ring. Theor. Comput. Sci. 410(6\u20137), 595\u2013613 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"JK Pachl","year":"1984","unstructured":"Pachl, J.K., Korach, E., Rotem, D.: Lower bounds for distributed maximum-finding algorithms. J. ACM 31(4), 905\u2013918 (1984)","journal-title":"J. ACM"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/69622.357194","volume":"4","author":"GL Peterson","year":"1982","unstructured":"Peterson, G.L.: An o(nlog n) unidirectional algorithm for the circular extrema problem. ACM Trans. Program. Lang. Syst. 4(4), 758\u2013762 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR21","unstructured":"Xu, Z., Srimani, P.K.: Self-stabilizing anonymous leader election in a tree. In: IPDPS. IEEE Computer Society (2005)"},{"issue":"9","key":"2_CR22","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/71.798313","volume":"10","author":"M Yamashita","year":"1999","unstructured":"Yamashita, M., Kameda, T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Trans. Parallel Distrib. Syst. 10(9), 878\u2013887 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<221::AID-NET7>3.0.CO;2-M","volume":"34","author":"M Yamashita","year":"1999","unstructured":"Yamashita, M., Kameda, T.: Modeling k-coteries by well-covered graphs. Networks 34(3), 221\u2013228 (1999)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09581-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T01:49:35Z","timestamp":1746323375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09581-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095806","9783319095813"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09581-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}