{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:49:53Z","timestamp":1761976193201,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_7","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"91-105","source":"Crossref","is-referenced-by-count":12,"title":["Time Optimal Synchronous Self Stabilizing Spanning Tree"],"prefix":"10.1007","author":[{"given":"Alex","family":"Kravchik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)"},{"key":"7_CR2","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)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci., 199\u2013229 (1997)","DOI":"10.1016\/S0304-3975(96)00286-1"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-57529-4_72","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"S. Aggarwal","year":"1993","unstructured":"Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithms. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol.\u00a0761, pp. 400\u2013410. Springer, Heidelberg (1993)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-53487-3_54","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Arora","year":"1990","unstructured":"Arora, A., Gouda, M.G.: Distributed reset. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol.\u00a0472, pp. 316\u2013331. Springer, Heidelberg (1990)"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM\u00a032(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Cidon, I., Kutten, S.: Optimal maintenance of a spanning tree. J. ACM\u00a055(4) (2008)","DOI":"10.1145\/1391289.1391292"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TDSC.2007.1007","volume":"4","author":"B. Awerbuch","year":"2007","unstructured":"Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: A time-optimal self-stabilizing synchronizer using a phase clock. IEEE Trans. Dependable Sec. Comput.\u00a04(3), 180\u2013190 (2007)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Mansour, Y., Kutten, S., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: STOC, pp. 652\u2013661 (1993)","DOI":"10.1145\/167088.167256"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: FOCS, pp. 268\u2013277 (1991)","DOI":"10.1109\/SFCS.1991.185378"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC, pp. 150\u2013159 (2004)","DOI":"10.1145\/1011767.1011790"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75142-7_10","volume-title":"Distributed Computing","author":"J. Burman","year":"2007","unstructured":"Burman, J., Kutten, S.: Time optimal asynchronous self-stabilizing spanning tree. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 92\u2013107. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00453-007-9066-x","volume":"51","author":"F. Petit","year":"2008","unstructured":"Petit, F., Boulinier, C., Villain, V.: Synchronous vs. asynchronous unison. Algoritmica\u00a051(1), 61\u201380 (2008)","journal-title":"Algoritmica"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Chen, N.-S., Yu, H.-P., Huang, S.-T.: A self-stabilizing algorithm for constructing spanning trees. Inf. Process. Lett., 147\u2013151 (1991)","DOI":"10.1016\/0020-0190(91)90111-T"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Cournier, A.: A new polynomial silent stabilizing spanning-tree construction algorithm, 141\u2013153 (2009)","DOI":"10.1007\/978-3-642-11476-2_12"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-16023-3_6","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A.K. Datta","year":"2010","unstructured":"Datta, A.K., Larmore, L.L., Piniganti, H.: Self-stabilizing leader election in dynamic networks. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 35\u201349. Springer, Heidelberg (2010)"},{"issue":"11","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1016\/j.jpdc.2011.05.008","volume":"71","author":"A.K. Datta","year":"2011","unstructured":"Datta, A.K., Larmore, L.L., Vemula, P.: An o(n)-time self-stabilizing leader election algorithm. J. Parallel Distrib. Comput.\u00a071(11), 1532\u20131544 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/360860.360914","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self stabilization in spite of distributed control. Comm. ACM\u00a017, 167\u2013180 (1974)","journal-title":"Comm. ACM"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM J. Comput., 418\u2013455 (1997)","DOI":"10.1137\/S0097539790192647"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. In: PODC, pp. 103\u2013117 (1990)","DOI":"10.1145\/93385.93407"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Dubois, S., Guerraoui, R.: Introducing speculation in self-stabilization: an application to mutual exclusion. In: PODC, pp. 290\u2013298 (2013)","DOI":"10.1145\/2484239.2484246"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst.\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"7_CR23","first-page":"322","volume":"2","author":"S. Gosh","year":"1996","unstructured":"Gosh, S., Gupta, A., Pemmaraju, S.V.: A fault containing self stabilizing algorithm for spanning trees. Journal of Computing and Information\u00a02, 322\u2013338 (1996)","journal-title":"Journal of Computing and Information"},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(90)90020-X","volume":"35","author":"M.G. Gouda","year":"1990","unstructured":"Gouda, M.G., Herman, T.: Stabilizing unison. Inf. Process. Lett.\u00a035(4), 171\u2013175 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"7_CR25","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. Inf. Process. Lett.\u00a054(5), 259\u2013265 (1995)","journal-title":"Inf. Process. Lett."},{"key":"7_CR26","unstructured":"Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach, 2nd edn. Addison Wesley (2003)"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-48169-9_24","volume-title":"Distributed Computing","author":"S. Kutten","year":"1999","unstructured":"Kutten, S., Porat, A.: Maintenance of a spanning tree in dynamic networks. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 342\u2013355. Springer, Heidelberg (1999)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-51687-5_42","volume-title":"Distributed Algorithms","author":"Y. Matias","year":"1989","unstructured":"Matias, Y., Afek, Y.: Simple and efficient election algorithms for anonymous networks. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol.\u00a0392, pp. 183\u2013194. Springer, Heidelberg (1989)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"7_CR30","first-page":"395","volume":"7","author":"R.J. Perlman","year":"1983","unstructured":"Perlman, R.J.: Fault-tolerant broadcast of routing information. Computer Networks\u00a07, 395\u2013405 (1983)","journal-title":"Computer Networks"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0022445","volume-title":"Distributed Algorithms","author":"S. Dolev","year":"1992","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol.\u00a0579, pp. 167\u2013180. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:29Z","timestamp":1746026849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}