"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",2016,Jan.
"Tatsuya Imai","Heuristic Algorithms for Classical STRIPS Planning Problems",,,,,,,2015,Mar.
"今井達也","古典的STRIPSプランニング問題のためのヒューリスティックアルゴリズム",,,,,,,2015,Mar.
"Tatsuya Imai","Heuristic Algorithms for Classical STRIPS Planning Problems",,,,,,,2015,Mar.
"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",,,,,2013,May
"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,