Classification of Search Problems and Their Definability in Bounded Arithmetic - Tsuyoshi Morioka (Electron. Colloquium Comput. Complex., 2001)

The Relative Complexity of Local Search Heuristics and the Iteration Principle - Tsuyoshi Morioka (Electron. Colloquium Comput. Complex., 2003)

Relativized NP Search Problems and Propositional Proof Systems. - Josh Buresh-Oppenheim; Tsuyoshi Morioka (CCC, 2004)

Quantified propositional calculus and a second-order theory for NC1. - Stephen A. Cook; Tsuyoshi Morioka (Arch. Math. Log., 2005)

Logical approaches to the complexity of search problems: : proof complexity, quantified propositional calculus, and bounded arithmetic. - Tsuyoshi Morioka (2005)

Comparison Between Test Driven Development and Waterfall Development in a Small-Scale Project. - Lei Zhang; Shunsuke Akifuji; Katsumi Kawai; Tsuyoshi Morioka (XP, 2006)

Multiscale recurrent neural network based language model. - Tsuyoshi Morioka; Tomoharu Iwata; Takaaki Hori; Tetsunori Kobayashi (INTERSPEECH, 2015)

Language Model Domain Adaptation Via Recurrent Neural Networks with Domain-Shared and Domain-Specific Representations. - Tsuyoshi Morioka; Naohiro Tawara; Tetsuji Ogawa; Atsunori Ogawa; Tomoharu Iwata; Tetsunori Kobayashi (ICASSP, 2018)

AIREV at the NTCIR-18 U4 Task. - Xin Fan; Kazuya Uesato; Yuma Hayashi; Tsuyoshi Morioka (NTCIR, 2025)