Programs with Minimal Goto Statements - Shigeki Iwata (Inf. Control., 1978)

Classes of Pebble Games and Complete Problems. - Takumi Kasai; Akeo Adachi; Shigeki Iwata (SIAM J. Comput., 1979)

Low Level Complexity for Combinatorial Games - Akeo Adachi; Shigeki Iwata; Takumi Kasai (STOC, 1981)

Some Combinatorial Game Problems Require Omega(nk) Time. - Akeo Adachi; Shigeki Iwata; Takumi Kasai (J. ACM, 1984)

Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. - Takumi Kasai; Shigeki Iwata (Math. Syst. Theory, 1985)

A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines - Etsuro Moriya; Shigeki Iwata; Takumi Kasai (Inf. Control., 1986)

Simultaneous (Poly-Time, Log-Space) Lower Bounds. - Shigeki Iwata; Takumi Kasai (Theor. Comput. Sci., 1987)

Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. - Shigeki Iwata; Takumi Kasai; Etsuro Moriya (Acta Informatica, 1993)

Thirty four Comparisons are Required to Sort 13 Items. - Takumi Kasai; Shusaku Sawato; Shigeki Iwata (Logic, Language and Computation, 1994)

The Othello game on an n*n board is PSPACE-complete. - Shigeki Iwata; Takumi Kasai (Theor. Comput. Sci., 1994)

Lower Bounds for Merging Networks. - Shigeki Iwata (Inf. Comput., 2001)

Some minimum merging networks. - Gembu Morohashi; Shigeki Iwata (Theor. Comput. Sci., 2004)

Horn Functions with a Single Two-Negated Term. - Naoki Kawamura; Shigeki Iwata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Stonehenge: Outcome of All First Moves and PSPACE-Completeness. - Yasuhiko Takenaga; Hikari Mori; Shigeki Iwata (J. Int. Comput. Games Assoc., 2010)

Posets with seven linear extensions sortable by three comparisons. - Satoshi Hanamura; Shigeki Iwata (Inf. Process. Lett., 2011)