The SCEAS System
| |||||||

## Search the dblp DataBase
Shigeki Iwata:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Akeo Adachi, Shigeki Iwata, Takumi Kasai
**Low Level Complexity for Combinatorial Games**[Citation Graph (0, 0)][DBLP] STOC, 1981, pp:228-237 [Conf] - 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] - Shigeki Iwata
**Lower Bounds for Merging Networks.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:168, n:2, pp:187-195 [Journal] - Shigeki Iwata
**Programs with Minimal Goto Statements**[Citation Graph (0, 0)][DBLP] Information and Control, 1978, v:37, n:1, pp:105-114 [Journal] - 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] - Akeo Adachi, Shigeki Iwata, Takumi Kasai
**Some Combinatorial Game Problems Require Omega(n**[Citation Graph (0, 0)][DBLP]^{k}) Time. J. ACM, 1984, v:31, n:2, pp:361-376 [Journal] - 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] - 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] - 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] - 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] - Gembu Morohashi, Shigeki Iwata
**Some minimum merging networks.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:329, n:1-3, pp:237-250 [Journal]
Search in 0.037secs, Finished in 0.037secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |