Shigeki Iwata

According to our database1, Shigeki Iwata
  • authored at least 16 papers between 1978 and 2011.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2011
Posets with seven linear extensions sortable by three comparisons.
Inf. Process. Lett., 2011

2010
Stonehenge: Outcome of All First Moves and PSPACE-Completeness.
ICGA Journal, 2010

2005
Horn Functions with a Single Two-Negated Term.
IEICE Transactions, 2005

2004
Some minimum merging networks.
Theor. Comput. Sci., 2004

2001
Lower Bounds for Merging Networks.
Inf. Comput., 2001

1994
The Othello game on an n*n board is PSPACE-complete.
Theor. Comput. Sci., 1994

Thirty four Comparisons are Required to Sort 13 Items.
Proceedings of the Logic, 1994

1993
Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines.
Acta Inf., 1993

1987
Simultaneous (Poly-Time, Log-Space) Lower Bounds.
Theor. Comput. Sci., 1987

1986
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines
Information and Control, 1986

1985
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds.
Mathematical Systems Theory, 1985

1984
Some Combinatorial Game Problems Require Omega(nk) Time.
J. ACM, 1984

1981
Low Level Complexity for Combinatorial Games
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1979
Classes of Pebble Games and Complete Problems.
SIAM J. Comput., 1979

1978
Programs with Minimal Goto Statements
Information and Control, April, 1978

Classes of pebble games and complete problems.
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978


  Loading...