Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga. How many vertices does a random walk miss in a network with moderately increasing the number of vertices?. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2021. 106-122
Nobutaka Shimizu, Takeharu Shiraga. Quasi-majority functional voting on expander graphs. Leibniz International Proceedings in Informatics, LIPIcs. 2020. 168
Nobutaka Shimizu, Takeharu Shiraga. Phase transitions of best-of-two and best-of-three on stochastic block Models. Proceedings of the 33rd International Symposium on Distributed Computing (DISC 2019). 2019. 146. 32:1-32:17
Analyses of the cover time of deterministic random walks
(The 21st Conference of the International Federation of Operational Research Societies (IFORS 2017) 2017)