An Hierarchy Between Context-Free and Context-Sensitive Languages. - Takumi Kasai (J. Comput. Syst. Sci., 1970)

Translatability of Flowcharts into While Programs. - Takumi Kasai (J. Comput. Syst. Sci., 1974)

A Universal Context-Free Grammar - Takumi Kasai (Inf. Control., 1975)

Classes of pebble games and complete problems. - Takumi Kasai; Akeo Adachi; Shigeki Iwata (ACM Annual Conference (2), 1978)

Comparing models of parallel computation by homomorphisms. - Raymond E. Miller; Takumi Kasai (COMPSAC, 1979)

A Theoretical Study of the Time Analysis of Programs. - Akeo Adachi; Takumi Kasai; Etsuro Moriya (MFCS, 1979)

On polynominal time computable problems. - Takumi Kasai; Akeo Adachi (Graph Theory and Algorithms, 1980)

A Characterization of Time Complexity by Simple Loop Programs. - Takumi Kasai; Akeo Adachi (J. Comput. Syst. Sci., 1980)

Low Level Complexity for Combinatorial Games - Akeo Adachi; Shigeki Iwata; Takumi Kasai (STOC, 1981)

Homomorphisms between Models of Parallel Computation. - Takumi Kasai; Raymond E. Miller (J. Comput. Syst. Sci., 1982)

Space Complexity in On-Line Computation. - Hajime Machida; Takumi Kasai (J. Comput. Syst. Sci., 1982)

Some Combinatorial Game Problems Require Omega(nk) Time. - Akeo Adachi; Shigeki Iwata; Takumi Kasai (J. ACM, 1984)

Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. - Takumi Kasai; Shigeki Iwata (Math. Syst. Theory, 1985)

A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines - Etsuro Moriya; Shigeki Iwata; Takumi Kasai (Inf. Control., 1986)

The emptiness problem for indexed language is exponential-time complete. - Shinichi Tanaka; Takumi Kasai (Syst. Comput. Jpn., 1986)

Simultaneous (Poly-Time, Log-Space) Lower Bounds. - Shigeki Iwata; Takumi Kasai (Theor. Comput. Sci., 1987)

Probabilistic automata push-down. - Zhi-Zhong Chen; Takumi Kasai (Syst. Comput. Jpn., 1989)

Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. - Shigeki Iwata; Takumi Kasai; Etsuro Moriya (Acta Informatica, 1993)

Thirty four Comparisons are Required to Sort 13 Items. - Takumi Kasai; Shusaku Sawato; Shigeki Iwata (Logic, Language and Computation, 1994)

The Othello game on an n*n board is PSPACE-complete. - Shigeki Iwata; Takumi Kasai (Theor. Comput. Sci., 1994)

Left-right trees, a new tree structure for machine translation. - Kouichi Kurokawa; Takumi Kasai (Syst. Comput. Jpn., 1998)

Spinal-Formed Context-Free Tree Grammars. - Akio Fujiyoshi; Takumi Kasai (Theory Comput. Syst., 2000)

A polynomial time algorithm to infer sequential machines. - Katsuhiko Takahashi; Akio Fujiyoshi; Takumi Kasai (Syst. Comput. Jpn., 2003)

Inherent Ambiguity of Languages Generated by Spine Grammars. - Ikuo Kawaharada; Takumi Kasai (IEICE Trans. Inf. Syst., 2005)

Midair Balloon Interface: A Soft and Lightweight Midair Object for Proximate Interactions. - Takuro Furumoto; Takumi Kasai; Masahiro Fujiwara; Yasutoshi Makino; Hiroyuki Shinoda 001 (UIST, 2021)