2 citations · 4 across the 6 of their papers we have counts for
6 papers · 1 filter
Gathering despite a linear number of weakly Byzantine agents
Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist agents with unique identifiers (IDs) in th…
Population Protocols for Graph Class Identification Problems
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication g…
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…
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,…
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…
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…