Toshimitsu Masuzawa

According to our database1, Toshimitsu Masuzawa authored at least 201 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

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

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

Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols.
CoRR, 2020

Efficient Dispersion of Mobile Agents without Global Knowledge.
CoRR, 2020

Communication Efficient Self-Stabilizing Leader Election (Full Version).
CoRR, 2020

Time-optimal Loosely-stabilizing Leader Election in Population Protocols.
CoRR, 2020

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

Communication Efficient Self-Stabilizing Leader Election.
Proceedings of the 34th International Symposium on Distributed Computing, 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

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

A Self-stabilizing 1-Maximal Independent Set Algorithm.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Logarithmic Expected-Time Leader Election in Population Protocol Model.
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

Tight Bounds on Distributed Exploration of Temporal Graphs.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Distributed Online Data Aggregation in Dynamic Graphs.
Proceedings of the Networked Systems - 7th International Conference, 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
Move-optimal partial gathering of mobile agents in asynchronous trees.
Theor. Comput. Sci., 2018

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

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

A Self-Stabilizing Algorithm for Constructing a Maximal (1, 1)-Directed Acyclic Mixed Graph.
Int. J. Netw. Comput., 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

A Cooperative Partial Snapshot Algorithm for Checkpoint-Rollback Recovery of Large-Scale and Dynamic Distributed Systems.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

A Self-Stabilizing Algorithm for Constructing a Maximal (2, 2)-Directed Acyclic Mixed Graph.
Proceedings of the Sixth International Symposium on Computing and Networking, 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

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

Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs.
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

A Self-Stabilizing Algorithm for Constructing (1, 1)-Maximal Directed Acyclic Graph.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

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

2016
Partial gathering of mobile agents in asynchronous unidirectional rings.
Theor. Comput. Sci., 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

A Distributed and Cooperative NameNode Cluster for a Highly-Available Hadoop Distributed File System.
IEICE Trans. Inf. Syst., 2015

Fast and compact self-stabilizing verification, computation, and fault detection of an MST.
Distributed Comput., 2015

Partial Gathering of Mobile Agents in Asynchronous Rings.
CoRR, 2015

Maximum Metric Spanning Tree Made Byzantine Tolerant.
Algorithmica, 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

Maximum Matching for Anonymous Trees with Constant Space per Process.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 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

Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing.
IEICE Trans. Inf. Syst., 2014

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance.
IEICE Trans. Inf. Syst., 2014

A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems.
IEICE Trans. Inf. Syst., 2014

Edge Coloring Despite Transient and Permanent Faults.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

A Distributed NameNode Cluster for a Highly-Available Hadoop Distributed File System.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems, 2014

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

A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees.
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

Transitive approach for topology control in Wireless Sensor Networks.
Proceedings of the 2013 9th International Wireless Communications and Mobile Computing Conference, 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
Bounding the Impact of Unbounded Attacks in Stabilization.
IEEE Trans. Parallel Distributed Syst., 2012

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

Self-stabilising protocols on oriented chains with joins and leaves.
Int. J. Auton. Adapt. Commun. Syst., 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

Reliable Communication on Emulated Channels Resilient to Transient Faults.
Int. J. Found. Comput. Sci., 2011

Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1
CoRR, 2011

Self-Stabilization, Byzantine Containment, and Maximizable Metrics: Necessary Conditions
CoRR, 2011

Silence Is Golden: Self-stabilizing Protocols Communication-Efficient after Convergence.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Brief Announcement: A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

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

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

2010
Quiescence of self-stabilizing gossiping among mobile agents in graphs.
Theor. Comput. Sci., 2010

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

Calibrating embedded protocols on asynchronous systems.
Inf. Sci., 2010

On Byzantine Containment Properties of the $min+1$ Protocol
CoRR, 2010

Self-stabilization with Byzantine tolerance for global tasks
CoRR, 2010

Construction auto-stabilisante d'arbre couvrant en dépit d'actions malicieuses
CoRR, 2010

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

The Impact of Topology on Byzantine Containment in Stabilization.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Adaptive Containment of Time-Bounded Byzantine Faults.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

On Byzantine Containment Properties of the <i>min</i> + 1 Protocol.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 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

Stabilizing Locally Maximizable Tasks in Unidirectional Networks Is Hard.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2009
On bootstrapping topology knowledge in anonymous networks.
ACM Trans. Auton. Adapt. Syst., 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

Self-Stabilization in Dynamic Networks.
IEICE Trans. Inf. Syst., 2009

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

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard
CoRR, 2009

Preserving the Fault-Containment of Ring Protocols Executed on Trees.
Comput. J., 2009

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

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Communication Efficiency in Self-Stabilizing Silent Protocols.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 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

Calibrating an Embedded Protocol on an Asynchronous System.
Proceedings of the Intelligent Distributed Computing, Systems and Applications, Proceedings of the 2nd International Symposium on Intelligent Distributed Computing, 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
Adaptive timeliness of consensus in presence of crash and timing faults.
J. Parallel Distributed Comput., 2007

Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model.
IEICE Trans. Inf. Syst., 2007

Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model.
IEICE Trans. Inf. Syst., 2007

Output Stability Versus Time Till Output.
Proceedings of the Distributed Computing, 21st International Symposium, 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
Condition Adaptation in Synchronous Consensus.
IEEE Trans. Computers, 2006

A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults.
J. Aerosp. Comput. Inf. Commun., 2006

Linear-State-Transition Protocols: Asynchronous Protocols with Ease of Efficiency Evaluation.
J. Aerosp. Comput. Inf. Commun., 2006

A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems.
Inf. Process. Lett., 2006

One-Step Consensus Solvability.
Proceedings of the Distributed Computing, 20th International Symposium, 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

Bounding the Impact of Unbounded Attacks in Stabilization.
Proceedings of the Stabilization, 2006

Scheduling Independent Tasks on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 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

An Interest-Based Peer Clustering Algorithm Using Ant Paradigm.
Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2006

2005
Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults.
IEICE Trans. Inf. Syst., 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

An Improved Algorithm for Adaptive Condition-Based Consensus.
Proceedings of the Structural Information and Communication Complexity, 2005

A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach.
Proceedings of the Second International Conference on Autonomic Computing (ICAC 2005), 2005

Biologically Inspired Self-Adaptation of Mobile Agent Population.
Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA 2005), 2005

2004
Scheduling for broadcast operation in heterogeneous parallel computing environments.
Systems and Computers in Japan, 2004

Self-Stabilizing Agent Traversal on Tree Networks.
IEICE Trans. Inf. Syst., 2004

Synchronous Condition-Based Consensus Adapting to Input-Vector Legality.
Proceedings of the Distributed Computing, 18th International Conference, 2004

A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Timed Uniform Consensus Resilient to Crash and Timing Faults.
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

Ant-Based Approach to Mobile Agent Traversal.
Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2004

2003
A Method for Evaluating Efficiency of Protocols on the Asynchronous Shared-State Model.
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

2002
A nonscan DFT method for controllers to provide complete fault efficiency.
Systems and Computers in Japan, 2002

Parallel algorithms for selection on the BSP and BSP* models.
Systems and Computers in Japan, 2002

A layout adjustment problem for disjoint rectangles preserving orthogonal order.
Systems and Computers in Japan, 2002

A Latency Optimal Superstabilizing Mutual Exclusion Protocol in Unidirectional Rings.
J. Parallel Distributed Comput., 2002

A Self-Stabilizing Protocol for Pipelined PIF in Tree Networks.
Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002

Efficient Gather Operation in Heterogeneous Cluster Systems.
Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002

2001
A causal broadcast protocol for distributed mobile systems.
Systems and Computers in Japan, 2001

Available stabilizing heaps.
Inf. Process. Lett., 2001

Self-Stabilizing Agent Traversal.
Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

Adaptive Long-Lived O(k<sup>2</sup>)-Renaming with O(k<sup>2</sup>) Steps.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Stabilizing Replicated Search Trees.
Proceedings of the Distributed Computing, 15th International Conference, 2001

A Stabilizing Search Tree with Availability Properties.
Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems, 2001

BIST Method Based on Concurrent Single-Control Testability of RTL Data Paths.
Proceedings of the 10th Asian Test Symposium (ATS 2001), 19-21 November 2001, Kyoto, Japan, 2001

2000
A Non-Scan Approach to DFT for Controllers Achieving 100% Fault Efficiency.
J. Electron. Test., 2000

Available and Stabilizing 2-3 Trees
CoRR, 2000

Design for Strong Testability of RTL Data Paths to Provide Complete Fault Efficiency.
Proceedings of the 13th International Conference on VLSI Design (VLSI Design 2000), 2000

Parallelizability of Some P-Complete Problems.
Proceedings of the Parallel and Distributed Processing, 2000

Single-control testability of RTL data paths for BIST.
Proceedings of the 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, 2000

Strong self-testability for data paths high-level synthesis.
Proceedings of the 9th Asian Test Symposium (ATS 2000), 4-6 December 2000, Taipei, Taiwan, 2000

A non-scan DFT method at register-transfer level to achieve complete fault efficiency.
Proceedings of ASP-DAC 2000, 2000

1999
A cost optimal parallel algorithm for weighted distance transforms.
Parallel Comput., 1999

An Efficient Distributed Algorithm for the Biconnected-components Updating Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Parallel Algorithms for All Nearest Neighbors of Binary Images on the BSP Model.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Parallel Selection Algorithms with Analysis on Clusters.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1998
On the synthesis of synchronizable finite state machines with partial scan.
Systems and Computers in Japan, 1998

SelfStabilizing WaitFree Clock Synchronization with Bounded Space.
Proceedings of the Distributed Computing, 1998

A Non-Scan DFT Method for Controllers to Achieve Complete Fault Efficiency.
Proceedings of the 7th Asian Test Symposium (ATS '98), 2-4 December 1998, Singapore, 1998

A High-Level Synthesis Method for Weakly Testable Data Paths.
Proceedings of the 7th Asian Test Symposium (ATS '98), 2-4 December 1998, Singapore, 1998

1997
Fault-tolerant distributed algorithms for autonomous mobile robots with crash faults.
Systems and Computers in Japan, 1997

Non-scan design for testable data paths using thru operation.
Systems and Computers in Japan, 1997

Parallel algorithms for connected-component problems of gray-scale images.
Systems and Computers in Japan, 1997

An Algorithm for Finding the Causal Distributed Breakpoint.
J. Parallel Distributed Comput., 1997

A latency-optimal superstabilizing mutual exclusion protocol.
Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

A Parallel Algorithm for Weighted Distance Transforms.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996
Self-stabilizing ring orientation algorithm under the C-Daemon.
Systems and Computers in Japan, 1996

A Snapshot Algorithm for Distributed Mobile Systems.
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

An Approach To The Synthesis Of Synchronizable Finite State Machines With Partial Scan.
Proceedings of the 5th Asian Test Symposium (ATS '96), 1996

1995
An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images.
Inf. Process. Lett., 1995

1994
A distributed shortest-paths algorithm with distance-dependent message complexities.
Systems and Computers in Japan, 1994

1993
An optimal parallel algorithm for finding shortest paths inside simple polygons.
Systems and Computers in Japan, 1993

1992
Efficient distributed algorithm to solve updating minimum spanning tree problem.
Systems and Computers in Japan, 1992

Simple parallel algorithms to compute interval maxima.
Systems and Computers in Japan, 1992

Methods for realizing a priority bus system.
Systems and Computers in Japan, 1992

1991
Efficient distributed algorithms solving problems about the connectivity of network.
Systems and Computers in Japan, 1991

A fault-tolerant algorithm for election in complete networks with a sense of direction.
Systems and Computers in Japan, 1991

1990
Distributed Algorithms for Reconstructing MST after Topology Change.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989
An efficient distributed algorithm for constructing a breadth-first search tree.
Systems and Computers in Japan, 1989

Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction.
Proceedings of the Distributed Algorithms, 1989

1988
Distributed algorithms for fault diagnosis of processors.
Systems and Computers in Japan, 1988

1987
Distributed algorithms tolerant of link failures.
Systems and Computers in Japan, 1987

An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees.
Discret. Appl. Math., 1987

1986
Optimal-Time Algorithm for the k-Node-Connectivity Augmentation Problem for Ternary Trees.
Systems and Computers in Japan, 1986

1985
Vulnerability of a communication network with a satellite.
Systems and Computers in Japan, 1985


  Loading...