Taisuke Izumi - RankMe

156 papers A* 11A 16B 24C 15Misc 5Journal 77Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Independent set reconfiguration under bounded-hop token jumping. Theor. Comput. Sci. Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2025	J	`jnl`	Approximation hardness of domination problems on generalized convex graphs. Theor. Comput. Sci. Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2025	B	`conf`	Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. SIROCCO Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2025	J	`jnl`	Deterministic fault-tolerant connectivity labeling scheme. Distributed Comput. Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
2025	J	`jnl`	Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation. CoRR Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2025	B	`conf`	Independent Set Reconfiguration Under Bounded-Hop Token Jumping. WALCOM Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2025	J	`jnl`	Towards distributed two-stage stochastic optimization. Distributed Comput. Yuval Emek, Noga Harlev, Taisuke Izumi
2024	A	`conf`	A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. ESA Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2024	A*	`conf`	A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2024	J	`jnl`	Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. CoRR Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2024	J	`jnl`	Independent Set Reconfiguration Under Bounded-Hop Token. CoRR Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2024	B	`conf`	Self-Stabilizing Fully Adaptive Maximal Matching. OPODIS Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
2023	J	`jnl`	A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2023	A*	`conf`	Deterministic Fault-Tolerant Connectivity Labeling Scheme. PODC Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
2023	J	`jnl`	Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. IEICE Trans. Inf. Syst. Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa
2023	B	`conf`	Power-Collision-Based 2-Shot Grant-Free NOMA with Cross-Slot SIC for mMTC. GLOBECOM Takeshi Hirai, Taisuke Izumi, Naoki Wakamiya
2022	J	`jnl`	A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. IEICE Trans. Inf. Syst. Naoki Kitamura, Taisuke Izumi
2022	B	`conf`	Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2022	J	`jnl`	Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. CoRR Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2022	J	`jnl`	Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. CoRR Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa
2022	J	`jnl`	Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time. CoRR Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
2022	J	`jnl`	Fast Neighborhood Rendezvous. IEICE Trans. Inf. Syst. Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
2022	B	`conf`	Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
2022	J	`jnl`	Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
2022	J	`jnl`	Loosely-stabilizing maximal independent set algorithms with unreliable communications. Theor. Comput. Sci. Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa
2021	J	`jnl`	A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. CoRR Naoki Kitamura, Taisuke Izumi
2021	J	`jnl`	Fast Neighborhood Rendezvous. CoRR Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
2021	J	`jnl`	Fully Adaptive Self-Stabilizing Transformer for LCL Problems. CoRR Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
2021	C	`conf`	Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications. SSS Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa
2021	J	`jnl`	Low-Congestion shortcuts without embedding. Distributed Comput. Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
2021	J	`jnl`	Low-congestion shortcut and graph parameters. Distributed Comput. Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2021	A	`conf`	Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols. DISC Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa
2020	A	`conf`	Fast Neighborhood Rendezvous. ICDCS Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
2020	J	`jnl`	Fault-tolerant simulation of population protocols. Distributed Comput. Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
2020	A	`conf`	Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS Taisuke Izumi, François Le Gall, Frédéric Magniez
2020	A*	`conf`	Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. ICALP Taisuke Izumi, Yota Otachi
2020	J	`jnl`	Time-Optimal Leader Election in Population Protocols. IEEE Trans. Parallel Distributed Syst. Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2020	J	`jnl`	Time-optimal Loosely-stabilizing Leader Election in Population Protocols. CoRR Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa
2020	J	`jnl`	Uniform distribution for Pachinko. Theor. Comput. Sci. Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
2019	J	`jnl`	A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
2019	A*	`conf`	Distributed Minimum Degree Spanning Trees. PODC Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport
2019	J	`jnl`	Foreword. IEICE Trans. Inf. Syst. Taisuke Izumi
2019	A*	`conf`	Logarithmic Expected-Time Leader Election in Population Protocol Model. PODC Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2019	C	`conf`	Logarithmic Expected-Time Leader Election in Population Protocol Model. SSS Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2019	A	`conf`	Low-Congestion Shortcut and Graph Parameters. DISC Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2019	J	`jnl`	Low-Congestion Shortcut and Graph Parameters. CoRR Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2019	A	`conf`	Message Reduction in the LOCAL Model Is a Free Lunch. DISC Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
2019	A*	`conf`	Message Reduction in the LOCAL Model is a Free Lunch. PODC Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
2019	J	`jnl`	Message Reduction in the Local Model is a Free Lunch. CoRR Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
2019	J	`jnl`	Population protocols with faulty interactions: The impact of a leader. Theor. Comput. Sci. Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
2019	J	`jnl`	Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. CoRR Taisuke Izumi, François Le Gall, Frédéric Magniez
2019	A*	`conf`	Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. PODC Taisuke Izumi, François Le Gall
2019	J	`jnl`	Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. CoRR Taisuke Izumi, François Le Gall
2019	J	`jnl`	Sub-Linear Time Aggregation in Probabilistic Population Protocol Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Ryota Eguchi, Taisuke Izumi
2019	B	`conf`	Towards Distributed Two-Stage Stochastic Optimization. OPODIS Yuval Emek, Noga Harlev, Taisuke Izumi
2018	—	`conf`	A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
2018	J	`jnl`	Bounds on the Asymptotic Rate for Capacitive Crosstalk Avoidance Codes for On-Chip Buses. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tadashi Wadayama, Taisuke Izumi
2018	A*	`conf`	Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. PODC Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi
2018	J	`jnl`	Logarithmic Expected-Time Leader Election in Population Protocol Model. CoRR Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2018	J	`jnl`	On time complexity for connectivity-preserving scattering of mobile robots. Theor. Comput. Sci. Taisuke Izumi, Daichi Kaino, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
2018	C	`ed.`	Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings SSS Taisuke Izumi, Petr Kuznetsov
2018	Misc	`conf`	Uniform Distribution On Pachinko. FUN Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
2017	A	`conf`	Brief Announcement: Fast Aggregation in Population Protocols. DISC Ryota Eguchi, Taisuke Izumi
2017	A	`conf`	On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. ICDCS Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
2017	C	`conf`	Population Protocols with Faulty Interactions: The Impact of a Leader. CIAC Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
2017	A*	`conf`	Triangle Finding and Listing in CONGEST Networks. PODC Taisuke Izumi, François Le Gall
2017	J	`jnl`	Triangle Finding and Listing in CONGEST Networks. CoRR Taisuke Izumi, François Le Gall
2016	J	`jnl`	Bitwise MAP Estimation for Group Testing Based on Holographic Transformation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura
2016	J	`jnl`	Bounds on Asymptotic Rate of Capacitive Crosstalk Avoidance Codes for On-chip Buses. CoRR Tadashi Wadayama, Taisuke Izumi
2016	B	`conf`	Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses. ISIT Tadashi Wadayama, Taisuke Izumi
2016	C	`conf`	Flocking with Oblivious Robots. SSS Davide Canepa, Xavier Défago, Taisuke Izumi, Maria Potop-Butucaru
2016	J	`jnl`	Improving the lower bound on opaque sets for equilateral triangle. Discret. Appl. Math. Taisuke Izumi
2016	A*	`conf`	Low-Congestion Shortcuts without Embedding. PODC Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
2016	J	`jnl`	Low-Congestion Shortcuts without Embedding. CoRR Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
2016	A	`conf`	Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. DISC Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
2016	J	`jnl`	On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. CoRR Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
2016	J	`jnl`	Population Protocols with Faulty Interactions: the Impact of a Leader. CoRR Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
2015	J	`jnl`	Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2015	B	`conf`	Bitwise MAP estimation for group testing based on holographic transformation. ISIT Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura
2015	J	`jnl`	Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2015	J	`jnl`	Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure. IEICE Trans. Inf. Syst. Taisuke Izumi, Daisuke Suzuki
2015	B	`conf`	Filling Logarithmic Gaps in Distributed Complexity for Global Problems. SOFSEM Hiroaki Ookawa, Taisuke Izumi
2015	J	`jnl`	Improving Lower Bound on Opaque Set for Equilateral Triangle. CoRR Taisuke Izumi
2015	C	`conf`	Listing Center Strings Under the Edit Distance Metric. COCOA Hiromitsu Maji, Taisuke Izumi
2015	B	`conf`	On Space and Time Complexity of Loosely-Stabilizing Leader Election. SIROCCO Taisuke Izumi
2015	J	`jnl`	Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
2015	B	`conf`	Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
2014	J	`jnl`	Bitwise MAP Algorithm for Group Testing based on Holographic Transformation. CoRR Tadashi Wadayama, Taisuke Izumi
2014	B	`conf`	Depth-First Search Using O(n) Bits. ISAAC Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
2014	—	`conf`	Investigating the Effectiveness of a Moving-Target Oriented Opportunistic Routing Algorithm on RoboCup Rescue Simulations. IIAI-AAI Takuma Kawakami, Kyoichi Kisanuki, Toshiaki Ito, Kazunori Iwata, Nobuhiro Ito, Taisuke Izumi
2014	—	`conf`	On the Worst-Case Initial Configuration for Conservative Connectivity Preservation. SRDS Workshops Daichi Kaino, Taisuke Izumi
2014	B	`conf`	Randomized Lower Bound for Distributed Spanning-Tree Verification. SIROCCO Taisuke Izumi
2014	J	`jnl`	Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theor. Comput. Sci. Tomoko Izumi, Keigo Kinpara, Taisuke Izumi, Koichi Wada
2014	B	`conf`	Time Lower Bounds for Distributed Distance Oracles. OPODIS Taisuke Izumi, Roger Wattenhofer
2013	J	`jnl`	Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots. IEEE Trans. Parallel Distributed Syst. Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita
2013	C	`conf`	Scalable Estimation of Network Average Degree. SSS Taisuke Izumi, Hironobu Kanzaki
2013	J	`jnl`	Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita
2013	C	`conf`	When Expanders Help Self-Healing Distributed R-Tree Overlays. ISPDC Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero
2012	J	`jnl`	A New Direction for Counting Perfect Matchings CoRR Taisuke Izumi, Tadashi Wadayama
2012	A*	`conf`	A New Direction for Counting Perfect Matchings. FOCS Taisuke Izumi, Tadashi Wadayama
2012	J	`jnl`	How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. Theory Comput. Syst. Shukai Cai, Taisuke Izumi, Koichi Wada
2012	C	`conf`	Minimum Certificate Dispersal with Tree Structures. TAMC Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2012	J	`jnl`	On the approximability and hardness of minimum topic connected overlay and its special instances. Theor. Comput. Sci. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2012	J	`jnl`	The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. SIAM J. Comput. Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita
2012	J	`jnl`	The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling. Parallel Process. Lett. Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi
2012	J	`jnl`	The optimal tolerance of uniform observation error for mobile robot convergence. Theor. Comput. Sci. Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada
2011	J	`jnl`	Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. Parallel Process. Lett. Nazreen Banu, Taisuke Izumi, Koichi Wada
2011	A	`conf`	Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. DISC Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
2011	Misc	`conf`	Distributed Algorithms for Cooperative Mobile Robots: A Survey. ICNC Samia Souissi, Taisuke Izumi, Koichi Wada
2011	J	`jnl`	Emergent velocity agreement in robot networks CoRR Davide Canepa, Xavier Défago, Taisuke Izumi, Maria Potop-Butucaru
2011	J	`jnl`	Minimum Certificate Dispersal with Tree Structures CoRR Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
2011	J	`jnl`	On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances CoRR Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011	B	`conf`	On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. MFCS Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
2011	J	`jnl`	Oracle-based flocking of mobile robots in crash-recovery model. Theor. Comput. Sci. Samia Souissi, Taisuke Izumi, Koichi Wada
2011	A	`conf`	Physical Expander in Virtual Tree Overlay. DISC Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Mathieu Valero
2011	J	`jnl`	Physical expander in Virtual Tree Overlay CoRR Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero
2011	J	`jnl`	The BG-simulation for Byzantine Mobile Robots CoRR Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil, Koichi Wada
2011	J	`jnl`	The Gathering Problem for Two Oblivious Robots with Unreliable Compasses CoRR Taisuke Izumi, Samia Souissi, Yoshiaki Katayama, Nobuhiro Inuzuka, Xavier Défago, Koichi Wada, Masafumi Yamashita
2010	J	`jnl`	Approximability and inapproximability of the minimum certificate dispersal problem. Theor. Comput. Sci. Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
2010	C	`conf`	Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility. SSS Taisuke Izumi, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
2010	A	`conf`	Doubly-expedited one-step Byzantine consensus. DSN Nazreen Banu, Taisuke Izumi, Koichi Wada
2010	B	`conf`	Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. OPODIS Keigo Kinpara, Tomoko Izumi, Taisuke Izumi, Koichi Wada
2010	B	`conf`	Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. SIROCCO Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita
2010	J	`jnl`	The cost of probabilistic agreement in oblivious robot networks. Inf. Process. Lett. Julien Clément, Xavier Défago, Maria Gradinariu Potop-Butucaru, Taisuke Izumi, Stéphane Messika
2009	J	`jnl`	A Biologically Inspired Self-Adaptation of Replica Density Control. IEICE Trans. Inf. Syst. Tomoko Izumi, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2009	C	`conf`	A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines. PDCAT Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi
2009	J	`jnl`	A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination. IEICE Trans. Inf. Syst. Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2009	B	`conf`	Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. OPODIS Toshimitsu Masuzawa, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada
2009	B	`conf`	Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. SIROCCO Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada
2009	C	`conf`	Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model. SSS Samia Souissi, Taisuke Izumi, Koichi Wada
2009	C	`conf`	Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. SSS Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita
2009	Misc	`conf`	Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada
2009	B	`conf`	Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. SIROCCO Shukai Cai, Taisuke Izumi, Koichi Wada
2008	J	`jnl`	An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks. IEICE Trans. Inf. Syst. Yusuke Takahashi, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2008	Misc	`conf`	Construction of Loosely-Structured Overlay Using Bloom Filter. PDPTA Yusuke Takahashi, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2008	B	`conf`	Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. SIROCCO Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada
2008	J	`jnl`	Move-optimal gossiping among mobile agents. Theor. Comput. Sci. Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2007	J	`jnl`	Adaptive timeliness of consensus in presence of crash and timing faults. J. Parallel Distributed Comput. Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa
2007	Misc	`conf`	An adaptive randomized search protocol in peer-to-peer systems. SAC Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2007	A	`conf`	Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. DISC Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada
2007	C	`conf`	On the Probabilistic Omission Adversary. SSS Taisuke Izumi, Koichi Wada
2007	B	`conf`	Optimal Moves for Gossiping Among Mobile Agents. SIROCCO Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2007	J	`jnl`	Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model. IEICE Trans. Inf. Syst. Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa
2006	J	`jnl`	A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems. Inf. Process. Lett. Taisuke Izumi, Toshimitsu Masuzawa
2006	—	`conf`	An Interest-Based Peer Clustering Algorithm Using Ant Paradigm. BioADIT Taisuke Izumi, Toshimitsu Masuzawa
2006	—	`conf`	Bio-inspired Replica Density Control in Dynamic Networks. BioADIT Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2006	C	`conf`	Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System. SSS Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2006	J	`jnl`	Condition Adaptation in Synchronous Consensus. IEEE Trans. Computers Taisuke Izumi, Toshimitsu Masuzawa
2006	A	`conf`	One-Step Consensus Solvability. DISC Taisuke Izumi, Toshimitsu Masuzawa
2005	B	`conf`	An Improved Algorithm for Adaptive Condition-Based Consensus. SIROCCO Taisuke Izumi, Toshimitsu Masuzawa
2005	—	`conf`	Biologically Inspired Self-Adaptation of Mobile Agent Population. DEXA Workshops Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa
2005	—	`conf`	Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach. ICAC Tomoko Suzuki, Taisuke Izumi, Fukuhito Ooshita, Toshimitsu Masuzawa
2005	J	`jnl`	Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults. IEICE Trans. Inf. Syst. Taisuke Izumi, Toshimitsu Masuzawa
2004	—	`conf`	Ant-Based Approach to Mobile Agent Traversal. BioADIT Taisuke Izumi, Toshimitsu Masuzawa
2004	A	`conf`	Synchronous Condition-Based Consensus Adapting to Input-Vector Legality. DISC Taisuke Izumi, Toshimitsu Masuzawa
2004	A	`conf`	Timed Uniform Consensus Resilient to Crash and Timing Faults. DSN Taisuke Izumi, Akinori Saitoh, Toshimitsu Masuzawa