| 2005 | 
|---|
| 14 | EE | Naoki Kawamura,
Shigeki Iwata:
Horn Functions with a Single Two-Negated Term.
IEICE Transactions 88-A(11): 3264-3266 (2005) | 
| 2004 | 
|---|
| 13 | EE | Gembu Morohashi,
Shigeki Iwata:
Some minimum merging networks.
Theor. Comput. Sci. 329(1-3): 237-250 (2004) | 
| 2001 | 
|---|
| 12 |  | Shigeki Iwata:
Lower Bounds for Merging Networks.
Inf. Comput. 168(2): 187-195 (2001) | 
| 1994 | 
|---|
| 11 |  | Takumi Kasai,
Shusaku Sawato,
Shigeki Iwata:
Thirty four Comparisons are Required to Sort 13 Items.
Logic, Language and Computation 1994: 260-269 | 
| 10 |  | Shigeki Iwata,
Takumi Kasai:
The Othello game on an n*n board is PSPACE-complete.
Theor. Comput. Sci. 123(2): 329-340 (1994) | 
| 1993 | 
|---|
| 9 |  | Shigeki Iwata,
Takumi Kasai,
Etsuro Moriya:
Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines.
Acta Inf. 30(3): 267-278 (1993) | 
| 1987 | 
|---|
| 8 |  | Shigeki Iwata,
Takumi Kasai:
Simultaneous (Poly-Time, Log-Space) Lower Bounds.
Theor. Comput. Sci. 54: 325-329 (1987) | 
| 1986 | 
|---|
| 7 |  | Etsuro Moriya,
Shigeki Iwata,
Takumi Kasai:
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines
Information and Control 70(2/3): 179-185 (1986) | 
| 1985 | 
|---|
| 6 |  | Takumi Kasai,
Shigeki Iwata:
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds.
Mathematical Systems Theory 18(2): 153-170 (1985) | 
| 1984 | 
|---|
| 5 | EE | Akeo Adachi,
Shigeki Iwata,
Takumi Kasai:
Some Combinatorial Game Problems Require Omega(nk) Time.
J. ACM 31(2): 361-376 (1984) | 
| 1981 | 
|---|
| 4 |  | Akeo Adachi,
Shigeki Iwata,
Takumi Kasai:
Low Level Complexity for Combinatorial Games
STOC 1981: 228-237 | 
| 1979 | 
|---|
| 3 |  | Takumi Kasai,
Akeo Adachi,
Shigeki Iwata:
Classes of Pebble Games and Complete Problems.
SIAM J. Comput. 8(4): 574-586 (1979) | 
| 1978 | 
|---|
| 2 | EE | Takumi Kasai,
Akeo Adachi,
Shigeki Iwata:
Classes of pebble games and complete problems.
ACM Annual Conference (2) 1978: 914-918 | 
| 1 |  | Shigeki Iwata:
Programs with Minimal Goto Statements
Information and Control 37(1): 105-114 (1978) |