| 2026 | PODC | Undecided State Dynamics with Many Opinions. | Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga |
| 2026 | STOC | Optimal Random Self-Reductions for All Linear Problems. | Shuichi Hirahara, Nobutaka Shimizu |
| 2026 | STOC | Hardness Amplification beyond Boolean Functions. | Nobutaka Shimizu, Kenji Yasunaga |
| 2025 | ICALP | An Optimal Error-Correcting Reduction for Matrix Multiplication. | Shuichi Hirahara, Nobutaka Shimizu |
| 2025 | PODC | 3-Majority and 2-Choices with Many Opinions. | Nobutaka Shimizu, Takeharu Shiraga |
| 2025 | SODA | Asynchronous 3-Majority Dynamics with Many Opinions. | Colin Cooper, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, Takeharu Shiraga |
| 2025 | STOC | Error-Correction of Matrix Multiplication Algorithms. | Shuichi Hirahara, Nobutaka Shimizu |
| 2024 | STOC | Planted Clique Conjectures Are Equivalent. | Shuichi Hirahara, Nobutaka Shimizu |
| 2023 | STOC | Hardness Self-Amplification: Simplified, Optimized, and Unified. | Shuichi Hirahara, Nobutaka Shimizu |
| 2022 | FOCS | Hardness Self-Amplification from Feasible Hard-Core Sets. | Shuichi Hirahara, Nobutaka Shimizu |
| 2021 | SODA | Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. | Shuichi Hirahara, Nobutaka Shimizu |
| 2021 | SODA | How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? | Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga |
| 2020 | ICALP | Quasi-Majority Functional Voting on Expander Graphs. | Nobutaka Shimizu, Takeharu Shiraga |
| 2018 | SODA | The Diameter of Dense Random Regular Graphs. | Nobutaka Shimizu |