| 2026 | MFCS | On the Complexity of Locally Dense Lattices. | Shuichi Hirahara, Kazuki Ogitsuka |
| 2026 | STOC | A Sharp Characterization of Pessiland. | Shuichi Hirahara, Mikito Nanashima |
| 2026 | STOC | Complexity-Theoretic Universal Inductive Inference. | Shuichi Hirahara, Mikito Nanashima |
| 2026 | STOC | Optimal Random Self-Reductions for All Linear Problems. | Shuichi Hirahara, Nobutaka Shimizu |
| 2025 | FOCS | NP-hardness of the Minimum Circuit Size Problem from Well-Studied Assumptions. | Shuichi Hirahara, Rahul Ilango |
| 2025 | FOCS | Asymptotically Optimal Inapproximability of Ek-SAT Reconfiguration. | Shuichi Hirahara, Naoto Ohsaka |
| 2025 | ICALP | Asymptotically Optimal Inapproximability of Maxmin k-Cut Reconfiguration. | Shuichi Hirahara, Naoto Ohsaka |
| 2025 | ICALP | An Optimal Error-Correcting Reduction for Matrix Multiplication. | Shuichi Hirahara, Nobutaka Shimizu |
| 2025 | ISAAC | Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules. | Shuichi Hirahara, Naoto Ohsaka, Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2025 | STOC | Error-Correction of Matrix Multiplication Algorithms. | Shuichi Hirahara, Nobutaka Shimizu |
| 2024 | FOCS | Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. | Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima |
| 2024 | ICALP | Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration. | Shuichi Hirahara, Naoto Ohsaka |
| 2024 | STOC | Symmetric Exponential Time Requires Near-Maximum Circuit Size. | Lijie Chen, Shuichi Hirahara, Hanlin Ren |
| 2024 | STOC | Beating Brute Force for Compression Problems. | Shuichi Hirahara, Rahul Ilango, R. Ryan Williams |
| 2024 | STOC | One-Way Functions and Zero Knowledge. | Shuichi Hirahara, Mikito Nanashima |
| 2024 | STOC | Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems. | Shuichi Hirahara, Naoto Ohsaka |
| 2024 | STOC | Planted Clique Conjectures Are Equivalent. | Shuichi Hirahara, Nobutaka Shimizu |
| 2024 | TCC | One-Way Functions and pKt Complexity. | Shuichi Hirahara, Zhenjian Lu, Igor C. Oliveira |
| 2023 | FOCS | Learning in Pessiland via Inductive Inference. | Shuichi Hirahara, Mikito Nanashima |
| 2023 | ISAAC | Regularization of Low Error PCPs and an Application to MCSP. | Shuichi Hirahara, Dana Moshkovitz |
| 2023 | STOC | Capturing One-Way Functions via NP-Hardness of Meta-Complexity. | Shuichi Hirahara |
| 2023 | STOC | A Duality between One-Way Functions and Average-Case Symmetry of Information. | Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira |
| 2023 | STOC | Hardness Self-Amplification: Simplified, Optimized, and Unified. | Shuichi Hirahara, Nobutaka Shimizu |
| 2022 | FOCS | NP-Hardness of Learning Programs and Partial MCSP. | Shuichi Hirahara |
| 2022 | FOCS | Hardness Self-Amplification from Feasible Hard-Core Sets. | Shuichi Hirahara, Nobutaka Shimizu |
| 2021 | FOCS | On Worst-Case Learning in Relativized Heuristica. | Shuichi Hirahara, Mikito Nanashima |
| 2021 | ISAAC | Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. | Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle |
| 2021 | MFCS | Test of Quantumness with Small-Depth Quantum Circuits. | Shuichi Hirahara, Franois Le Gall |
| 2021 | SODA | Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. | Shuichi Hirahara, Nobutaka Shimizu |
| 2021 | STOC | Average-case hardness of NP from exponential worst-case hardness assumptions. | Shuichi Hirahara |
| 2021 | STACS | One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. | Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida |
| 2020 | FOCS | Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity. | Shuichi Hirahara |
| 2020 | STOC | Unexpected hardness results for Kolmogorov complexity under uniform reductions. | Shuichi Hirahara |
| 2018 | FOCS | Non-Black-Box Worst-Case to Average-Case Reductions within NP. | Shuichi Hirahara |
| 2017 | MFCS | New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. | Eric Allender, Shuichi Hirahara |
| 2015 | INFOCOM | Virtual machine placement for minimizing connection cost in data center networks. | Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa |
| 2014 | MFCS | On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity. | Shuichi Hirahara, Akitoshi Kawamura |