Nobutaka Shimizu

Electron. Colloquium Comput. Complex., 2024

2023

Reversible random walks on dynamic graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, December, 2023

Hardness Self-Amplification: Simplified, Optimized, and Unified.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

2022

Hardness Self-Amplification from Feasible Hard-Core Sets.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

2021

Phase transitions of Best-of-two and Best-of-three on stochastic block models.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2021

Metropolis Walks on Dynamic Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?

[BibT_eX]

[DOI]

Shuji Kijima

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

The Average Distance and the Diameter of Dense Random Regular Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Quasi-Majority Functional Voting on Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018

The Diameter of Dense Random Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2016

Average shortest path length of graphs of diameter 3.

[BibT_eX]

[DOI]

Ryuhei Mori

Proceedings of the Tenth IEEE/ACM International Symposium on Networks-on-Chip, 2016

2014

Some results of multidimensional discrete probability measures represented by Euler products.

[BibT_eX]

[DOI]

Takahiro Aoyama