{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:14Z","timestamp":1725619094804},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_13","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T06:56:37Z","timestamp":1318056997000},"page":"148-162","source":"Crossref","is-referenced-by-count":0,"title":["Self-stabilizing\u00a0Labeling\u00a0and\u00a0Ranking\u00a0in\u00a0Ordered\u00a0Trees"],"prefix":"10.1007","author":[{"given":"Ajoy K.","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvan","family":"Rivierre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11577327_1","volume-title":"Self-Stabilizing Systems","author":"D. Bein","year":"2005","unstructured":"Bein, D., Datta, A., Villain, V.: Snap-stabilizing optimal binary-search-tree. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol.\u00a03764, pp. 1\u201317. Springer, Heidelberg (2005)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bourgon, B., Datta, A.K., Natarajan, V.: A self-stabilizing ranking algorithm for tree structured networks. In: Proceedings of the First Workshop on Self-Stabilizing Systems (WSS 1995), pp. 23\u201328 (1995)","DOI":"10.1109\/PCCC.1995.472517"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Datta, A.K., Devismes, S., Heurtefeux, K., Larmore, L.L., Rivierre, Y.: Self-stabilizing small k-dominating sets. Tech. rep., VERIMAG (2011), http:\/\/www-verimag.imag.fr\/TR\/TR-2011-6.pdf","DOI":"10.1109\/ICNC.2011.15"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of Computing Machinery\u00a017, 643\u2013644 (1974)","journal-title":"Communications of the Association of Computing Machinery"},{"key":"13_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gouda, M., Schneider, M.: Memory requirements for silent stabilization. In: PODC 1996: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201334 (1996)","DOI":"10.1145\/248052.248055"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1093\/ietisy\/e89-d.2.700","volume":"89-D","author":"P. Flocchini","year":"2006","unstructured":"Flocchini, P., Enriques, A.M., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: Computing the optimal swap edges distributively. IEICE Transactions\u00a089-D(2), 700\u2013708 (2006)","journal-title":"IEICE Transactions"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Herman, T., Masuzawa, T.: A stabilizing search tree with availability properties. In: Fifth International Symposium on Autonomous Decentralized Systems (ISADS 2001), pp. 398\u2013405 (2001)","DOI":"10.1109\/ISADS.2001.917445"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-45438-1_12","volume-title":"Self-Stabilizing Systems","author":"T. Herman","year":"2001","unstructured":"Herman, T., Pirwani, I.: A composite stabilizing data structure. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 167\u2013182. Springer, Heidelberg (2001)"},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to distributed algorithms","author":"G. Tel","year":"2000","unstructured":"Tel, G.: Introduction to distributed algorithms, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"}],"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-642-24550-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T06:53:24Z","timestamp":1560754404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}