Search the dblp DataBase

Publications of Author

1. Takumi Kasai, Akeo Adachi, Shigeki Iwata
   Classes of pebble games and complete problems. [Citation Graph (0, 0)][DBLP]
   ACM Annual Conference (2), 1978, pp:914-918 [Conf]
   
2. Takumi Kasai, Shusaku Sawato, Shigeki Iwata
   Thirty four Comparisons are Required to Sort 13 Items. [Citation Graph (0, 0)][DBLP]
   Logic, Language and Computation, 1994, pp:260-269 [Conf]
   
3. Takumi Kasai, Akeo Adachi
   On polynominal time computable problems. [Citation Graph (0, 0)][DBLP]
   Graph Theory and Algorithms, 1980, pp:152-158 [Conf]
   
4. Akeo Adachi, Takumi Kasai, Etsuro Moriya
   A Theoretical Study of the Time Analysis of Programs. [Citation Graph (0, 0)][DBLP]
   MFCS, 1979, pp:201-207 [Conf]
   
5. Akeo Adachi, Shigeki Iwata, Takumi Kasai
   Low Level Complexity for Combinatorial Games [Citation Graph (0, 0)][DBLP]
   STOC, 1981, pp:228-237 [Conf]
   
6. Shigeki Iwata, Takumi Kasai, Etsuro Moriya
   Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1993, v:30, n:3, pp:267-278 [Journal]
   
7. Takumi Kasai
   A Universal Context-Free Grammar [Citation Graph (0, 0)][DBLP]
   Information and Control, 1975, v:28, n:1, pp:30-34 [Journal]
   
8. Etsuro Moriya, Shigeki Iwata, Takumi Kasai
   A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines [Citation Graph (0, 0)][DBLP]
   Information and Control, 1986, v:70, n:2/3, pp:179-185 [Journal]
   
9. Akeo Adachi, Shigeki Iwata, Takumi Kasai
   Some Combinatorial Game Problems Require Omega(n^k) Time. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1984, v:31, n:2, pp:361-376 [Journal]
   
10. Takumi Kasai
    An Hierarchy Between Context-Free and Context-Sensitive Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:5, pp:492-508 [Journal]
    
11. Takumi Kasai
    Translatability of Flowcharts into While Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:2, pp:177-195 [Journal]
    
12. Takumi Kasai, Akeo Adachi
    A Characterization of Time Complexity by Simple Loop Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:1-17 [Journal]
    
13. Takumi Kasai, Raymond E. Miller
    Homomorphisms between Models of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:3, pp:285-331 [Journal]
    
14. Hajime Machida, Takumi Kasai
    Space Complexity in On-Line Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:24, n:3, pp:362-372 [Journal]
    
15. Akio Fujiyoshi, Takumi Kasai
    Spinal-Formed Context-Free Tree Grammars. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:1, pp:59-83 [Journal]
    
16. Takumi Kasai, Shigeki Iwata
    Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1985, v:18, n:2, pp:153-170 [Journal]
    
17. Kouichi Kurokawa, Takumi Kasai
    Left-right trees, a new tree structure for machine translation. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 1998, v:29, n:5, pp:84-91 [Journal]
    
18. Katsuhiko Takahashi, Akio Fujiyoshi, Takumi Kasai
    A polynomial time algorithm to infer sequential machines. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 2003, v:34, n:1, pp:59-67 [Journal]
    
19. Takumi Kasai, Akeo Adachi, Shigeki Iwata
    Classes of Pebble Games and Complete Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:574-586 [Journal]
    
20. Shigeki Iwata, Takumi Kasai
    Simultaneous (Poly-Time, Log-Space) Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:325-329 [Journal]
    
21. Shigeki Iwata, Takumi Kasai
    The Othello game on an n*n board is PSPACE-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:329-340 [Journal]