An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals. - Kenshi Miyabe (Notre Dame J. Formal Log., 2010)

An Optimal Superfarthingale and Its Convergence over a Computable Topological Space. - Kenshi Miyabe (Algorithmic Probability and Friends, 2011)

Truth-table Schnorr randomness and truth-table reducible randomness. - Kenshi Miyabe (Math. Log. Q., 2011)

The difference between optimality and universality. - Kenshi Miyabe (Log. J. IGPL, 2012)

L1-Computability, Layerwise Computability and Solovay Reducibility. - Kenshi Miyabe (Comput., 2013)

Characterization of Kurtz Randomness by a Differentiation Theorem. - Kenshi Miyabe (Theory Comput. Syst., 2013)

Uniform Kurtz randomness. - Takayuki Kihara; Kenshi Miyabe (J. Log. Comput., 2014)

Algorithmic randomness over general spaces. - Kenshi Miyabe (Math. Log. Q., 2014)

Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10). - Rodney G. Downey; Kenshi Miyabe; André Nies; Osamu Watanabe (NII Shonan Meet. Rep., 2014)

Unified characterizations of lowness properties via Kolmogorov complexity. - Takayuki Kihara; Kenshi Miyabe (Arch. Math. Log., 2015)

Schnorr Triviality and Its Equivalent Notions. - Kenshi Miyabe (Theory Comput. Syst., 2015)

Using Almost-everywhere theorems from Analysis to Study Randomness. - Kenshi Miyabe; André Nies; Jing Zhang (Bull. Symb. Log., 2016)

Reducibilities Relating to Schnorr Randomness. - Kenshi Miyabe (Theory Comput. Syst., 2016)

Randomness and Solovay degrees. - Kenshi Miyabe; André Nies; Frank Stephan 001 (J. Log. Anal., 2018)

Coherence of Reducibilities with Randomness Notions. - Kenshi Miyabe (Theory Comput. Syst., 2018)

Computable Prediction. - Kenshi Miyabe (AGI, 2019)

Uniform Relativization. - Kenshi Miyabe (CiE, 2019)

Solovay reducibility and continuity. - Masahiro Kumabe; Kenshi Miyabe; Yuki Mizusawa; Toshio Suzuki (J. Log. Anal., 2020)