Taisuke Izumi

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 77

Top Venues

CoRR

PODC

Theor. Comput. Sci.

IEICE Trans. Inf. Syst.

Publications

Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA (2024)
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
Independent Set Reconfiguration Under Bounded-Hop Token. CoRR (2024)
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. CoRR (2024)
Takeshi Hirai, Taisuke Izumi, Naoki Wakamiya
Power-Collision-Based 2-Shot Grant-Free NOMA with Cross-Slot SIC for mMTC. GLOBECOM (2023)
Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR (2023)
Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
Deterministic Fault-Tolerant Connectivity Labeling Scheme. PODC (2023)
Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. IEICE Trans. Inf. Syst. 106 (11) (2023)
Naoki Kitamura, Taisuke Izumi
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. IEICE Trans. Inf. Syst. (3) (2022)
Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. CoRR (2022)
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS (2022)
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Computational Power of A Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. CoRR (2022)
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR (2022)
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA (2022)
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
Fast Neighborhood Rendezvous. IEICE Trans. Inf. Syst. (3) (2022)
Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa
Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time. CoRR (2022)
Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa
Loosely-stabilizing maximal independent set algorithms with unreliable communications. Theor. Comput. Sci. 937 (2022)
Naoki Kitamura, Taisuke Izumi
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. CoRR (2021)
Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa
Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications. SSS (2021)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Fully Adaptive Self-Stabilizing Transformer for LCL Problems. CoRR (2021)
Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa
Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols. DISC (2021)
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Low-congestion shortcut and graph parameters. Distributed Comput. 34 (5) (2021)
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
Low-Congestion shortcuts without embedding. Distributed Comput. 34 (1) (2021)
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
Fast Neighborhood Rendezvous. CoRR (2021)
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
Fast Neighborhood Rendezvous. ICDCS (2020)
Taisuke Izumi, Yota Otachi
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. ICALP (2020)
Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
Time-Optimal Leader Election in Population Protocols. IEEE Trans. Parallel Distributed Syst. 31 (11) (2020)
Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa
Time-optimal Loosely-stabilizing Leader Election in Population Protocols. CoRR (2020)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Fault-tolerant simulation of population protocols. Distributed Comput. 33 (6) (2020)
Taisuke Izumi, François Le Gall, Frédéric Magniez
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS (2020)
Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
Uniform distribution for Pachinko. Theor. Comput. Sci. 839 (2020)
Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport
Distributed Minimum Degree Spanning Trees. PODC (2019)
Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
Logarithmic Expected-Time Leader Election in Population Protocol Model. PODC (2019)
Taisuke Izumi, François Le Gall, Frédéric Magniez
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. CoRR (2019)
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Low-Congestion Shortcut and Graph Parameters. CoRR (2019)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Population protocols with faulty interactions: The impact of a leader. Theor. Comput. Sci. 754 (2019)
Yuval Emek, Noga Harlev, Taisuke Izumi
Towards Distributed Two-Stage Stochastic Optimization. OPODIS (2019)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Message Reduction in the LOCAL Model is a Free Lunch. PODC (2019)
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Low-Congestion Shortcut and Graph Parameters. DISC (2019)
Taisuke Izumi
Foreword. IEICE Trans. Inf. Syst. (3) (2019)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Message Reduction in the Local Model is a Free Lunch. CoRR (2019)
Taisuke Izumi, François Le Gall
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. PODC (2019)
Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
Logarithmic Expected-Time Leader Election in Population Protocol Model. SSS (2019)
Taisuke Izumi, François Le Gall
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. CoRR (2019)
Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten
Message Reduction in the LOCAL Model Is a Free Lunch. DISC (2019)
Ryota Eguchi, Taisuke Izumi
Sub-Linear Time Aggregation in Probabilistic Population Protocol Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. 9 (1) (2019)
Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. PODC (2018)
Taisuke Izumi, Daichi Kaino, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
On time complexity for connectivity-preserving scattering of mobile robots. Theor. Comput. Sci. 738 (2018)
Tadashi Wadayama, Taisuke Izumi
Bounds on the Asymptotic Rate for Capacitive Crosstalk Avoidance Codes for On-Chip Buses. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2018)
Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa
Logarithmic Expected-Time Leader Election in Population Protocol Model. CoRR (2018)
Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops (2018)
Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
Uniform Distribution On Pachinko. FUN (2018)
Taisuke Izumi, François Le Gall
Triangle Finding and Listing in CONGEST Networks. CoRR (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Population Protocols with Faulty Interactions: The Impact of a Leader. CIAC (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. ICDCS (2017)
Taisuke Izumi, François Le Gall
Triangle Finding and Listing in CONGEST Networks. PODC (2017)
Ryota Eguchi, Taisuke Izumi
Brief Announcement: Fast Aggregation in Population Protocols. DISC (2017)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
Population Protocols with Faulty Interactions: the Impact of a Leader. CoRR (2016)
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols. CoRR (2016)
Tadashi Wadayama, Taisuke Izumi
Bounds on Asymptotic Rate of Capacitive Crosstalk Avoidance Codes for On-chip Buses. CoRR (2016)
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
Low-Congestion Shortcuts without Embedding. PODC (2016)
Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura
Bitwise MAP Estimation for Group Testing Based on Holographic Transformation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2016)
Tadashi Wadayama, Taisuke Izumi
Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses. ISIT (2016)
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
Low-Congestion Shortcuts without Embedding. CoRR (2016)
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. DISC (2016)
Taisuke Izumi
Improving the lower bound on opaque sets for equilateral triangle. Discret. Appl. Math. 213 (2016)
Davide Canepa, Xavier Défago, Taisuke Izumi, Maria Potop-Butucaru
Flocking with Oblivious Robots. SSS (2016)
Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura
Bitwise MAP estimation for group testing based on holographic transformation. ISIT (2015)
Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT (2015)
Taisuke Izumi, Daisuke Suzuki
Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure. IEICE Trans. Inf. Syst. (3) (2015)
Hiroaki Ookawa, Taisuke Izumi
Filling Logarithmic Gaps in Distributed Complexity for Global Problems. SOFSEM (2015)
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
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. 562 (2015)
Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR (2015)
Taisuke Izumi
Improving Lower Bound on Opaque Set for Equilateral Triangle. CoRR (2015)
Hiromitsu Maji, Taisuke Izumi
Listing Center Strings Under the Edit Distance Metric. COCOA (2015)
Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. 591 (2015)
Taisuke Izumi
On Space and Time Complexity of Loosely-Stabilizing Leader Election. SIROCCO (2015)
Taisuke Izumi
Randomized Lower Bound for Distributed Spanning-Tree Verification. SIROCCO (2014)
Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara
Depth-First Search Using O(n) Bits. ISAAC (2014)
Takuma Kawakami, Kyoichi Kisanuki, Toshiaki Ito, Kazunori Iwata, Nobuhiro Ito, Taisuke Izumi
Investigating the Effectiveness of a Moving-Target Oriented Opportunistic Routing Algorithm on RoboCup Rescue Simulations. IIAI-AAI (2014)
Tadashi Wadayama, Taisuke Izumi
Bitwise MAP Algorithm for Group Testing based on Holographic Transformation. CoRR (2014)
Daichi Kaino, Taisuke Izumi
On the Worst-Case Initial Configuration for Conservative Connectivity Preservation. SRDS Workshops (2014)
Taisuke Izumi, Roger Wattenhofer
Time Lower Bounds for Distributed Distance Oracles. OPODIS (2014)
Tomoko Izumi, Keigo Kinpara, Taisuke Izumi, Koichi Wada
Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theor. Comput. Sci. 552 (2014)
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero
When Expanders Help Self-Healing Distributed R-Tree Overlays. ISPDC (2013)
Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots. IEEE Trans. Parallel Distributed Syst. 24 (4) (2013)
Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, Fukuhito Ooshita
Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2013)
Taisuke Izumi, Hironobu Kanzaki
Scalable Estimation of Network Average Degree. SSS (2013)
Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi
The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling. Parallel Process. Lett. 22 (2) (2012)
Taisuke Izumi, Tadashi Wadayama
A New Direction for Counting Perfect Matchings CoRR (2012)
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 (2012)
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 (2012)
Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
Minimum Certificate Dispersal with Tree Structures. TAMC (2012)
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) (2012)
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) (2012)
Taisuke Izumi, Tadashi Wadayama
A New Direction for Counting Perfect Matchings. FOCS (2012)
Samia Souissi, Taisuke Izumi, Koichi Wada
Oracle-based flocking of mobile robots in crash-recovery model. Theor. Comput. Sci. 412 (33) (2011)
Samia Souissi, Taisuke Izumi, Koichi Wada
Distributed Algorithms for Cooperative Mobile Robots: A Survey. ICNC (2011)
Nazreen Banu, Taisuke Izumi, Koichi Wada
Adaptive and doubly-Expedited One-Step Consensus in Byzantine Asynchronous Systems. Parallel Process. Lett. 21 (4) (2011)
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero
Physical expander in Virtual Tree Overlay CoRR (2011)

Taisuke Izumi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Taisuke Izumi