Takumi Kasai

	2005
22		Ikuo Kawaharada, Takumi Kasai: Inherent Ambiguity of Languages Generated by Spine Grammars. IEICE Transactions 88-D(6): 1150-1158 (2005)
	2003
21		Katsuhiko Takahashi, Akio Fujiyoshi, Takumi Kasai: A polynomial time algorithm to infer sequential machines. Systems and Computers in Japan 34(1): 59-67 (2003)
	2000
20		Akio Fujiyoshi, Takumi Kasai: Spinal-Formed Context-Free Tree Grammars. Theory Comput. Syst. 33(1): 59-83 (2000)
	1998
19		Kouichi Kurokawa, Takumi Kasai: Left-right trees, a new tree structure for machine translation. Systems and Computers in Japan 29(5): 84-91 (1998)
	1994
18		Takumi Kasai, Shusaku Sawato, Shigeki Iwata: Thirty four Comparisons are Required to Sort 13 Items. Logic, Language and Computation 1994: 260-269
17		Shigeki Iwata, Takumi Kasai: The Othello game on an n*n board is PSPACE-complete. Theor. Comput. Sci. 123(2): 329-340 (1994)
	1993
16		Shigeki Iwata, Takumi Kasai, Etsuro Moriya: Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. Acta Inf. 30(3): 267-278 (1993)
	1987
15		Shigeki Iwata, Takumi Kasai: Simultaneous (Poly-Time, Log-Space) Lower Bounds. Theor. Comput. Sci. 54: 325-329 (1987)
	1986
14		Etsuro Moriya, Shigeki Iwata, Takumi Kasai: A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines Information and Control 70(2/3): 179-185 (1986)
	1985
13		Takumi Kasai, Shigeki Iwata: Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. Mathematical Systems Theory 18(2): 153-170 (1985)
	1984
12		Akeo Adachi, Shigeki Iwata, Takumi Kasai: Some Combinatorial Game Problems Require Omega(nk) Time. J. ACM 31(2): 361-376 (1984)
	1982
11		Hajime Machida, Takumi Kasai: Space Complexity in On-Line Computation. J. Comput. Syst. Sci. 24(3): 362-372 (1982)
10		Takumi Kasai, Raymond E. Miller: Homomorphisms between Models of Parallel Computation. J. Comput. Syst. Sci. 25(3): 285-331 (1982)
	1981
9		Akeo Adachi, Shigeki Iwata, Takumi Kasai: Low Level Complexity for Combinatorial Games STOC 1981: 228-237
	1980
8		Takumi Kasai, Akeo Adachi: On polynominal time computable problems. Graph Theory and Algorithms 1980: 152-158
7		Takumi Kasai, Akeo Adachi: A Characterization of Time Complexity by Simple Loop Programs. J. Comput. Syst. Sci. 20(1): 1-17 (1980)
	1979
6		Akeo Adachi, Takumi Kasai, Etsuro Moriya: A Theoretical Study of the Time Analysis of Programs. MFCS 1979: 201-207
5		Takumi Kasai, Akeo Adachi, Shigeki Iwata: Classes of Pebble Games and Complete Problems. SIAM J. Comput. 8(4): 574-586 (1979)
	1978
4		Takumi Kasai, Akeo Adachi, Shigeki Iwata: Classes of pebble games and complete problems. ACM Annual Conference (2) 1978: 914-918
	1975
3		Takumi Kasai: A Universal Context-Free Grammar Information and Control 28(1): 30-34 (1975)
	1974
2		Takumi Kasai: Translatability of Flowcharts into While Programs. J. Comput. Syst. Sci. 9(2): 177-195 (1974)
	1970
1		Takumi Kasai: An Hierarchy Between Context-Free and Context-Sensitive Languages. J. Comput. Syst. Sci. 4(5): 492-508 (1970)

Coauthor Index

1	Akeo Adachi	[4] [5] [6] [7] [8] [9] [12]
2	Akio Fujiyoshi	[20] [21]
3	Shigeki Iwata	[4] [5] [9] [12] [13] [14] [15] [16] [17] [18]
4	Ikuo Kawaharada	[22]
5	Kouichi Kurokawa	[19]
6	Hajime Machida	[11]
7	Raymond E. Miller	[10]
8	Etsuro Moriya	[6] [14] [16]
9	Shusaku Sawato	[18]
10	Katsuhiko Takahashi	[21]

Colors in the list of coauthors