2 citations · 4 across the 8 of their papers we have counts for
10 papers
Meeting Times of Non-atomic Random Walks
Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue +1
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undir…
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…
Systematic Unsupervised Recycled Field-Programmable Gate Array Detection
Yuya Isaka, Michihiro Shintani, Foisal Ahmed +1
With the expansion of the semiconductor supply chain, the use of recycled field-programmable gate arrays (FPGAs) has become a serious concern. Several methods for detecting recycle…
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…
Wafer-level Variation Modeling for Multi-site RF IC Testing via Hierarchical Gaussian Process
Michihiro Shintani, Riaz-Ul-Haque Mian, Tomoki Nakamura +3
Wafer-level performance prediction has been attracting attention to reduce measurement costs without compromising test quality in production tests. Although several efficient metho…
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…