| Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection S Kamei, A Lamani, F Ooshita, S Tixeuil Structural Information and Communication Complexity: 18th International …, 2011 | 79 | 2011 |
| Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings T Izumi, T Izumi, S Kamei, F Ooshita IEICE Transactions on Fundamentals of Electronics, Communications and …, 2013 | 71* | 2013 |
| An ant colony optimization routing based on robustness for ad hoc networks with GPSs D Kadono, T Izumi, F Ooshita, H Kakugawa, T Masuzawa Ad Hoc Networks 8 (1), 63-76, 2010 | 60 | 2010 |
| Feasibility of polynomial-time randomized gathering for oblivious mobile robots T Izumi, T Izumi, S Kamei, F Ooshita IEEE Transactions on Parallel and Distributed Systems 24 (4), 716-723, 2013 | 57* | 2013 |
| A self-stabilizing link-coloring protocol in tree networks with permanent byzantine faults Y Sakurai, F Ooshita, T Masuzawa Journal of Aerospace Computing, Information, and Communication 3 (8), 420-436, 2006 | 53* | 2006 |
| Loosely-stabilizing leader election in a population protocol model Y Sudo, J Nakamura, Y Yamauchi, F Ooshita, H Kakugawa, T Masuzawa Theoretical Computer Science 444, 100-112, 2012 | 51 | 2012 |
| Uniform deployment of mobile agents in asynchronous rings M Shibata, T Mega, F Ooshita, H Kakugawa, T Masuzawa Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 50 | 2016 |
| Gathering an even number of robots in an odd ring without global multiplicity detection S Kamei, A Lamani, F Ooshita, S Tixeuil Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 42 | 2012 |
| Time-optimal leader election in population protocols Y Sudo, F Ooshita, T Izumi, H Kakugawa, T Masuzawa IEEE Transactions on Parallel and Distributed Systems 31 (11), 2620-2632, 2020 | 40* | 2020 |
| Linear time and space gathering of anonymous mobile agents in asynchronous trees D Baba, T Izumi, F Ooshita, H Kakugawa, T Masuzawa Theoretical Computer Science 478, 118-126, 2013 | 31* | 2013 |
| A single agent exploration in unknown undirected graphs with whiteboards Y Sudo, D Baba, J Nakamura, F Ooshita, H Kakugawa, T Masuzawa IEICE Transactions on Fundamentals of Electronics, Communications and …, 2015 | 28* | 2015 |
| On the self-stabilization of mobile oblivious robots in uniform rings F Ooshita, S Tixeuil Theoretical Computer Science 568, 84-96, 2015 | 27 | 2015 |
| Loosely-stabilizing leader election with polylogarithmic convergence time Y Sudo, F Ooshita, H Kakugawa, T Masuzawa, AK Datta, LL Larmore Theoretical Computer Science 806, 617-631, 2020 | 25 | 2020 |
| Randomized gathering of mobile agents in anonymous unidirectional ring networks F Ooshita, S Kawai, H Kakugawa, T Masuzawa IEEE Transactions on Parallel and Distributed Systems 25 (5), 1289-1296, 2013 | 25* | 2013 |
| Ring exploration with myopic luminous robots F Ooshita, S Tixeuil Information and Computation 285, 104702, 2022 | 23 | 2022 |
| Exploration of dynamic tori by multiple agents T Gotoh, Y Sudo, F Ooshita, H Kakugawa, T Masuzawa Theoretical Computer Science 850, 202-220, 2021 | 22* | 2021 |
| Loosely-stabilizing leader election for arbitrary graphs in population protocol model Y Sudo, F Ooshita, H Kakugawa, T Masuzawa, AK Datta, LL Larmore IEEE Transactions on Parallel and Distributed Systems 30 (6), 1359-1373, 2018 | 22 | 2018 |
| Byzantine-tolerant gathering of mobile agents in arbitrary networks with authenticated whiteboards M Tsuchida, F Ooshita, M Inoue IEICE TRANSACTIONS on Information and Systems 101 (3), 602-610, 2018 | 22* | 2018 |
| Gathering on rings for myopic asynchronous robots with lights S Kamei, A Lamani, F Ooshita, S Tixeuil, K Wada arXiv preprint arXiv:1911.04757, 2019 | 18 | 2019 |
| Loosely-stabilizing leader election on arbitrary graphs in population protocols Y Sudo, F Ooshita, H Kakugawa, T Masuzawa Principles of Distributed Systems: 18th International Conference, OPODIS …, 2014 | 16 | 2014 |
Toshimitsu MasuzawaOsaka UniversityDirección de correo verificada de ist.osaka-u.ac.jp
