The following pages link to Hirotsugu Kakugawa (Q418749):
Displaying 46 items.
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- Loosely-stabilizing leader election in a population protocol model (Q442276) (← links)
- On the family of critical section problems (Q458377) (← links)
- Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures (Q555315) (← links)
- Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon (Q701146) (← links)
- Partial gathering of mobile agents in asynchronous unidirectional rings (Q905844) (← links)
- Timer-based composition of fault-containing self-stabilizing protocols (Q985053) (← links)
- A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie (Q1318744) (← links)
- An asynchronous message-passing distributed algorithm for the generalized local critical section problem (Q1662701) (← links)
- Move-optimal partial gathering of mobile agents in asynchronous trees (Q1680543) (← links)
- Linear time and space gathering of anonymous mobile agents in asynchronous trees (Q1951563) (← links)
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings (Q2182313) (← links)
- Exploration of dynamic tori by multiple agents (Q2216438) (← links)
- Loosely-stabilizing leader election with polylogarithmic convergence time (Q2285158) (← links)
- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings (Q2303295) (← links)
- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault (Q2303305) (← links)
- Self-stabilizing distributed algorithm for local mutual inclusion (Q2345850) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- Move-optimal gossiping among mobile agents (Q2481955) (← links)
- Loosely-Stabilizing Leader Election in Population Protocol Model (Q3408179) (← links)
- Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator (Q3458203) (← links)
- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees (Q3569118) (← links)
- A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET (Q3569287) (← links)
- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks (Q3578305) (← links)
- Timer-Based Composition of Fault-Containing Self-stabilizing Protocols (Q3613469) (← links)
- (Q4548297) (← links)
- (Q4937175) (← links)
- (Q4937219) (← links)
- (Q4937220) (← links)
- How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults (Q5045445) (← links)
- (Q5091108) (← links)
- Logarithmic Expected-Time Leader Election in Population Protocol Model (Q5145180) (← links)
- Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings (Q5307041) (← links)
- Uniform Deployment of Mobile Agents in Asynchronous Rings (Q5361965) (← links)
- Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers (Q5363805) (← links)
- Optimal Moves for Gossiping Among Mobile Agents (Q5425967) (← links)
- Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees (Q5496168) (← links)
- Principles of Distributed Systems (Q5713670) (← links)
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings (Q5915923) (← links)
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings (Q5919349) (← links)
- Atomic cross-chain swaps with improved space, time and local time complexities (Q6044465) (← links)
- Self-stabilizing 2-minimal dominating set algorithms based on loop composition (Q6144026) (← links)
- Atomic cross-chain swaps with improved space and local time complexity (Q6536334) (← links)
- Logarithmic expected-time leader election in population protocol model (Q6536340) (← links)
- A self-stabilizing 1-maximal independent set algorithm (Q6536341) (← links)
- A timestamp based transformation of self-stabilizing programs for distributed computing environments (Q6570925) (← links)
