| 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 | 147* | 2012 |
| How to prove impossibility under global fairness: On space complexity of self-stabilizing leader election on a population protocol model S Cai, T Izumi, K Wada Theory of Computing Systems 50, 433-445, 2012 | 78* | 2012 |
| Triangle finding and listing in CONGEST networks T Izumi, F Le Gall Proceedings of the ACM Symposium on Principles of Distributed Computing, 381-389, 2017 | 62 | 2017 |
| 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 |
| Mobile robots gathering algorithm with local weak multiplicity in rings T Izumi, T Izumi, S Kamei, F Ooshita Structural Information and Communication Complexity: 17th International …, 2010 | 56 | 2010 |
| Depth-first search using bits T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ... International Symposium on Algorithms and Computation, 553-564, 2014 | 54 | 2014 |
| Low-congestion shortcuts without embedding B Haeupler, T Izumi, G Zuzic Distributed Computing 34, 79-90, 2021 | 50* | 2021 |
| On time complexity for connectivity-preserving scattering of mobile robots T Izumi, D Kaino, MG Potop-Butucaru, S Tixeuil Theoretical Computer Science 738, 42-52, 2018 | 47* | 2018 |
| Near-optimal low-congestion shortcuts on bounded parameter graphs B Haeupler, T Izumi, G Zuzic International Symposium on Distributed Computing, 158-172, 2016 | 47 | 2016 |
| Quantum distributed algorithm for triangle finding in the CONGEST model T Izumi, FL Gall, F Magniez arXiv preprint arXiv:1908.11488, 2019 | 35 | 2019 |
| Space-efficient self-stabilizing counting population protocols on mobile sensor networks T Izumi, K Kinpara, T Izumi, K Wada Theoretical Computer Science 552, 99-108, 2014 | 35 | 2014 |
| Quantum distributed algorithm for the All-Pairs Shortest Path problem in the CONGEST-CLIQUE model T Izumi, F Le Gall Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 34 | 2019 |
| On space and time complexity of loosely-stabilizing leader election T Izumi International Colloquium on Structural Information and Communication …, 2015 | 30 | 2015 |
| An improved byzantine agreement algorithm for synchronous systems with mobile faults N Banu, S Souissi, T Izumi, K Wada International Journal of Computer Applications 43 (22), 1-7, 2012 | 28 | 2012 |
| Logarithmic expected-time leader election in population protocol model Y Sudo, F Ooshita, T Izumi, H Kakugawa, T Masuzawa Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 26 | 2019 |
| Brief Announcement: The BG-simulation for Byzantine mobile robots T Izumi, Z Bouzid, S Tixeuil, K Wada International Symposium on Distributed Computing, 330-331, 2011 | 25 | 2011 |
| Population protocols with faulty interactions: the impact of a leader GA Di Luna, P Flocchini, T Izumi, T Izumi, N Santoro, G Viglietta Theoretical Computer Science 754, 35-49, 2019 | 21 | 2019 |
| 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 | 20 | 2020 |
| On the approximability and hardness of minimum topic connected overlay and its special instances J Hosoda, J Hromkovič, T Izumi, H Ono, M Steinová, K Wada Theoretical Computer Science 429, 144-154, 2012 | 20 | 2012 |
| The cost of probabilistic agreement in oblivious robot networks J Clement, X Défago, MG Potop-Butucaru, T Izumi, S Messika Information Processing Letters 110 (11), 431-438, 2010 | 19 | 2010 |
