default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChuzo Iwamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j44]Chuzo Iwamoto, Takeru Tokunaga:
Choco Banana is NP-Complete. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(9): 1488-1491 (2024)- [j43]Chuzo Iwamoto, Tatsuya Ide:
Chained Block is NP-Complete. IEICE Trans. Inf. Syst. 107(3): 320-324 (2024) - 2023
- [j42]Chuzo Iwamoto, Tatsuya Ide:
Calculation Solitaire is NP-Complete. IEICE Trans. Inf. Syst. 106(3): 328-332 (2023) - [j41]Chuzo Iwamoto, Tatsuaki Ibusuki:
Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem. IEICE Trans. Inf. Syst. 106(9): 1499-1506 (2023) - 2022
- [j40]Chuzo Iwamoto, Tatsuya Ide:
Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1187-1194 (2022) - [j39]Chuzo Iwamoto, Tatsuya Ide:
Five Cells and Tilepaint are NP-Complete. IEICE Trans. Inf. Syst. 105-D(3): 508-516 (2022) - [c23]Chuzo Iwamoto
, Tatsuaki Ibusuki:
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard. WALCOM 2022: 111-122 - 2021
- [j38]Chuzo Iwamoto, Tatsuaki Ibusuki:
Chromatic Art Gallery Problem with r-Visibility is NP-Complete. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1108-1115 (2021) - 2020
- [j37]Chuzo Iwamoto, Tatsuaki Ibusuki:
Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles. IEICE Trans. Inf. Syst. 103-D(3): 500-505 (2020) - [j36]Chuzo Iwamoto, Tatsuya Ide:
Computational Complexity of Nurimisaki and Sashigane. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1183-1192 (2020) - [c22]Chuzo Iwamoto, Tatsuaki Ibusuki:
Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. WALCOM 2020: 146-157
2010 – 2019
- 2019
- [j35]Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki:
Computational Complexity of Herugolf and Makaro. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1118-1125 (2019) - [c21]Chuzo Iwamoto, Tatsuya Ide:
Nurimisaki and Sashigane are NP-complete. CCCG 2019: 184-194 - 2018
- [j34]Chuzo Iwamoto, Masato Haruishi:
Computational Complexity of Usowan Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1537-1540 (2018) - [j33]Chuzo Iwamoto, Tatsuaki Ibusuki:
Dosun-Fuwari is NP-complete. J. Inf. Process. 26: 358-361 (2018) - [c20]Chuzo Iwamoto, Masato Haruishi, Tatsuaki Ibusuki:
Herugolf and Makaro are NP-complete. FUN 2018: 24:1-24:11 - [c19]Chuzo Iwamoto, Tatsuaki Ibusuki:
Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan. JCDCGGG 2018: 175-185 - 2017
- [j32]Chuzo Iwamoto:
Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard. IEICE Trans. Inf. Syst. 100-D(7): 1521-1525 (2017) - 2016
- [j31]Chuzo Iwamoto, Yusuke Kitagaki:
Visibility Problems for Manhattan Towers. IEICE Trans. Inf. Syst. 99-D(3): 607-614 (2016) - [j30]Chuzo Iwamoto, Yuta Matsui:
Computational Complexity of Building Puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1145-1148 (2016) - 2015
- [j29]Chuzo Iwamoto, Yuta Matsui:
Computational Complexity of Generalized Forty Thieves. IEICE Trans. Inf. Syst. 98-D(2): 429-432 (2015) - [j28]Chuzo Iwamoto:
Computational Complexity of Generalized Golf Solitaire. IEICE Trans. Inf. Syst. 98-D(3): 541-544 (2015) - 2014
- [j27]Chuzo Iwamoto:
Yosenabe is NP-complete. J. Inf. Process. 22(1): 40-43 (2014) - 2013
- [j26]Chuzo Iwamoto, Yuta Mukai, Yuichi Sumida, Kenichi Morita:
Generalized Chat Noir is PSPACE-Complete. IEICE Trans. Inf. Syst. 96-D(3): 502-505 (2013) - [j25]Chuzo Iwamoto, Yuta Matsui:
Generalized Pyramid is NP-Complete. IEICE Trans. Inf. Syst. 96-D(11): 2462-2465 (2013) - [c18]Kota Sato, Katsunobu Imai, Chuzo Iwamoto:
Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings. CANDAR 2013: 515-521 - [c17]Chuzo Iwamoto, Toshihiko Kume:
Computational Complexity of the r -visibility Guard Set Problem for Polyominoes. JCDCGG 2013: 87-95 - 2012
- [j24]Chuzo Iwamoto, Kento Sasaki, Kenichi Morita:
A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem. Algorithms 5(2): 261-272 (2012) - [j23]Chuzo Iwamoto, Yoshihiro Wada, Kenichi Morita:
Generalized Shisen-Sho is NP-Complete. IEICE Trans. Inf. Syst. 95-D(11): 2712-2715 (2012) - [j22]Chuzo Iwamoto, Yusuke Kitagaki, Kenichi Morita:
Finding the Minimum Number of Face Guards is NP-Hard. IEICE Trans. Inf. Syst. 95-D(11): 2716-2719 (2012) - [j21]Chuzo Iwamoto, Junichi Kishi, Kenichi Morita:
Lower Bound of Face Guards of Polyhedral Terrains. Inf. Media Technol. 7(2): 737-739 (2012) - [j20]Chuzo Iwamoto, Junichi Kishi, Kenichi Morita:
Lower Bound of Face Guards of Polyhedral Terrains. J. Inf. Process. 20(2): 435-437 (2012) - [c16]Chuzo Iwamoto, Kento Sasaki, Kenichi Morita:
Computational Complexity of String Puzzles. CATS 2012: 69-74 - 2010
- [j19]Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita:
NP-Hard and k-EXPSPACE-Hard Cast Puzzles. IEICE Trans. Inf. Syst. 93-D(11): 2995-3004 (2010)
2000 – 2009
- 2009
- [j18]Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four. IEICE Trans. Inf. Syst. 92-D(2): 255-257 (2009) - [c15]Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita:
Computational Complexity of Cast Puzzles. ISAAC 2009: 122-131 - [c14]Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, Kenichi Morita:
On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata. IWNC 2009: 184-190 - 2008
- [j17]Chuzo Iwamoto:
Special Section on Foundations of Computer Science. IEICE Trans. Inf. Syst. 91-D(2): 161 (2008) - [j16]Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai:
A Recursive Padding Technique on Nondeterministic Cellular Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2335-2340 (2008) - [c13]Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life. Automata 2008: 413-416 - 2007
- [j15]Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai:
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. Acta Informatica 44(5): 345-359 (2007) - [c12]Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520 - 2006
- [j14]Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. J. Cell. Autom. 1(4): 275-297 (2006) - 2005
- [c11]Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai:
Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148 - 2004
- [j13]Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita:
A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. IEICE Trans. Inf. Syst. 87-D(3): 694-699 (2004) - [j12]Chuzo Iwamoto, Maurice Margenstern:
Time and Space Complexity Classes of Hyperbolic Cellular Automata. IEICE Trans. Inf. Syst. 87-D(3): 700-707 (2004) - [j11]Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai:
Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. IEICE Trans. Inf. Syst. 87-D(3): 708-712 (2004) - [j10]Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto:
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs. J. Parallel Distributed Comput. 64(3): 319-326 (2004) - [c10]Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu:
Hierarchies of DLOGTIME-Uniform Circuits. MCU 2004: 211-222 - 2003
- [j9]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. Fundam. Informaticae 58(2003): 261-271 (2003) - 2002
- [j8]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
A quadratic speedup theorem for iterative arrays. Acta Informatica 38(11/12): 847-858 (2002) - [j7]Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
Constructible functions in cellular automata and their applications to hierarchy results. Theor. Comput. Sci. 270(1-2): 797-809 (2002) - [c9]Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374 - [c8]Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita:
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. UMC 2002: 164-175 - 2001
- [c7]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Speeding-Up Cellular Automata by Alternations. MCU 2001: 240-251 - [c6]Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita:
A three-dimensional uniquely parsable array grammar that generates and parses cubes. IWCIA 2001: 339-354
1990 – 1999
- 1999
- [c5]Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326 - 1998
- [j6]Kazuo Iwama, Chuzo Iwamoto:
A Canonical Form of Vector Machines. Inf. Comput. 141(1): 37-65 (1998) - [c4]Kazuo Iwama, Chuzo Iwamoto:
Improved Time and Space Hierarchies of One-Tape Off-Line TMs. MFCS 1998: 580-588 - 1997
- [j5]Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa:
A Faster Parallel Algorithm for k-Connectivity. Inf. Process. Lett. 61(5): 265-269 (1997) - 1996
- [j4]Kazuo Iwama, Chuzo Iwamoto:
alpha-Connectivity: A Gradually Nonparallel Graph Problem. J. Algorithms 20(3): 526-544 (1996) - [j3]Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed:
Time Lower Bounds do not Exist for CRCW PRAMs. Theor. Comput. Sci. 155(2): 411-424 (1996) - [c3]Kazuo Iwama, Chuzo Iwamoto:
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. CCC 1996: 24-32 - 1994
- [j2]Chuzo Iwamoto, Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. Inf. Process. Lett. 52(4): 183-189 (1994) - [c2]Chuzo Iwamoto, Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. CCCG 1994: 93-98 - [c1]Chuzo Iwamoto, Kazuo Iwama:
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. ISAAC 1994: 478-486 - 1993
- [j1]Chuzo Iwamoto, Kazuo Iwama:
Rs-vector algorithms for combinational problems. Syst. Comput. Jpn. 24(7): 41-51 (1993)
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-09-07 00:56 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:
