most citedGathering with a strong team in weakly Byzantine environments

1 citations · 1 across the 1 of their papers we have counts for

collaborators

5 papers

cs.DC2021

Terminating grid exploration with myopic luminous robots

Shota Nagahama, Fukuhito Ooshita, Michiko Inoue

We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and lumi…

cs.DC2020

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs

Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue +1

In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular,…

cs.DC20201 cited

Gathering with a strong team in weakly Byzantine environments

Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1

We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of agents with unique identifiers (IDs), an…

cs.AR2020

Cycle-Accurate Evaluation of Software-Hardware Co-Design of Decimal Computation in RISC-V Ecosystem

Riaz-ul-haque Mian, Michihiro Shintani, Michiko Inoue

Software-hardware co-design solutions for decimal computation can provide several Pareto points to development of embedded systems in terms of hardware cost and performance. This p…

cs.DC2019

Uniform Partition in Population Protocol Model under Weak Fairness

Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue

We focus on a uniform partition problem in a population protocol model. The uniform partition problem aims to divide a population into k groups of the same size, where k is a given…