Another approach of the equivalence problem for measure-many one-way quantum finite automata - Tianrong Lin (CoRR, 2011)

On commutativity of quantum weakest preconditions - Tianrong Lin (CoRR, 2011)

Another approach to the equivalence of measure-many one-way quantum finite automata and its application. - Tianrong Lin (J. Comput. Syst. Sci., 2012)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems. - Tianrong Lin (CoRR, 2014)

Corrigendum to "Another approach to the equivalence of measure-many one-way quantum infinite automata and its application" [J. Comput. Syst. Sci. 78(3) (2012) 807-821]. - Tianrong Lin (J. Comput. Syst. Sci., 2015)

The Separation of NP and PSPACE. - Tianrong Lin (CoRR, 2021)

Resolution of The Linear-Bounded Automata Question. - Tianrong Lin (CoRR, 2021)

Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine. - Tianrong Lin (CoRR, 2021)

On Baker-Gill-Solovay Oracle Turing Machines and Relativization Barrier. - Tianrong Lin (CoRR, 2021)

On Probabilistic ω-Pushdown Systems, and ω-Probabilistic Computational Tree Logic. - Tianrong Lin (CoRR, 2022)

Quantum and Probabilistic Computers Rigorously Powerful than Traditional Computers, and Derandomization. - Tianrong Lin (CoRR, 2023)

Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines. - Tianrong Lin (CoRR, 2024)

Computational Complexity of Model-Checking Quantum Pushdown Systems. - Deren Lin; Tianrong Lin (CoRR, 2025)