2008 |
24 | EE | Chuzo Iwamoto,
Harumasa Yoneda,
Kenichi Morita,
Katsunobu Imai:
A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Transactions 91-A(9): 2335-2340 (2008) |
23 | EE | Chuzo Iwamoto:
Special Section on Foundations of Computer Science.
IEICE Transactions 91-D(2): 161 (2008) |
2007 |
22 | EE | Chuzo Iwamoto,
Harumasa Yoneda,
Kenichi Morita,
Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
TAMC 2007: 511-520 |
21 | EE | 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) |
2005 |
20 | EE | Chuzo Iwamoto,
Yoshiaki Nakashiba,
Kenichi Morita,
Katsunobu Imai:
Translational Lemmas for Alternating TMs and PRAMs.
FCT 2005: 137-148 |
2004 |
19 | EE | Chuzo Iwamoto,
Naoki Hatayama,
Kenichi Morita,
Katsunobu Imai,
Daisuke Wakamatsu:
Hierarchies of DLOGTIME-Uniform Circuits.
MCU 2004: 211-222 |
18 | EE | 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) |
2003 |
17 | EE | Chuzo Iwamoto,
Katsuyuki Tateishi,
Kenichi Morita,
Katsunobu Imai:
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Inform. 58(2003): 261-271 (2003) |
2002 |
16 | EE | Chuzo Iwamoto,
Takeshi Andou,
Kenichi Morita,
Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane.
MFCS 2002: 365-374 |
15 | EE | 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 |
14 | EE | Chuzo Iwamoto,
Katsuyuki Tateishi,
Kenichi Morita,
Katsunobu Imai:
A quadratic speedup theorem for iterative arrays.
Acta Inf. 38(11/12): 847-858 (2002) |
13 | EE | 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) |
2001 |
12 | EE | Chuzo Iwamoto,
Katsuyuki Tateishi,
Kenichi Morita,
Katsunobu Imai:
Speeding-Up Cellular Automata by Alternations.
MCU 2001: 240-251 |
11 | EE | 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: (2001) |
1999 |
10 | EE | Chuzo Iwamoto,
Tomonobu Hatsuyama,
Kenichi Morita,
Katsunobu Imai:
On Time-Constructible Functions in One-Dimensional Cellular Automata.
FCT 1999: 316-326 |
1998 |
9 | EE | Kazuo Iwama,
Chuzo Iwamoto:
Improved Time and Space Hierarchies of One-Tape Off-Line TMs.
MFCS 1998: 580-588 |
8 | | Kazuo Iwama,
Chuzo Iwamoto:
A Canonical Form of Vector Machines.
Inf. Comput. 141(1): 37-65 (1998) |
1997 |
7 | EE | Kazuo Iwama,
Chuzo Iwamoto,
T. Ohsawa:
A Faster Parallel Algorithm for k-Connectivity.
Inf. Process. Lett. 61(5): 265-269 (1997) |
1996 |
6 | EE | Kazuo Iwama,
Chuzo Iwamoto:
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits.
IEEE Conference on Computational Complexity 1996: 24-32 |
5 | | Kazuo Iwama,
Chuzo Iwamoto:
alpha-Connectivity: A Gradually Nonparallel Graph Problem.
J. Algorithms 20(3): 526-544 (1996) |
4 | EE | Kazuo Iwama,
Chuzo Iwamoto,
Manzur Morshed:
Time Lower Bounds do not Exist for CRCW PRAMs.
Theor. Comput. Sci. 155(2): 411-424 (1996) |
1994 |
3 | | Chuzo Iwamoto,
Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete.
CCCG 1994: 93-98 |
2 | | Chuzo Iwamoto,
Kazuo Iwama:
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity.
ISAAC 1994: 478-486 |
1 | | Chuzo Iwamoto,
Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete.
Inf. Process. Lett. 52(4): 183-189 (1994) |