( en | de | ru )

 

Disambiguation of "Izumi, Taisuke"

Author of the publication

copydeleteadd this publication to your clipboard
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage.

, , , and . PODC, page 241-243. ACM, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Izumi Kazuhara

Bogumi Izumi

 

Other publications of authors with the same name

Brief Announcement: Fast Aggregation in Population Protocols., and . DISC, volume 91 of LIPIcs, page 49:1-49:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults., and . IEICE Trans. Inf. Syst., 88-D (1): 72-81 (2005)Bounds on the Asymptotic Rate for Capacitive Crosstalk Avoidance Codes for On-Chip Buses., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 101-A (12): 2018-2025 (2018)On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols, , , , , and . Theoretical Computer Science, (2019)Triangle Finding and Listing in CONGEST Networks., and . PODC, page 381-389. ACM, (2017)Time-optimal Loosely-stabilizing Leader Election in Population Protocols., , , and . CoRR, (2020)Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model., and . PODC, page 84-93. ACM, (2019)Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses., and . ISIT, page 400-404. IEEE, (2016)A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching., , and . CoRR, (2023)Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots., , , and . IEEE Trans. Parallel Distributed Syst., 24 (4): 716-723 (2013)