Chuzo Iwamoto

According to our database1, Chuzo Iwamoto
  • authored at least 48 papers between 1993 and 2017.
  • has a "Dijkstra number"2 of five.



In proceedings 
PhD thesis 




Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard.
IEICE Transactions, 2017

Computational Complexity of Building Puzzles.
IEICE Transactions, 2016

Visibility Problems for Manhattan Towers.
IEICE Transactions, 2016

Computational Complexity of Generalized Forty Thieves.
IEICE Transactions, 2015

Computational Complexity of Generalized Golf Solitaire.
IEICE Transactions, 2015

Yosenabe is NP-complete.
JIP, 2014

Generalized Chat Noir is PSPACE-Complete.
IEICE Transactions, 2013

Generalized Pyramid is NP-Complete.
IEICE Transactions, 2013

Computational Complexity of the r -visibility Guard Set Problem for Polyominoes.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings.
Proceedings of the First International Symposium on Computing and Networking, 2013

Lower Bound of Face Guards of Polyhedral Terrains.
JIP, 2012

Generalized Shisen-Sho is NP-Complete.
IEICE Transactions, 2012

Finding the Minimum Number of Face Guards is NP-Hard.
IEICE Transactions, 2012

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem.
Algorithms, 2012

Computational Complexity of String Puzzles.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

NP-Hard and k-EXPSPACE-Hard Cast Puzzles.
IEICE Transactions, 2010

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, 2009

Computational Complexity of Cast Puzzles.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Transactions, 2008

Special Section on Foundations of Computer Science.
IEICE Transactions, 2008

A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs.
Acta Inf., 2007

A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
Proceedings of the Theory and Applications of Models of Computation, 2007

A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton.
J. Cellular Automata, 2006

Translational Lemmas for Alternating TMs and PRAMs.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs.
J. Parallel Distrib. Comput., 2004

Prefix Computations on Iterative Arrays with Sequential Input/Output Mode.
IEICE Transactions, 2004

Time and Space Complexity Classes of Hyperbolic Cellular Automata.
IEICE Transactions, 2004

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Transactions, 2004

Hierarchies of DLOGTIME-Uniform Circuits.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Inform., 2003

Constructible functions in cellular automata and their applications to hierarchy results.
Theor. Comput. Sci., 2002

A quadratic speedup theorem for iterative arrays.
Acta Inf., 2002

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Computational Complexity in the Hyperbolic Plane.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

A three-dimensional uniquely parsable array grammar that generates and parses cubes.
Electr. Notes Theor. Comput. Sci., 2001

Speeding-Up Cellular Automata by Alternations.
Proceedings of the Machines, 2001

On Time-Constructible Functions in One-Dimensional Cellular Automata.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

A Canonical Form of Vector Machines.
Inf. Comput., 1998

Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett., 1997

Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci., 1996

alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms, 1996

Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete.
Inf. Process. Lett., 1994

Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

Rs-vector algorithms for combinational problems.
Systems and Computers in Japan, 1993