{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:46:25Z","timestamp":1791319585085,"version":"4.3.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993866","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T10:36:21Z","timestamp":1307529381000},"page":"311-320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Fast and compact self stabilizing verification, computation, and fault detection of an MST"],"prefix":"10.1145","author":[{"given":"Amos","family":"Korman","sequence":"first","affiliation":[{"name":"CNRS & Univ. Paris Diderot, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[{"name":"Osaka University, Osaka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"Self-Stabilizing Unidirectional Network Algorithms by Power Supply","volume":"1998","author":"Afek Y.","year":"1998","unstructured":"Y. Afek and A. Bremler-Barr . Self-Stabilizing Unidirectional Network Algorithms by Power Supply . Chicago J. Theor. Comput. Sci. 1998 : ( 1998 ). Y. Afek and A. Bremler-Barr. Self-Stabilizing Unidirectional Network Algorithms by Power Supply. Chicago J. Theor. Comput. Sci. 1998: (1998).","journal-title":"Chicago J. Theor. Comput. Sci."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00286-1"},{"key":"e_1_3_2_1_3_1","volume-title":"Time Optimal Self Stabilizing Spanning Tree Algorithms. FSTTCS","author":"Aggarwal S.","year":"1993","unstructured":"S. Aggarwal and S. Kutten . Time Optimal Self Stabilizing Spanning Tree Algorithms. FSTTCS 1993 . S. Aggarwal and S. Kutten. Time Optimal Self Stabilizing Spanning Tree Algorithms. FSTTCS 1993."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.312126"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28421"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2007.1007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167256"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185378"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185377"},{"key":"e_1_3_2_1_10_1","volume-title":"A New Self-stabilizingminimum spanning treeconstruction with loop-Free property.DISC","author":"Blin L.","year":"2009","unstructured":"L. Blin , M. Potop-Butucaru , S. Rovedakis and S. Tixeuil . A New Self-stabilizingminimum spanning treeconstruction with loop-Free property.DISC 2009 . L. Blin, M. Potop-Butucaru, S. Rovedakis and S. Tixeuil.A New Self-stabilizingminimum spanning treeconstruction with loop-Free property.DISC 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"L. Blin S. Dolev M. Gradinariu Potop-Butucaru andS. Rovedakis.Fast Self-Stabilizing Minimum Spanning Tree Construction.DISC 2010: 312--327.   L. Blin S. Dolev M. Gradinariu Potop-Butucaru andS. Rovedakis.Fast Self-Stabilizing Minimum Spanning Tree Construction.DISC 2010: 312--327.","DOI":"10.1007\/978-3-642-15763-9_29"},{"key":"e_1_3_2_1_12_1","volume-title":"IPCCC 1999: 20--26","author":"Bui A.","unstructured":"A. Bui , A. K. Datta , F. Petit , V. Villain . Space optimal PIF algorithm: self-stabilized with no extra space . IPCCC 1999: 20--26 . A. Bui, A. K. Datta, F. Petit, V. Villain. Space optimal PIF algorithm: self-stabilized with no extra space. IPCCC 1999:20--26."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90103-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011790"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233171"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1484018.1484033"},{"key":"e_1_3_2_1_17_1","volume-title":"SSS 2010:  35--49","author":"Datta A. K.","unstructured":"A. K. Datta , L. L. Larmore , H. Piniganti . Self stabilizing Leader Election in Dynamic Networks . SSS 2010: 35--49 . A. K. Datta, L. L. Larmore, H. Piniganti. Self stabilizing Leader Election in Dynamic Networks. SSS 2010: 35--49."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050180"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684110"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366821"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248057"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(02)00029-1"},{"key":"e_1_3_2_1_25_1","first-page":"194","article-title":"Self-stabilizing minimum spanning tree construction on message passingnetworks.","volume":"2001","author":"Higham L.","unstructured":"L. Higham , and Z. Liang . Self-stabilizing minimum spanning tree construction on message passingnetworks. DISC 2001 : 194 -- 208 . L. Higham, and Z. Liang. Self-stabilizing minimum spanning tree construction on message passingnetworks.DISC 2001:194--208.","journal-title":"DISC"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"a locality-sensitive approach","author":"Peleg D.","year":"2000","unstructured":"D. Peleg . Distributed computing : a locality-sensitive approach . SIAM , 2000 ,ISBN:0--89871-464-8. D. Peleg.Distributed computing: a locality-sensitive approach.SIAM, 2000,ISBN:0--89871-464-8."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333982"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278852"},{"issue":"4","key":"e_1_3_2_1_29_1","first-page":"253","article-title":"Distributed verification of minimum spanning trees.","volume":"20","author":"Korman A.","year":"2007","unstructured":"A. Korman and S. Kutten . Distributed verification of minimum spanning trees. DC , 20 ( 4 ): 253 -- 266 ( 2007 ). A. Korman and S. Kutten. Distributed verification of minimum spanning trees.DC, 20(4):253--266 (2007).","journal-title":"DC"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993866"},{"key":"e_1_3_2_1_31_1","first-page":"215","article-title":"Proof labeling schemes.","volume":"22","author":"Korman A.","year":"2010","unstructured":"A. Korman , S. Kutten , and D Peleg . Proof labeling schemes. DC , 22 : 215 -- 233 , 2010 . A. Korman, S. Kutten, and D Peleg. Proof labeling schemes.DC, 22:215--233, 2010.","journal-title":"DC"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"A. Korman and D. Peleg. Compact Separator Decomposition for DynamicTrees and Applications.DC (2008) 21(2):  141--161.  A. Korman and D. Peleg. Compact Separator Decomposition for DynamicTrees and Applications.DC (2008) 21(2): 141--161.","DOI":"10.1007\/s00446-008-0061-5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224990"},{"key":"e_1_3_2_1_34_1","volume-title":"Distributed MST for constant diameter graphs.DC, 18(6)","author":"Lotker Z.","year":"2006","unstructured":"Z. Lotker , B. Patt-Shamir , and D. Peleg . Distributed MST for constant diameter graphs.DC, 18(6) , 2006 . Z. Lotker, B. Patt-Shamir, and D. Peleg.Distributed MST for constant diameter graphs.DC, 18(6), 2006."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","location":"San Jose California USA","acronym":"PODC '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993866","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:05:52Z","timestamp":1750230352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":36,"alternative-id":["10.1145\/1993806.1993866","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993866","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}