Rchr
J-GLOBAL ID：202201005632065038
Update date: Jul. 23, 2024
Shimizu Nobutaka
シミズ ノブタカ | Shimizu Nobutaka
Affiliation and department：
Job title：
Assistant Professor
Homepage URL (1)：
https://sites.google.com/view/nobutaka-shimizu/home
Research theme for competitive and other funds (2)：
- 2021 - 2023 合意モデルに基づく分散コミュニティ検出アルゴリズムの開発と理論的解析
- 2018 - 2022 Computational Complexity of Minimum Description Size Problems
Papers (8)：
-
Shuichi Hirahara, Nobutaka Shimizu. Planted Clique Conjectures Are Equivalent. STOC. 2024. 358-366
-
Shuichi Hirahara, Nobutaka Shimizu. Hardness Self-Amplification: Simplified, Optimized, and Unified. STOC. 2023. 70-83
-
Shuichi Hirahara, Nobutaka Shimizu. Hardness Self-Amplification from Feasible Hard-Core Sets. Proceedings of the Symposium on Foundations of Computer Science (FOCS 2022). 2022
-
Nobutaka Shimizu, Takeharu Shiraga. Phase transitions of Best-of-two and Best-of-three on stochastic block models. Random Structures & Algorithms. 2021. 59. 1. 96-140
-
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 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). 2021. 106-122
ｍore...
Lectures and oral presentations (7)：
-
エクスパンダーグラフと脱乱択化
(エクスパンダーグラフの新しい構成手法の確立とその応用 2022)
-
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
(2022)
-
エキスパンダーグラフ上の合意モデル
(最適化とその応用 (OPTA) 第12回研究部会 2020)
-
SETHの下での完全二部グラフ数え上げの平均計算量
(2019年度 冬のLAシンポジウム 2020)
-
密なランダム正則グラフの直径
(情報科学技術フォーラム(FIT) 2019)
ｍore...
Return to Previous Page
