{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T21:03:33Z","timestamp":1765487013400,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_17","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"232-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Self-stabilizing $$(\\varDelta +1)$$-Coloring in\u00a0Sublinear (in $$\\varDelta $$) Rounds via\u00a0Locally-Iterative Algorithms"],"prefix":"10.1007","author":[{"given":"Xinyu","family":"Fu","sequence":"first","affiliation":[]},{"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Chaodong","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"4","key":"17_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":"17_CR2","doi-asserted-by":"crossref","unstructured":"Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to Distributed Self-Stabilizing Algorithms. Morgan & Claypool, San Rafael (2019)","DOI":"10.1007\/978-3-031-02013-1"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2979675","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim, L.: Deterministic ($$\\Delta $$+1)-coloring in sublinear (in $$\\Delta $$) time in static, dynamic, and faulty networks. J. ACM 63(5), 1\u201322 (2016)","journal-title":"J. ACM"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, San Rafael (2013)","DOI":"10.1007\/978-3-031-02009-4"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3486625","volume":"69","author":"L Barenboim","year":"2021","unstructured":"Barenboim, L., Elkin, M., Goldenberg, U.: Locally-iterative distributed ($$\\Delta $$+1)-coloring and applications. J. ACM 69(1), 1\u201326 (2021)","journal-title":"J. ACM"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/12088848X","volume":"43","author":"L Barenboim","year":"2014","unstructured":"Barenboim, L., Elkin, M., Kuhn, F.: Distributed ($$\\Delta $$+1)-coloring in linear (in $$\\Delta $$) time. SIAM J. Comput. 43(1), 72\u201395 (2014)","journal-title":"SIAM J. Comput."},{"key":"17_CR7","first-page":"366","volume":"1","author":"PL Chebyshev","year":"1852","unstructured":"Chebyshev, P.L.: M\u00e9moire sur les nombres premiers. Journal de math\u00e9matiques pures et appliqu\u00e9es 1, 366\u2013390 (1852)","journal-title":"Journal de math\u00e9matiques pures et appliqu\u00e9es"},{"issue":"1","key":"17_CR8","first-page":"21","volume":"14","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Datta, A.K., Tixeuil, S.: Stabilizing inter-domain routing in the internet. J. High Speed Netw. 14(1), 21\u201337 (2005)","journal-title":"J. High Speed Netw."},{"key":"17_CR9","unstructured":"Datta, A.K., Outley, E., Thiagarajan, V., Flatebo, M.: Stabilization of the x.25 connection management protocol. In: International Conference on Computing and Information, ICCI 1994, pp. 1637\u20131654 (1994)"},{"issue":"11","key":"17_CR10","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"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Heinrich, M., Kosowski, A.: Local conflict coloring. In: Proceedings of the 2016 IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, pp. 625\u2013634. IEEE (2016)","DOI":"10.1109\/FOCS.2016.73"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Kuhn, F.: Deterministic distributed vertex coloring: simpler, faster, and without network decomposition. In: Proceedings of the 62nd Annual Symposium on Foundations of Computer Science, FOCS 2022, pp. 1009\u20131020. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00101"},{"issue":"4","key":"17_CR14","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":"17_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 138\u2013144. ACM (2009)","DOI":"10.1145\/1583991.1584032"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/858336.858339","volume":"19","author":"L Lamport","year":"1985","unstructured":"Lamport, L.: Solved problems, unsolved problems and non-problems in concurrency. ACM SIGOPS Oper. Syst. Rev. 19(4), 34\u201344 (1985)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"17_CR17","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"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Linial, N.: Distributive graph algorithms global solutions from local data. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, FOCS 1987, pp. 331\u2013335. IEEE (1987)","DOI":"10.1109\/SFCS.1987.20"},{"issue":"4","key":"17_CR19","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":"17_CR20","doi-asserted-by":"crossref","unstructured":"Maus, Y.: Distributed graph coloring made easy. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2021, pp. 362\u2013372. ACM (2021)","DOI":"10.1145\/3409964.3461804"},{"key":"17_CR21","unstructured":"Maus, Y., Tonoyan, T.: Local Conflict Coloring Revisited: Linial for Lists. In: Proceedings of the 34th International Symposium on Distributed Computing, DISC 2020, pp. 16:1\u201316:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 184\u2013193. ACM (1993)","DOI":"10.1145\/167088.167149"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. In: SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Szegedy, M., Vishwanathan, S.: Locality based graph coloring. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 201\u2013207. ACM (1993)","DOI":"10.1145\/167088.167156"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:09:59Z","timestamp":1702026599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","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":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"0","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":"41% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}