{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:41Z","timestamp":1740099221870,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032319"},{"type":"electronic","value":"9783030032326"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_6","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"80-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Self-stabilization and Byzantine Tolerance for Maximal Matching"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kunne","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9548-5260","authenticated-orcid":false,"given":"Johanne","family":"Cohen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1104-8216","authenticated-orcid":false,"given":"Laurence","family":"Pilard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-15612-5_17","volume-title":"WALCOM: Algorithms and Computation","author":"Y Asada","year":"2015","unstructured":"Asada, Y., Inoue, M.: An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 187\u2013198. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-15612-5_17"},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s00453-007-9081-y","volume":"50","author":"P Berenbrink","year":"2008","unstructured":"Berenbrink, P., Friedetzky, T., Martin, R.A.: On the stability of dynamic diffusion load balancing. Algorithmica 50(3), 329\u2013350 (2008)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S012962641650016X","volume":"26","author":"J Cohen","year":"2016","unstructured":"Cohen, J., Lef\u00e8vre, J., Ma\u00e2mra, K., Pilard, L., Sohier, D.: A self-stabilizing algorithm for maximal matching in anonymous networks. Parallel Process. Lett. 26(4), 1\u201317 (2016). \nhttps:\/\/doi.org\/10.1142\/S012962641650016X","journal-title":"Parallel Process. Lett."},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Cournier, A., Devismes, S., Villain, V.: Snap-stabilizing PIF and useless computations. In: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, 12\u201315 July 2006, pp. 39\u201348 (2006). \nhttps:\/\/doi.org\/10.1109\/ICPADS.2006.100","DOI":"10.1109\/ICPADS.2006.100"},{"issue":"11","key":"6_CR5","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":"6_CR6","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/71.588622","volume":"8","author":"S Dolev","year":"1997","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4), 424\u2013440 (1997). \nhttps:\/\/doi.org\/10.1109\/71.588622","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"7","key":"6_CR7","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.jpdc.2012.04.001","volume":"72","author":"S Dubois","year":"2012","unstructured":"Dubois, S., Potop-Butucaru, M., Nesterenko, M., Tixeuil, S.: Self-stabilizing Byzantine asynchronous unison. J. Parallel Distrib. Comput. 72(7), 917\u2013923 (2012). \nhttps:\/\/doi.org\/10.1016\/j.jpdc.2012.04.001","journal-title":"J. Parallel Distrib. Comput."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-30347-0_13","volume-title":"Fun with Algorithms","author":"S Dubois","year":"2012","unstructured":"Dubois, S., Tixeuil, S., Zhu, N.: The Byzantine brides problem. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 107\u2013118. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-30347-0_13"},{"issue":"3","key":"6_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1006\/jcss.1996.0075","volume":"53","author":"B Ghosh","year":"1996","unstructured":"Ghosh, B., Muthukrishnan, S.: Dynamic load balancing by random matchings. J. Comput. Syst. Sci. 53(3), 357\u2013370 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR10","unstructured":"Goddard, W., Hedetniemi, S.T., Shi, Z.: An anonymous self-stabilizing algorithm for 1-maximal matching in trees. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications and Conference on Real-Time Computing Systems and Applications, PDPTA, vol. 2, pp. 797\u2013803 (2006)"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.jpdc.2009.11.006","volume":"70","author":"N Guellati","year":"2010","unstructured":"Guellati, N., Kheddouci, H.: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs. J. Parallel Distrib. Comput. 70(4), 406\u2013415 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"key":"6_CR12","series-title":"Wireless Networks","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56252-0","volume-title":"Matching Theory for Wireless Networks","author":"Z Han","year":"2017","unstructured":"Han, Z., Gu, Y., Saad, W.: Matching Theory for Wireless Networks. WN. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-56252-0"},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0020-0190(01)00171-5","volume":"80","author":"ST Hedetniemi","year":"2001","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5), 221\u2013223 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"SC Hsu","year":"1992","unstructured":"Hsu, S.C., Huang, S.T.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett. 43(2), 77\u201381 (1992)","journal-title":"Inf. Process. Lett."},{"key":"6_CR15","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69084-1_7"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/71.920585","volume":"12","author":"MH Karaata","year":"2001","unstructured":"Karaata, M.H.: Self-stabilizing strong fairness under weak fairness. IEEE Trans. Parallel Distrib. Syst. 12(4), 337\u2013345 (2001). \nhttps:\/\/doi.org\/10.1109\/71.920585","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. (TOPLAS) 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"14","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1016\/j.tcs.2008.12.022","volume":"410","author":"F Manne","year":"2009","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A new self-stabilizing maximal matching algorithm. Theor. Comput. Sci. (TCS) 410(14), 1336\u20131345 (2009)","journal-title":"Theor. Comput. Sci. (TCS)"},{"issue":"1","key":"6_CR19","first-page":"1","volume":"1","author":"T Masuzawa","year":"2007","unstructured":"Masuzawa, T., Tixeuil, S.: Stabilizing link-coloration of arbitrary networks with unbounded Byzantine faults. Int. J. Princ. Appl. Inf. Sci. Technol. (PAIST) 1(1), 1\u201313 (2007)","journal-title":"Int. J. Princ. Appl. Inf. Sci. Technol. (PAIST)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded Byzantine faults. In: Proceedings 21st IEEE Symposium on Reliable Distributed Systems 2002, pp. 22\u201329. IEEE (2002)","DOI":"10.1109\/RELDIS.2002.1180170"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11516798_21","volume-title":"Principles of Distributed Systems","author":"Y Sakurai","year":"2005","unstructured":"Sakurai, Y., Ooshita, F., Masuzawa, T.: A self-stabilizing link-coloring protocol resilient to Byzantine faults in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 283\u2013298. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11516798_21"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Sauerwald, T., Sun, H.: Tight bounds for randomized load balancing on arbitrary network topologies. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 341\u2013350. IEEE (2012)","DOI":"10.1109\/FOCS.2012.86"},{"issue":"40","key":"6_CR23","doi-asserted-by":"publisher","first-page":"5527","DOI":"10.1016\/j.tcs.2010.11.032","volume":"412","author":"V Turau","year":"2011","unstructured":"Turau, V., Hauck, B.: A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2. Theor. Comput. Sci. (TCS) 412(40), 5527\u20135540 (2011)","journal-title":"Theor. Comput. Sci. (TCS)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:47:38Z","timestamp":1539935258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_6","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":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}