Follow
Taisuke Izumi
Taisuke Izumi
Associate Professor, Osaka University
Verified email at ist.osaka-u.ac.jp
Title
Cited by
Cited by
Year
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
123*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
71*2012
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
56*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
542010
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
482017
Depth-first search using bits
T Asano, T Izumi, M Kiyomi, M Konagaya, H Ono, Y Otachi, P Schweitzer, ...
Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014
472014
Low-Congestion shortcuts without embedding
B Haeupler, T Izumi, G Zuzic
Distributed Computing 34, 79-90, 2021
40*2021
Near-optimal low-congestion shortcuts on bounded parameter graphs
B Haeupler, T Izumi, G Zuzic
Distributed Computing: 30th International Symposium, DISC 2016, Paris …, 2016
392016
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
352014
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
34*2018
On space and time complexity of loosely-stabilizing leader election
T Izumi
Structural Information and Communication Complexity: 22nd International …, 2015
252015
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
252012
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
222019
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
212019
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
192010
Quantum distributed algorithm for triangle finding in the CONGEST model
T Izumi, FL Gall, F Magniez
arXiv preprint arXiv:1908.11488, 2019
182019
Brief Announcement: The BG-simulation for Byzantine mobile robots
T Izumi, Z Bouzid, S Tixeuil, K Wada
Distributed Computing: 25th International Symposium, DISC 2011, Rome, Italy …, 2011
182011
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
162012
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
152019
Time lower bounds for distributed distance oracles
T Izumi, R Wattenhofer
Principles of Distributed Systems: 18th International Conference, OPODIS …, 2014
152014
The system can't perform the operation now. Try again later.
Articles 1–20