Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols. - Haruki Kanaya; Ryota Eguchi; Taisho Sasada; Michiko Inoue (OPODIS, 2024)

Complete Graph Identification in Population Protocols. - Haruki Kanaya; Yuichi Sudo (SSS, 2024)

Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols. - Haruki Kanaya; Ryota Eguchi; Taisho Sasada; Fukuhito Ooshita; Michiko Inoue (CoRR, 2025)

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors. - Shota Takahashi; Haruki Kanaya; Shoma Hiraoka; Ryota Eguchi; Yuichi Sudo (CoRR, 2025)