default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaisuke Izumi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c75]Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. ESA 2024: 65:1-65:18- [c74]Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA 2024: 4062-4082 - [i31]Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. CoRR abs/2401.01103 (2024) - [i30]Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa:
Independent Set Reconfiguration Under Bounded-Hop Token. CoRR abs/2407.11768 (2024) - 2023
- [j41]Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa:
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. IEICE Trans. Inf. Syst. 106(11): 1762-1771 (2023) - [c73]Takeshi Hirai, Taisuke Izumi, Naoki Wakamiya:
Power-Collision-Based 2-Shot Grant-Free NOMA with Cross-Slot SIC for mMTC. GLOBECOM 2023: 6261-6266 - [c72]Taisuke Izumi
, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa:
Deterministic Fault-Tolerant Connectivity Labeling Scheme. PODC 2023: 190-199 - [i29]Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR abs/2311.04140 (2023) - 2022
- [j40]Ryota Eguchi, Naoki Kitamura, Taisuke Izumi:
Fast Neighborhood Rendezvous. IEICE Trans. Inf. Syst. 105-D(3): 597-610 (2022) - [j39]Naoki Kitamura, Taisuke Izumi:
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. IEICE Trans. Inf. Syst. 105-D(3): 634-645 (2022) - [j38]Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa:
Loosely-stabilizing maximal independent set algorithms with unreliable communications. Theor. Comput. Sci. 937: 69-84 (2022) - [c71]Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS 2022: 11:1-11:18 - [c70]Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA 2022: 11-22 - [i28]Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR abs/2205.14897 (2022) - [i27]Taisuke Izumi, Yuval Emek, Tadashi Wadayama, Toshimitsu Masuzawa:
Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time. CoRR abs/2208.11459 (2022) - [i26]Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa:
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. CoRR abs/2209.01906 (2022) - [i25]Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. CoRR abs/2211.00332 (2022) - 2021
- [j37]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion shortcuts without embedding. Distributed Comput. 34(1): 79-90 (2021) - [j36]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-congestion shortcut and graph parameters. Distributed Comput. 34(5): 349-365 (2021) - [c69]Rongcheng Dong, Yuichi Sudo, Taisuke Izumi, Toshimitsu Masuzawa:
Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications. SSS 2021: 335-349 - [c68]Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa:
Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols. DISC 2021: 40:1-40:17 - [i24]Naoki Kitamura, Taisuke Izumi:
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. CoRR abs/2104.12057 (2021) - [i23]Ryota Eguchi, Naoki Kitamura, Taisuke Izumi:
Fast Neighborhood Rendezvous. CoRR abs/2105.03638 (2021) - [i22]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Fully Adaptive Self-Stabilizing Transformer for LCL Problems. CoRR abs/2105.09756 (2021) - 2020
- [j35]Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta:
Fault-tolerant simulation of population protocols. Distributed Comput. 33(6): 561-578 (2020) - [j34]Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform distribution for Pachinko. Theor. Comput. Sci. 839: 103-121 (2020) - [j33]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Time-Optimal Leader Election in Population Protocols. IEEE Trans. Parallel Distributed Syst. 31(11): 2620-2632 (2020) - [c67]Taisuke Izumi, Yota Otachi:
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. ICALP 2020: 67:1-67:17 - [c66]Ryota Eguchi, Naoki Kitamura, Taisuke Izumi:
Fast Neighborhood Rendezvous. ICDCS 2020: 168-178 - [c65]Taisuke Izumi, François Le Gall, Frédéric Magniez:
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS 2020: 23:1-23:13 - [i21]Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa:
Time-optimal Loosely-stabilizing Leader Election in Population Protocols. CoRR abs/2005.09944 (2020)
2010 – 2019
- 2019
- [j32]Taisuke Izumi:
Foreword. IEICE Trans. Inf. Syst. 102-D(3): 415 (2019) - [j31]Ryota Eguchi, Taisuke Izumi:
Sub-Linear Time Aggregation in Probabilistic Population Protocol Model. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1187-1194 (2019) - [j30]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): 97-110 (2019) - [j29]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: 35-49 (2019) - [c64]Yuval Emek, Noga Harlev, Taisuke Izumi:
Towards Distributed Two-Stage Stochastic Optimization. OPODIS 2019: 32:1-32:16 - [c63]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Logarithmic Expected-Time Leader Election in Population Protocol Model. PODC 2019: 60-62 - [c62]Taisuke Izumi, François Le Gall:
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. PODC 2019: 84-93 - [c61]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the LOCAL Model is a Free Lunch. PODC 2019: 300-302 - [c60]Michael Dinitz, Magnús M. Halldórsson, Taisuke Izumi, Calvin Newport:
Distributed Minimum Degree Spanning Trees. PODC 2019: 511-520 - [c59]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Logarithmic Expected-Time Leader Election in Population Protocol Model. SSS 2019: 323-337 - [c58]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the LOCAL Model Is a Free Lunch. DISC 2019: 7:1-7:15 - [c57]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. DISC 2019: 25:1-25:17 - [i20]Taisuke Izumi, François Le Gall:
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. CoRR abs/1906.02456 (2019) - [i19]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. CoRR abs/1908.09473 (2019) - [i18]Taisuke Izumi, François Le Gall, Frédéric Magniez:
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. CoRR abs/1908.11488 (2019) - [i17]Shimon Bitton, Yuval Emek, Taisuke Izumi, Shay Kutten:
Message Reduction in the Local Model is a Free Lunch. CoRR abs/1909.08369 (2019) - 2018
- [j28]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. 101-A(12): 2018-2025 (2018) - [j27]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: 42-52 (2018) - [c56]Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform Distribution On Pachinko. FUN 2018: 26:1-26:14 - [c55]Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue:
A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops 2018: 813-819 - [c54]Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi:
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. PODC 2018: 241-243 - [e1]Taisuke Izumi, Petr Kuznetsov:
Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Tokyo, Japan, November 4-7, 2018, Proceedings. Lecture Notes in Computer Science 11201, Springer 2018, ISBN 978-3-030-03231-9 [contents] - [i16]Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Logarithmic Expected-Time Leader Election in Population Protocol Model. CoRR abs/1812.11309 (2018) - 2017
- [c53]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: 454-466 - [c52]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: 2472-2477 - [c51]Taisuke Izumi, François Le Gall:
Triangle Finding and Listing in CONGEST Networks. PODC 2017: 381-389 - [c50]Ryota Eguchi, Taisuke Izumi:
Brief Announcement: Fast Aggregation in Population Protocols. DISC 2017: 49:1-49:3 - [i15]Taisuke Izumi, François Le Gall:
Triangle Finding and Listing in CONGEST Networks. CoRR abs/1705.09061 (2017) - 2016
- [j26]Taisuke Izumi:
Improving the lower bound on opaque sets for equilateral triangle. Discret. Appl. Math. 213: 130-138 (2016) - [j25]Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura:
Bitwise MAP Estimation for Group Testing Based on Holographic Transformation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(12): 2147-2154 (2016) - [c49]Tadashi Wadayama, Taisuke Izumi:
Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses. ISIT 2016: 400-404 - [c48]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. PODC 2016: 451-460 - [c47]Davide Canepa, Xavier Défago, Taisuke Izumi, Maria Potop-Butucaru:
Flocking with Oblivious Robots. SSS 2016: 94-108 - [c46]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. DISC 2016: 158-172 - [i14]Tadashi Wadayama, Taisuke Izumi:
Bounds on Asymptotic Rate of Capacitive Crosstalk Avoidance Codes for On-chip Buses. CoRR abs/1601.06880 (2016) - [i13]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. CoRR abs/1607.07553 (2016) - [i12]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 abs/1610.09435 (2016) - [i11]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 abs/1611.06864 (2016) - 2015
- [j24]Taisuke Izumi, Daisuke Suzuki:
Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure. IEICE Trans. Inf. Syst. 98-D(3): 490-496 (2015) - [j23]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: 660-661 (2015) - [j22]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. 591: 5-14 (2015) - [c45]Hiromitsu Maji, Taisuke Izumi:
Listing Center Strings Under the Edit Distance Metric. COCOA 2015: 771-782 - [c44]Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono:
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT 2015: 1307-1311 - [c43]Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura:
Bitwise MAP estimation for group testing based on holographic transformation. ISIT 2015: 2787-2791 - [c42]Taisuke Izumi:
On Space and Time Complexity of Loosely-Stabilizing Leader Election. SIROCCO 2015: 299-312 - [c41]Hiroaki Ookawa, Taisuke Izumi:
Filling Logarithmic Gaps in Distributed Complexity for Global Problems. SOFSEM 2015: 377-388 - [i10]Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono:
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR abs/1501.04402 (2015) - [i9]Taisuke Izumi:
Improving Lower Bound on Opaque Set for Equilateral Triangle. CoRR abs/1509.03846 (2015) - 2014
- [j21]Tomoko Izumi, Keigo Kinpara, Taisuke Izumi, Koichi Wada:
Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theor. Comput. Sci. 552: 99-108 (2014) - [c40]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: 919-924 - [c39]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: 553-564 - [c38]Taisuke Izumi, Roger Wattenhofer:
Time Lower Bounds for Distributed Distance Oracles. OPODIS 2014: 60-75 - [c37]Taisuke Izumi:
Randomized Lower Bound for Distributed Spanning-Tree Verification. SIROCCO 2014: 137-148 - [c36]Daichi Kaino, Taisuke Izumi:
On the Worst-Case Initial Configuration for Conservative Connectivity Preservation. SRDS Workshops 2014: 60-63 - [i8]Tadashi Wadayama, Taisuke Izumi:
Bitwise MAP Algorithm for Group Testing based on Holographic Transformation. CoRR abs/1401.4251 (2014) - 2013
- [j20]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. 96-A(6): 1072-1080 (2013) - [j19]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): 716-723 (2013) - [c35]Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero:
When Expanders Help Self-Healing Distributed R-Tree Overlays. ISPDC 2013: 143-150 - [c34]Taisuke Izumi, Hironobu Kanzaki:
Scalable Estimation of Network Average Degree. SSS 2013: 367-369 - 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 Process. Lett. 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]Taisuke Izumi, Tadashi Wadayama:
A New Direction for Counting Perfect Matchings. FOCS 2012: 591-598 - [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 Process. Lett. 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
2000 – 2009
- 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 Trans. Inf. Syst. 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 Trans. Inf. Syst. 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 Trans. Inf. Syst. 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 Trans. Inf. Syst. 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 Distributed 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]Taisuke Izumi, Koichi Wada:
On the Probabilistic Omission Adversary. SSS 2007: 357-371 - [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]Taisuke Izumi, Toshimitsu Masuzawa:
One-Step Consensus Solvability. DISC 2006: 224-237 - 2005
- [j1]Taisuke Izumi, Toshimitsu Masuzawa:
Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults. IEICE Trans. Inf. Syst. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
