Ant-Based Approach to Mobile Agent Traversal. - Taisuke Izumi; Toshimitsu Masuzawa (BioADIT, 2004)

Timed Uniform Consensus Resilient to Crash and Timing Faults. - Taisuke Izumi; Akinori Saitoh; Toshimitsu Masuzawa (DSN, 2004)

Synchronous Condition-Based Consensus Adapting to Input-Vector Legality. - Taisuke Izumi; Toshimitsu Masuzawa (DISC, 2004)

Biologically Inspired Self-Adaptation of Mobile Agent Population. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Toshimitsu Masuzawa (DEXA Workshops, 2005)

Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Toshimitsu Masuzawa (ICAC, 2005)

An Improved Algorithm for Adaptive Condition-Based Consensus. - Taisuke Izumi; Toshimitsu Masuzawa (SIROCCO, 2005)

Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults. - Taisuke Izumi; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2005)

An Interest-Based Peer Clustering Algorithm Using Ant Paradigm. - Taisuke Izumi; Toshimitsu Masuzawa (BioADIT, 2006)

Bio-inspired Replica Density Control in Dynamic Networks. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (BioADIT, 2006)

Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System. - Yu Wu; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SSS, 2006)

One-Step Consensus Solvability. - Taisuke Izumi; Toshimitsu Masuzawa (DISC, 2006)

A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems. - Taisuke Izumi; Toshimitsu Masuzawa (Inf. Process. Lett., 2006)

Condition Adaptation in Synchronous Consensus. - Taisuke Izumi; Toshimitsu Masuzawa (IEEE Trans. Computers, 2006)

An adaptive randomized search protocol in peer-to-peer systems. - Yu Wu; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SAC, 2007)

Optimal Moves for Gossiping Among Mobile Agents. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (SIROCCO, 2007)

On the Probabilistic Omission Adversary. - Taisuke Izumi; Koichi Wada 001 (SSS, 2007)

Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result. - Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada 001 (DISC, 2007)

Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2007)

Adaptive timeliness of consensus in presence of crash and timing faults. - Taisuke Izumi; Akinori Saitoh; Toshimitsu Masuzawa (J. Parallel Distributed Comput., 2007)

Construction of Loosely-Structured Overlay Using Bloom Filter. - Yusuke Takahashi; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (PDPTA, 2008)

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses. - Nobuhiro Inuzuka; Yuichi Tomida; Taisuke Izumi; Yoshiaki Katayama; Koichi Wada 001 (SIROCCO, 2008)

An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks. - Yusuke Takahashi; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2008)

Move-optimal gossiping among mobile agents. - Tomoko Suzuki; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (Theor. Comput. Sci., 2008)

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. - Tomoko Izumi; Taisuke Izumi; Hirotaka Ono 001; Koichi Wada 001 (COCOON, 2009)

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction. - Toshimitsu Masuzawa; Taisuke Izumi; Yoshiaki Katayama; Koichi Wada 001 (OPODIS, 2009)

A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines. - Fukuhito Ooshita; Tomoko Izumi; Taisuke Izumi (PDCAT, 2009)

Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents. - Shukai Cai; Taisuke Izumi; Koichi Wada 001 (SIROCCO, 2009)

Convergence of Mobile Robots with Uniformly-Inaccurate Sensors. - Kenta Yamamoto; Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada 001 (SIROCCO, 2009)

Randomized Gathering of Mobile Robots with Local-Multiplicity Detection. - Taisuke Izumi; Tomoko Izumi; Sayaka Kamei; Fukuhito Ooshita (SSS, 2009)

A Biologically Inspired Self-Adaptation of Replica Density Control. - Tomoko Izumi; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination. - Yu Wu; Taisuke Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2009)

Doubly-expedited one-step Byzantine consensus. - Nazreen Banu; Taisuke Izumi; Koichi Wada 001 (DSN, 2010)

Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. - Keigo Kinpara; Tomoko Izumi; Taisuke Izumi; Koichi Wada 001 (OPODIS, 2010)

Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings. - Tomoko Izumi; Taisuke Izumi; Sayaka Kamei; Fukuhito Ooshita (SIROCCO, 2010)

Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility. - Taisuke Izumi; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (SSS, 2010)

The cost of probabilistic agreement in oblivious robot networks. - Julien Clément 002; Xavier Défago; Maria Gradinariu Potop-Butucaru; Taisuke Izumi; Stéphane Messika (Inf. Process. Lett., 2010)

Approximability and inapproximability of the minimum certificate dispersal problem. - Tomoko Izumi; Taisuke Izumi; Hirotaka Ono 001; Koichi Wada 001 (Theor. Comput. Sci., 2010)

Distributed Algorithms for Cooperative Mobile Robots: A Survey. - Samia Souissi; Taisuke Izumi; Koichi Wada 001 (ICNC, 2011)

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (MFCS, 2011)

Brief Announcement: The BG-Simulation for Byzantine Mobile Robots. - Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada 001 (DISC, 2011)

Physical Expander in Virtual Tree Overlay. - Taisuke Izumi; Maria Gradinariu Potop-Butucaru; Mathieu Valero (DISC, 2011)

Emergent velocity agreement in robot networks - Davide Canepa; Xavier Défago; Taisuke Izumi; Maria Potop-Butucaru (CoRR, 2011)

The BG-simulation for Byzantine Mobile Robots - Taisuke Izumi; Zohir Bouzid; Sébastien Tixeuil; Koichi Wada 001 (CoRR, 2011)

Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. - Nazreen Banu; Taisuke Izumi; Koichi Wada 001 (Parallel Process. Lett., 2011)

Oracle-based flocking of mobile robots in crash-recovery model. - Samia Souissi; Taisuke Izumi; Koichi Wada 001 (Theor. Comput. Sci., 2011)

A New Direction for Counting Perfect Matchings. - Taisuke Izumi; Tadashi Wadayama (FOCS, 2012)

Minimum Certificate Dispersal with Tree Structures. - Taisuke Izumi; Tomoko Izumi; Hirotaka Ono 001; Koichi Wada 001 (TAMC, 2012)

How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model. - Shukai Cai; Taisuke Izumi; Koichi Wada 001 (Theory Comput. Syst., 2012)

The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling. - Fukuhito Ooshita; Tomoko Izumi; Taisuke Izumi (Parallel Process. Lett., 2012)

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses. - Taisuke Izumi; Samia Souissi; Yoshiaki Katayama; Nobuhiro Inuzuka; Xavier Défago; Koichi Wada 001; Masafumi Yamashita (SIAM J. Comput., 2012)

On the approximability and hardness of minimum topic connected overlay and its special instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2012)

The optimal tolerance of uniform observation error for mobile robot convergence. - Kenta Yamamoto; Taisuke Izumi; Yoshiaki Katayama; Nobuhiro Inuzuka; Koichi Wada 001 (Theor. Comput. Sci., 2012)

When Expanders Help Self-Healing Distributed R-Tree Overlays. - Taisuke Izumi; Maria Potop-Butucaru; Mathieu Valero (ISPDC, 2013)

Scalable Estimation of Network Average Degree. - Taisuke Izumi; Hironobu Kanzaki (SSS, 2013)

Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings. - Tomoko Izumi; Taisuke Izumi; Sayaka Kamei; Fukuhito Ooshita (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots. - Taisuke Izumi; Tomoko Izumi; Sayaka Kamei; Fukuhito Ooshita (IEEE Trans. Parallel Distributed Syst., 2013)

Investigating the Effectiveness of a Moving-Target Oriented Opportunistic Routing Algorithm on RoboCup Rescue Simulations. - Takuma Kawakami; Kyoichi Kisanuki; Toshiaki Ito; Kazunori Iwata 001; Nobuhiro Ito; Taisuke Izumi (IIAI-AAI, 2014)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Time Lower Bounds for Distributed Distance Oracles. - Taisuke Izumi; Roger Wattenhofer (OPODIS, 2014)

Randomized Lower Bound for Distributed Spanning-Tree Verification. - Taisuke Izumi (SIROCCO, 2014)

On the Worst-Case Initial Configuration for Conservative Connectivity Preservation. - Daichi Kaino; Taisuke Izumi (SRDS Workshops, 2014)

Bitwise MAP Algorithm for Group Testing based on Holographic Transformation. - Tadashi Wadayama; Taisuke Izumi (CoRR, 2014)

Space-efficient self-stabilizing counting population protocols on mobile sensor networks. - Tomoko Izumi; Keigo Kinpara; Taisuke Izumi; Koichi Wada 001 (Theor. Comput. Sci., 2014)

Listing Center Strings Under the Edit Distance Metric. - Hiromitsu Maji; Taisuke Izumi (COCOA, 2015)

Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. - Tadashi Wadayama; Taisuke Izumi; Hirotaka Ono 001 (ISIT, 2015)

On Space and Time Complexity of Loosely-Stabilizing Leader Election. - Taisuke Izumi (SIROCCO, 2015)

Filling Logarithmic Gaps in Distributed Complexity for Global Problems. - Hiroaki Ookawa; Taisuke Izumi (SOFSEM, 2015)

Improving Lower Bound on Opaque Set for Equilateral Triangle. - Taisuke Izumi (CoRR, 2015)

Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. - Tadashi Wadayama; Taisuke Izumi; Hirotaka Ono 001 (CoRR, 2015)

Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure. - Taisuke Izumi; Daisuke Suzuki (IEICE Trans. Inf. Syst., 2015)

Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2015)

Approximability of minimum certificate dispersal with tree structures. - Taisuke Izumi; Tomoko Izumi; Hirotaka Ono 001; Koichi Wada 001 (Theor. Comput. Sci., 2015)

Flocking with Oblivious Robots. - Davide Canepa; Xavier Défago; Taisuke Izumi; Maria Potop-Butucaru (SSS, 2016)

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. - Bernhard Haeupler; Taisuke Izumi; Goran Zuzic (DISC, 2016)

Improving the lower bound on opaque sets for equilateral triangle. - Taisuke Izumi (Discret. Appl. Math., 2016)

Bitwise MAP Estimation for Group Testing Based on Holographic Transformation. - Tadashi Wadayama; Taisuke Izumi; Kazushi Mimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (ICDCS, 2017)

Triangle Finding and Listing in CONGEST Networks. - Taisuke Izumi; François Le Gall (PODC, 2017)

Brief Announcement: Fast Aggregation in Population Protocols. - Ryota Eguchi; Taisuke Izumi (DISC, 2017)

Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. - Naoki Kitamura; Kazuki Kakizawa; Yuya Kawabata; Taisuke Izumi (PODC, 2018)

Bounds on the Asymptotic Rate for Capacitive Crosstalk Avoidance Codes for On-Chip Buses. - Tadashi Wadayama; Taisuke Izumi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

On time complexity for connectivity-preserving scattering of mobile robots. - Taisuke Izumi; Daichi Kaino; Maria Gradinariu Potop-Butucaru; Sébastien Tixeuil (Theor. Comput. Sci., 2018)

Towards Distributed Two-Stage Stochastic Optimization. - Yuval Emek; Noga Harlev; Taisuke Izumi (OPODIS, 2019)

Message Reduction in the LOCAL Model is a Free Lunch. - Shimon Bitton; Yuval Emek; Taisuke Izumi; Shay Kutten (PODC, 2019)

Distributed Minimum Degree Spanning Trees. - Michael Dinitz; Magnús M. Halldórsson; Taisuke Izumi; Calvin Newport (PODC, 2019)

Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. - Taisuke Izumi; François Le Gall (PODC, 2019)

Logarithmic Expected-Time Leader Election in Population Protocol Model. - Yuichi Sudo; Fukuhito Ooshita; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (PODC, 2019)

Sub-Linear Time Aggregation in Probabilistic Population Protocol Model. - Ryota Eguchi; Taisuke Izumi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Foreword. - Taisuke Izumi (IEICE Trans. Inf. Syst., 2019)

A Population Protocol for Uniform $k$-partition under Global Fairness. - Hiroto Yasumi; Naoki Kitamura; Fukuhito Ooshita; Taisuke Izumi; Michiko Inoue (Int. J. Netw. Comput., 2019)

Population protocols with faulty interactions: The impact of a leader. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (Theor. Comput. Sci., 2019)

Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. - Taisuke Izumi; Yota Otachi (ICALP, 2020)

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. - Taisuke Izumi; François Le Gall; Frédéric Magniez (STACS, 2020)

Fault-tolerant simulation of population protocols. - Giuseppe Antonio Di Luna; Paola Flocchini; Taisuke Izumi; Tomoko Izumi; Nicola Santoro; Giovanni Viglietta (Distributed Comput., 2020)

Uniform distribution for Pachinko. - Naoki Kitamura; Yuya Kawabata; Taisuke Izumi (Theor. Comput. Sci., 2020)

Time-Optimal Leader Election in Population Protocols. - Yuichi Sudo; Fukuhito Ooshita; Taisuke Izumi; Hirotsugu Kakugawa; Toshimitsu Masuzawa (IEEE Trans. Parallel Distributed Syst., 2020)

Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols. - Yuichi Sudo; Ryota Eguchi; Taisuke Izumi; Toshimitsu Masuzawa (DISC, 2021)

Fully Adaptive Self-Stabilizing Transformer for LCL Problems. - Shimon Bitton; Yuval Emek; Taisuke Izumi; Shay Kutten (CoRR, 2021)

Low-Congestion shortcuts without embedding. - Bernhard Haeupler; Taisuke Izumi; Goran Zuzic (Distributed Comput., 2021)

Low-congestion shortcut and graph parameters. - Naoki Kitamura; Hirotaka Kitagawa; Yota Otachi; Taisuke Izumi (Distributed Comput., 2021)

Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. - Taichi Inoue; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (OPODIS, 2022)

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. - Taisuke Izumi; Naoki Kitamura; Takamasa Naruse; Gregory Schwartzman (SPAA, 2022)

Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time. - Taisuke Izumi; Yuval Emek; Tadashi Wadayama; Toshimitsu Masuzawa (CoRR, 2022)

Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. - Taisuke Izumi; Kazuki Kakizawa; Yuya Kawabata; Naoki Kitamura; Toshimitsu Masuzawa (CoRR, 2022)

Fast Neighborhood Rendezvous. - Ryota Eguchi; Naoki Kitamura; Taisuke Izumi (IEICE Trans. Inf. Syst., 2022)

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. - Naoki Kitamura; Taisuke Izumi (IEICE Trans. Inf. Syst., 2022)

Loosely-stabilizing maximal independent set algorithms with unreliable communications. - Rongcheng Dong; Yuichi Sudo; Taisuke Izumi; Toshimitsu Masuzawa (Theor. Comput. Sci., 2022)

Power-Collision-Based 2-Shot Grant-Free NOMA with Cross-Slot SIC for mMTC. - Takeshi Hirai; Taisuke Izumi; Naoki Wakamiya (GLOBECOM, 2023)

Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. - Rongcheng Dong; Taisuke Izumi; Naoki Kitamura; Yuichi Sudo; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2023)

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. - Kaito Harada; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (ESA, 2024)

Self-Stabilizing Fully Adaptive Maximal Matching. - Shimon Bitton; Yuval Emek; Taisuke Izumi; Shay Kutten (OPODIS, 2024)

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. - Taisuke Izumi; Naoki Kitamura; Yutaro Yamaguchi 001 (SODA, 2024)

Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. - Kaito Harada; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (CoRR, 2024)

Independent Set Reconfiguration Under Bounded-Hop Token. - Hiroki Hatano; Naoki Kitamura; Taisuke Izumi; Takehiro Ito; Toshimitsu Masuzawa (CoRR, 2024)

Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. - Yuki Kawashima; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (SIROCCO, 2025)

Independent Set Reconfiguration Under Bounded-Hop Token Jumping. - Hiroki Hatano; Naoki Kitamura; Taisuke Izumi; Takehiro Ito; Toshimitsu Masuzawa (WALCOM, 2025)

Approximation hardness of domination problems on generalized convex graphs. - Po Yuan Wang; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (Theor. Comput. Sci., 2025)

Deterministic fault-tolerant connectivity labeling scheme. - Taisuke Izumi; Yuval Emek; Tadashi Wadayama; Toshimitsu Masuzawa (Distributed Comput., 2025)