{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:48Z","timestamp":1759638768514,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922940"},{"type":"electronic","value":"9783540922957"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92295-7_33","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T04:00:00Z","timestamp":1237953600000},"page":"275-280","source":"Crossref","is-referenced-by-count":10,"title":["Byzantine-Resilient Convergence in Oblivious Robot Networks"],"prefix":"10.1007","author":[{"given":"Zohir","family":"Bouzid","sequence":"first","affiliation":[]},{"given":"Maria Gradinariu","family":"Potop-Butucaru","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_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":"33_CR2","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. In: Symposium on Discrete Algorithms: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, vol.\u00a011(14), pp. 1070\u20131078 (2004)"},{"issue":"5","key":"33_CR3","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H. Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation\u00a015(5), 818\u2013828 (1999)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Gradinariu Potop-Butucaru, M., Tixeuil, S.: Byzantine-resilient convergence in oblivious robot networks. Technical Report inria-00329890, INRIA (2008)","DOI":"10.1007\/978-3-540-92295-7_33"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, R., Peleg, D.: Robot convergence via center-of-gravity algorithms. In: Proc. of the 11th Int. Colloquium on Structural Information and Communication Complexity, pp. 79\u201388 (2004)","DOI":"10.1007\/978-3-540-27796-5_8"},{"issue":"6","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM Journal on Computing\u00a034(6), 1516\u20131528 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/11672142_45","volume-title":"STACS 2006","author":"R. Cohen","year":"2006","unstructured":"Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 549\u2013560. Springer, Heidelberg (2006)"},{"issue":"3","key":"33_CR8","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. Journal of the ACM (JACM)\u00a033(3), 499\u2013516 (1986)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"33_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0890-5401(03)00067-1","volume":"185","author":"N. Lynch","year":"2003","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Hybrid I\/O automata. Information and Computation\u00a0185(1), 105\u2013157 (2003)","journal-title":"Information and Computation"},{"key":"33_CR10","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"33_CR11","unstructured":"Prencipe, G.: Corda: Distributed coordination of a set of autonomous mobile robots. In: Proc. 4th European Research Seminar on Advances in Distributed Systems (ERSADS 2001), Bertinoro, Italy, pp. 185\u2013190 (May 2001)"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11429647_20","volume-title":"Structural Information and Communication Complexity","author":"G. Prencipe","year":"2005","unstructured":"Prencipe, G.: On the feasibility of gathering by autonomous mobile robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 246\u2013261. Springer, Heidelberg (2005)"},{"issue":"4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I. Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal of Computing\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92295-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:55:30Z","timestamp":1558266930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92295-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922940","9783540922957"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92295-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}