A Theoretical Study of the Time Analysis of Programs. - Akeo Adachi; Takumi Kasai; Etsuro Moriya (MFCS, 1979)

Classes of Pebble Games and Complete Problems. - Takumi Kasai; Akeo Adachi; Shigeki Iwata (SIAM J. Comput., 1979)

On polynominal time computable problems. - Takumi Kasai; Akeo Adachi (Graph Theory and Algorithms, 1980)

A Characterization of Time Complexity by Simple Loop Programs. - Takumi Kasai; Akeo Adachi (J. Comput. Syst. Sci., 1980)

Low Level Complexity for Combinatorial Games - Akeo Adachi; Shigeki Iwata; Takumi Kasai (STOC, 1981)

Some Combinatorial Game Problems Require Omega(nk) Time. - Akeo Adachi; Shigeki Iwata; Takumi Kasai (J. ACM, 1984)

Complexity of path discovery game problems. - Hiroaki Tohyama; Akeo Adachi (Theor. Comput. Sci., 2000)