EDBT 2026 Demo / reviewers in the wild / expert
Chuzo Iwamoto
dblp:61/4126
· DBLP profile ↗
20ranked-venue papers
14as first author
0since 2021 · last 2020
0000-0003-0152-2233ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 19 · 14 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Mathematical optimization · 34% Logic in computer science · 34% Computational complexity · 33% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › rewriting
canonical form |
0.0 | 1 | 1998 | A Canonical Form of Vector Machines · Inf. Comput. 1998 |
Mathematical optimization
vector machines |
0.0 | 1 | 1998 | A Canonical Form of Vector Machines · Inf. Comput. 1998 |
Computational complexity
parallel complexity |
0.0 | 1 | 1996 | Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits · CCC 1996 |
Computational complexity
circuit complexity |
0.0 | 1 | 1996 | Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits · CCC 1996 |
Methods — techniques the papers use, named apart from their topics
uniformity · 0.0hierarchy theorems · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons
Chuzo Iwamoto, Tatsuaki Ibusuki |
WALCOM | 1 |
| 2009 | Computational Complexity of Cast Puzzles
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita |
ISAAC | 1 |
| 2007 | A Time Hierarchy Theorem for Nondeterministic Cellular Automata
Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai |
TAMC | 1 |
| 2007 | Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai |
Acta Informatica | 1 |
| 2005 | Translational Lemmas for Alternating TMs and PRAMs
Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai |
FCT | 1 |
| 2004 | Hierarchies of DLOGTIME-Uniform Circuits
Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu |
MCU | 1 |
| 2004 | Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto |
J. Parallel Distributed Comput. | 3 |
| 2003 | Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai |
Fundam. Informaticae | 1 |
| 2002 | Computational Complexity in the Hyperbolic Plane
Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai |
MFCS | 1 |
| 2002 | A quadratic speedup theorem for iterative arrays
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai |
Acta Informatica | 1 |
| 2002 | Constructible functions in cellular automata and their applications to hierarchy results
Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai |
Theor. Comput. Sci. | 1 |
| 2001 | Speeding-Up Cellular Automata by Alternations
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai |
MCU | 1 |
| 1999 | On Time-Constructible Functions in One-Dimensional Cellular Automata
Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai |
FCT | 1 |
| 1998 | Improved Time and Space Hierarchies of One-Tape Off-Line TMs
Kazuo Iwama, Chuzo Iwamoto |
MFCS | 2 |
| 1998 | A Canonical Form of Vector Machines
Kazuo Iwama, Chuzo Iwamoto |
Inf. Comput. | 2 |
| 1997 | A Faster Parallel Algorithm for k-Connectivity
Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa |
Inf. Process. Lett. | 2 |
| 1996 | Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform CircuitsabstractUnlike the case of logspace-uniform circuits, complexity hierarchies do exist for PRAMs and DLOGTIME-uniform circuits: (i) There exist a constant d and a language L such that L is recognizable in time dT(n) by some PRIORITY CRCW PRAM but is not recognizable in time T(n) by any PRIORITY CRCW PRAM if the number of processors is fixed. (ii) There exist constants c, d and a language L such that L is recognizable by some family of DLOGTIME-uniform circuits of size (Z(n))/sup c/ and depth dT(n) but is not recognizable by any family of DLOGTIME-uniform circuits of size Z(n) and depth T(n) if T(n) is not bounded by O(log n). Kazuo Iwama, Chuzo Iwamoto |
CCC | 2 |
| 1996 | Time Lower Bounds do not Exist for CRCW PRAMs
Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed |
Theor. Comput. Sci. | 2 |
| 1994 | Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity
Chuzo Iwamoto, Kazuo Iwama |
ISAAC | 1 |
| 1994 | Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete
Chuzo Iwamoto, Godfried T. Toussaint |
Inf. Process. Lett. | 1 |