| Distributed anonymous mobile robots: Formation of geometric patterns I Suzuki, M Yamashita SIAM Journal on Computing 28 (4), 1347-1363, 1999 | 997 | 1999 |
| Distributed memoryless point convergence algorithm for mobile robots with limited visibility H Ando, Y Oasa, I Suzuki, M Yamashita IEEE Transactions on Robotics and Automation 15 (5), 818-828, 1999 | 704 | 1999 |
| Searching for a mobile intruder in a polygonal region I Suzuki, M Yamashita SIAM Journal on computing 21 (5), 863-888, 1992 | 399 | 1992 |
| Computing on anonymous networks. I. Characterizing the solvable cases M Yamashita, T Kameda IEEE Transactions on parallel and distributed systems 7 (1), 69-89, 1996 | 362 | 1996 |
| Characterizing geometric patterns formable by oblivious anonymous mobile robots M Yamashita, I Suzuki Theoretical Computer Science 411 (26-28), 2433-2453, 2010 | 168 | 2010 |
| Autonomous mobile robots with lights S Das, P Flocchini, G Prencipe, N Santoro, M Yamashita Theoretical Computer Science 609, 171-184, 2016 | 164 | 2016 |
| Formation and agreement problems for synchronous mobile robots with limited visibility H Ando, I Suzuki, M Yamashita Proceedings of Tenth International Symposium on Intelligent Control, 453-460, 1995 | 158 | 1995 |
| Computing on an anonymous network M Yamashita, T Kameda Proceedings of the seventh annual ACM Symposium on Principles of distributed …, 1988 | 133 | 1988 |
| Distances defined by neighborhood sequences M Yamashita, T Ibaraki Pattern Recognition 19 (3), 237-246, 1986 | 128 | 1986 |
| Distributed anonymous mobile robots-formation and agreement problems I Suzuki, M Yamashita Proc. 3rd Colloq. on Structural Information and Communication Complexity …, 1996 | 113 | 1996 |
| Pattern formation by oblivious asynchronous mobile robots N Fujinaga, Y Yamauchi, H Ono, S Kijima, M Yamashita SIAM Journal on Computing 44 (3), 740-785, 2015 | 109 | 2015 |
| The gathering problem for two oblivious robots with unreliable compasses T Izumi, S Souissi, Y Katayama, N Inuzuka, X Défago, K Wada, ... SIAM Journal on Computing 41 (1), 26-46, 2012 | 109 | 2012 |
| The hitting and cover times of random walks on finite graphs using local degree information S Ikeda, I Kubo, M Yamashita Theoretical Computer Science 410 (1), 94-100, 2009 | 109 | 2009 |
| Searching for a mobile intruder in a corridor—the open edge variant of the polygon search problem D Crass, I Suzuki, M Yamashita International Journal of Computational Geometry & Applications 5 (04), 397-412, 1995 | 96 | 1995 |
| Plane formation by synchronous mobile robots in the three-dimensional euclidean space Y Yamauchi, T Uehara, S Kijima, M Yamashita Journal of the ACM (JACM) 64 (3), 1-43, 2017 | 88 | 2017 |
| Leader election problem on networks in which processor identity numbers are not distinct M Yamashita, T Kameda IEEE Transactions on parallel and distributed systems 10 (9), 878-887, 1999 | 88 | 1999 |
| Availability of k-coterie H Kakugawa, S Fujita, M Yamashita, T Ae IEEE Transactions on Computers 42 (5), 553-558, 1993 | 88 | 1993 |
| Forming sequences of geometric patterns with oblivious mobile robots S Das, P Flocchini, N Santoro, M Yamashita Distributed Computing 28, 131-145, 2015 | 85 | 2015 |
| Using eventually consistent compasses to gather memory-less mobile robots with limited visibility S Souissi, X Défago, M Yamashita ACM Transactions on Autonomous and Adaptive Systems (TAAS) 4 (1), 1-27, 2009 | 77 | 2009 |
| Searching for mobile intruders in a polygonal region by a group of mobile searchers M Yamashita, H Umemoto, I Suzuki, T Kameda Proceedings of the thirteenth annual symposium on Computational geometry …, 1997 | 77 | 1997 |
