Shigeki Iwata

16 papers A* 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2011 J jnl
Posets with seven linear extensions sortable by three comparisons.
Inf. Process. Lett.
Satoshi Hanamura, Shigeki Iwata
2010 J jnl
Stonehenge: Outcome of All First Moves and PSPACE-Completeness.
ICGA J.
Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata
2005 J jnl
Horn Functions with a Single Two-Negated Term.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Naoki Kawamura, Shigeki Iwata
2004 J jnl
Some minimum merging networks.
Theor. Comput. Sci.
Gembu Morohashi, Shigeki Iwata
2001 J jnl
Lower Bounds for Merging Networks.
Inf. Comput.
Shigeki Iwata
1994 J jnl
The Othello game on an n*n board is PSPACE-complete.
Theor. Comput. Sci.
Shigeki Iwata, Takumi Kasai
1994 — conf
Thirty four Comparisons are Required to Sort 13 Items.
Logic, Language and Computation
Takumi Kasai, Shusaku Sawato, Shigeki Iwata
1993 J jnl
Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines.
Acta Informatica
Shigeki Iwata, Takumi Kasai, Etsuro Moriya
1987 J jnl
Simultaneous (Poly-Time, Log-Space) Lower Bounds.
Theor. Comput. Sci.
Shigeki Iwata, Takumi Kasai
1986 J jnl
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines
Inf. Control.
Etsuro Moriya, Shigeki Iwata, Takumi Kasai
1985 J jnl
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds.
Math. Syst. Theory
Takumi Kasai, Shigeki Iwata
1984 J jnl
Some Combinatorial Game Problems Require Omega(n
J. ACM
Akeo Adachi, Shigeki Iwata, Takumi Kasai
1981 A* conf
Low Level Complexity for Combinatorial Games
STOC
Akeo Adachi, Shigeki Iwata, Takumi Kasai
1979 J jnl
Classes of Pebble Games and Complete Problems.
SIAM J. Comput.
Takumi Kasai, Akeo Adachi, Shigeki Iwata
1978 — conf
Classes of pebble games and complete problems.
ACM Annual Conference (2)
Takumi Kasai, Akeo Adachi, Shigeki Iwata
1978 J jnl
Programs with Minimal Goto Statements
Inf. Control.
Shigeki Iwata