CURRICULUM VITAE
Education:
1986-1990 Faculty of Engineering, Yamaguchi University.
(Bachelor of Engineering)
1990-1992 Department of Computer Science and Communication
Engineering, Kyushu University.
(Master of Engineering)
1992-1993 School of Computer Science, McGill University, Montreal.
Visiting Student. Funded by Japanese Government.
1992-1995 Department of Computer Science and Communication
Engineering, Kyushu University.
(Doctor of Engineering)
Employment:
1995-1995 Research Associate, Kyushu University.
1995-1997 Lecturer, Kyushu Institute of Design.
1997-2014 Associate Professor, Hiroshima University.
2014 Professor, Hiroshima University.
Visiting Positions:
2001 Apr - 2001 May
Universite de Metz, France
2002 Oct - 2003 Sep
Universite de Metz, France
(Monbusho-Sponsored Japanese Overseas Research Fellow)
Grants:
1993-1995 The Ministry of Education, Science, Sports and Culture
(JSPS Research Fellowships for Young Scientists)
No. 1149, JPY 1,800,000
1997-1998 The Ministry of Education, Science, Sports and Culture
(Grant-in-Aid for Encouragement of Young Scientists (A))
No. 09780297, JPY 2,000,000
1999-2000 The Ministry of Education, Science, Sports and Culture
(Grant-in-Aid for Encouragement of Young Scientists (A))
No. 11780277, JPY 1,800,000
2001 The Telecommunications Advancement Foundation
JPY 839,000
2001-2002 The Ministry of Education, Science, Sports and Culture
(Grant-in-Aid for Encouragement of Young Scientists (A))
No. 13780241, JPY 1,800,000
2002-2003 Monbusho-Sponsored Japanese Overseas Research Fellow
2004-2006 The Ministry of Education, Science, Sports and Culture
(Grant-in-Aid for Young Scientists (B))
No. 16700015, JPY 2,400,000
2007-2010 Japan Society for the Promotion of Science
(Grant-in-Aid for Scientific Research (C))
No. 19500014, JPY 2,500,000
2011-2016 Japan Society for the Promotion of Science
(Grant-in-Aid for Scientific Research (C))
No. 23500018, JPY 3,900,000
2016-2021 Japan Society for the Promotion of Science
(Grant-in-Aid for Scientific Research (C))
No. 16K00020, JPY 3,500,000
2023-2027 Japan Society for the Promotion of Science
(Grant-in-Aid for Scientific Research (C))
No. 23K10987, JPY 3,700,000
Awards and Fellowships:
1993 Mar Awarded "Telecom-Columbus Award" from the
Telecommunications Advancement Foundation
1993-1995 Research Fellow of Japan Society for the Promotion of
Science (JSPS)
2008 Jan Awarded "2007 EATCS/LA Best Presentation Award" from the
EATCS Japan Chapter and LA Symposium
2009 Dec Awarded "The ISS Distinguished Service Award" from the
IEICE Information and Systems Society (ISS)
(Contribution as an editor of IEICE Transactions)
2011 Jun Awarded "The ISS Distinguished Reviewer Award" from the
IEICE Information and Systems Society (ISS)
(Contribution as a reviewer of IEICE Transactions)
2018 Feb Awarded "2017 EATCS/LA Best Presentation Award" from the
EATCS Japan Chapter and LA Symposium
Refereed Journal Papers:
[1] Chuzo Iwamoto and Junnosuke Tanigami, "Shinkamino is
NP-complete", IEICE Transactions on Information and Systems
(Japanese Edition), Vol. J108-D, No. 3, pp. 1-5 (2025)
[2] Chuzo Iwamoto and Ryo Takaishi, "Computational Complexity of
Yajisan-Kazusan and Stained Glass", IEICE Transactions on
Information and Systems, Vol. E108-D, No. 3, pp. 1-7 (2025)
[3] Chuzo Iwamoto and Takeru Tokunaga, "Choco Banana is
NP-complete", IEICE Transactions on Fundamentals of Electronics,
Communications and Computer Sciences, Vol. E107-A, No. 9,
pp. 1488-1491 (2024) doi:10.1587/transfun.2023DML0001
[4] Chuzo Iwamoto and Tatsuya Ide, "Chained Block is NP-complete",
IEICE Transactions on Information and Systems, Vol. E107-D,
No. 3, pp. 320-324 (2024) doi:10.1587/transinf.2023FCL0001
[5] Chuzo Iwamoto and Tatsuaki Ibusuki, "Computational Complexity of
the Vertex-to-Point Conflict-Free Chromatic Art Gallery
Problem", IEICE Transactions on Information and Systems,
Vol. E106-D, No. 9, pp. 1499-1506 (2023)
doi:10.1587/transinf.2022EDP7222
[6] Chuzo Iwamoto and Suzuka Oda, "Computational Complexity of
Sukoro", IEICE Transactions on Information and Systems (Japanese
Edition), Vol. J106-D, No. 5, pp. 357-361 (2023)
doi:10.14923/transinfj.2022JDL8010
[7] Chuzo Iwamoto and Tatsuya Ide, "Calculation Solitaire is
NP-complete", IEICE Transactions on Information and Systems,
Vol. E106-D, No. 3, pp. 328-332 (2023)
doi:10.1587/transinf.2022FCL0002
[8] Chuzo Iwamoto and Tatsuya Ide, "Moon-or-Sun, Nagareru, and
Nurimeizu are NP-complete", IEICE Transactions on Fundamentals
of Electronics, Communications and Computer Sciences,
Vol. E105-A, No. 9, pp. 1187-1194 (2022)
doi:10.1587/transfun.2021DMP0006
[9] Chuzo Iwamoto and Tatsuya Ide, "Five Cells and Tilepaint are
NP-complete", IEICE Transactions on Information and Systems,
Vol. E105-D, No. 3, pp. 508-516 (2022)
doi:10.1587/transinf.2021FCP0001
[10] Chuzo Iwamoto and Tatsuaki Ibusuki, "Computational Complexity of
Two Pencil Puzzles: Kurotto and Juosan", Lecture Notes in
Computer Science, Springer-Verlag, J.Akiyama et al. (Eds.),
vol. 13034, pp. 175-185 (2021) doi:10.1007/978-3-030-90048-9_14
[11] Chuzo Iwamoto and Tatsuaki Ibusuki, "Chromatic Art Gallery
Problem with r-visibility is NP-complete", IEICE Transactions on
Fundamentals of Electronics, Communications and Computer
Sciences, Vol. E104-A, No. 9, pp. 1108-1115 (2021)
doi:10.1587/transfun.2020DMP0006
[12] Chuzo Iwamoto and Tatsuya Ide, "Computational Complexity of
Nurimisaki and Sashigane", IEICE Transactions on Fundamentals of
Electronics, Communications and Computer Sciences, Vol. E103-A,
No. 10, pp. 1183-1192 (2020) doi:10.1587/transfun.2019DMP0002
[13] Chuzo Iwamoto and Tatsuaki Ibusuki, "Polynomial-Time Reductions
from 3SAT to Kurotto and Juosan Puzzles", IEICE Transactions on
Information and Systems, Vol. E103-D, No. 3, pp. 500-505 (2020)
doi:10.1587/transinf.2019FCP0004
[14] Chuzo Iwamoto, Masato Haruishi, and Tatsuaki Ibusuki,
"Computational Complexity of Herugolf and Makaro", IEICE
Transactions on Fundamentals of Electronics, Communications and
Computer Sciences, Vol. E102-A, No. 9, pp. 1118-1125 (2019)
doi:10.1587/transfun.E102.A.1118
[15] Chuzo Iwamoto and Masato Haruishi, "Computational Complexity of
Usowan Puzzles", IEICE Transactions on Fundamentals of
Electronics, Communications and Computer Sciences, Vol. E101-A,
No. 9, pp. 1537-1540 (2018) doi:10.1587/transfun.E101.A.1537
[16] Chuzo Iwamoto and Tatsuaki Ibusuki, "Dosun-Fuwari is
NP-complete", Journal of Information Processing, Vol. 26,
pp. 358-361 (2018) doi:10.2197/ipsjjip.26.358
[17] Chuzo Iwamoto and Masato Haruishi, "NP-completeness of
Mojipittan", IEICE Transactions on Information and Systems
(Japanese Edition), Vol. J100-D, No. 12, pp. 974-977 (2017)
doi:10.14923/transinfj.2017JDL8016
[18] Chuzo Iwamoto, "Finding the Minimum Number of Open-Edge Guards
in an Orthogonal Polygon is NP-hard", IEICE Transactions on
Information and Systems, Vol. E100-D, No. 7, pp. 1521-1525
(2017) doi:10.1587/transinf.2016EDL8251
[19] Chuzo Iwamoto and Yuta Matsui, "Computational Complexity of
Building Puzzles", IEICE Transactions on Fundamentals of
Electronics, Communications and Computer Sciences, Vol. E99-A,
No. 6, pp. 1145-1148 (2016) doi:10.1587/transfun.E99.A.1145
[20] Chuzo Iwamoto and Yusuke Kitagaki, "Visibility Problems for
Manhattan Towers", IEICE Transactions on Information and
Systems, Vol. E99-D, No. 3, pp. 607-614 (2016)
doi:10.1587/transinf.2015FCP0007
[21] Chuzo Iwamoto, "Computational Complexity of Generalized Golf
Solitaire", IEICE Transactions on Information and Systems,
Vol. E98-D, No. 3, pp. 541-544 (2015)
doi:10.1587/transinf.2014FCL0001
[22] Chuzo Iwamoto and Yuta Matsui, "Computational Complexity of
Generalized Forty Thieves", IEICE Transactions on Information
and Systems, Vol. E98-D, No. 2, pp. 429-432 (2015)
doi:10.1587/transinf.2014EDL8154
[23] Chuzo Iwamoto, "Yosenabe is NP-complete", Journal of Information
Processing, Vol. 22, No. 1, pp. 40-43 (2014)
doi:10.2197/ipsjjip.22.40
[24] Chuzo Iwamoto and Toshihiko Kume, "Computational Complexity of
the r-visibility Guard Set Problem for Polyominoes", Lecture
Notes in Computer Science, Springer-Verlag, vol. 8845, pp. 87-95
(2014) doi:10.1007/978-3-319-13287-7_8
[25] Chuzo Iwamoto and Yuta Matsui, "Generalized Pyramid is
NP-complete", IEICE Transactions on Information and Systems,
Vol. E96-D, No. 11, pp. 2462-2465 (2013)
doi:10.1587/transinf.E96.D.2462
[26] Chuzo Iwamoto, Yuta Mukai, Yuichi Sumida, and Kenichi Morita,
"Generalized Chat Noir is PSPACE-complete", IEICE Transactions
on Information and Systems, Vol. E96-D, No. 3, pp. 502-505
(2013) doi:10.1587/transinf.E96.D.1
[27] Chuzo Iwamoto, Kento Sasaki, and Kenichi Morita, "A
Polynomial-Time Reduction from the 3SAT Problem to the
Generalized String Puzzle Problem", Algorithms, Vol. 5, No. 2,
pp. 261-272 (2012) doi:10.3390/a5020261
[28] Chuzo Iwamoto, Yusuke Kitagaki, and Kenichi Morita, "Finding the
Minimum Number of Face Guards is NP-hard", IEICE Transactions on
Information and Systems, Vol. E95-D, No. 11, pp. 2716-2719
(2012) doi:10.1587/transinf.E95.D.2716
[29] Chuzo Iwamoto, Junichi Kishi, and Kenichi Morita, "Lower Bound
of Face Guards of Polyhedral Terrains", Journal of Information
Processing, Vol. 20, No. 2, pp. 435-437 (2012)
doi:10.2197/ipsjjip.20.435
[30] Chuzo Iwamoto, Yoshihiro Wada, and Kenichi Morita, "Generalized
Shisen-Sho is NP-complete", IEICE Transactions on Information
and Systems, Vol. E95-D, No. 11, pp. 2712-2715 (2012)
doi:10.1587/transinf.E95.D.2712
[31] Chuzo Iwamoto and Takumi Kuranobu, "Improved Lower and Upper
Bounds of Face Guards of Polyhedral Terrains", IEICE
Transactions on Information and Systems (Japanese Edition),
Vol. J95-D, No. 10, pp. 1869-1872 (2012)
[32] Chuzo Iwamoto, Yusuke Ono, Kenichi Morita, and Katsunobu Imai,
"Relationship between Depth and Nondeterministic Gates in
Nondeterministic Circuit Families", IPSJ Journal, Vol. 52,
No. 4, pp. 1667-1677 (2011) (in Japanese)
[33] Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, and Kenichi Morita,
"NP-hard and k-EXPSPACE-hard Cast Puzzles", IEICE Transactions
on Information and Systems, Vol. E93-D, No. 11, pp. 2995-3004,
November 2010, doi:10.1587/transinf.E93.D.2995
[34] Chuzo Iwamoto, Daisuke Tachibana, Seiki Tokunaga, and Kenichi
Morita, "A Tight Space-Hierarchy Theorem for Nondeterministic
Turing Machines", IEICE Transactions on Information and Systems
(Japanese Edition), Vol. J93-D, No. 9, pp. 1717-1726, September
2010
[35] Chuzo Iwamoto and Reijiro Mikamo, "An Efficient Reconstruction
Algorithm for Restricted Domino Tilings", IEICE Transactions on
Information and Systems (Japanese Edition), Vol. J92-D, No. 6,
June 2009, pp. 758-766
[36] Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, and 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 on Information and
Systems, Vol. E92-D, No. 2 (2009) pp. 255-257,
doi:10.1587/transinf.E92.D.255
[37] Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, and Katsunobu
Imai, "A Recursive Padding Technique on Nondeterministic
Cellular Automata", IEICE Transactions on Fundamentals of
Electronics, Communications and Computer Sciences, Vol. E91-A,
No. 9 (2008) pp. 2335-2340, doi:10.1093/ietfec/e91-a.9.2335
[38] Chuzo Iwamoto, "Special Section on Foundations of Computer
Science", IEICE Transactions on Information and Systems,
Vol. E91-D, No. 2 (2008) pp. 161, doi:10.1093/ietisy/e91-d.2.161
[39] Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi
Morita, and Katsunobu Imai, "Translational Lemmas for
DLOGTIME-uniform Circuits, Alternating TMs, and PRAMs", Acta
Informatica, Vol. 44, No. 5 (2007) pp. 345-359,
doi:10.1007/s00236-007-0051-2
[40] Katsunobu Imai, Chuzo Iwamoto, and Kenichi Morita, "A Five-State
von Neumann Neighbor Universal Hyperbolic Cellular Automaton",
Journal of Cellular Automata, Vol. 1, No. 4 (2007) pp. 275-297
[41] Chuzo Iwamoto and Maurice Margenstern, "Time and Space
Complexity Classes of Hyperbolic Cellular Automata", IEICE
Transactions on Information and Systems, Vol. E87-D, No. 3
(2004) pp. 700-707
[42] Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, and Katsunobu
Imai, "Prefix Computations on Iterative Arrays with Sequential
Input/Output Mode", IEICE Transactions on Information and
Systems, Vol. E87-D, No. 3 (2004) pp. 708-712
[43] Toshiyuki Fujiwara, Kazuo Iwama, and Chuzo Iwamoto, "Partially
Effective Randomization in Simulations Between ARBITRARY and
COMMON PRAMs", Journal of Parallel and Distributed Computing,
Vol. 64, No. 3 (2004) pp. 319-326,
doi:10.1016/j.jpdc.2003.12.001
[44] Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, and Kenichi
Morita, "A Logically Universal Number-Conserving Cellular
Automaton with a Unary Table-Lookup Function", IEICE
Transactions on Information and Systems, Vol. E87-D, No. 3
(2004) pp. 694-699
[45] Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, and Katsunobu
Imai, "Simulations Between Multi-dimensional Deterministic and
Alternating Cellular Automata", Fundamenta Informaticae,
Vol. 58, No. 3-4 (2003) pp. 261-271
[46] Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, and Katsunobu
Imai, "A Quadratic Speed-up Theorem for Iterative Arrays", Acta
Informatica, Vol. 38, No. 11/12 (2002) pp. 847-858,
doi:10.1007/s002360200092
[47] Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, and Katsunobu
Imai, "Constructible Functions in Cellular Automata and their
Applications to Hierarchy Results", Theoretical Computer
Science, Vol. 270, No. 1-2 (2002) pp. 797-809,
doi:10.1016/S0304-3975(01)00112-8
[48] Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, and Kenichi
Morita, "A Three-Dimensional Uniquely Parsable Array Grammar
that Generates and Parses Cubes", Electronic Notes in
Theoretical Computer Science, Vol. 46 (2001), 16 pages,
doi:10.1016/S1571-0661(04)80996-4
[49] Hiroshi Hosokawa, Kenichi Morita, Chuzo Iwamoto, and Katsunobu
Imai, "Universality of the Language Generating Ability of
Two-Point Splicing Systems", IEICE Transactions on Information
and Systems (Japanese Edition), Vol. J83-D-I, No. 1 (2000)
pp. 55-59
[50] Masatami Iwamoto and Chuzo Iwamoto, "Application of Finite
Difference Method to Arbitrary Mesh Points", The Transactions of
the Institute of Electrical Engineers of Japan, Vol. 120-A,
No. 2, pp. 116-121, 2000 (in Japanese),
doi:10.1541/ieejfms1990.120.2_116
[51] Chuzo Iwamoto and Kazuo Iwama, "Space Hierarchies of Turing
Machines with Restricted Tape Symbols", IEICE Transactions on
Information and Systems (Japanese Edition), Vol. J82-D-I, No. 6
(1999) pp. 661-668
[52] Masatami Iwamoto and Chuzo Iwamoto, "Technological Changes and
the Effect of Business Cycles in Electric Manufacturing
Companies for the Postwar 50 Years", The Transactions of the
Institute of Electrical Engineers of Japan, Vol. 119-A, No. 6
(1999) pp. 725-730 (in Japanese),
doi:10.1541/ieejfms1990.119.6_725
[53] Kazuo Iwama and Chuzo Iwamoto, "A Canonical Form of Vector
Machines", Information and Computation, Vol. 141, No. 1 (1998)
pp. 37-65, doi:10.1006/inco.1997.2685
[54] Kazuo Iwama, Chuzo Iwamoto, and Taku Ohsawa, "A Faster Parallel
Algorithm for k-Connectivity", Information Processing Letters,
Vol. 61, No. 5 (1997) pp. 265-269,
doi:10.1016/S0020-0190(97)00015-X
[55] Chuzo Iwamoto and Kazuo Iwama, "Time Complexity Hierarchies of
Extended TMs for Parallel Computation", IEICE Transactions on
Information and Systems (Japanese Edition), Vol. J80-D-I, No. 5
(1997) pp. 421-427
[56] Kazuo Iwama and Chuzo Iwamoto, "$\alpha$-Connectivity: A
Gradually Nonparallel Graph Problem", Journal of Algorithms,
Vol. 20, No. 3 (1996) pp. 526-544,
doi:10.1016/S0196-6774(96)90033-5
[57] Kazuo Iwama, Chuzo Iwamoto, and Monzur Morshed, "Time Lower
Bounds Do Not Exist for CRCW PRAMs", Theoretical Computer
Science, Vol. 155, No. 2 (1996) pp. 411-424,
doi:10.1016/0304-3975(94)00299-1
[58] Chuzo Iwamoto and Godfried T. Toussaint, "Finding Hamiltonian
Circuits in Arrangements of Jordan Curves is NP-complete",
Information Processing Letters, Vol. 52, No. 4 (1994)
pp. 183-189, doi:10.1016/0020-0190(94)90125-2
[59] Chuzo Iwamoto, K.Iwama, "RS-Vector Algorithms for Combinatorial
Problems", Systems and Computers in Japan, Vol. 24, No. 7 (1993)
pp. 41-51, doi:10.1002/scj.4690240704
[60] Chuzo Iwamoto and Kazuo Iwama, "RS-Vector Algorithms for
Combinatorial Problems", IEICE Transactions on Information and
Systems (Japanese Edition), Vol. J75-D-I, No. 3, (1992)
pp. 143-151
[61] Chuzo Iwamoto, Katsushi Inoue, and Itsuo Takanami, "Some
Properties of Homogeneous Pyramid automata", IEICE Transactions
on Information and Systems (Japanese Edition), Vol. J73-D-I,
No. 9 (1990) pp. 778-780
Refereed International Conference Papers:
[62] Chuzo Iwamoto and Shun Takahashi, "The Chromatic Dispersive Art
Gallery Problem", The 26th Japan Conference on Discrete and
Computational Geometry, Graphs, and Games (JCDCG3), Tokyo,
Japan, pp.120-121, September 10-12, 2024
[63] Chuzo Iwamoto and Ryo Takaishi, "Yajisan-Kazusan and Stained
Glass are NP-complete", Proceedings of the 23rd Japan-Korea
Joint Workshop on Algorithms and Computation, pp. 227-233, June
24-25, 2023, Nagoya University, Nagoya, Japan
[64] Chuzo Iwamoto and Tatsuaki Ibusuki, "Vertex-to-Point
Conflict-Free Chromatic Guarding is NP-hard", Proceedings of the
16th International Conference and Workshop on Algorithms and
Computation (P.Mutzel et al.(Eds): WALCOM 2022, Lecture Notes in
Computer Science, vol. 13174, pp. 111-122, 2022), Universitas
Jember, Indonesia, March 24-26, 2022,
doi:10.1007/978-3-030-96731-4_10
[65] Chuzo Iwamoto and Tatsuaki Ibusuki, "Computational Complexity of
the Chromatic Art Gallery Problem for Orthogonal Polygons",
Proceedings of the 14th International Conference and Workshop on
Algorithms and Computation (R.M. Sohel et al.(Eds): WALCOM 2020,
Lecture Notes in Computer Science, vol. 12049, pp. 146-157,
2020), National University of Singapore, Singapore, March 31 -
April 2, 2020, doi:10.1007/978-3-030-39881-1_13
[66] Chuzo Iwamoto and Tatsuya Ide, "Nurimisaki and Sashigane are
NP-complete", The 31st Canadian Conference on Computational
Geometry, University of Alberta, Edmonton, Alberta, Canada,
pp. 184-194, August 8-10, 2019.
[67] Chuzo Iwamoto and Tatsuaki Ibusuki, "Kurotto and Juosan are
NP-complete", The 21st Japan Conference on Discrete and
Computational Geometry, Graphs, and Games (JCDCG^3 2018), Ateneo
de Manila University, Philippines, pp. 46-48, September 1-3,
2018
[68] Chuzo Iwamoto, Masato Haruishi, and Tatsuaki Ibusuki, "Herugolf
and Makaro are NP-complete", The Ninth International Conference
on Fun with Algorithms (FUN 2018), Vol. 100, No. 24, La
Maddalena, Maddalena Islands, Italy, June 13-15, 2018,
pp.24:1-24:11, doi:10.4230/LIPIcs.FUN.2018.24
[69] Kota Sato, Katsunobu Imai, and Chuzo Iwamoto, "Universal von
Neumann Neighborhood Cellular Automata on Penrose Tilings", The
1st International Workshop on Applications and Fundamentals of
Cellular Automata (AFCA'13), Matsuyama, Japan, pp. 515-521,
December 4-6, 2013, doi:10.1109/CANDAR.2013.92
[70] Chuzo Iwamoto and Toshihiko Kume, "Locating the Minimum Number
of Guards with r-visibility in a Polyomino is NP-hard", The 16th
Japan Conference on Discrete and Computational Geometry and
Graphs (JCDCGG 2013), Tokyo, Japan, pp. 100-101, September
17-19, 2013
[71] Chuzo Iwamoto, Kento Sasaki, and Kenichi Morita, "Computational
Complexity of String Puzzles", Proceedings of the 18th
Computing: the Australasian Theory Symposium (CATS 2012),
Melbourne, Australia, CRPIT, 128, Mestre, J. Eds., ACS.,
pp. 69-74, 2012
[72] Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, and Kenichi
Morita, "On Designing Gliders in Three-Dimensional Larger than
Life Cellular Automata", in F. Peper et al. (eds.): Natural
Computing (Proceedings in Information and Communications
Technology), Himeji, Japan, Vol. 2, Part 3, Springer 2010,
pp. 184-190 (September 23-25, 2009)
doi:10.1007/978-4-431-53868-4_21
[73] Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, and Kenichi Morita,
"Computational Complexity of Cast Puzzles", Proceedings of the
20th International Symposium on Algorithms and Computation
(ISAAC 2009) (Lecture Notes in Computer Science, vol. 5878),
Hawaii, USA, 2009, pp. 122-131, doi:10.1007/978-3-642-10631-6_14
[74] Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, and Kenichi
Morita, "A Java Based Three-Dimensional Cellular Automata
Simulator and its Application to Three-Dimensional Larger Than
Life", Proceedings of Automata 2008: Theory and Applications of
Cellular Automata, Bristol, UK, pp. 413-416, Luniver Press,
Frome, UK 2008 (June 12-14, 2008), ISBN 978-1-905986-16-3
[75] Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, and Katsunobu
Imai, "A Time Hierarchy Theorem for Nondeterministic Cellular
Automata", Proceedings of the Fourth Annual Conference on Theory
and Applications of Models of Computation (Lecture Notes in
Computer Science, vol. 4484), Shanghai, China, May 22-25 2007,
pp. 511-520, doi:10.1007/978-3-540-72504-6_46
[76] Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, and Katsunobu
Imai, "Translational Lemmas for Alternating TMs and PRAMs",
Proceedings of the 15th International Symposium on Fundamentals
of Computation Theory (Lecture Notes in Computer Science,
vol. 3623), Luebeck, Germany, August 17-20 2005, pp. 126-137,
doi:10.1007/11537311_13
[77] Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai,
and Daisuke Wakamatsu, "Hierarchies of DLOGTIME-Uniform
Circuits", in Maurice Margenstern (ed.): Machines, Computations
and Universality (Proceedings of MCU2004, Saint-Petersburg,
Russia, September 21-26, 2004), Lecture Notes in Computer
Science, vol. 3354, Springer 2005, pp. 211-222,
doi:10.1007/978-3-540-31834-7_17
[78] Katsunobu Imai, Yousuke Kasai, Yuya Sonoyama, Chuzo Iwamoto, and
Kenichi Morita, "Self-reproduction and Shape Formation in Two
and Three Dimensional Cellular Automata with Conservative
Constraints", Proceedings of the Eighth International Symposium
on Artificial Life and Robotics (AROB2003), Beppu, Japan,
January 24-26, 2003, pp. 377-380
[79] Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, and Katsunobu
Imai, "Computational Complexity in the Hyperbolic Plane",
Proceedings of the 27th International Symposium on Mathematical
Foundations of Computer Science, MFCS2002, (Lecture Notes in
Computer Science, vol. 2420), Warszawa, Poland, August 26-30,
2002, pp. 365-374
[80] Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, and Kenichi Morita,
"Embedding a Logically Universal Model and a Self-Reproducing
Model into Number-Conserving Cellular Automata", Proceedings of
the Third International Conference on Unconventional Models of
Computation (UMC2002) (Lecture Notes in Computer Science,
vol. 2509) Himeji, Japan, October 15-19, 2002, pp. 164-175
[81] Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, and Katsunobu
Imai, "Speeding-up Cellular Automata by Alternations",
Proceedings of the third International Conference on Machines,
Computations and Universality, MCU2001, (Lecture Notes in
Computer Science, vol. 2055), Chisinau, Moldova, May 23-28,
2001, pp. 240-251
[82] Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, and Katsunobu
Imai, "On Time-Constructible Functions in One-Dimensional
Cellular Automata", Proceedings of the Twelveth International
Symposium on Fundamentals of Computation Theory (Lecture Notes
in Computer Science, vol. 1684), Iasi, Romania, 1999,
pp. 316-326
[83] Masatami Iwamoto, Chuzo Iwamoto, and Tadatoshi Yamada, "Juglar
Cycles and Their Effects on Technological Changes", Portland
International Conference on Management of Engineering and
Technology (PICMET99), Proceedings Vol-1: Book of Summaries,
page 287, Proceedings Vol-2: Papers Presented at PICMET99,
17-34.PDF, Portland, USA, 1999
[84] Masatami Iwamoto and Chuzo Iwamoto, "Periodic Recession and R&D
Management in Japan", Proceedings of the 1998 IEEE EMS
International Engineering Management Conference (IEMC'98,
rescheduled for May 3-5, 1999), San Juan, Puerto Rico, 1999,
pp. 198-201
[85] Kazuo Iwama and Chuzo Iwamoto, "Improved Time and Space
Hierarchies of One-Tape Off-Line TMs", Proceedings of the 23rd
International Symposium on Mathematical Foundations of Computer
Science (Lecture Notes in Computer Science, vol. 1450), Brno,
Czech Republic, 1998, pp. 580-588, doi:10.1007/BFb0055808
[86] Chuzo Iwamoto, "Complexity Hierarchies on DLOGTIME-Uniform
Circuits and TMs with Restricted Symbols", Proceedings of the
Eleventh Workshop on Circuits and Systems in Karuizawa,
pp. 367-372, 1998 (invited)
[87] Kazuo Iwama and Chuzo Iwamoto, "(1+o(1))S(n)-Space Is Stronger
Than S(n)-Space", Proceedings of the Third Japan-Korea Joint
Workshop on Algorithms and Computation, Fukuoka, Japan, 1997,
pp. 72-79
[88] Kazuo Iwama and Chuzo Iwamoto, "Parallel Complexity Hierarchies
Based on PRAMs and DLOGTIME-Uniform Circuits" Proceedings of the
Eleventh Annual IEEE Conference on Computational Complexity,
Philadelphia, USA, 1996, pp. 24-32, doi:10.1109/CCC.1996.507665
[89] Chuzo Iwamoto and Kazuo Iwama, "How Can We Demonstrate
Increasing Parallel Complexities?", ACM/UMIACS Fourth Workshop
on Parallel Algorithms, Philadelphia, USA, 1996
[90] Chuzo Iwamoto, "On Problems with Gradually Increasing Parallel
Complexities", Proceedings of the 1996 IEICE General Conference,
The Frontline of Theoretical Computer Science, pp. 361-362, 1996
[91] Kazuo Iwama, Chuzo Iwamoto, and Taku Ohsawa, "A Faster Parallel
Algorithm for k-Connectivity", Proceedings of the Second
KOREA-JAPAN Joint Workshop on Algorithms and Computation, KAIST,
Taejon, Korea, August 1996, pp. 8-13
[92] Chuzo Iwamoto and Kazuo Iwama, "Extended Graph Connectivity and
Its Gradually Increasing Parallel Complexity", Proceedings of
the Fifth Annual International Symposium on Algorithms and
Computation (Lecture Notes in Computer Science, vol. 834),
Beijing, China, 1994, pp. 478-486, doi:10.1007/3-540-58325-4_214
[93] Chuzo Iwamoto and Godfried T. Toussaint, "Finding Hamiltonian
Circuits in Arrangements of Jordan Curves is NP-complete",
Proceedings of the Sixth Canadian Conference on Computational
Geometry, Saskatoon, Canada, August 1994, pp. 93-98
[94] Chuzo Iwamoto and Kazuo Iwama, "Parallelizabilities of Vertex
Set Partition Problems", Proceedings of the Joint Symposium on
Parallel Processing, Yokohama, Japan, 1992, pp. 47-53
Non-Refereed Publications:
[home]