Fukuhito Ooshita

Orcid: 0000-0001-9400-1095

According to our database1, Fukuhito Ooshita authored at least 112 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications.
Acta Informatica, March, 2024

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

2023
Ring exploration of myopic luminous robots with visibility more than one.
Inf. Comput., June, 2023

Location functions for self-stabilizing byzantine tolerant swarms.
Theor. Comput. Sci., 2023

Eventually consistent distributed ledger despite degraded atomic broadcast.
Concurr. Comput. Pract. Exp., 2023

Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots.
Concurr. Comput. Pract. Exp., 2023

Meeting Times of Non-atomic Random Walks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model.
Proceedings of the Eleventh International Symposium on Computing and Networking, CANDAR 2023, 2023

2022
Terminating Grid Exploration with Myopic Luminous Robots.
Int. J. Netw. Comput., 2022

Weakly Byzantine Gathering with a Strong Team.
IEICE Trans. Inf. Syst., 2022

Ring exploration with myopic luminous robots.
Inf. Comput., 2022

Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Gathering despite a linear number of weakly Byzantine agents.
Proceedings of the 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022, 2022

2021
Uniform bipartition in the population protocol model with arbitrary graphs.
Theor. Comput. Sci., 2021

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

Population Protocols for Graph Class Identification Problems.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Asynchronous Gathering in a Torus.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Gathering with a strong team in weakly Byzantine environments.
Proceedings of the ICDCN '21: International Conference on Distributed 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

Byzantine-Tolerant Gathering of Mobile Agents in Asynchronous Arbitrary Networks with Authenticated Whiteboards.
IEICE Trans. Inf. Syst., 2020

Foreword.
IEICE Trans. Inf. Syst., 2020

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

Self-stabilizing Graph Exploration by a Single Agent.
CoRR, 2020

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

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

2019
Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model.
IEEE Trans. Parallel Distributed Syst., 2019

A Population Protocol for Uniform $k$-partition under Global Fairness.
Int. J. Netw. Comput., 2019

Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness.
IEICE Trans. Inf. Syst., 2019

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

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract).
CoRR, 2019

Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Black Hole Search Despite Byzantine Agents.
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

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

Brief Announcement: Self-stabilizing LCM Schedulers for Autonomous Mobile Robots Using Neighborhood Mutual Remainder.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Brief Announcement Forgive & Forget: Self-stabilizing Swarms in Spite of Byzantine Robots.
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

Uniform Partition in Population Protocol Model Under Weak Fairness.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Gathering on Rings for Myopic Asynchronous Robots With Lights.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Eventually Consistent Distributed Ledger Relying on Degraded Atomic Broadcast.
Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 2019

Forgive & Forget: Self-Stabilizing Swarms in Spite of Byzantine Robots.
Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 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

Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards.
IEICE Trans. Inf. Syst., 2018

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

Brief Announcement: Feasibility of Weak Gathering in Connected-over-Time Dynamic Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards.
Proceedings of the Networked Systems - 6th International Conference, 2018

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

2017
Byzantine Gathering in Networks with Authenticated Whiteboards.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks.
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

Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Constant-Space Population Protocols for Uniform Bipartition.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

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

An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks.
J. Graph Algorithms Appl., 2016

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

2015
On the self-stabilization of mobile oblivious robots in uniform rings.
Theor. Comput. Sci., 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

Asynchronous Ring Gathering by Oblivious Robots with Limited Vision.
Proceedings of the 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, 2014

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

2013
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots.
IEEE Trans. Parallel Distributed Syst., 2013

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

Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Hierarchical Low Power Consumption Technique with Location Information for Sensor Networks.
CoRR, 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

The Price of Multi-Organization Constraint in Unrelated Parallel Machine Scheduling.
Parallel Process. Lett., 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

Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection.
Proceedings of the Structural Information and Communication Complexity, 2011

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

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

Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings.
Proceedings of the Structural Information and Communication Complexity, 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

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

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

Randomized Gathering of Mobile Robots with Local-Multiplicity Detection.
Proceedings of the Stabilization, 2009

A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines.
Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

2008
Move-optimal gossiping among mobile agents.
Theor. Comput. Sci., 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
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

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 Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults.
J. Aerosp. Comput. Inf. Commun., 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

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

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

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.
Syst. Comput. Jpn., 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

2003
Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

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


  Loading...