国際会議発表 (査読有り)

• Tatsuya Imai, Osamu Watanabe. Relating sublinear space computability, The 42nd Int'l Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'16), SOFSEM 2016: Theory and Practice of Computer Science, Springer Berlin Heidelberg, Vol. LNCS 9587, pp. 17-28, Jan. 2016.
• Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N.V. Vinodchandran, Osamu Watanabe. An O(n^{{1/2}+epsilon}})-space and polynomial-time algorithm for directed planar reachability, Proc. of the 28th Conference on Computational Complexity (CCC'13), Computational Complexity (CCC), 2013 IEEE Conference on, IEEE, pp. 277-286, 2013.

国際会議発表 (査読なし・不明)

• Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, Variyam Vinochandran, Osamu Watanabe. An O(sqrt(n)+eps})-Space Algorithm for Directed Planar Reachability with Polynomial Running Time, アルゴリズム研，情報処理学会, 情処研報 AL, May 2013.

学位論文

• Heuristic Algorithms for Classical STRIPS Planning Problems,  Thesis,  博士（理学）,  Tokyo Institute of Technology,  2015/03/26,   
• 古典的STRIPSプランニング問題のためのヒューリスティックアルゴリズム,  論文要旨,  博士（理学）,  東京工業大学,  2015/03/26,   
• Heuristic Algorithms for Classical STRIPS Planning Problems,  Exam Summary,  博士（理学）,  Tokyo Institute of Technology,  2015/03/26,   

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]