{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:51:05Z","timestamp":1764557465601},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032319"},{"type":"electronic","value":"9783030032326"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_23","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"349-364","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Gracefully Degrading Gathering in Dynamic Rings"],"prefix":"10.1007","author":[{"given":"Marjorie","family":"Bournat","sequence":"first","affiliation":[]},{"given":"Swan","family":"Dubois","sequence":"additional","affiliation":[]},{"given":"Franck","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"issue":"4","key":"23_CR1","first-page":"404","volume":"51","author":"D Alistarh","year":"2012","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Generating fast indulgent algorithms. TCS 51(4), 404\u2013424 (2012)","journal-title":"TCS"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2018.02.019","volume":"726","author":"M Biely","year":"2018","unstructured":"Biely, M., Robinson, P., Schmid, U., Schwarz, M., Winkler, K.: Gracefully degrading consensus and k-set agreement in directed dynamic networks. TCS 726, 41\u201377 (2018)","journal-title":"TCS"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-49259-9_5","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Bournat","year":"2016","unstructured":"Bournat, M., Datta, A.K., Dubois, S.: Self-stabilizing robots in highly dynamic environments. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 54\u201369. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_5"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bournat, M., Dubois, S., Petit, F.: Computability of perpetual exploration in highly dynamic rings. In: ICDCS, pp. 794\u2013804 (2017)","DOI":"10.1109\/ICDCS.2017.80"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bournat, M., Dubois, S., Petit, F.: Gracefully degrading gathering in dynamic rings. Technical report, arXiv:1805.05137 (2018)","DOI":"10.1007\/978-3-030-03232-6_23"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.15803\/ijnc.6.1_27","volume":"6","author":"N Braud-Santoni","year":"2016","unstructured":"Braud-Santoni, N., Dubois, S., Kaaouachi, M.-H., Petit, F.: The next 700 impossibility results in time-varying graphs. IJNC 6(1), 27\u201341 (2016)","journal-title":"IJNC"},{"issue":"4","key":"23_CR7","first-page":"499","volume":"26","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Shortest, fastest, and foremost broadcast in dynamic networks. IJFCS 26(4), 499\u2013522 (2015)","journal-title":"IJFCS"},{"issue":"5","key":"23_CR8","first-page":"387","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS 27(5), 387\u2013408 (2012)","journal-title":"IJPEDS"},{"key":"23_CR9","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"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-540-24698-5_62","volume-title":"LATIN 2004: Theoretical Informatics","author":"P Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple mobile agent rendezvous in a ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 599\u2013608. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_62"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/11940128_74","volume-title":"Algorithms and Computation","author":"R Klasing","year":"2006","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 744\u2013753. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11940128_74"},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/1658357.1658358","volume":"27","author":"R Kotla","year":"2009","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. TOCS 27(4), 7:1\u20137:39 (2009)","journal-title":"TOCS"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. TOCS 16(2), 133\u2013169 (1998)","journal-title":"TOCS"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Technical report, arXiv:1710.04073 (2017)","DOI":"10.1007\/s13278-018-0537-7"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Di Luna, G., Dobrev, S., Flocchini, P., Santoro, N.: Live exploration of dynamic rings. In: ICDCS, pp. 570\u2013579 (2016)","DOI":"10.1109\/ICDCS.2016.59"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-72050-0_20","volume-title":"Structural Information and Communication Complexity","author":"GA Luna Di","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Viglietta, G.: Gathering in dynamic rings. In: Das, S., Tixeuil, S. (eds.) SIROCCO 2017. LNCS, vol. 10641, pp. 339\u2013355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72050-0_20"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. DC 30(2), 75\u201386 (2017)","DOI":"10.1007\/s00446-016-0278-7"},{"issue":"02","key":"23_CR19","first-page":"267","volume":"14","author":"B Xuan","year":"2003","unstructured":"Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. IJFCS 14(02), 267\u2013285 (2003)","journal-title":"IJFCS"}],"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-030-03232-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T03:43:40Z","timestamp":1572147820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}