Toshimitsu Masuzawa

Concurr. Comput. Pract. Exp., 2021

A self-stabilizing algorithm for constructing a maximal (σ, τ)-directed acyclic mixed graph.

[BibT_eX]

[DOI]

Yonghwan Kim

Yoshiaki Katayama

Concurr. Comput. Pract. Exp., 2021

Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

A New Problem Setting for Mobile Robots Based on Backscatter-Based Communication and Sensing.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

2020

Time-Optimal Leader Election in Population Protocols.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2020

Loosely-stabilizing leader election with polylogarithmic convergence time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings.

[BibT_eX]

[DOI]

Masahiro Shibata

Theor. Comput. Sci., 2020

Leader Election Requires Logarithmic Time in Population Protocols.

[BibT_eX]

[DOI]

Yuichi Sudo

Parallel Process. Lett., 2020

Self-stabilizing token distribution on trees with constant space.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2020

Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Dynamic Ring Exploration with (H, S) View.

[BibT_eX]

[DOI]

Algorithms, 2020

Communication Efficient Self-Stabilizing Leader Election.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Efficient Dispersion of Mobile Agents without Global Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

The Power of Global Knowledge on Self-stabilizing Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

2019

Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2019

Energy Balancing by Wireless Energy Transfer in Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2019

Partial Gathering of Mobile Agents in Arbitrary Networks.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Logarithmic Expected-Time Leader Election in Population Protocol Model.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Tight Bounds on Distributed Exploration of Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Distributed Online Data Aggregation in Dynamic Graphs.

[BibT_eX]

[DOI]

Quentin Bramas

Proceedings of the Networked Systems - 7th International Conference, 2019

A Population Protocol Model with Interaction Probability Considering Speeds of Agents.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

2018

Move-optimal partial gathering of mobile agents in asynchronous trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2018

Uniform deployment of mobile agents in asynchronous rings.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2018

A Self-Stabilizing Algorithm for Constructing a Maximal (1, 1)-Directed Acyclic Mixed Graph.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2018

Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Constant-Space Self-stabilizing Token Distribution in Trees.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Self-Stabilizing Token Distribution with Constant-Space for Trees.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Group Exploration of Dynamic Tori.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Brief Announcement: Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings.

[BibT_eX]

[DOI]

Masahiro Shibata

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs.

[BibT_eX]

[DOI]

Ajoy K. Datta

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Brief Announcement: A Self-stabilizing Algorithm for the Minimal Generalized Dominating Set Problem.

[BibT_eX]

[DOI]

Hisaki Kobayashi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

A Self-Stabilizing Algorithm for Constructing (1, 1)-Maximal Directed Acyclic Graph.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

A Self-Stabilizing Minimal k-Grouping Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016

Partial gathering of mobile agents in asynchronous unidirectional rings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

The Same Speed Timer in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015

Pseudo Polynomial Time Algorithms for Optimal Longcut Route Selection.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2015

A Single Agent Exploration in Unknown Undirected Graphs with Whiteboards.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

A Distributed and Cooperative NameNode Cluster for a Highly-Available Hadoop Distributed File System.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2015

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

[BibT_eX]

[DOI]

Amos Korman

Shay Kutten

Distributed Comput., 2015

Partial Gathering of Mobile Agents in Asynchronous Rings.

[BibT_eX]

[DOI]

CoRR, 2015

Maximum Metric Spanning Tree Made Byzantine Tolerant.

[BibT_eX]

[DOI]

Algorithmica, 2015

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Maximum Matching for Anonymous Trees with Constant Space per Process.

[BibT_eX]

[DOI]

Ajoy Kumar Datta

Lawrence L. Larmore

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks.

[BibT_eX]

[DOI]

Ajoy Kumar Datta

Lawrence L. Larmore

Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2014

Randomized Gathering of Mobile Agents in Anonymous Unidirectional Ring Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2014

Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2014

Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

A Concurrent Partial Snapshot Algorithm for Large-Scale and Dynamic Distributed Systems.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2014

Edge Coloring Despite Transient and Permanent Faults.

[BibT_eX]

[DOI]

Alexandre Maurer

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

A Distributed NameNode Cluster for a Highly-Available Hadoop Distributed File System.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems, 2014

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees.

[BibT_eX]

[DOI]

Ajoy Kumar Datta

Lawrence L. Larmore

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Linear time and space gathering of anonymous mobile agents in asynchronous trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Transitive approach for topology control in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 2013 9th International Wireless Communications and Mobile Computing Conference, 2013

Zigzag: Local-Information-Based Self-Optimizing Routing in Virtual Grid Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012

Bounding the Impact of Unbounded Attacks in Stabilization.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2012

Loosely-stabilizing leader election in a population protocol model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Self-stabilising protocols on oriented chains with joins and leaves.

[BibT_eX]

[DOI]

Int. J. Auton. Adapt. Commun. Syst., 2012

Communication-Efficient Self-stabilization in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2012

Algorithms for Partial Gathering of Mobile Agents in Asynchronous Rings.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Reliable Communication on Emulated Channels Resilient to Transient Faults.

[BibT_eX]

[DOI]

Yukiko Yamauchi

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

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

[BibT_eX]

[DOI]

CoRR, 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

Silence Is Golden: Self-stabilizing Protocols Communication-Efficient after Convergence.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Advantages of Optimal Longcut Route for Wireless Mobile Users.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2011

Self-Stabilization in Unstable Network Environments.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Networking and Computing, 2011

2010

Quiescence of self-stabilizing gossiping among mobile agents in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Timer-based composition of fault-containing self-stabilizing protocols.

[BibT_eX]

[DOI]

Inf. Sci., 2010

Calibrating embedded protocols on asynchronous systems.

[BibT_eX]

[DOI]

Inf. Sci., 2010

On Byzantine Containment Properties of the $min+1$ Protocol

[BibT_eX]

[DOI]

CoRR, 2010

Self-stabilization with Byzantine tolerance for global tasks

[BibT_eX]

[DOI]

CoRR, 2010

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

[BibT_eX]

[DOI]

CoRR, 2010

An ant colony optimization routing based on robustness for ad hoc networks with GPSs.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2010

The Impact of Topology on Byzantine Containment in Stabilization.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Adaptive Containment of Time-Bounded Byzantine Faults.

[BibT_eX]

[DOI]

Yukiko Yamauchi

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

On Byzantine Containment Properties of the min + 1 Protocol.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2010

An agent exploration in unknown undirected graphs with whiteboards.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Reliability, Availability, and Security, 2010

Stabilizing Locally Maximizable Tasks in Unidirectional Networks Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

2009

On bootstrapping topology knowledge in anonymous networks.

[BibT_eX]

[DOI]

ACM Trans. Auton. Adapt. Syst., 2009

Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Self-Stabilization in Dynamic Networks.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

A Biologically Inspired Self-Adaptation of Replica Density Control.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2009

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard

[BibT_eX]

[DOI]

CoRR, 2009

Preserving the Fault-Containment of Ring Protocols Executed on Trees.

[BibT_eX]

[DOI]

Yukiko Yamauchi

Comput. J., 2009

Cached Sensornet Transformation of Non-silent Self-stabilizing Algorithms with Unreliable Links.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Communication Efficiency in Self-Stabilizing Silent Protocols.

[BibT_eX]

[DOI]

Stéphane Devismes

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.

[BibT_eX]

[DOI]

Sayaka Kamei

IEEE Trans. Parallel Distributed Syst., 2008

Move-optimal gossiping among mobile agents.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2008

Convergence Time Analysis of Self-stabilizing Algorithms in Wireless Sensor Networks with Unreliable Links.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2008

Construction of Loosely-Structured Overlay Using Bloom Filter.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

Calibrating an Embedded Protocol on an Asynchronous System.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Proceedings of the 2008 International Conference on Wireless Networks, 2008

A stable clustering algorithm for mobile ad hoc networks based on attractor selection.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Akinori Saitoh

J. Parallel Distributed Comput., 2007

Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2007

Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2007

Output Stability Versus Time Till Output.

[BibT_eX]

[DOI]

Shay Kutten

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Optimal Moves for Gossiping Among Mobile Agents.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2007

An adaptive randomized search protocol in peer-to-peer systems.

[BibT_eX]

[DOI]

Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007

2006

Condition Adaptation in Synchronous Consensus.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2006

A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults.

[BibT_eX]

[DOI]

Yusuke Sakurai

J. Aerosp. Comput. Inf. Commun., 2006

Linear-State-Transition Protocols: Asynchronous Protocols with Ease of Efficiency Evaluation.

[BibT_eX]

[DOI]

J. Aerosp. Comput. Inf. Commun., 2006

A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

One-Step Consensus Solvability.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Composition of Fault-Containing Protocols Based on Recovery Waiting Fault-Containing Composition Framework.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2006

Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2006

Bounding the Impact of Unbounded Attacks in Stabilization.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2006

Scheduling Independent Tasks on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

A self-stabilizing minimal dominating set algorithm with safe convergence.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Bio-inspired Replica Density Control in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2006

An Interest-Based Peer Clustering Algorithm Using Ant Paradigm.

[BibT_eX]

[DOI]

Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2006

2005

Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2005

Self-stabilization in Spite of Frequent Changes of Networks: Case Study of Mutual Exclusion on Dynamic Rings.

[BibT_eX]

[DOI]

Proceedings of the Self-Stabilizing Systems, 2005

An Improved Algorithm for Adaptive Condition-Based Consensus.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Autonomic Computing (ICAC 2005), 2005

Biologically Inspired Self-Adaptation of Mobile Agent Population.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2004

Self-Stabilizing Agent Traversal on Tree Networks.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2004

Synchronous Condition-Based Consensus Adapting to Input-Vector Legality.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

A Self-stabilizing Link-Coloring Protocol Resilient to Byzantine Faults in Tree Networks.

[BibT_eX]

[DOI]

Yusuke Sakurai

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Timed Uniform Consensus Resilient to Crash and Timing Faults.

[BibT_eX]

[DOI]

Akinori Saitoh

Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

Ant-Based Approach to Mobile Agent Traversal.

[BibT_eX]

[DOI]

Proceedings of the Biologically Inspired Approaches to Advanced Information Technology, 2004

2003

Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

A Method for Evaluating Efficiency of Protocols on the Asynchronous Shared-State Model.

[BibT_eX]

[DOI]

Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

2002

A nonscan DFT method for controllers to provide complete fault efficiency.

[BibT_eX]

[DOI]

Satoshi Ohtake

Syst. Comput. Jpn., 2002

Parallel algorithms for selection on the BSP and BSP* models.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2002

A layout adjustment problem for disjoint rectangles preserving orthogonal order.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2002

A Latency Optimal Superstabilizing Mutual Exclusion Protocol in Unidirectional Rings.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2002

A Self-Stabilizing Protocol for Pipelined PIF in Tree Networks.

[BibT_eX]

[DOI]

Daisuke Kondou

Hideo Masuda

Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002

Efficient Gather Operation in Heterogeneous Cluster Systems.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002

2001

A causal broadcast protocol for distributed mobile systems.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 2001

Available stabilizing heaps.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Self-Stabilizing Agent Traversal.

[BibT_eX]

[DOI]

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

Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

Stabilizing Replicated Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 15th International Conference, 2001

A Stabilizing Search Tree with Availability Properties.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems, 2001

BIST Method Based on Concurrent Single-Control Testability of RTL Data Paths.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Satoshi Ohtake

J. Electron. Test., 2000

Available and Stabilizing 2-3 Trees

[BibT_eX]

[DOI]

CoRR, 2000

Design for Strong Testability of RTL Data Paths to Provide Complete Fault Efficiency.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on VLSI Design (VLSI Design 2000), 2000

Parallelizability of Some P-Complete Problems.

[BibT_eX]

[DOI]

Akihiro Fujiwara

Michiko Inoue

Proceedings of the Parallel and Distributed Processing, 2000

Single-control testability of RTL data paths for BIST.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Xiaowei Li

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.

[BibT_eX]

[DOI]

Proceedings of ASP-DAC 2000, 2000

1999

A cost optimal parallel algorithm for weighted distance transforms.

[BibT_eX]

[DOI]

Parallel Comput., 1999

An Efficient Distributed Algorithm for the Biconnected-components Updating Problem.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Parallel Selection Algorithms with Analysis on Clusters.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1998

On the synthesis of synchronizable finite state machines with partial scan.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1998

SelfStabilizing WaitFree Clock Synchronization with Bounded Space.

[BibT_eX]

Proceedings of the Distributed Computing, 1998

A Non-Scan DFT Method for Controllers to Achieve Complete Fault Efficiency.

[BibT_eX]

[DOI]

Satoshi Ohtake

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Daisuke Yoshida

Syst. Comput. Jpn., 1997

Non-scan design for testable data paths using thru operation.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1997

Parallel algorithms for connected-component problems of gray-scale images.

[BibT_eX]

[DOI]

Akihiro Fujiwara

Syst. Comput. Jpn., 1997

An Algorithm for Finding the Causal Distributed Breakpoint.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1997

A latency-optimal superstabilizing mutual exclusion protocol.

[BibT_eX]

Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

A Parallel Algorithm for Weighted Distance Transforms.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

Self-stabilizing ring orientation algorithm under the C-Daemon.

[BibT_eX]

[DOI]

Yoshiaki Katayama

Syst. Comput. Jpn., 1996

A Snapshot Algorithm for Distributed Mobile Systems.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

An Approach To The Synthesis Of Synchronizable Finite State Machines With Partial Scan.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Akihiro Fujiwara

Inf. Process. Lett., 1995

1994

A distributed shortest-paths algorithm with distance-dependent message complexities.

[BibT_eX]

[DOI]

Kouji Miura

Syst. Comput. Jpn., 1994

1993

An optimal parallel algorithm for finding shortest paths inside simple polygons.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1993

1992

Efficient distributed algorithm to solve updating minimum spanning tree problem.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1992

Simple parallel algorithms to compute interval maxima.

[BibT_eX]

[DOI]

Koji Nakano

Syst. Comput. Jpn., 1992

Methods for realizing a priority bus system.

[BibT_eX]

[DOI]

Koji Nakano

Syst. Comput. Jpn., 1992

1991

Efficient distributed algorithms solving problems about the connectivity of network.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1991

A fault-tolerant algorithm for election in complete networks with a sense of direction.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1991

1990

Distributed Algorithms for Reconstructing MST after Topology Change.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

An efficient distributed algorithm for constructing a breadth-first search tree.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1989

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

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1989

1988

Distributed algorithms for fault diagnosis of processors.

[BibT_eX]

[DOI]

Kenichi Hagihara

Syst. Comput. Jpn., 1988

1987

Distributed algorithms tolerant of link failures.

[BibT_eX]

[DOI]

Kenichi Hagihara

Syst. Comput. Jpn., 1987

An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees.

[BibT_eX]

[DOI]

Kenichi Hagihara