Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Nobutaka Shimizu
Observed name:
Shimizu, Nobutaka
Institutions:
Institute of Science Tokyo,
Chuo University
Observed institutions:
Tokyo Institute of Technology,
Ritsumeikan University,
Institute of Science Tokyo,
The University of Tokyo,
Chuo University
ORCID:
0000-0001-5448-6761
Observed ORCID:
0000-0001-5448-6761
OpenAlex ID:
A5103108401
Works
30
Awards
2
Planted Clique Conjectures Are Equivalent
2024
·
Shuichi Hirahara
, Nobutaka Shimizu
·
ACM Symposium on Theory of Computing (STOC)
·
26
Hardness Self-Amplification: Simplified, Optimized, and Unified
2023
·
Shuichi Hirahara
, Nobutaka Shimizu
·
ACM Symposium on Theory of Computing (STOC)
·
21
PDF
3-Majority and 2-Choices with Many Opinions
2025
·
Nobutaka Shimizu
, Takeharu Shiraga
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
13
PDF
Average shortest path length of graphs of diameter 3
2016
·
Nobutaka Shimizu
, Ryuhei Mori
·
IEEE/ACM International Symposium on Networks-on-Chip (NOCS)
·
13
PDF
Asynchronous 3-Majority Dynamics with Many Opinions
2025
·
Colin Cooper
, Frederik Mallmann-Trenn
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
12
Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH
2021
·
Shuichi Hirahara
, Nobutaka Shimizu
·
Society for Industrial and Applied Mathematics eBooks
·
12
PDF
Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
2021
·
Nobutaka Shimizu
, Takeharu Shiraga
·
Random Structures and Algorithms
·
10
Error-Correction of Matrix Multiplication Algorithms
2025
·
Shuichi Hirahara
, Nobutaka Shimizu
·
ACM Symposium on Theory of Computing (STOC)
·
8
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
2021
·
Shuji Kijima
, Nobutaka Shimizu
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
7
Quasi‐majority functional voting on expander graphs
2024
·
Nobutaka Shimizu
, Takeharu Shiraga
·
Random Structures and Algorithms
·
6
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
2019
·
Shimizu, Nobutaka
, Shiraga, Takeharu
·
arXiv (Cornell University)
·
6
PDF
Hardness Self-Amplification from Feasible Hard-Core Sets
2022
·
Shuichi Hirahara
, Nobutaka Shimizu
·
Annual Symposium on Foundations of Computer Science
·
5
Quasi-Majority Functional Voting on Expander Graphs
2020
·
Shimizu, Nobutaka
, Shiraga, Takeharu
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
Undecided State Dynamics with Many Opinions
2026
·
Colin Cooper
, Frederik Mallmann-Trenn
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
3
Reversible random walks on dynamic graphs
2023
·
Nobutaka Shimizu
, Takeharu Shiraga
·
Random Structures and Algorithms
·
3
PDF
The Average Distance and the Diameter of Dense Random Regular Graphs
2020
·
Nobutaka Shimizu
·
The Electronic Journal of Combinatorics
·
3
PDF
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
2019
·
Nobutaka Shimizu
, Takeharu Shiraga
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
3
PDF
The Diameter of Dense Random Regular Graphs
2018
·
Nobutaka Shimizu
·
Society for Industrial and Applied Mathematics eBooks
·
3
Optimal Random Self-Reductions for All Linear Problems
2026
·
Shuichi Hirahara
, Nobutaka Shimizu
·
ACM Symposium on Theory of Computing (STOC)
·
2
Hardness Amplification beyond Boolean Functions
2026
·
Nobutaka Shimizu
, Kenji Yasunaga
·
ACM Symposium on Theory of Computing (STOC)
·
2
Nearly-Optimal Time-Sample Trade-off in Consensus Dynamics
2026
·
d'Amore, Francesco
, Rybicki, Joel
, et al.
·
arXiv (Cornell University)
·
1
PDF
Improved Quantum Random Self-Reduction for Linear Problems
2026
·
Asadi, Vahid R.
, Hirahara, Shuichi
, et al.
·
arXiv (Cornell University)
·
1
PDF
Some results of multidimensional discrete probability measures represented by Euler products
2014
·
Takahiro Aoyama
, Nobutaka Shimizu
·
JSIAM Letters
·
1
PDF
FIXP-Completeness in Second-Price Auctions
2026
·
Shimizu, Nobutaka
·
arXiv (Cornell University)
PDF
An Efficient Algorithm for Computing Average Network Flow
2026
·
Yutaro Fuse
, Tomomi Matsui
, et al.
·
Journal of the Operations Research Society of Japan
PDF
Show more works
View as search
Works count:
30
Citation count:
165
H-index:
8
I10-index:
7
Year
Topic
Type