Rchr
J-GLOBAL ID:201801012931793647   Update date: Mar. 13, 2024

Hirahara Shuichi

ヒラハラ シュウイチ | Hirahara Shuichi
Affiliation and department:
Job title: Associate Professor
Research field  (1): Information theory
Research keywords  (5): average-case complexity ,  meta-complexity ,  Kolmogorov Complexity ,  Minimum Circuit Size Problem ,  Complexity Theory
Research theme for competitive and other funds  (7):
  • 2020 - 2025 New computational models for algorithms and discrete optimization
  • 2020 - 2024 Quantum Algorithms for Large-Scale Quantum Computers: New Horizons and Applications
  • 2020 - 2024 メタな視点に基づく計算量理論の新展開
  • 2018 - 2022 Computational Complexity of Minimum Description Size Problems
  • 2019 - 2021 安全な暗号の確立に向けた回路最小化問題の計算困難性の解析
Show all
Papers (45):
  • Shuichi Hirahara. Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\). SIAM Journal on Computing. 2023. 52. 6. 349
  • Shuichi Hirahara, Dana Moshkovitz. Regularization of Low Error PCPs and an Application to MCSP. ISAAC. 2023. 39-16
  • Shuichi Hirahara, Mikito Nanashima. Learning in Pessiland via Inductive Inference. FOCS. 2023. 447-457
  • Shuichi Hirahara, Zhenjian Lu, Hanlin Ren. Bounded Relativization. CCC. 2023. 6-45
  • Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira. A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC. 2023. 1039-1050
more...
MISC (4):
  • 平原 秀一. 「メタ計算量理論」について. LAシンポジウム会誌. 2021. 76
  • 平原 秀一. 回路最小化問題と計算量理論の近年の動向について. LAシンポジウム会誌. 2016
  • HIRAHARA Shuichi, IMAI Hiroshi. On Extended Complexity of Generalized Transversal Matroids (Short Note) (Theoretical Foundations of Computing). IEICE technical report. Theoretical foundations of Computing. 2014. 114. 238. 1-4
  • Shuichi Hirahara, Akitoshi Kawamura. On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. IPSJ SIG Notes. 2014. 2014. 13. 1-7
Lectures and oral presentations  (25):
  • メタ計算量と平均時計算量
    (コンピュテーション研究会(COMP) 2023)
  • 脱乱択化の理論とメタ計算量
    (RIMS 共同研究「組合せ最適化セミナー」 (第 20 回) 2023)
  • Meta-complexity and average-case complexity
    (Computational Complexity Conference (CCC 2023) 2023)
  • Meta-complexity and average-case complexity
    (16th International Conference on Computability, Complexity and Randomness (CCR 2023) 2023)
  • メタ計算量の最近の進展について
    (AFSA 2023年度第1回領域集会 2023)
more...
Education (1):
  • 2016 - 2019 The University of Tokyo Graduate School of Information Science and Technology Doctoral Program
Professional career (1):
  • Ph.D. (The University of Tokyo)
Work history (4):
  • 2022/04 - 現在 National Institute of Informatics Principle of Informatics Research Division Associate Professor
  • 2022/09 - 2022/12 University of Warwick Computer Science Department Research Fellow
  • 2019/04 - 2022/03 National Institute of Informatics Principle of Informatics Research Division Assistant Professor
  • 2021/04 - 2021/09 Nagoya University Graduate School of Mathematics
Committee career (5):
  • 2023/09 - 2024/01 The 15th Innovations in Theoretical Computer Science (ITCS 2024) Program Committee
  • 2021/06 - 2023/05 情報処理学会 論文誌ジャーナル/JIP編集委員会委員
  • 2022/11 - 2023/02 The 55th ACM Symposium on Theory of Computing (STOC 2023), Program Committee
  • 2021/08 - 2021/08 The 25th International Conference on Randomization and Computation (RANDOM 2021), Program Committee
  • 2020/12 - 2021/01 International Computer Science Symposium in Russia (CSR 2021), Program Committee
Awards (8):
  • 2024/03 - ヤマト科学株式会社 ヤマト科学賞 暗号の安全性の証明に向けた計算量理論の先駆的研究
  • 2024/01 - IPSJ Microsoft Faculty Award
  • 2022/12 - Complexity result of the year 2022 NP-Hardness of Learning Programs and Partial MCSP
  • 2022/02 - Funai Information Technology Award for Young Researchers
  • 2019/03 - 電子情報通信学会 学術奨励賞 OR-AND-XOR回路に対する回路最小化問題のNP完全性
Show all
Association Membership(s) (2):
情報処理学会 ,  電子情報通信学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page