default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShigeki Iwata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j13]Satoshi Hanamura, Shigeki Iwata:
Posets with seven linear extensions sortable by three comparisons. Inf. Process. Lett. 111(8): 365-369 (2011)- 2010
- [j12]Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata:
Stonehenge: Outcome of All First Moves and PSPACE-Completeness. J. Int. Comput. Games Assoc. 33(1): 34-41 (2010)
2000 – 2009
- 2005
- [j11]Naoki Kawamura, Shigeki Iwata:
Horn Functions with a Single Two-Negated Term. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(11): 3264-3266 (2005) - 2004
- [j10]Gembu Morohashi, Shigeki Iwata:
Some minimum merging networks. Theor. Comput. Sci. 329(1-3): 237-250 (2004) - 2001
- [j9]Shigeki Iwata:
Lower Bounds for Merging Networks. Inf. Comput. 168(2): 187-195 (2001)
1990 – 1999
- 1994
- [j8]Shigeki Iwata, Takumi Kasai:
The Othello game on an n*n board is PSPACE-complete. Theor. Comput. Sci. 123(2): 329-340 (1994) - [c3]Takumi Kasai, Shusaku Sawato, Shigeki Iwata:
Thirty four Comparisons are Required to Sort 13 Items. Logic, Language and Computation 1994: 260-269 - 1993
- [j7]Shigeki Iwata, Takumi Kasai, Etsuro Moriya:
Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. Acta Informatica 30(3): 267-278 (1993)
1980 – 1989
- 1987
- [j6]Shigeki Iwata, Takumi Kasai:
Simultaneous (Poly-Time, Log-Space) Lower Bounds. Theor. Comput. Sci. 54: 325-329 (1987) - 1986
- [j5]Etsuro Moriya, Shigeki Iwata, Takumi Kasai:
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines. Inf. Control. 70(2/3): 179-185 (1986) - 1985
- [j4]Takumi Kasai, Shigeki Iwata:
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds. Math. Syst. Theory 18(2): 153-170 (1985) - 1984
- [j3]Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Some Combinatorial Game Problems Require Omega(nk) Time. J. ACM 31(2): 361-376 (1984) - 1981
- [c2]Akeo Adachi, Shigeki Iwata, Takumi Kasai:
Low Level Complexity for Combinatorial Games. STOC 1981: 228-237
1970 – 1979
- 1979
- [j2]Takumi Kasai, Akeo Adachi, Shigeki Iwata:
Classes of Pebble Games and Complete Problems. SIAM J. Comput. 8(4): 574-586 (1979) - 1978
- [j1]Shigeki Iwata:
Programs with Minimal Goto Statements. Inf. Control. 37(1): 105-114 (1978) - [c1]Takumi Kasai, Akeo Adachi, Shigeki Iwata:
Classes of pebble games and complete problems. ACM Annual Conference (2) 1978: 914-918
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
