Search the dblp DataBase

Publications of Author

1. Takumi Kasai, Akeo Adachi, Shigeki Iwata
   Classes of pebble games and complete problems. [Citation Graph (0, 0)][DBLP]
   ACM Annual Conference (2), 1978, pp:914-918 [Conf]
   
2. Takumi Kasai, Akeo Adachi
   On polynominal time computable problems. [Citation Graph (0, 0)][DBLP]
   Graph Theory and Algorithms, 1980, pp:152-158 [Conf]
   
3. Akeo Adachi, Takumi Kasai, Etsuro Moriya
   A Theoretical Study of the Time Analysis of Programs. [Citation Graph (0, 0)][DBLP]
   MFCS, 1979, pp:201-207 [Conf]
   
4. Akeo Adachi, Shigeki Iwata, Takumi Kasai
   Low Level Complexity for Combinatorial Games [Citation Graph (0, 0)][DBLP]
   STOC, 1981, pp:228-237 [Conf]
   
5. Akeo Adachi, Shigeki Iwata, Takumi Kasai
   Some Combinatorial Game Problems Require Omega(n^k) Time. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1984, v:31, n:2, pp:361-376 [Journal]
   
6. Takumi Kasai, Akeo Adachi
   A Characterization of Time Complexity by Simple Loop Programs. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1980, v:20, n:1, pp:1-17 [Journal]
   
7. Takumi Kasai, Akeo Adachi, Shigeki Iwata
   Classes of Pebble Games and Complete Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1979, v:8, n:4, pp:574-586 [Journal]
   
8. Hiroaki Tohyama, Akeo Adachi
   Complexity of path discovery game problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:237, n:1-2, pp:381-406 [Journal]