{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:12:36Z","timestamp":1764936756344},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s00446-014-0240-5","type":"journal-article","created":{"date-parts":[[2014,12,31]],"date-time":"2014-12-31T15:16:44Z","timestamp":1420039004000},"page":"423-441","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Multidimensional agreement in Byzantine systems"],"prefix":"10.1007","volume":"28","author":[{"given":"Hammurabi","family":"Mendes","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[]},{"given":"Vijay K.","family":"Garg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,1]]},"reference":[{"key":"240_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Higashino, T. (ed.) Principles of Distributed Systems. Lecture Notes in Computer Science, vol. 3544, pp. 229\u2013239. Springer, Berlin (2005)","DOI":"10.1007\/11516798_17"},{"key":"240_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharir, M., Welzl, E.: Algorithms for center and Tverberg points. In: Proceedings of the 20th Annual Symposium on Computational Geometry (SCG), pp. 61\u201367. ACM, New York, NY, USA (2004)","DOI":"10.1145\/997817.997830"},{"key":"240_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, New York (2004)","edition":"2"},{"key":"240_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Dolev, D., Hoch, E.: Brief announcement: simple gradecast based algorithms. In: Lynch, N., Shvartsman, A. (eds.) Distributed Computing. Lecture Notes in Computer Science, vol. 6343, pp. 194\u2013197. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15763-9_18"},{"issue":"34\u201336","key":"240_CR5","doi-asserted-by":"crossref","first-page":"3154","DOI":"10.1016\/j.tcs.2010.05.006","volume":"411","author":"Z Bouzid","year":"2010","unstructured":"Bouzid, Z., Potop-Butucaru, M.G., Tixeuil, S.: Optimal Byzantine-resilient convergence in uni-dimensional robot networks. Theor. Comput. Sci. 411(34\u201336), 3154\u20133168 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"240_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"240_CR7","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"key":"240_CR8","doi-asserted-by":"crossref","unstructured":"Danzer, L., Gr\u00fcnbaum, B., Klee, V.: Helly\u2019s theorem and its relatives. In: Klee, V.L. (ed.) Proceedings of the Seventh Symposium in Pure Mathematics, vol. 7, pp. 101\u2013180. American Mathematical Society (1963)","DOI":"10.1090\/pspum\/007\/0157289"},{"issue":"3","key":"240_CR9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N., Pinter, S., Stark, E., Weihl, W.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"issue":"4","key":"240_CR10","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in Byzantine agreement. J. ACM 37(4), 720\u2013741 (1990)","journal-title":"J. ACM"},{"key":"240_CR11","doi-asserted-by":"crossref","unstructured":"Doudou, A., Schiper, A.: Muteness detectors for consensus with Byzantine processes. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201998, p. 315. ACM, New York, NY, USA (1998)","DOI":"10.1145\/277697.277772"},{"issue":"1","key":"240_CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"A Fekete","year":"1990","unstructured":"Fekete, A.: Asymptotically optimal algorithms for approximate agreement. Distrib. Comput. 4(1), 9\u201329 (1990)","journal-title":"Distrib. Comput."},{"issue":"1","key":"240_CR13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M Fischer","year":"1986","unstructured":"Fischer, M., Lynch, N., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"key":"240_CR14","doi-asserted-by":"crossref","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"240_CR15","doi-asserted-by":"crossref","unstructured":"Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput. Geom. 12(1), 291\u2013312 (1994)","DOI":"10.1007\/BF02574382"},{"key":"240_CR16","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","DOI":"10.1145\/357172.357176"},{"key":"240_CR17","doi-asserted-by":"crossref","unstructured":"Mendes, H., Herlihy, M.: Multidimensional approximate agreement in Byzantine asynchronous systems. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 391\u2013400. STOC\u201913. ACM, New York, NY, USA (2013). doi: 10.1145\/2488608.2488657","DOI":"10.1145\/2488608.2488657"},{"issue":"8","key":"240_CR18","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.comgeo.2010.04.006","volume":"43","author":"GL Miller","year":"2010","unstructured":"Miller, G.L., Sheehy, D.R.: Approximate centerpoints with proofs. Comput. Geom. 43(8), 647\u2013654 (2010)","journal-title":"Comput. Geom."},{"key":"240_CR19","doi-asserted-by":"crossref","unstructured":"Mulzer, W., Werner, D.: Approximating Tverberg points in linear time for any fixed dimension. In: Proceedings of the 28th Annual Symposium on Computational Geometry, SoCG \u201912, pp. 303\u2013310. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2261250.2261294"},{"key":"240_CR20","volume-title":"Elements of Algebraic Topology","author":"J Munkres","year":"1984","unstructured":"Munkres, J.: Elements of Algebraic Topology, 2nd edn. Prentice Hall, Englewood Cliffs (1984)","edition":"2"},{"issue":"12","key":"240_CR21","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1109\/TPDS.2005.153","volume":"16","author":"NF Neves","year":"2005","unstructured":"Neves, N.F., Correia, M., Verissimo, P.: Solving vector consensus with a wormhole. IEEE Trans. Parallel Distrib. Syst. 16(12), 1120\u20131131 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"240_CR22","unstructured":"Perles, M., Sigron, M.: A generalization of the Tverberg\u2019s theorem (2007). arXiv:0710.4668"},{"key":"240_CR23","doi-asserted-by":"crossref","unstructured":"Potop-Butucaru, M., Raynal, M., Tixeuil, S.: Distributed computing with mobile robots: an introductory survey. In: 14th International Conference on Network-Based Information Systems, NBiS\u201911, pp. 318\u2013324 (2011)","DOI":"10.1109\/NBiS.2011.55"},{"key":"240_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-57748-2","volume-title":"Basic Geometry of Voting","author":"D Saari","year":"1995","unstructured":"Saari, D.: Basic Geometry of Voting. Springer, Berlin (1995)"},{"issue":"2","key":"240_CR25","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T Srikanth","year":"1987","unstructured":"Srikanth, T., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"issue":"1","key":"240_CR26","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1112\/jlms\/s1-41.1.123","volume":"s1\u201341","author":"H Tverberg","year":"1966","unstructured":"Tverberg, H.: A generalization of Radon\u2019s theorem. J. Lond. Math. Soc. s1\u201341(1), 123\u2013128 (1966)","journal-title":"J. Lond. Math. Soc."},{"key":"240_CR27","doi-asserted-by":"crossref","unstructured":"Vaidya, N., Garg, V.K.: Byzantine vector consensus in complete graphs. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC \u201913. ACM, New York, NY, USA (2013). doi: 10.1145\/2484239.2484256","DOI":"10.1145\/2484239.2484256"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0240-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0240-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0240-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:45Z","timestamp":1559136405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0240-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["240"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0240-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}