{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:04:46Z","timestamp":1740096286926,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392467"},{"type":"electronic","value":"9783642392474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39247-4_23","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T21:43:18Z","timestamp":1370295798000},"page":"269-280","source":"Crossref","is-referenced-by-count":10,"title":["A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm"],"prefix":"10.1007","author":[{"given":"Chris","family":"Litsas","sequence":"first","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Dimitris","family":"Sakavalas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. J. Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM\u00a040(1), 17\u201347 (1993), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/138027.138036","journal-title":"J. ACM"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Wright, R.N.: Secure communication in minimal connectivity models. Journal of Cryptology\u00a013, 9\u201330 (2000), \n                  \n                    http:\/\/dx.doi.org\/10.1007\/s001459910002","journal-title":"Journal of Cryptology"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for n\u2009>\u20093t processors in t\u2009+\u20091 rounds. SIAM J. Comput.\u00a027(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"issue":"12-13","key":"23_CR5","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ipl.2010.04.003","volume":"110","author":"A. Ichimura","year":"2010","unstructured":"Ichimura, A., Shigeno, M.: A new parameter for a broadcast algorithm with locally bounded byzantine faults. Inf. Process. Lett.\u00a0110(12-13), 514\u2013517 (2010)","journal-title":"Inf. Process. Lett."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Chaudhuri, S., Kutten, S. (eds.) PODC, pp. 275\u2013282. ACM (2004)","DOI":"10.1145\/1011767.1011807"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. Journal of Algorithms\u00a039(1), 47\u201367 (2001), \n                  \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677400911477","journal-title":"Journal of Algorithms"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/571825.571858","volume-title":"Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, PODC 2002","author":"M.V.N.A. Kumar","year":"2002","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, PODC 2002, pp. 193\u2013202. ACM, New York (2002), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/571825.571858"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"A. Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Inf. Process. Lett.\u00a093(3), 109\u2013115 (2005)","journal-title":"Inf. Process. Lett."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H., Bhandari, V.: Broadcast using certified propagation algorithm in presence of byzantine faults. CoRR abs\/1209.4620 (2012)","DOI":"10.21236\/ADA568117"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Network"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39247-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:37:46Z","timestamp":1557754666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39247-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392467","9783642392474"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39247-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}