Akeo Adachi

According to our database, Akeo Adachi authored at least 7 papers between 1978 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2000

Complexity of path discovery game problems.

Hiroaki Tohyama, Akeo Adachi

Theor. Comput. Sci., 2000

1984

Some Combinatorial Game Problems Require Omega(n^k) Time.

Akeo Adachi, Shigeki Iwata, Takumi Kasai

J. ACM, 1984

1981

Low Level Complexity for Combinatorial Games

Akeo Adachi, Shigeki Iwata, Takumi Kasai

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

A Characterization of Time Complexity by Simple Loop Programs.

Takumi Kasai, Akeo Adachi

J. Comput. Syst. Sci., 1980

On polynominal time computable problems.

Takumi Kasai, Akeo Adachi

Proceedings of the Graph Theory and Algorithms, 1980

1979

A Theoretical Study of the Time Analysis of Programs.

Akeo Adachi, Takumi Kasai, Etsuro Moriya

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

Classes of pebble games and complete problems.

Takumi Kasai, Akeo Adachi, Shigeki Iwata

Proceedings of the Proceedings 1978 ACM Annual Conference, 1978