Yamakami Tomoyuki. One-way bounded-error probabilistic pushdown automata and kolmogorov complexity: (preliminary report). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. 10396. 353-364
Tomoyuki Yamakami. A recursive definition of quantum polynomial time computability (extended abstract). Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, Österreichische Computer Gesellschaft 2017. 2017. 243-258
Tomoyuki Yamakami. Parameterized graph connectivity and polynomial-time sub-linear-space short reductions - (preliminary report). Proceedings of the 11th International Workshop on Reachability Problems, Lecture Notes in Computer Science. 2017. 10506. 176-191
Tomoyuki Yamakami. The 2CNF Boolean formula satisfiability problem and the linear space hypothesis. Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics. 2017
