{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:22:52Z","timestamp":1764688972036},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452482"},{"type":"electronic","value":"9783642452499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45249-9_2","type":"book-chapter","created":{"date-parts":[[2014,1,2]],"date-time":"2014-01-02T11:08:11Z","timestamp":1388660891000},"page":"14-28","source":"Crossref","is-referenced-by-count":45,"title":["Iterative Byzantine Vector Consensus in Incomplete Graphs"],"prefix":"10.1007","author":[{"given":"Nitin H.","family":"Vaidya","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11516798_17","volume-title":"Principles of Distributed Systems","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 229\u2013239. Springer, Heidelberg (2005)"},{"key":"2_CR2","unstructured":"Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill Higher Education (2006)"},{"key":"2_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":"2_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/10590.10597","volume-title":"Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 1986","author":"A.D. Fekete","year":"1986","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. In: Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 1986, pp. 73\u201387. ACM, New York (1986)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0305004100033399","volume":"54","author":"J. Hajnal","year":"1958","unstructured":"Hajnal, J.: Weak ergodicity in non-homogeneous markov chains. Proceedings of the Cambridge Philosophical Society\u00a054, 233\u2013246 (1958)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"2_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.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control\u00a048, 988\u20131001 (2003)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"LeBlanc, H., Koutsoukos, X.: Consensus in networked multi-agent systems with adversaries. In: 14th International Conference on Hybrid Systems: Computation and Control, HSCC (2011)","DOI":"10.1145\/1967701.1967742"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"LeBlanc, H., Koutsoukos, X.: Low complexity resilient consensus in networked multi-agent systems with adversaries. In: 15th International Conference on Hybrid Systems: Computation and Control, HSCC (2012)","DOI":"10.1145\/2185632.2185637"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Mendes, H., Herlihy, M.: Multidimensional approximate agreement in byzantine asynchronous systems. In: 45th ACM Symposium on the Theory of Computing, STOC (June 2013)","DOI":"10.1145\/2488608.2488657"},{"key":"2_CR10","unstructured":"Perles, M.A., Sigron, M.: A generalization of Tverberg\u2019s theorem, CoRR (2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0710.4668"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-35668-1_6","volume-title":"Distributed Computing and Networking","author":"L. Tseng","year":"2013","unstructured":"Tseng, L., Vaidya, N.: Iterative approximate byzantine consensus under a generalized fault model. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol.\u00a07730, pp. 72\u201386. Springer, Heidelberg (2013)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Garg, V.K.: Byzantine vector consensus in complete graphs. In: ACM Symposium on Principles of Distributed Computing (PODC) (July 2013)","DOI":"10.1145\/2484239.2484256"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: ACM Symposium on Principles of Distributed Computing (PODC) (July 2012)","DOI":"10.21236\/ADA558910"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H.: Matrix representation of iterative approximate byzantine consensus in directed graphs. CoRR (March 2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1203.1888","DOI":"10.21236\/ADA558910"},{"key":"2_CR15","unstructured":"Vaidya, N.H.: Iterative Byzantine vector consensus in incomplete graphs. CoRR (July 2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1307.2483"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Garg, V.: Byzantine vector consensus in complete graphs. CoRR (July 2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1302.2543","DOI":"10.1145\/2484239.2484256"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. In: Proceedings of the American Mathematical Society, 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-45249-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T23:01:58Z","timestamp":1558825318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45249-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642452482","9783642452499"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45249-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}