TY - JOUR AU - Agmon, N. AU - Peleg, D. PY - 2006 DA - 2006// TI - Fault-tolerant gathering algorithms for autonomous mobile robots JO - SIAM J Comput VL - 36 UR - https://doi.org/10.1137/050645221 DO - 10.1137/050645221 ID - Agmon2006 ER - TY - STD TI - Alcántara M, Castañeda A, Peñaloza DF, Rajsbaum S (2017) Fault-tolerant robot gathering problems on graphs with arbitrary appearing times In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 493–502.. IEEE. ID - ref2 ER - TY - JOUR AU - Attiya, H. AU - Bar-Noy, A. AU - Dolev, D. PY - 1995 DA - 1995// TI - Sharing memory robustly in message-passing systems JO - J ACM VL - 42 UR - https://doi.org/10.1145/200836.200869 DO - 10.1145/200836.200869 ID - Attiya1995 ER - TY - JOUR AU - Attiya, H. AU - Bar-Noy, A. AU - Dolev, D. AU - Peleg, D. AU - Reischuk, R. PY - 1990 DA - 1990// TI - Renaming in an asynchronous environment JO - J ACM VL - 37 UR - https://doi.org/10.1145/79147.79158 DO - 10.1145/79147.79158 ID - Attiya1990 ER - TY - STD TI - Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations, and advanced topics. Wiley. ID - ref5 ER - TY - JOUR AU - Bhattacharya, S. AU - Lipsky, D. AU - Ghrist, R. AU - Kumar, V. PY - 2013 DA - 2013// TI - Invariants for homology classes with application to optimal search and planning problem in robotics JO - Ann Math Artif Intell VL - 67 UR - https://doi.org/10.1007/s10472-013-9357-7 DO - 10.1007/s10472-013-9357-7 ID - Bhattacharya2013 ER - TY - JOUR AU - Biran, O. AU - Moran, S. AU - Zaks, S. PY - 1990 DA - 1990// TI - A combinatorial characterization of the distributed 1-solvable tasks JO - J Algoritm VL - 11 UR - https://doi.org/10.1016/0196-6774(90)90020-F DO - 10.1016/0196-6774(90)90020-F ID - Biran1990 ER - TY - JOUR AU - Borowsky, E. AU - Gafni, E. AU - Lynch, N. AU - Rajsbaum, S. PY - 2001 DA - 2001// TI - The BG distributed simulation algorithm JO - Distrib Comput VL - 14 UR - https://doi.org/10.1007/PL00008933 DO - 10.1007/PL00008933 ID - Borowsky2001 ER - TY - STD TI - Borowsky E, Gafni E (1993) Generalized FLP impossibility result for t-resilient asynchronous computations In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, 91–100. ID - ref9 ER - TY - STD TI - Bouzid Z, Das S, Tixeuil S (2013) Gathering of mobile robots tolerating multiple crash faults In: Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems, ICDCS ’13. IEEE Computer Society, Washington, 337–346. ID - ref10 ER - TY - JOUR AU - Castañeda, A. AU - Rajsbaum, S. PY - 2012 DA - 2012// TI - New combinatorial topology bounds for renaming: the upper bound JO - J ACM VL - 59 UR - https://doi.org/10.1145/2108242.2108245 DO - 10.1145/2108242.2108245 ID - Castañeda2012 ER - TY - JOUR AU - Castañeda, A. AU - Rajsbaum, S. AU - Raynal, M. PY - 2011 DA - 2011// TI - The renaming problem in shared memory systems: an introduction JO - Comput Sci Rev VL - 5 UR - https://doi.org/10.1016/j.cosrev.2011.04.001 DO - 10.1016/j.cosrev.2011.04.001 ID - Castañeda2011 ER - TY - JOUR AU - Castañeda, A. AU - Imbs, D. AU - Rajsbaum, S. AU - Raynal, M. PY - 2016 DA - 2016// TI - Generalized symmetry breaking tasks and nondeterminism in concurrent objects JO - SIAM J Comput VL - 45 UR - https://doi.org/10.1137/130936828 DO - 10.1137/130936828 ID - Castañeda2016 ER - TY - JOUR AU - Chaudhuri, S. PY - 1993 DA - 1993// TI - More choices allow more faults: set consensus problems in totally asynchronous systems JO - Inf Comput VL - 105 UR - https://doi.org/10.1006/inco.1993.1043 DO - 10.1006/inco.1993.1043 ID - Chaudhuri1993 ER - TY - JOUR AU - Das, S. AU - Flocchini, P. AU - Prencipe, G. AU - Santoro, N. AU - Yamashita, M. PY - 2016 DA - 2016// TI - Autonomous mobile robots with lights JO - Theor Comput Sci VL - 609 UR - https://doi.org/10.1016/j.tcs.2015.09.018 DO - 10.1016/j.tcs.2015.09.018 ID - Das2016 ER - TY - JOUR AU - Dolev, D. AU - Lynch, N. A. AU - Pinter, S. S. AU - Stark, E. W. AU - Weihl, W. E. PY - 1986 DA - 1986// TI - Reaching approximate agreement in the presence of faults JO - J ACM VL - 33 UR - https://doi.org/10.1145/5925.5931 DO - 10.1145/5925.5931 ID - Dolev1986 ER - TY - JOUR AU - Fischer, M. J. AU - Lynch, N. A. AU - Paterson, M. PY - 1985 DA - 1985// TI - Impossibility of distributed consensus with one faulty process JO - J ACM VL - 32 UR - https://doi.org/10.1145/3149.214121 DO - 10.1145/3149.214121 ID - Fischer1985 ER - TY - CHAP AU - Gafni, E. AU - Rajsbaum, S. PY - 2010 DA - 2010// TI - Recursion in distributed computing BT - Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems, SSS’10 PB - Springer-Verlag CY - Heidelberg UR - https://doi.org/10.1007/978-3-642-16023-3_30 DO - 10.1007/978-3-642-16023-3_30 ID - Gafni2010 ER - TY - CHAP AU - Gafni, E. AU - Rajsbaum, S. AU - Herlihy, M. PY - 2006 DA - 2006// TI - Subconsensus tasks: renaming is weaker than set agreement BT - Proceedings of the 20th International Conference on Distributed Computing, DISC’06 PB - Springer-Verlag CY - Heidelberg ID - Gafni2006 ER - TY - JOUR AU - Herlihy, M. PY - 1991 DA - 1991// TI - Wait-free synchronization JO - ACM Trans Program Lang Syst VL - 13 UR - https://doi.org/10.1145/114005.102808 DO - 10.1145/114005.102808 ID - Herlihy1991 ER - TY - BOOK AU - Herlihy, M. AU - Kozlov, D. AU - Rajsbaum, S. PY - 2013 DA - 2013// TI - Distributed computing through combinatorial topology, 1st edition PB - Morgan Kaufmann Publishers Inc. CY - San Francisco ID - Herlihy2013 ER - TY - CHAP AU - Herlihy, M. AU - Rajsbaum, S. PY - 1997 DA - 1997// TI - The decidability of distributed decision tasks (extended abstract) BT - Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC ’97 PB - ACM CY - New York UR - https://doi.org/10.1145/258533.258652 DO - 10.1145/258533.258652 ID - Herlihy1997 ER - TY - JOUR AU - Herlihy, M. AU - Rajsbaum, S. PY - 2003 DA - 2003// TI - A classification of wait-free loop agreement tasks JO - Theor Comput Sci VL - 291 UR - https://doi.org/10.1016/S0304-3975(01)00396-6 DO - 10.1016/S0304-3975(01)00396-6 ID - Herlihy2003 ER - TY - CHAP AU - Herlihy, M. AU - Rajsbaum, S. AU - Raynal, M. AU - Stainer, J. PY - 2014 DA - 2014// TI - LATIN 2014: Theoretical Informatics: 11th Latin American Symposium, Montevideo, Uruguay, March 31–April 4, 2014 BT - Proceedings, chapter Computing in the Presence of Concurrent Solo Executions PB - Springer Berlin Heidelberg CY - Heidelberg ID - Herlihy2014 ER - TY - JOUR AU - Herlihy, M. AU - Shavit, N. PY - 1999 DA - 1999// TI - The topological structure of asynchronous computability JO - J ACM VL - 46 UR - https://doi.org/10.1145/331524.331529 DO - 10.1145/331524.331529 ID - Herlihy1999 ER - TY - JOUR AU - Hoest, G. AU - Shavit, N. PY - 2006 DA - 2006// TI - Toward a topological characterization of asynchronous complexity JO - SIAM J Comput VL - 36 UR - https://doi.org/10.1137/S0097539701397412 DO - 10.1137/S0097539701397412 ID - Hoest2006 ER - TY - JOUR AU - Liu, X. AU - Xu, Z. AU - Pan, J. PY - 2009 DA - 2009// TI - Classifying rendezvous tasks of arbitrary dimension JO - Theor Comput Sci VL - 410 UR - https://doi.org/10.1016/j.tcs.2009.01.033 DO - 10.1016/j.tcs.2009.01.033 ID - Liu2009 ER - TY - JOUR AU - Mendes, H. AU - Herlihy, M. AU - Vaidya, N. AU - Garg, V. K. PY - 2015 DA - 2015// TI - Multidimensional agreement in byzantine systems JO - Distrib Comput VL - 28 UR - https://doi.org/10.1007/s00446-014-0240-5 DO - 10.1007/s00446-014-0240-5 ID - Mendes2015 ER - TY - BOOK AU - Portugal, D. AU - Rocha, R. P. PY - 2013 DA - 2013// TI - Retrieving topological information for mobile robots provided with grid maps, Number 358 in Communications in Computer and Information Science PB - Springer Berlin Heidelberg CY - Heidelberg ID - Portugal2013 ER - TY - STD TI - Saraph V, Herlihy MThe relative power of composite loop agreement tasks In: Proceedings of the International Conference on Principles of Distributed systems (OPODIS), LIPIcs: Leibniz Int. Proc. Informatics, Germany, 2015. Dagstuhl. ID - ref30 ER -