| 2013 | ||
|---|---|---|
| j19 | Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita: Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots. IEEE Trans. Parallel Distrib. Syst. 24(4): 716-723 (2013) | |
| 2012 | ||
| j18 | Shukai Cai, Taisuke Izumi, Koichi Wada: How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory Comput. Syst. 50(3): 433-445 (2012) | |
| j17 | Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi: The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling. Parallel Processing Letters 22(2) (2012) | |
| j16 | Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita: The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. SIAM J. Comput. 41(1): 26-46 (2012) | |
| j15 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada: On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. 429: 144-154 (2012) | |
| j14 | Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada: The optimal tolerance of uniform observation error for mobile robot convergence. Theor. Comput. Sci. 444: 77-86 (2012) | |
| c33 | ||
| c32 | Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada: Minimum Certificate Dispersal with Tree Structures. TAMC 2012: 548-559 | |
| i7 | Taisuke Izumi, Tadashi Wadayama: A New Direction for Counting Perfect Matchings. CoRR abs/1208.2329 (2012) | |
| 2011 | ||
| j13 | Nazreen Banu, Taisuke Izumi, Koichi Wada: Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. Parallel Processing Letters 21(4): 461-477 (2011) | |
| j12 | Samia Souissi, Taisuke Izumi, Koichi Wada: Oracle-based flocking of mobile robots in crash-recovery model. Theor. Comput. Sci. 412(33): 4350-4360 (2011) | |
| c31 | Samia Souissi, Taisuke Izumi, Koichi Wada: Distributed Algorithms for Cooperative Mobile Robots: A Survey. ICNC 2011: 364-371 | |
| c30 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada: On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS 2011: 376-387 | |
| c29 | Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Mathieu Valero: Physical Expander in Virtual Tree Overlay. DISC 2011: 82-96 | |
| c28 | Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada: Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. DISC 2011: 330-331 | |
| i6 | Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero: Physical expander in Virtual Tree Overlay. CoRR abs/1102.4981 (2011) | |
| i5 | Davide Canepa, Xavier Défago, Taisuke Izumi, Maria Potop-Butucaru: Emergent velocity agreement in robot networks. CoRR abs/1105.4082 (2011) | |
| i4 | Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada: The BG-simulation for Byzantine Mobile Robots. CoRR abs/1106.0113 (2011) | |
| i3 | Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada: Minimum Certificate Dispersal with Tree Structures. CoRR abs/1106.5845 (2011) | |
| i2 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada: On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances. CoRR abs/1107.2443 (2011) | |
| i1 | Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita: The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. CoRR abs/1111.1492 (2011) | |
| 2010 | ||
| j11 | Julien Clément, Xavier Défago, Maria Gradinariu Potop-Butucaru, Taisuke Izumi, Stéphane Messika: The cost of probabilistic agreement in oblivious robot networks. Inf. Process. Lett. 110(11): 431-438 (2010) | |
| j10 | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada: Approximability and inapproximability of the minimum certificate dispersal problem. Theor. Comput. Sci. 411(31-33): 2773-2783 (2010) | |
| c27 | Nazreen Banu, Taisuke Izumi, Koichi Wada: Doubly-expedited one-step Byzantine consensus. DSN 2010: 373-382 | |
| c26 | Keigo Kinpara, Tomoko Izumi, Taisuke Izumi, Koichi Wada: Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. OPODIS 2010: 504-515 | |
| c25 | Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. SIROCCO 2010: 101-113 | |
| c24 | Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil: Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility. SSS 2010: 319-331 | |
| 2009 | ||
| j9 | Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination. IEICE Transactions 92-D(2): 258-268 (2009) | |
| j8 | Tomoko Izumi, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: A Biologically Inspired Self-Adaptation of Replica Density Control. IEICE Transactions 92-D(5): 1125-1136 (2009) | |
| c23 | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada: Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON 2009: 56-65 | |
| c22 | Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada: Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. OPODIS 2009: 219-224 | |
| c21 | Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi: A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines. PDCAT 2009: 26-33 | |
| c20 | Shukai Cai, Taisuke Izumi, Koichi Wada: Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. SIROCCO 2009: 113-125 | |
| c19 | Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada: Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. SIROCCO 2009: 309-322 | |
| c18 | Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita: Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. SSS 2009: 384-398 | |
| c17 | Samia Souissi, Taisuke Izumi, Koichi Wada: Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model. SSS 2009: 683-697 | |
| 2008 | ||
| j7 | Yusuke Takahashi, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa: An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks. IEICE Transactions 91-D(7): 1971-1981 (2008) | |
| j6 | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: Move-optimal gossiping among mobile agents. Theor. Comput. Sci. 393(1-3): 90-101 (2008) | |
| c16 | Yusuke Takahashi, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa: Construction of Loosely-Structured Overlay Using Bloom Filter. PDPTA 2008: 895-899 | |
| c15 | Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada: Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. SIROCCO 2008: 5-19 | |
| 2007 | ||
| j5 | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa: Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model. IEICE Transactions 90-D(1): 314-324 (2007) | |
| j4 | Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa: Adaptive timeliness of consensus in presence of crash and timing faults. J. Parallel Distrib. Comput. 67(6): 648-658 (2007) | |
| c14 | Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: An adaptive randomized search protocol in peer-to-peer systems. SAC 2007: 533-537 | |
| c13 | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: Optimal Moves for Gossiping Among Mobile Agents. SIROCCO 2007: 151-165 | |
| c12 | ||
| c11 | Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada: Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. DISC 2007: 298-312 | |
| 2006 | ||
| j3 | Taisuke Izumi, Toshimitsu Masuzawa: A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems. Inf. Process. Lett. 100(5): 199-205 (2006) | |
| j2 | Taisuke Izumi, Toshimitsu Masuzawa: Condition Adaptation in Synchronous Consensus. IEEE Trans. Computers 55(7): 843-853 (2006) | |
| c10 | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: Bio-inspired Replica Density Control in Dynamic Networks. BioADIT 2006: 281-293 | |
| c9 | Taisuke Izumi, Toshimitsu Masuzawa: An Interest-Based Peer Clustering Algorithm Using Ant Paradigm. BioADIT 2006: 379-386 | |
| c8 | Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa: Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System. SSS 2006: 586-587 | |
| c7 | ||
| 2005 | ||
| j1 | Taisuke Izumi, Toshimitsu Masuzawa: Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults. IEICE Transactions 88-D(1): 72-81 (2005) | |
| c6 | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa: Biologically Inspired Self-Adaptation of Mobile Agent Population. DEXA Workshops 2005: 170-174 | |
| c5 | Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa: Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach. ICAC 2005: 374-375 | |
| c4 | Taisuke Izumi, Toshimitsu Masuzawa: An Improved Algorithm for Adaptive Condition-Based Consensus. SIROCCO 2005: 170-184 | |
| 2004 | ||
| c3 | Taisuke Izumi, Toshimitsu Masuzawa: Ant-Based Approach to Mobile Agent Traversal. BioADIT 2004: 350-363 | |
| c2 | Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa: Timed Uniform Consensus Resilient to Crash and Timing Faults. DSN 2004: 243-252 | |
| c1 | Taisuke Izumi, Toshimitsu Masuzawa: Synchronous Condition-Based Consensus Adapting to Input-Vector Legality. DISC 2004: 16-29 | |
Data released under the ODC-BY 1.0 license — See also our legal information page