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
772012
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 (3), 433-445, 2012
532012
Mobile robots gathering algorithm with local weak multiplicity in rings
T Izumi, T Izumi, S Kamei, F Ooshita
International Colloquium on Structural Information and Communication …, 2010
492010
Gathering autonomous mobile robots with dynamic compasses: An optimal result
T Izumi, Y Katayama, N Inuzuka, K Wada
International Symposium on Distributed Computing, 298-312, 2007
462007
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
412014
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
372017
Randomized gathering of mobile robots with local-multiplicity detection
T Izumi, T Izumi, S Kamei, F Ooshita
Symposium on Self-Stabilizing Systems, 384-398, 2009
332009
Low-congestion shortcuts without embedding
B Haeupler, T Izumi, G Zuzic
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
292016
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
292014
Near-optimal low-congestion shortcuts on bounded parameter graphs
B Haeupler, T Izumi, G Zuzic
International Symposium on Distributed Computing, 158-172, 2016
272016
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
242012
On space and time complexity of loosely-stabilizing leader election
T Izumi
International Colloquium on Structural Information and Communication …, 2015
212015
Connectivity-preserving scattering of mobile robots with limited visibility
T Izumi, MG Potop-Butucaru, S Tixeuil
Symposium on Self-Stabilizing Systems, 319-331, 2010
212010
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
192013
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
Logarithmic expected-time leader election in population protocol model
Y Sudo, F Ooshita, T Izumi, H Kakugawa, T Masuzawa
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2019
182019
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
162011
A new direction for counting perfect matchings
T Izumi, T Wadayama
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 591-598, 2012
142012
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
S Cai, T Izumi, K Wada
International Colloquium on Structural Information and Communication …, 2009
142009
On gathering problem in a ring for 2n autonomous mobile robots
K Haba
Proc. 10th International Symposium on Stabilization, Safety, and Security of …, 2008
142008
The system can't perform the operation now. Try again later.
Articles 1–20