Akeo Adachi

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

Coauthor Index

1	Shigeki Iwata	[1] [2] [6] [7]
2	Takumi Kasai	[1] [2] [3] [4] [5] [6] [7]
3	Etsuro Moriya	[3]
4	Hiroaki Tohyama	[8]

Colors in the list of coauthors

Last update Thu May 24 01:13:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page