{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T22:24:37Z","timestamp":1790375077424,"version":"4.1.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319268491","type":"print"},{"value":"9783319268507","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26850-7_8","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T09:14:46Z","timestamp":1455959686000},"page":"109-124","source":"Crossref","is-referenced-by-count":8,"title":["Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Martin","family":"Biely","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manfred","family":"Schwarz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyrill","family":"Winkler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-35668-1_16","volume-title":"Distributed Computing and Networking","author":"Y Afek","year":"2013","unstructured":"Afek, Y., Gafni, E.: Asynchrony from synchrony. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 225\u2013239. Springer, Heidelberg (2013)"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(98)00235-7","volume":"220","author":"MK Aguilera","year":"1999","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks. Theor. Comput. Sci. 220(1), 3\u201330 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-25873-2_21","volume-title":"Principles of Distributed Systems","author":"M Biely","year":"2011","unstructured":"Biely, M., Robinson, P., Schmid, U.: Easy impossibility proofs for k-set agreement in message passing systems. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 299\u2013312. Springer, Heidelberg (2011)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Biely, M., Robinson, P., Schmid, U.: Solving k-set agreement with stable skeleton graphs. In: Proceedings of the IPDPS Workshops, pp. 1488\u20131495 (2011)","DOI":"10.1109\/IPDPS.2011.301"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-31104-8_7","volume-title":"Structural Information and Communication Complexity","author":"M Biely","year":"2012","unstructured":"Biely, M., Robinson, P., Schmid, U.: Agreement in directed dynamic networks. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 73\u201384. Springer, Heidelberg (2012)"},{"key":"8_CR6","unstructured":"Biely, M., Robinson, P., Schmid, U., Schwarz, M., Winkler, K.: Gracefully degrading consensus and $$k$$ k -set agreement in directed dynamic networks, January 2015. arXiv:1501.02716"},{"issue":"33","key":"8_CR7","doi-asserted-by":"publisher","first-page":"4273","DOI":"10.1016\/j.tcs.2010.11.007","volume":"412","author":"F Bonnet","year":"2011","unstructured":"Bonnet, F., Raynal, M.: On the road to the weakest failure detector for k-set agreement in message-passing systems. Theor. Comput. Sci. 412(33), 4273\u20134284 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"8_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"},{"issue":"5","key":"8_CR9","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Comput. 17(5), 975\u2013988 (1988)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/rsa.3240040303","volume":"4","author":"S Janson","year":"1993","unstructured":"Janson, S., Knuth, D.E., Luczak, T., Pittel, B.: The birth of the giant component. Random Struct. Algorithms 4, 233\u2013358 (1993)","journal-title":"Random Struct. Algorithms"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: Proceedings of the PODC 2011 (2011)","DOI":"10.1145\/1993806.1993808"},{"key":"8_CR12","unstructured":"Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, pp. 215\u2013226. North-Holland (1989)"},{"issue":"9","key":"8_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1177\/0037549707085632","volume":"83","author":"C Newport","year":"2007","unstructured":"Newport, C., Kotz, D., Yuan, Y., Gray, R.S., Liu, J., Elliott, C.: Experimental evaluation of wireless simulation assumptions. SIMULATION: Trans. Soc. Model. Simul. Int. 83(9), 643\u2013661 (2007)","journal-title":"SIMULATION: Trans. Soc. Model. Simul. Int."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Raynal, M., Stainer, J.: Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors. In: Proceedings of the PODC 2013, pp. 166\u2013175 (2013)","DOI":"10.1145\/2484239.2484249"},{"issue":"5","key":"8_CR15","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/S009753970443999X","volume":"38","author":"U Schmid","year":"2009","unstructured":"Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for consensus under link failures. SIAM J. Comput. 38(5), 1912\u20131951 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","first-page":"555","volume-title":"Distributed Computing","author":"A Sealfon","year":"2014","unstructured":"Sealfon, A., Sotiraki, A.A.: Brief announcement: agreement in partitioned dynamic networks. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 555\u2013556. Springer, Heidelberg (2014)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Pradhan, D.K.: Degradable agreement in the presence of Byzantine faults. In: Proceedings of ICDCS 1993, pp. 237\u2013244 (1993)","DOI":"10.1109\/ICDCS.1993.287703"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26850-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:04:47Z","timestamp":1748783087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26850-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268491","9783319268507"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26850-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}