Haruki Kanaya

According to our database, Haruki Kanaya authored at least 4 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors.

Shota Takahashi, Haruki Kanaya, Shoma Hiraoka, Ryota Eguchi, Yuichi Sudo

CoRR, May, 2025

Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols.

Haruki Kanaya, Ryota Eguchi, Taisho Sasada, Fukuhito Ooshita, Michiko Inoue

CoRR, March, 2025

2024

Complete Graph Identification in Population Protocols.

Haruki Kanaya, Yuichi Sudo

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

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols.

Haruki Kanaya, Ryota Eguchi, Taisho Sasada, Michiko Inoue

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024