default search action
Takumi Kasai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c7]Takuro Furumoto, Takumi Kasai, Masahiro Fujiwara, Yasutoshi Makino, Hiroyuki Shinoda
:
Midair Balloon Interface: A Soft and Lightweight Midair Object for Proximate Interactions. UIST 2021: 783-795
2000 – 2009
- 2005
- [j19]Ikuo Kawaharada, Takumi Kasai:
Inherent Ambiguity of Languages Generated by Spine Grammars. IEICE Trans. Inf. Syst. 88-D(6): 1150-1158 (2005) - 2003
- [j18]Katsuhiko Takahashi, Akio Fujiyoshi, Takumi Kasai:
A polynomial time algorithm to infer sequential machines. Syst. Comput. Jpn. 34(1): 59-67 (2003) - 2000
- [j17]Akio Fujiyoshi, Takumi Kasai:
Spinal-Formed Context-Free Tree Grammars. Theory Comput. Syst. 33(1): 59-83 (2000)
1990 – 1999
- 1998
- [j16]Kouichi Kurokawa, Takumi Kasai:
Left-right trees, a new tree structure for machine translation. Syst. Comput. Jpn. 29(5): 84-91 (1998) - 1994
- [j15]Shigeki Iwata, Takumi Kasai:
The Othello game on an n*n board is PSPACE-complete. Theor. Comput. Sci. 123(2): 329-340 (1994) - [c6]Takumi Kasai, Shusaku Sawato, Shigeki Iwata:
Thirty four Comparisons are Required to Sort 13 Items. Logic, Language and Computation 1994: 260-269 - 1993
- [j14]Shigeki Iwata, Takumi Kasai, Etsuro Moriya:
Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. Acta Informatica 30(3): 267-278 (1993)
1980 – 1989
- 1989
- [j13]Zhi-Zhong Chen, Takumi Kasai:
Probabilistic automata push-down. Syst. Comput. Jpn. 20(6): 11-20 (1989) - 1987
- [j12]Shigeki Iwata, Takumi Kasai:
Simultaneous (Poly-Time, Log-Space) Lower Bounds. Theor. Comput. Sci. 54: 325-329 (1987) - 1986
- [j11]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): 179-185 (1986) - [j10]Shinichi Tanaka, Takumi Kasai:
The emptiness problem for indexed language is exponential-time complete. Syst. Comput. Jpn. 17(9): 29-37 (1986) - 1985
- [j9]Takumi Kasai, Shigeki Iwata:
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. Math. Syst. Theory 18(2): 153-170 (1985) - 1984
- [j8]Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Some Combinatorial Game Problems Require Omega(nk) Time. J. ACM 31(2): 361-376 (1984) - 1982
- [j7]Hajime Machida, Takumi Kasai:
Space Complexity in On-Line Computation. J. Comput. Syst. Sci. 24(3): 362-372 (1982) - [j6]Takumi Kasai, Raymond E. Miller:
Homomorphisms between Models of Parallel Computation. J. Comput. Syst. Sci. 25(3): 285-331 (1982) - 1981
- [c5]Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Low Level Complexity for Combinatorial Games. STOC 1981: 228-237 - 1980
- [j5]Takumi Kasai, Akeo Adachi:
A Characterization of Time Complexity by Simple Loop Programs. J. Comput. Syst. Sci. 20(1): 1-17 (1980) - [c4]Takumi Kasai, Akeo Adachi:
On polynominal time computable problems. Graph Theory and Algorithms 1980: 152-158
1970 – 1979
- 1979
- [j4]Takumi Kasai, Akeo Adachi, Shigeki Iwata:
Classes of Pebble Games and Complete Problems. SIAM J. Comput. 8(4): 574-586 (1979) - [c3]Raymond E. Miller, Takumi Kasai:
Comparing models of parallel computation by homomorphisms. COMPSAC 1979: 794-799 - [c2]Akeo Adachi, Takumi Kasai, Etsuro Moriya:
A Theoretical Study of the Time Analysis of Programs. MFCS 1979: 201-207 - 1978
- [c1]Takumi Kasai, Akeo Adachi, Shigeki Iwata:
Classes of pebble games and complete problems. ACM Annual Conference (2) 1978: 914-918 - 1975
- [j3]Takumi Kasai:
A Universal Context-Free Grammar. Inf. Control. 28(1): 30-34 (1975) - 1974
- [j2]Takumi Kasai:
Translatability of Flowcharts into While Programs. J. Comput. Syst. Sci. 9(2): 177-195 (1974) - 1970
- [j1]Takumi Kasai:
An Hierarchy Between Context-Free and Context-Sensitive Languages. J. Comput. Syst. Sci. 4(5): 492-508 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: