Takumi Kasai

Publication Activity (10 Years)

Years Active: 1970-2021
Publications (10 Years): 1

Top Topics

Handheld Devices

Top Venues

Publications

Takuro Furumoto, Takumi Kasai, Masahiro Fujiwara, Yasutoshi Makino, Hiroyuki Shinoda
Midair Balloon Interface: A Soft and Lightweight Midair Object for Proximate Interactions. UIST (2021)
Ikuo Kawaharada, Takumi Kasai
Inherent Ambiguity of Languages Generated by Spine Grammars. IEICE Trans. Inf. Syst. (6) (2005)
Katsuhiko Takahashi, Akio Fujiyoshi, Takumi Kasai
A polynomial time algorithm to infer sequential machines. Systems and Computers in Japan 34 (1) (2003)
Akio Fujiyoshi, Takumi Kasai
Spinal-Formed Context-Free Tree Grammars. Theory Comput. Syst. 33 (1) (2000)
Kouichi Kurokawa, Takumi Kasai
Left-right trees, a new tree structure for machine translation. Systems and Computers in Japan 29 (5) (1998)
Shigeki Iwata, Takumi Kasai
The Othello game on an n*n board is PSPACE-complete. Theor. Comput. Sci. 123 (2) (1994)
Takumi Kasai, Shusaku Sawato, Shigeki Iwata
Thirty four Comparisons are Required to Sort 13 Items. Logic, Language and Computation (1994)
Shigeki Iwata, Takumi Kasai, Etsuro Moriya
Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. Acta Informatica 30 (3) (1993)
Zhi-Zhong Chen, Takumi Kasai
Probabilistic automata push-down. Systems and Computers in Japan 20 (6) (1989)
Shigeki Iwata, Takumi Kasai
Simultaneous (Poly-Time, Log-Space) Lower Bounds. Theor. Comput. Sci. 54 (1987)
Etsuro Moriya, Shigeki Iwata, Takumi Kasai
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines Inf. Control. 70 (2/3) (1986)
Shinichi Tanaka, Takumi Kasai
The emptiness problem for indexed language is exponential-time complete. Systems and Computers in Japan 17 (9) (1986)
Takumi Kasai, Shigeki Iwata
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. Math. Syst. Theory 18 (2) (1985)
Akeo Adachi, Shigeki Iwata, Takumi Kasai
) Time. J. ACM 31 (2) (1984)
Hajime Machida, Takumi Kasai
Space Complexity in On-Line Computation. J. Comput. Syst. Sci. 24 (3) (1982)
Takumi Kasai, Raymond E. Miller
Homomorphisms between Models of Parallel Computation. J. Comput. Syst. Sci. 25 (3) (1982)
Akeo Adachi, Shigeki Iwata, Takumi Kasai
Low Level Complexity for Combinatorial Games STOC (1981)
Takumi Kasai, Akeo Adachi
On polynominal time computable problems. Graph Theory and Algorithms (1980)
Takumi Kasai, Akeo Adachi
A Characterization of Time Complexity by Simple Loop Programs. J. Comput. Syst. Sci. 20 (1) (1980)
Raymond E. Miller, Takumi Kasai
Comparing models of parallel computation by homomorphisms. COMPSAC (1979)
Akeo Adachi, Takumi Kasai, Etsuro Moriya
A Theoretical Study of the Time Analysis of Programs. MFCS (1979)
Takumi Kasai, Akeo Adachi, Shigeki Iwata
Classes of Pebble Games and Complete Problems. SIAM J. Comput. 8 (4) (1979)
Takumi Kasai, Akeo Adachi, Shigeki Iwata
Classes of pebble games and complete problems. ACM Annual Conference (2) (1978)
Takumi Kasai
A Universal Context-Free Grammar Inf. Control. 28 (1) (1975)
Takumi Kasai
Translatability of Flowcharts into While Programs. J. Comput. Syst. Sci. 9 (2) (1974)
Takumi Kasai
An Hierarchy Between Context-Free and Context-Sensitive Languages. J. Comput. Syst. Sci. 4 (5) (1970)