Chuzo Iwamoto

Chuzo Iwamoto, Yuta Mukai, Yuichi Sumida, Kenichi Morita: Generalized Chat Noir is PSPACE-Complete. IEICE Transactions 96-D(3): 502-505 (2013)

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)

Chuzo Iwamoto, Yoshihiro Wada, Kenichi Morita: Generalized Shisen-Sho is NP-Complete. IEICE Transactions 95-D(11): 2712-2715 (2012)

Chuzo Iwamoto, Yusuke Kitagaki, Kenichi Morita: Finding the Minimum Number of Face Guards is NP-Hard. IEICE Transactions 95-D(11): 2716-2719 (2012)

Chuzo Iwamoto, Junichi Kishi, Kenichi Morita: Lower Bound of Face Guards of Polyhedral Terrains. JIP 20(2): 435-437 (2012)

Chuzo Iwamoto, Kento Sasaki, Kenichi Morita: Computational Complexity of String Puzzles. CATS 2012: 69-74

Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita: NP-Hard and k-EXPSPACE-Hard Cast Puzzles. IEICE Transactions 93-D(11): 2995-3004 (2010)

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 Transactions 92-D(2): 255-257 (2009)

Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita: Computational Complexity of Cast Puzzles. ISAAC 2009: 122-131

Chuzo Iwamoto: Special Section on Foundations of Computer Science. IEICE Transactions 91-D(2): 161 (2008)

Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai: A Recursive Padding Technique on Nondeterministic Cellular Automata. IEICE Transactions 91-A(9): 2335-2340 (2008)

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

Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai: Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. Acta Inf. 44(5): 345-359 (2007)

Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai: A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520

Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita: A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. J. Cellular Automata 1(4): 275-297 (2006)

Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai: Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148

Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita: A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. IEICE Transactions 87-D(3): 694-699 (2004)

Chuzo Iwamoto, Maurice Margenstern: Time and Space Complexity Classes of Hyperbolic Cellular Automata. IEICE Transactions 87-D(3): 700-707 (2004)

Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai: Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. IEICE Transactions 87-D(3): 708-712 (2004)

Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto: Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs. J. Parallel Distrib. Comput. 64(3): 319-326 (2004)

Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu: Hierarchies of DLOGTIME-Uniform Circuits. MCU 2004: 211-222

Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. Fundam. Inform. 58(2003): 261-271 (2003)

Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: A quadratic speedup theorem for iterative arrays. Acta Inf. 38(11/12): 847-858 (2002)

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)

Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai: Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374

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

Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita: A three-dimensional uniquely parsable array grammar that generates and parses cubes. Electr. Notes Theor. Comput. Sci. 46: 339-354 (2001)

Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: Speeding-Up Cellular Automata by Alternations. MCU 2001: 240-251

Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai: On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326

Kazuo Iwama, Chuzo Iwamoto: A Canonical Form of Vector Machines. Inf. Comput. 141(1): 37-65 (1998)

Kazuo Iwama, Chuzo Iwamoto: Improved Time and Space Hierarchies of One-Tape Off-Line TMs. MFCS 1998: 580-588

Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa: A Faster Parallel Algorithm for k-Connectivity. Inf. Process. Lett. 61(5): 265-269 (1997)

Kazuo Iwama, Chuzo Iwamoto: alpha-Connectivity: A Gradually Nonparallel Graph Problem. J. Algorithms 20(3): 526-544 (1996)

Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed: Time Lower Bounds do not Exist for CRCW PRAMs. Theor. Comput. Sci. 155(2): 411-424 (1996)

Kazuo Iwama, Chuzo Iwamoto: Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. IEEE Conference on Computational Complexity 1996: 24-32

Chuzo Iwamoto, Godfried T. Toussaint: Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. Inf. Process. Lett. 52(4): 183-189 (1994)

Chuzo Iwamoto, Godfried T. Toussaint: Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. CCCG 1994: 93-98

Chuzo Iwamoto, Kazuo Iwama: Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. ISAAC 1994: 478-486

Chuzo Iwamoto, Kazuo Iwama: Rs-vector algorithms for combinational problems. Systems and Computers in Japan 24(7): 41-51 (1993)