
Search the dblp DataBase
Akeo Adachi:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Takumi Kasai, Akeo Adachi, Shigeki Iwata
Classes of pebble games and complete problems. [Citation Graph (0, 0)][DBLP] ACM Annual Conference (2), 1978, pp:914918 [Conf]
 Takumi Kasai, Akeo Adachi
On polynominal time computable problems. [Citation Graph (0, 0)][DBLP] Graph Theory and Algorithms, 1980, pp:152158 [Conf]
 Akeo Adachi, Takumi Kasai, Etsuro Moriya
A Theoretical Study of the Time Analysis of Programs. [Citation Graph (0, 0)][DBLP] MFCS, 1979, pp:201207 [Conf]
 Akeo Adachi, Shigeki Iwata, Takumi Kasai
Low Level Complexity for Combinatorial Games [Citation Graph (0, 0)][DBLP] STOC, 1981, pp:228237 [Conf]
 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:361376 [Journal]
 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:117 [Journal]
 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:574586 [Journal]
 Hiroaki Tohyama, Akeo Adachi
Complexity of path discovery game problems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:237, n:12, pp:381406 [Journal]
Search in 0.003secs, Finished in 0.004secs
