Takumi Kasai - RankMe

26 papers A* 2B 2Journal 19Unranked 3

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