The following pages link to Toshimitsu Masuzawa (Q442275):
Displaying 36 items.
- Loosely-stabilizing leader election in a population protocol model (Q442276) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures (Q555315) (← links)
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images (Q673013) (← links)
- A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings (Q701145) (← links)
- A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems (Q845867) (← links)
- Adaptive timeliness of consensus in presence of crash and timing faults (Q883265) (← links)
- Partial gathering of mobile agents in asynchronous unidirectional rings (Q905844) (← links)
- Quiescence of self-stabilizing gossiping among mobile agents in graphs (Q962163) (← links)
- Timer-based composition of fault-containing self-stabilizing protocols (Q985053) (← links)
- An algorithm for finding the causal distributed breakpoint (Q1370846) (← links)
- A cost optimal parallel algorithm for weighted distance transforms. (Q1606863) (← links)
- Available stabilizing heaps (Q1607089) (← links)
- Move-optimal partial gathering of mobile agents in asynchronous trees (Q1680543) (← links)
- Constant-space self-stabilizing token distribution in trees (Q1713880) (← links)
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- Linear time and space gathering of anonymous mobile agents in asynchronous trees (Q1951563) (← links)
- A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets (Q2034405) (← links)
- Loosely-stabilizing maximal independent set algorithms with unreliable communications (Q2089676) (← 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)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← 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)
- Move-optimal gossiping among mobile agents (Q2481955) (← links)
- RELIABLE COMMUNICATION ON EMULATED CHANNELS RESILIENT TO TRANSIENT FAULTS (Q3173938) (← links)
- Loosely-Stabilizing Leader Election in Population Protocol Model (Q3408179) (← links)
- (Q5091108) (← links)
- (Q5091109) (← links)
- Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers (Q5363805) (← links)
- Maximum Matching for Anonymous Trees with Constant Space per Process (Q5363807) (← links)
- Tight bounds on distributed exploration of temporal graphs (Q5874255) (← links)
- Atomic cross-chain swaps with improved space, time and local time complexities (Q6044465) (← links)
- (Q6083413) (← links)
