Average shortest path length of graphs of diameter 3 N Shimizu, R Mori 2016 Tenth IEEE/ACM International Symposium on Networks-on-Chip (NOCS), 1-6, 2016 | 13 | 2016 |

Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models N Shimizu, T Shiraga Random Structures & Algorithms 59 (1), 96-140, 2021 | 10 | 2021 |

Nearly optimal average-case complexity of counting bicliques under SETH S Hirahara, N Shimizu Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 10 | 2021 |

Quasi‐majority functional voting on expander graphs N Shimizu, T Shiraga Random Structures & Algorithms, 2020 | 5 | 2020 |

Hardness self-amplification: Simplified, optimized, and unified S Hirahara, N Shimizu Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 70-83, 2023 | 4 | 2023 |

How many vertices does a random walk miss in a network with moderately increasing the number of vertices? S Kijima, N Shimizu, T Shiraga Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 3 | 2021 |

The diameter of dense random regular graphs N Shimizu Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 3 | 2018 |

Average Shortest Path Length of Graphs of Diameter 3. CoRR abs/1606.05119 (2016) N Shimizu, R Mori arXiv preprint arXiv:1606.05119, 2016 | 3 | 2016 |

Hardness self-amplification from feasible hard-core sets S Hirahara, N Shimizu 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 2 | 2022 |

Reversible random walks on dynamic graphs N Shimizu, T Shiraga Random Structures & Algorithms 63 (4), 1100-1136, 2023 | 1 | 2023 |

The average distance and the diameter of dense random regular graphs N Shimizu The Electronic Journal of Combinatorics, P3. 62-P3. 62, 2020 | 1 | 2020 |

The average distance of dense homogeneous random graphs N Shimizu Mathematical engineering technical report, Department of Mathematical …, 2017 | 1 | 2017 |

ÔYÔ SÛRI S Kijima, N Shimizu, T Shiraga, T Yokoyama, T Sakajo, Y Sumoto, ... 応用数理 32 (1), 62, 2022 | | 2022 |

How many vertices does a random walk miss in a network with moderately increasing the number of vertices? S Kijima, N Shimizu, T Shiraga arXiv preprint arXiv:2008.10837, 2020 | | 2020 |

The Diameter of Dense Random Regular Graphs N Shimizu IEICE Technical Report; IEICE Tech. Rep. 118 (517), 41-41, 2019 | | 2019 |

The Diameter of Dense Random Regular Graphs 清水伸高 電子情報通信学会技術研究報告; 信学技報 118 (517), 41-41, 2019 | | 2019 |