{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:59:00Z","timestamp":1743008340006,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030643478"},{"type":"electronic","value":"9783030643485"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64348-5_10","type":"book-chapter","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T07:04:38Z","timestamp":1606201478000},"page":"118-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Silent MST Approximation for Tiny Memory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0342-9243","authenticated-orcid":false,"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[]},{"given":"Swan","family":"Dubois","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-0898","authenticated-orcid":false,"given":"Laurent","family":"Feuilloley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Goldenberg, U.: Locally-iterative distributed ($$\\Delta $$+ 1): -coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In: Newport, C., Keidar, I. (eds.) Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, 23\u201327 July 2018, pp. 437\u2013446. ACM (2018)","DOI":"10.1145\/3212734.3212769"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for self-stabilizing leader election protocols. In: 18th Annual ACM Symposium on Principles of Distributed Computing, PODC 1999, pp. 199\u2013207 (1999). https:\/\/doi.org\/10.1145\/301308.301358","DOI":"10.1145\/301308.301358"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jpdc.2018.02.007","volume":"117","author":"L Blin","year":"2018","unstructured":"Blin, L., Boubekeur, F., Dubois, S.: A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distrib. Comput. 117, 50\u201362 (2018). https:\/\/doi.org\/10.1016\/j.jpdc.2018.02.007","journal-title":"J. Parallel Distrib. Comput."},{"key":"10_CR4","unstructured":"Blin, L., Dubois, S., Feuilloley, L.: Silent MST approximation for tiny memory. CoRR abs\/1905.08565 (2019). http:\/\/arxiv.org\/abs\/1905.08565"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Blin, L., Feuilloley, L., Bouder, G.L.: Brief announcement: memory lower bounds for self-stabilization. In: 33rd International Symposium on Distributed Computing, DISC 2019, Budapest, Hungary, 14\u201318 October 2019, vol. 146, pp. 37:1\u201337:3 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2019.37","DOI":"10.4230\/LIPIcs.DISC.2019.37"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Blin, L., Fraigniaud, P.: Space-optimal time-efficient silent self-stabilizing constructions of constrained spanning trees. In: 35th IEEE International Conference on Distributed Computing Systems, ICDCS 2015, pp. 589\u2013598 (2015). https:\/\/doi.org\/10.1109\/ICDCS.2015.66","DOI":"10.1109\/ICDCS.2015.66"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-11764-5_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Blin","year":"2014","unstructured":"Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 18\u201332. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_2"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00446-017-0294-2","volume":"31","author":"L Blin","year":"2017","unstructured":"Blin, L., Tixeuil, S.: Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distrib. Comput. 31(2), 139\u2013166 (2017). https:\/\/doi.org\/10.1007\/s00446-017-0294-2","journal-title":"Distrib. Comput."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00446-007-0030-4","volume":"20","author":"A Bui","year":"2007","unstructured":"Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Distrib. Comput. 20(1), 3\u201319 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0030-4","journal-title":"Distrib. Comput."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.tcs.2018.08.020","volume":"811","author":"K Censor-Hillel","year":"2020","unstructured":"Censor-Hillel, K., Paz, A., Perry, M.: Approximate proof-labeling schemes. Theoret. Comput. Sci. 811, 112\u2013124 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.020","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1016\/j.jpdc.2011.05.008","volume":"71","author":"AK 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. 71(11), 1532\u20131544 (2011). https:\/\/doi.org\/10.1016\/j.jpdc.2011.05.008","journal-title":"J. Parallel Distrib. Comput."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Devismes, S., Johnen, C.: Self-stabilizing distributed cooperative reset. In: 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019, pp. 379\u2013389 (2019). https:\/\/doi.org\/10.1109\/ICDCS.2019.00045","DOI":"10.1109\/ICDCS.2019.00045"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/S0097539792235074","volume":"26","author":"S Dolev","year":"1997","unstructured":"Dolev, S., Israeli, A., Moran, S.: Resource bounds for self-stabilizing message-driven protocols. SIAM J. Comput. 26(1), 273\u2013290 (1997). https:\/\/doi.org\/10.1137\/S0097539792235074","journal-title":"SIAM J. Comput."},{"key":"10_CR15","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization (2011). arXiv: 1110.0334"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Emek, Y., Gil, Y.: Twenty-two new approximate proof labeling schemes. In: 34th International Symposium on Distributed Computing, DISC 2020, Virtual Conference, 12\u201316 October 2020, vol. 179, pp. 20:1\u201320:14 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.20","DOI":"10.4230\/LIPIcs.DISC.2020.20"},{"key":"10_CR17","unstructured":"Feuilloley, L.: Introduction to local certification. CoRR abs\/1910.12747 (2019). http:\/\/arxiv.org\/abs\/1910.12747"},{"key":"10_CR18","unstructured":"Feuilloley, L.: Note on distributed certification of minimum spanning trees (2019). arXiv: 1909.07251"},{"key":"10_CR19","unstructured":"Feuilloley, L.: Can we always build and certify at the same time? (Maybe not). Discrete notes (2020). https:\/\/discrete-notes.github.io\/build-certify-3"},{"key":"10_CR20","unstructured":"Feuilloley, L., Fraigniaud, P.: Survey of distributed decision. Bull. EATCS 119 (2016). bulletin.eatcs.org, arXiv: 1606.04434"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-44676-1_40","volume-title":"Algorithms \u2014 ESA 2001","author":"C Gavoille","year":"2001","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 476\u2013487. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_40"},{"issue":"4","key":"10_CR22","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 trees. Distrib. Comput. 20(4), 253\u2013266 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0025-1","journal-title":"Distrib. Comput."},{"issue":"4","key":"10_CR23","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. Distrib. Comput. 22(4), 215\u2013233 (2010). https:\/\/doi.org\/10.1007\/s00446-010-0095-3","journal-title":"Distrib. Comput."},{"key":"10_CR24","unstructured":"Petit, F., Villain, V.: Time and space optimality of distributed depth-first token circulation algorithms. In: Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), pp. 91\u2013106 (1999)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64348-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T08:55:53Z","timestamp":1606208153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64348-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643478","9783030643485"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64348-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.msu.edu\/~sandeep\/SSS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}