Takumi Kasai

According to our database, Takumi Kasai authored at least 25 papers between 1970 and 2021.

Collaborative distances:

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

2021

Midair Balloon Interface: A Soft and Lightweight Midair Object for Proximate Interactions.

Takuro Furumoto, Takumi Kasai, Masahiro Fujiwara, Yasutoshi Makino, Hiroyuki Shinoda

Proceedings of the UIST '21: The 34th Annual ACM Symposium on User Interface Software and Technology, 2021

2005

Inherent Ambiguity of Languages Generated by Spine Grammars.

Ikuo Kawaharada, Takumi Kasai

IEICE Trans. Inf. Syst., 2005

2003

A polynomial time algorithm to infer sequential machines.

Katsuhiko Takahashi, Akio Fujiyoshi, Takumi Kasai

Syst. Comput. Jpn., 2003

2000

Spinal-Formed Context-Free Tree Grammars.

Akio Fujiyoshi, Takumi Kasai

Theory Comput. Syst., 2000

1998

Left-right trees, a new tree structure for machine translation.

Kouichi Kurokawa, Takumi Kasai

Syst. Comput. Jpn., 1998

1994

The Othello game on an n*n board is PSPACE-complete.

Shigeki Iwata, Takumi Kasai

Theor. Comput. Sci., 1994

Thirty four Comparisons are Required to Sort 13 Items.

Takumi Kasai, Shusaku Sawato, Shigeki Iwata

Proceedings of the Logic, 1994

1993

Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines.

Shigeki Iwata, Takumi Kasai, Etsuro Moriya

Acta Informatica, 1993

1989

Probabilistic automata push-down.

Zhi-Zhong Chen, Takumi Kasai

Syst. Comput. Jpn., 1989

1987

Simultaneous (Poly-Time, Log-Space) Lower Bounds.

Shigeki Iwata, Takumi Kasai

Theor. Comput. Sci., 1987

1986

The emptiness problem for indexed language is exponential-time complete.

Shinichi Tanaka, Takumi Kasai

Syst. Comput. Jpn., 1986

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

1985

Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds.

Takumi Kasai, Shigeki Iwata

Math. Syst. Theory, 1985

1984

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

Akeo Adachi, Shigeki Iwata, Takumi Kasai

J. ACM, 1984

1982

Space Complexity in On-Line Computation.

Hajime Machida, Takumi Kasai

J. Comput. Syst. Sci., 1982

Homomorphisms between Models of Parallel Computation.

Takumi Kasai, Raymond E. Miller

J. Comput. Syst. Sci., 1982

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

Classes of Pebble Games and Complete Problems.

Takumi Kasai, Akeo Adachi, Shigeki Iwata

SIAM J. Comput., 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

Comparing models of parallel computation by homomorphisms.

Raymond E. Miller, Takumi Kasai

Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1975

A Universal Context-Free Grammar

Takumi Kasai

Inf. Control., May, 1975

1974

Translatability of Flowcharts into While Programs.

Takumi Kasai

J. Comput. Syst. Sci., 1974

1970

An Hierarchy Between Context-Free and Context-Sensitive Languages.

Takumi Kasai

J. Comput. Syst. Sci., 1970