{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:52:31Z","timestamp":1743076351674,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910808"},{"type":"electronic","value":"9783030910815"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91081-5_33","type":"book-chapter","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T21:03:40Z","timestamp":1636405420000},"page":"479-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-stabilization and Byzantine Tolerance for Maximal Independent Set"],"prefix":"10.1007","author":[{"given":"Johanne","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence","family":"Pilard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"S\u00e9nizergues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"issue":"4","key":"33_CR1","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":"33_CR2","doi-asserted-by":"crossref","unstructured":"Cournier, A., Devismes, S., Villain, V.: Snap-stabilizing PIF and useless computations. In: ICPADS, pp. 39\u201348 (2006)","DOI":"10.1109\/ICPADS.2006.100"},{"issue":"11","key":"33_CR3","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":"33_CR4","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)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1109\/TNET.2017.2690359","volume":"25","author":"X Gao","year":"2017","unstructured":"Gao, X., et al.: A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE\/ACM Trans. Netw. 25(4), 2223\u20132234 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"33_CR6","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: IPDPS, p. 14-p. IEEE (2003)"},{"key":"33_CR7","first-page":"406","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. JPDC 70, 406\u2013415 (2010)","journal-title":"JPDC"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Hedetniemi, S.T.: Self-stabilizing domination algorithms. In: Structures of Dominationin Graphs, pp. 485\u2013520 (2021)","DOI":"10.1007\/978-3-030-58892-2_16"},{"key":"33_CR9","unstructured":"Ikeda, M., Kamei, S., Kakugawa, H.: A space-optimal self-stabilizing algorithm for the maximal independent set problem. In: PDCAT, pp. 70\u201374 (2002)"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Linial, N.: Distributive graph algorithms global solutions from local data. In: 28th Annual Symposium on Foundations of Computer Science, pp. 331\u2013335 (1987)","DOI":"10.1109\/SFCS.1987.20"},{"issue":"6","key":"33_CR12","doi-asserted-by":"publisher","first-page":"2740","DOI":"10.1109\/TCOMM.2017.2685580","volume":"65","author":"T Liu","year":"2017","unstructured":"Liu, T., Wang, X., Zheng, L.: A cooperative SWIPT scheme for wirelessly powered sensor networks. IEEE Trans. Commun. 65(6), 2740\u20132752 (2017)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"33_CR14","unstructured":"Shukla, S.K., Rosenkrantz, D.J., Ravi, S.S., et al.: Observations on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of the Second Workshop on Self-stabilizing Systems, vol. 7, p. 15 (1995)"},{"issue":"3","key":"33_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ipl.2007.02.013","volume":"103","author":"V Turau","year":"2007","unstructured":"Turau, V.: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf. Process. Lett. 103(3), 88\u201393 (2007)","journal-title":"Inf. Process. Lett."},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-24922-9_21","volume-title":"Structural Information and Communication Complexity","author":"V Turau","year":"2019","unstructured":"Turau, V.: Making randomized algorithms self-stabilizing. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 309\u2013324. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_21"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91081-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:44:25Z","timestamp":1710258265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91081-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910808","9783030910815"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91081-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.chalmers.se\/~elad\/SSS2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"56","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":"16","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":"10","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":"29% - 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":"3","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)"}}]}}