{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T20:46:32Z","timestamp":1791319592480,"version":"4.3.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319117638","type":"print"},{"value":"9783319117645","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11764-5_2","type":"book-chapter","created":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T22:53:32Z","timestamp":1411512812000},"page":"18-32","source":"Crossref","is-referenced-by-count":22,"title":["On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-54099-7_2","volume-title":"Distributed Algorithms","author":"Y. Afek","year":"1991","unstructured":"Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol.\u00a0486, pp. 15\u201328. Springer, Heidelberg (1991)"},{"issue":"1-2","key":"2_CR2","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. Theoretical Computer Science\u00a0186(1-2), 199\u2013229 (1997)","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Arfaoui, H., Fraigniaud, P., Pelc, A.: Local Decision and Verification with Bounded-Size Outputs. In: 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS, pp. 133\u2013147 (2013)","DOI":"10.1007\/978-3-319-03089-0_10"},{"issue":"9","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A. Arora","year":"1994","unstructured":"Arora, A., Gouda, M.: Distributed reset. IEEE Trans. Computers\u00a043(9), 1026\u20131038 (1994)","journal-title":"IEEE Trans. Computers"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-15763-9_46","volume-title":"Distributed Computing","author":"L. Blin","year":"2010","unstructured":"Blin, L., Dolev, S., Potop-Butucaru, M.G., Rovedakis, S.: Fast self-stabilizing minimum spanning tree construction \u2013 using compact nearest common ancestor labeling scheme. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 480\u2013494. Springer, Heidelberg (2010)"},{"key":"2_CR6","unstructured":"Blin, L., Fraigniaud, P.: Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction. Tech. Report arXiv 1402.2496 (2014)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-04355-0_43","volume-title":"Distributed Computing","author":"L. Blin","year":"2009","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S., Tixeuil, S.: A new self-stabilizing minimum spanning tree construction with loop-free property. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 407\u2013422. Springer, Heidelberg (2009)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-41527-2_6","volume-title":"Distributed Computing","author":"L. Blin","year":"2013","unstructured":"Blin, L., Tixeuil, S.: Compact Deterministic Self-stabilizing Leader Election \u2013 The Exponential Advantage of Being Talkative. In: Afek, Y. (ed.) DISC 2013. LNCS, vol.\u00a08205, pp. 76\u201390. Springer, Heidelberg (2013)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-11476-2_12","volume-title":"Structural Information and Communication Complexity","author":"A. Cournier","year":"2010","unstructured":"Cournier, A.: A new polynomial silent stabilizing spanning-tree construction algorithm. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 141\u2013153. Springer, Heidelberg (2010)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-25873-2_12","volume-title":"Principles of Distributed Systems","author":"A. Cournier","year":"2011","unstructured":"Cournier, A., Rovedakis, S., Villain, V.: The first fully polynomial stabilizing algorithm for bfs tree construction. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 159\u2013174. Springer, Heidelberg (2011)"},{"issue":"40","key":"2_CR11","doi-asserted-by":"publisher","first-page":"5541","DOI":"10.1016\/j.tcs.2010.05.001","volume":"412","author":"A. Datta","year":"2011","unstructured":"Datta, A., Larmore, L., Vemula, P.: Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theor. Comput. Sci.\u00a0412(40), 5541\u20135561 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, S.: Self-Stabilization. MIT Press (2000)","DOI":"10.7551\/mitpress\/6156.001.0001"},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s002360050180","volume":"36","author":"S. Dolev","year":"1999","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory Requirements for Silent Stabilization. Acta Inf.\u00a036(6), 447\u2013462 (1999)","journal-title":"Acta Inf."},{"issue":"5","key":"2_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/2499228","volume":"60","author":"P. Fraigniaud","year":"2013","unstructured":"Fraigniaud, P., Korman, A., Peleg, D.: Towards a complexity theory for local distributed computing. J. ACM\u00a060(5), 35 (2013)","journal-title":"J. ACM"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Suomela, J.: Locally checkable proofs. In: 30th ACM Symposium on Principles of Distributed Computing (PODC), pp. 159\u2013168 (2011)","DOI":"10.1145\/1993806.1993829"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(92)90264-V","volume":"41","author":"S.-T. Huang","year":"1992","unstructured":"Huang, S.-T., Chen, N.-S.: A self-stabilizing algorithm for constructing breadth-first trees. Inf. Process. Lett.\u00a041(2), 109\u2013117 (1992)","journal-title":"Inf. Process. Lett."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00446-007-0025-1","volume":"20","author":"A. Korman","year":"2007","unstructured":"Korman, A., Kutten, S.: Distributed verification of minimum spanning tree. Distributed Computing\u00a020, 253\u2013266 (2007)","journal-title":"Distributed Computing"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Korman, A., Kutten, S., Masuzawa, T.: Fast and compact self stabilizing verification, computation, and fault detection of an MST. In: 30th ACM Symp. on Principles of Distributed Computing (PODC), pp. 311\u2013320 (2011)","DOI":"10.1145\/1993806.1993866"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A. Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distributed Computing\u00a022(4), 215\u2013233 (2010)","journal-title":"Distributed Computing"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11752578_10","volume-title":"Parallel Processing and Applied Mathematics","author":"A. Kosowski","year":"2006","unstructured":"Kosowski, A., Kuszner, \u0141.: A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Wa\u015bniewski, J. (eds.) PPAM 2005. LNCS, vol.\u00a03911, pp. 75\u201382. Springer, Heidelberg (2006)"}],"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-319-11764-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T23:45:28Z","timestamp":1559000728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11764-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319117638","9783319117645"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11764-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}