{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:17Z","timestamp":1763468117918},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642356674"},{"type":"electronic","value":"9783642356681"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35668-1_6","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T10:07:03Z","timestamp":1357294023000},"page":"72-86","source":"Crossref","is-referenced-by-count":19,"title":["Iterative Approximate Byzantine Consensus under a Generalized Fault Model"],"prefix":"10.1007","author":[{"given":"Lewis","family":"Tseng","sequence":"first","affiliation":[]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proc. of ACM Symposium on Principles of Distributed Computing, PODC 2005 (2005)","DOI":"10.1145\/1073814.1073841"},{"key":"6_CR2","unstructured":"Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill Higher Education (2006)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM\u00a033, 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Hajnal, J., Bartlett, M.S.: Weak ergodicity in non-homogeneous markov chains. In: Proceedings of the Cambridge Philosophical Society (1958)","DOI":"10.1017\/S0305004100033399"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC 1997 (1997)","DOI":"10.1145\/259380.259412"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"A. Jadbabaie","year":"2003","unstructured":"Jadbabaie, A., Lin, J., Morse, A.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control\u00a048(6), 988\u20131001 (2003)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Junqueira, F.P., Marzullo, K.: Synchronous consensus for dependent process failures. In: ICDCS 2003 (2003)","DOI":"10.1007\/3-540-37795-6_5"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Proc. ACM Symp. on Principles of Distributed Computing, PODC 2004 (2004)","DOI":"10.1145\/1011767.1011807"},{"key":"6_CR9","first-page":"53","volume":"106","author":"P. Kuznetsov","year":"2012","unstructured":"Kuznetsov, P.: Understanding non-uniform failure models. Bulletin of the European Association for Theoretical Computer Science (BEATCS)\u00a0106, 53\u201377 (2012)","journal-title":"Bulletin of the European Association for Theoretical Computer Science (BEATCS)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. on Programming Languages and Systems (1982)","DOI":"10.1145\/357172.357176"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"LeBlanc, H., Zhang, H., Sundaram, S., Koutsoukos, X.: Consensus of multi-agent networks in the presence of adversaries using only local information. In: HiCoNs 2012 (2012)","DOI":"10.1145\/2185505.2185507"},{"key":"6_CR12","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H.: Iterative approximate byzantine consensus under a generalized fault model. Technical report, CSL, UIUC (2012)","DOI":"10.21236\/ADA564090"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H.: Matrix representation of iterative approximate byzantine consensus in directed graphs. Technical report, CSL, UIUC (2012)","DOI":"10.21236\/ADA558910"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: PODC 2012 (2012)","DOI":"10.1145\/2332432.2332505"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. In: Proc. of the American Mathematical Society, vol.\u00a014, pp. 733\u2013737 (1963)","DOI":"10.2307\/2034984"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35668-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:22:41Z","timestamp":1620134561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35668-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642356674","9783642356681"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35668-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}