Hirotsugu Kakugawa

Orcid: 0000-0003-1087-410X

According to our database1, Hirotsugu Kakugawa authored at least 112 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model.
Concurr. Comput. Pract. Exp., November, 2024

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

A self-stabilizing distributed algorithm for the bounded lattice domination problems under the distance-2 model.
Concurr. Comput. Pract. Exp., 2024

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots.
Proceedings of the Advanced Information Networking and Applications, 2024

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

2022
A self-stabilizing token circulation with graceful handover on bidirectional ring networks.
Int. J. Netw. Comput., 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

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

A linear-time self-stabilizing distributed algorithm for the minimal minus ($L, K, Z$) -domination problem under the distance-2 model.
Proceedings of the 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022, 2022

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

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

A self-stabilizing distributed algorithm for the local (1, |Ni|)-critical section problem.
Concurr. Comput. Pract. Exp., 2021

A self-stabilizing token circulation with graceful handover on bidirectional ring networks.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

A Distributed Multi-group Mutual Exclusion Algorithm for Intersection Traffic Control.
Proceedings of the Ninth International Symposium on Computing and Networking, 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

Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings.
Theor. Comput. Sci., 2020

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

Efficient Dispersion of Mobile Agents without Global Knowledge.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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

Asynchronous message-passing distributed algorithm for the global critical section problem.
Int. J. Netw. Comput., 2019

Partial Gathering of Mobile Agents in Arbitrary Networks.
IEICE Trans. Inf. Syst., 2019

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

Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity.
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

Logarithmic Expected-Time Leader Election in Population Protocol Model.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A Self-Stabilizing Algorithm for the Local (1, |Ni|)-Critical Section Problem with Safe Convergence.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2019

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

2018
Move-optimal partial gathering of mobile agents in asynchronous trees.
Theor. Comput. Sci., 2018

Uniform deployment of mobile agents in asynchronous rings.
J. Parallel Distributed Comput., 2018

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

A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence.
Proceedings of the 24th IEEE International Conference on Parallel and Distributed Systems, 2018

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

Self-Stabilizing Algorithm for Dynamically Maintaining Two Disjoint Dominating Sets.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

2017
An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem.
Algorithms, 2017

Brief Announcement: Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

An Asynchronous Message-Passing Distributed Algorithm for the Global Critical Section Problem.
Proceedings of the Fifth International Symposium on Computing and Networking, 2017

2016
Partial gathering of mobile agents in asynchronous unidirectional rings.
Theor. Comput. Sci., 2016

2015
Mutual inclusion in asynchronous message-passing distributed systems.
J. Parallel Distributed Comput., 2015

Self-stabilizing distributed algorithm for local mutual inclusion.
Inf. Process. Lett., 2015

On the family of critical section problems.
Inf. Process. Lett., 2015

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

Partial Gathering of Mobile Agents in Asynchronous Rings.
CoRR, 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
Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks.
IEEE Trans. Parallel Distributed Syst., 2014

Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator.
Parallel Process. Lett., 2014

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

2013
Linear time and space gathering of anonymous mobile agents in asynchronous trees.
Theor. Comput. Sci., 2013

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks.
J. Comb. Optim., 2013

Zigzag: Local-Information-Based Self-Optimizing Routing in Virtual Grid Networks.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

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

A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs.
Theor. Comput. Sci., 2012

Self-stabilising protocols on oriented chains with joins and leaves.
Int. J. Auton. Adapt. Commun. Syst., 2012

Implementation of a smart office system in an ambient environment.
Proceedings of the 2012 IEEE Virtual Reality, 2012

Owens Luis - A context-aware multi-modal smart office chair in an ambient environment.
Proceedings of the 2012 IEEE Virtual Reality, 2012

Communication-Efficient Self-stabilization in Wireless Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks.
Proceedings of the Structural Information and Communication Complexity, 2012

Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures.
Theor. Comput. Sci., 2011

Preface.
Int. J. Found. Comput. Sci., 2011

Self-Stabilization in Unstable Network Environments.
Proceedings of the Second International Conference on Networking and Computing, 2011

2010
Timer-based composition of fault-containing self-stabilizing protocols.
Inf. Sci., 2010

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set.
Int. J. Found. Comput. Sci., 2010

An ant colony optimization routing based on robustness for ad hoc networks with GPSs.
Ad Hoc Networks, 2010

Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees.
Proceedings of the Structural Information and Communication Complexity, 2010

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

A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property.
IEICE Trans. Inf. Syst., 2009

Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays.
IEICE Trans. Inf. Syst., 2009

A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination.
IEICE Trans. Inf. Syst., 2009

A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection.
IEICE Trans. Inf. Syst., 2009

Foreword.
IEICE Trans. Inf. Syst., 2009

A Biologically Inspired Self-Adaptation of Replica Density Control.
IEICE Trans. Inf. Syst., 2009

Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links.
Proceedings of the Stabilization, 2009

2008
A Token-Based Distributed Group Mutual Exclusion Algorithm with Quorums.
IEEE Trans. Parallel Distributed Syst., 2008

Move-optimal gossiping among mobile agents.
Theor. Comput. Sci., 2008

An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks.
IEICE Trans. Inf. Syst., 2008

Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links.
Proceedings of the Stabilization, 2008

Construction of Loosely-Structured Overlay Using Bloom Filter.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

A Robustness based Ant Colony Optimization Routing for Ad Hoc Networks with GPSs.
Proceedings of the 2008 International Conference on Wireless Networks, 2008

A stable clustering algorithm for mobile ad hoc networks based on attractor selection.
Proceedings of the 3rd International ICST Conference on Bio-Inspired Models of Network, 2008

2007
Optimal Moves for Gossiping Among Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2007

An adaptive randomized search protocol in peer-to-peer systems.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

2006
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks.
IEEE Trans. Parallel Distributed Syst., 2006

Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework.
Proceedings of the Stabilization, 2006

Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System.
Proceedings of the Stabilization, 2006

An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

A self-stabilizing minimal dominating set algorithm with safe convergence.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Bio-inspired Replica Density Control in Dynamic Networks.
Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2006

2005
A Self-Stabilizing Approximation Algorithm for the Distributed Minimum <i>k</i>-Domination.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings.
Proceedings of the Self-Stabilizing Systems, 2005

2004
A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem.
IEICE Trans. Inf. Syst., 2004

A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

A Learning System for the Problem of Mutual Exclusion in Multithreaded Programming.
Proceedings of the IEEE International Conference on Advanced Learning Technologies, 2004

2002
Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon.
J. Parallel Distributed Comput., 2002

A Self-Stabilizing Algorithm for the Steiner Tree Problem.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

A Self-Stabilizing Algorithm for Finding Cliques in Distributed Systems.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

1998
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States.
IEEE Trans. Parallel Distributed Syst., 1998

1997
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon.
IEEE Trans. Parallel Distributed Syst., 1997

Development of self-stabilizing distributed algorithms using transformation: case studies.
Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

1996
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Lock Based Self-Stabilizing Distributed Mutual Exclusion Algorithms.
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

1994
A Distributed k-Mutual Exclusion Algorithm Using k-Coterie.
Inf. Process. Lett., 1994

1993
Availability of k-Coterie.
IEEE Trans. Computers, 1993


  Loading...