{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:48Z","timestamp":1759637688407,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_13","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"161-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compact Self-Stabilizing Leader Election for General Networks"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-33536-5_13","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J Adamek","year":"2012","unstructured":"Adamek, J., Nesterenko, M., Tixeuil, S.: Evaluating practical tolerance properties of stabilizing programs through simulation: the case of propagation of information with feedback. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 126\u2013132. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33536-5_13"},{"key":"13_CR2","unstructured":"Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-54099-7_2","volume-title":"Distributed Algorithms","author":"Y Afek","year":"1991","unstructured":"Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 15\u201328. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54099-7_2"},{"issue":"9","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A Arora","year":"1994","unstructured":"Arora, A., Gouda, M.G.: Distributed reset. IEEE Trans. Comput. 43(9), 1026\u20131038 (1994)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset. In: PODC, pp. 254\u2013263. ACM (1994)","DOI":"10.1145\/197917.198104"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2012.01.034","volume":"444","author":"JRS Blair","year":"2012","unstructured":"Blair, J.R.S., Manne, F.: An efficient self-stabilizing distance-2 coloring algorithm. Theor. Comput. Sci. 444, 28\u201339 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Blin, L., Boubekeur, F., Dubois, S.: A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. In: IPDPS 2015, pp. 1065\u20131074 (2015)","DOI":"10.1109\/IPDPS.2015.44"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Blin, L., Fraigniaud, P.: Space-optimal time-efficient silent self-stabilizing constructions of constrained spanning trees. In: Proceedings of ICDCS 2015, pp. 589\u2013598 (2015)","DOI":"10.1109\/ICDCS.2015.66"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2013.07.003","volume":"500","author":"L Blin","year":"2013","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S.: A super-stabilizing log(n)log(n)-approximation algorithm for dynamic steiner trees. Theor. Comput. Sci. 500, 90\u2013112 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Blin, L., Tixeuil, S.: Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distrib. Comput. 1\u201328 (2017). https:\/\/doi.org\/10.1007\/s00446-017-0294-2","DOI":"10.1007\/s00446-017-0294-2"},{"key":"13_CR11","unstructured":"Blin, L., Tixeuil, S.: Compact self-stabilizing leader election for arbitrary networks. Technical report 1702.07605, ArXiv eprint, Febrary 2017"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(91)90111-T","volume":"39","author":"NS Chen","year":"1991","unstructured":"Chen, N.S., Yu, H.P., Huang, S.T.: A self-stabilizing algorithm for constructing spanning trees. Inf. Process. Lett. 39(3), 147\u2013151 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(94)90103-1","volume":"49","author":"Z Collin","year":"1994","unstructured":"Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Inf. Process. Lett. 49(6), 297\u2013301 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"10","key":"13_CR14","doi-asserted-by":"publisher","first-page":"498","DOI":"10.2514\/1.19848","volume":"3","author":"S Dela\u00ebt","year":"2006","unstructured":"Dela\u00ebt, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revisited. J. Aerosp. Comput. Inf. Commun. (JACIC) 3(10), 498\u2013514 (2006)","journal-title":"J. Aerosp. Comput. Inf. Commun. (JACIC)"},{"key":"13_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)"},{"issue":"6","key":"13_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s002360050180","volume":"36","author":"S Dolev","year":"1999","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Inf. 36(6), 447\u2013462 (1999)","journal-title":"Acta Inf."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S Dolev","year":"1993","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. Distrib. Comput. 7(1), 3\u201316 (1993)","journal-title":"Distrib. Comput."},{"key":"13_CR18","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. Technical report 1110.0334, ArXiv eprint, October 2011"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-44681-8_67","volume-title":"Euro-Par 2001 Parallel Processing","author":"M Gradinariu","year":"2001","unstructured":"Gradinariu, M., Johnen, C.: Self-stabilizing neighborhood unique naming under unfair scheduler. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds.) Euro-Par 2001. LNCS, vol. 2150, pp. 458\u2013465. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44681-8_67"},{"issue":"1\u20132","key":"13_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0020-0190(99)00164-7","volume":"73","author":"T Herman","year":"2000","unstructured":"Herman, T., Pemmaraju, S.V.: Error-detecting codes and fault-containing self-stabilization. Inf. Process. Lett. 73(1\u20132), 41\u201346 (2000)","journal-title":"Inf. Process. Lett."},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 45\u201358. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27820-7_6"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-49259-9_17","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Inoue","year":"2016","unstructured":"Inoue, M., Ooshita, F., Tixeuil, S.: An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 195\u2013212. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_17"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-69084-1_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Inoue","year":"2017","unstructured":"Inoue, M., Ooshita, F., Tixeuil, S.: An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 93\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_7"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Korman, A., Kutten, S., Masuzawa, T.: Fast and compact self stabilizing verification, computation, and fault detection of an MST. In: Proceedings of PODC 2011, pp. 311\u2013320. ACM, New York (2011)","DOI":"10.1145\/1993806.1993866"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:01:29Z","timestamp":1709827289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}