|
Search the dblp DataBase
Chuzo Iwamoto:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Chuzo Iwamoto, Godfried T. Toussaint
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-complete. [Citation Graph (0, 0)][DBLP] CCCG, 1994, pp:93-98 [Conf]
- Kazuo Iwama, Chuzo Iwamoto
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:24-32 [Conf]
- Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
On Time-Constructible Functions in One-Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP] FCT, 1999, pp:316-326 [Conf]
- Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
Translational Lemmas for Alternating TMs and PRAMs. [Citation Graph (0, 0)][DBLP] FCT, 2005, pp:137-148 [Conf]
- Chuzo Iwamoto, Kazuo Iwama
Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. [Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:478-486 [Conf]
- Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu
Hierarchies of DLOGTIME-Uniform Circuits. [Citation Graph (0, 0)][DBLP] MCU, 2004, pp:211-222 [Conf]
- Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
Speeding-Up Cellular Automata by Alternations. [Citation Graph (0, 0)][DBLP] MCU, 2001, pp:240-251 [Conf]
- Kazuo Iwama, Chuzo Iwamoto
Improved Time and Space Hierarchies of One-Tape Off-Line TMs. [Citation Graph (0, 0)][DBLP] MFCS, 1998, pp:580-588 [Conf]
- Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai
Computational Complexity in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:365-374 [Conf]
- Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. [Citation Graph (0, 0)][DBLP] UMC, 2002, pp:164-175 [Conf]
- Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
A quadratic speedup theorem for iterative arrays. [Citation Graph (0, 0)][DBLP] Acta Inf., 2002, v:38, n:11/12, pp:847-858 [Journal]
- Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita
A three-dimensional uniquely parsable array grammar that generates and parses cubes. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:46, n:, pp:- [Journal]
- Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2003, v:58, n:2003, pp:261-271 [Journal]
- Kazuo Iwama, Chuzo Iwamoto
A Canonical Form of Vector Machines. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1998, v:141, n:1, pp:37-65 [Journal]
- Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa
A Faster Parallel Algorithm for k-Connectivity. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:5, pp:265-269 [Journal]
- Chuzo Iwamoto, Godfried T. Toussaint
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:52, n:4, pp:183-189 [Journal]
- Kazuo Iwama, Chuzo Iwamoto
alpha-Connectivity: A Gradually Nonparallel Graph Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:3, pp:526-544 [Journal]
- Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto
Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2004, v:64, n:3, pp:319-326 [Journal]
- Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed
Time Lower Bounds do not Exist for CRCW PRAMs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:155, n:2, pp:411-424 [Journal]
- Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
Constructible functions in cellular automata and their applications to hierarchy results. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:797-809 [Journal]
- Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. [Citation Graph (0, 0)][DBLP] TAMC, 2007, pp:511-520 [Conf]
- Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. [Citation Graph (0, 0)][DBLP] Acta Inf., 2007, v:44, n:5, pp:345-359 [Journal]
Computational Complexity of Cast Puzzles. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.339secs
|