Yuichi Sudo

Orcid: 0000-0002-4442-1750

According to our database1, Yuichi Sudo authored at least 67 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Self-stabilizing 2-minimal dominating set algorithms based on loop composition.
Theor. Comput. Sci., February, 2024

2023
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set.
IEICE Trans. Inf. Syst., November, 2023

Atomic cross-chain swaps with improved space, time and local time complexities.
Inf. Comput., June, 2023

A Self-Stabilizing Distributed Algorithm for the Generalized Dominating Set Problem With Safe Convergence.
Comput. J., June, 2023

Near-linear Time Dispersion of Mobile Agents.
CoRR, 2023

Partial Gathering of Mobile Agents in Dynamic Tori.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

On Asynchrony, Memory, and Communication: Separations and Landscapes.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022
Loosely-stabilizing maximal independent set algorithms with unreliable communications.
Theor. Comput. Sci., 2022

Visibility-optimal gathering of seven autonomous mobile robots on triangular grids.
Int. J. Netw. Comput., 2022

Almost uniform deployment of mobile agents in dynamic rings.
Inf. Comput., 2022

Gathering Despite Defected View.
CoRR, 2022

Brief Announcement: Gathering Despite Defected View.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Gathering of Mobile Robots with Defected Views.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

A self-stabilizing 2-minimal dominating set algorithm based on loop composition in networks of girth at least 7.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

Implementation and Evaluation of Leader Election in the Population Protocol Model Using an Emulation Environment.
Proceedings of the IEEE Intl. Conf. on Dependable, 2022

2021
Self-Stabilizing Population Protocols With Global Knowledge.
IEEE Trans. Parallel Distributed Syst., 2021

A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets.
Theor. Comput. Sci., 2021

Exploration of dynamic tori by multiple agents.
Theor. Comput. Sci., 2021

A Self-stabilizing 1-maximal Independent Set Algorithm.
J. Inf. Process., 2021

Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Smoothed Analysis of Population Protocols.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Partial Gathering of Mobile Agents in Dynamic Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Gathering of seven autonomous mobile robots on triangular grids.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

2020
Time-Optimal Leader Election in Population Protocols.
IEEE Trans. Parallel Distributed Syst., 2020

Loosely-stabilizing leader election with polylogarithmic convergence time.
Theor. Comput. Sci., 2020

Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings.
Theor. Comput. Sci., 2020

Leader Election Requires Logarithmic Time in Population Protocols.
Parallel Process. Lett., 2020

Self-stabilizing token distribution on trees with constant space.
J. Parallel Distributed Comput., 2020

Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers.
IEICE Trans. Inf. Syst., 2020

Self-stabilizing Graph Exploration by a Single Agent.
CoRR, 2020

Dynamic Ring Exploration with (H, S) View.
Algorithms, 2020

Efficient Dispersion of Mobile Agents without Global Knowledge.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Uniform Deployment of Mobile Agents in Dynamic Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Self-Stabilizing Construction of a Minimal Weakly ST-Reachable Directed Acyclic Graph.
Proceedings of the International Symposium on Reliable Distributed Systems, 2020

The Power of Global Knowledge on Self-stabilizing Population Protocols.
Proceedings of the Structural Information and Communication Complexity, 2020

2019
Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model.
IEEE Trans. Parallel Distributed Syst., 2019

Energy Balancing by Wireless Energy Transfer in Sensor Networks.
Int. J. Netw. Comput., 2019

Atomic Cross-Chain Swaps with Improved Space and Time Complexity.
CoRR, 2019

Logarithmic Expected-Time Leader Election in Population Protocol Model.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Brief Announcement: Self-stabilizing Construction of a Minimal Weakly <i>ST</i>-Reachable Directed Acyclic Graph.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Improved-Zigzag: An Improved Local-Information-Based Self-optimizing Routing Algorithm in Virtual Grid Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Exploration of Dynamic Ring Networks by a Single Agent with the H-hops and S-time Steps View.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Partial Gathering of Mobile Agents Without Identifiers or Global Knowledge in Asynchronous Unidirectional Rings.
Proceedings of the Structural Information and Communication Complexity, 2019

A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault.
Proceedings of the Structural Information and Communication Complexity, 2019

A Population Protocol Model with Interaction Probability Considering Speeds of Agents.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

A Self-Stabilizing Algorithm for Constructing ST-Reachable Directed Acyclic Graph When lS| ≤ 2 and |T| ≤ 2.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

2018
Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees.
Parallel Process. Lett., 2018

Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Constant-Space Self-stabilizing Token Distribution in Trees.
Proceedings of the Structural Information and Communication Complexity, 2018

Self-Stabilizing Token Distribution with Constant-Space for Trees.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Group Exploration of Dynamic Tori.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

2017
Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

A Self-Stabilizing Minimal k-Grouping Algorithm.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016
The Same Speed Timer in Population Protocols.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015
Pseudo Polynomial Time Algorithms for Optimal Longcut Route Selection.
IEICE Trans. Inf. Syst., 2015

A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2014
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
Cost reduction evaluation of sharing backup servers in inter-cloud.
Proceedings of the 19th Asia-Pacific Conference on Communications, 2013

2012
Loosely-stabilizing leader election in a population protocol model.
Theor. Comput. Sci., 2012

2011
Advantages of Optimal Longcut Route for Wireless Mobile Users.
Proceedings of IEEE International Conference on Communications, 2011

2010
An agent exploration in unknown undirected graphs with whiteboards.
Proceedings of the Third International Workshop on Reliability, Availability, and Security, 2010


  Loading...