{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:55Z","timestamp":1759637635789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030249212"},{"type":"electronic","value":"9783030249229"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-24922-9_21","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T10:04:49Z","timestamp":1562925889000},"page":"309-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Making Randomized Algorithms Self-stabilizing"],"prefix":"10.1007","author":[{"given":"Volker","family":"Turau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(96)00286-1","volume":"186","author":"Y Afek","year":"1997","unstructured":"Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its applications to self-stabilization. Theor. Comput. Sci. 186(1), 199\u2013229 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"21_CR3","unstructured":"Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: Proceedings of 32nd Annual Symposium of Foundations of Computer Science, pp. 258\u2013267, October 1991"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/BFb0020443","volume-title":"Distributed Algorithms","author":"B Awerbuch","year":"1994","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilization by local checking and global reset. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 326\u2013339. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0020443"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Goldenberg, U.: Locally-iterative distributed $$(\\varDelta +1)$$-Coloring below szegedy-vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In: Proceedings of ACM Symposium on Principles of Distributed Computing, pp. 437\u2013446 (2018)","DOI":"10.1145\/3212734.3212769"},{"issue":"3","key":"21_CR6","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/2903137","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM 63(3), 20:1\u201320:45 (2016)","journal-title":"J. ACM"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/11577327_2","volume-title":"Self-Stabilizing Systems","author":"C Boulinier","year":"2005","unstructured":"Boulinier, C., Petit, F., Villain, V.: Synchronous vs. Asynchronous Unison. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol. 3764, pp. 18\u201332. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11577327_2"},{"issue":"04","key":"21_CR8","first-page":"1650016","volume":"26","author":"J Cohen","year":"2016","unstructured":"Cohen, J., Lefevre, J., Maamra, K., Pilard, L., Sohier, D.: A self-stabilizing algorithm for maximal matching in anonymous networks. PPL 26(04), 1650016 (2016)","journal-title":"PPL"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1142\/S0129054115500173","volume":"26","author":"S Devismes","year":"2015","unstructured":"Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. self vs. probabilistic stabilization. Int. J. Found. Comput. Sci. 26(3), 291\u2013319 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/32.387472","volume":"21","author":"S Dolev","year":"1995","unstructured":"Dolev, S., Israeli, A., Moran, S.: Analyzing expected time by scheduler-luck games. IEEE Trans. Softw. Eng. 21(5), 429\u2013439 (1995)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1007\/s00446-018-0344-4","volume-title":"Distributed Computing","author":"M Fischer","year":"2017","unstructured":"Fischer, M.: Improved deterministic distributed matching via rounding. In: Richa, A. (ed.) Distributed Computing, vol. 91, pp. 17:1\u201317:15. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/s00446-018-0344-4"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 270\u2013277 (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"issue":"4","key":"21_CR13","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."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(90)90107-9","volume":"35","author":"T Herman","year":"1990","unstructured":"Herman, T.: Probabilistic self-stabilization. IPL 35(2), 63\u201367 (1990)","journal-title":"IPL"},{"issue":"5","key":"21_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(95)00050-M","volume":"54","author":"T Herman","year":"1995","unstructured":"Herman, T., Ghosh, S.: Stabilizing phase-clocks. IPL 54(5), 259\u2013265 (1995)","journal-title":"IPL"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A Israeli","year":"1986","unstructured":"Israeli, A., Itai, A.: A fast and simple randomized parallel algorithm for maximal matching. IPL 22(2), 77\u201380 (1986)","journal-title":"IPL"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-41527-2_7","volume-title":"Distributed Computing","author":"A Kravchik","year":"2013","unstructured":"Kravchik, A., Kutten, S.: Time optimal synchronous self stabilizing spanning tree. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 91\u2013105. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41527-2_7"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-05118-0_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Lenzen","year":"2009","unstructured":"Lenzen, C., Suomela, J., Wattenhofer, R.: Local algorithms: self-stabilization on speed. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 17\u201334. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05118-0_2"},{"issue":"5","key":"21_CR19","doi-asserted-by":"publisher","first-page":"38:1","DOI":"10.1145\/2786753","volume":"62","author":"Z Lotker","year":"2015","unstructured":"Lotker, Z., Patt-Shamir, B., Pettie, S.: Improved distributed approximate matching. J. ACM 62(5), 38:1\u201338:17 (2015)","journal-title":"J. ACM"},{"issue":"5","key":"21_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s00446-010-0121-5","volume":"23","author":"Y M\u00e9tivier","year":"2011","unstructured":"M\u00e9tivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A.: An optimal bit complexity randomized distributed MIS algorithm. Distrib. Comput. 23(5), 331\u2013340 (2011)","journal-title":"Distrib. Comput."},{"key":"21_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"issue":"5","key":"21_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.3390\/a11050058","volume":"11","author":"V Turau","year":"2018","unstructured":"Turau, V.: Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains. Algorithms 11(5), 58 (2018)","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24922-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:58:32Z","timestamp":1710266312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24922-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030249212","9783030249229"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24922-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.gssi.it\/sirocco2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}