default search action
Katsunobu Imai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Toru Nakanishi, Atsuki Iriboshi, Katsunobu Imai:
Short DL-Based Blacklistable Ring Signatures from DualRing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 464-475 (2024) - 2023
- [c33]Katsunobu Imai, Hiroki Kitagawa, Kazuma Nakahara:
On Visualization of Three-Dimensional Cellular Automata and Tilings with Head-Mounted Display. ASCAT 2023: 15-21 - 2022
- [j29]Hisamichi Ishizaka, GilTak Kong, Katsunobu Imai:
The Weak Universality of Two-Dimensional Five-State von Neumann Neighborhood Number-Conserving Cellular Automaton. New Gener. Comput. 40(2): 541-551 (2022) - [c32]Toru Nakanishi, Atsuki Iriboshi, Katsunobu Imai:
Short DL-based Blacklistable Ring Signatures from DualRing. CANDAR 2022: 137-143 - 2021
- [j28]GilTak Kong, Katsunobu Imai, Toru Nakanishi:
A New Structure of 2-State Number-Conserving Cellular Automata. IEICE Trans. Inf. Syst. 104-D(5): 673-678 (2021)
2010 – 2019
- 2019
- [j27]Shigeki Akiyama
, Jonathan Caalim, Katsunobu Imai, Hajime Kaneko:
Corona Limits of Tilings: Periodic Case. Discret. Comput. Geom. 61(3): 626-652 (2019) - [j26]GilTak Kong, Katsunobu Imai, Tom Nakanishi:
The Structure of Hierarchical Motion Representation of 2-state Number Conserving Cellular Automata. J. Cell. Autom. 14(5-6): 397-416 (2019) - 2018
- [j25]Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo:
Preface. J. Cell. Autom. 13(3): 181-182 (2018) - [c31]Katsunobu Imai, Kyosuke Oroji, Tomohiro Kubota:
A Weakly Universal Three-Dimensional Larger than Life Cellular Automaton. CANDAR Workshops 2018: 15-19 - [p3]Katsunobu Imai, Bruno Martin, Ryohei Saito:
On Radius 1 Nontrivial Reversible and Number-Conserving Cellular Automata. Reversibility and Universality 2018: 269-277 - [p2]Masami Hagiya, Katsunobu Imai:
On the Persistency of Gellular Automata. Reversibility and Universality 2018: 373-383 - 2017
- [c30]GilTak Kong, Katsunobu Imai, Toru Nakanishi:
Hierarchical Motion Representation of 2-State Number Conserving Cellular Automata. CANDAR 2017: 194-199 - 2016
- [c29]Shigeki Akiyama
The Corona Limit of Penrose Tilings Is a Regular Decagon. Automata 2016: 35-48 - [c28]Artiom Alhazov
Particle Complexity of Universal Finite Number-Conserving Cellular Automata. CANDAR 2016: 209-214 - [i2]Katsunobu Imai, Hisamichi Ishizaka, Victor Poupet:
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal. CoRR abs/1610.00333 (2016) - 2015
- [c27]Hisamichi Ishizaka, Yohei Takemura, Katsunobu Imai:
On Enumeration of Motion Representable Two-Dimensional Two-State Number-Conserving Cellular Automata. CANDAR 2015: 412-417 - [c26]Shaoyu Wang, Katsunobu Imai, Masami Hagiya:
An Approach to Constructing and Simulating Block Cellular Automata by Gellular Automata. CANDAR 2015: 442-448 - [e1]Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo:
Cellular Automata and Discrete Complex Systems - 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8996, Springer 2015, ISBN 978-3-319-18811-9 [contents] - 2014
- [c25]Katsunobu Imai, Hisamichi Ishizaka, Victor Poupet:
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal. Automata 2014: 31-43 - [c24]Enrico Formenti
Advances on Random Sequence Generation by Uniform Cellular Automata. Computing with New Resources 2014: 56-70 - [c23]Shaoyu Wang, Katsunobu Imai, Masami Hagiya:
On the Composition of Signals in Gellular Automata. CANDAR 2014: 499-502 - [c22]Wen-Hu Zhou, Jia Lee, Guo-Long Li, Katsunobu Imai:
Embedding Game of Life into a Simple Asynchronous Cellular Automaton. CANDAR 2014: 503-506 - [c21]Masami Hagiya, Shaoyu Wang, Ibuki Kawamata, Satoshi Murata, Teijiro Isokawa, Ferdinand Peper, Katsunobu Imai:
On DNA-Based Gellular Automata. UCNC 2014: 177-189 - 2013
- [j24]Katsunobu Imai, Takahiro Hatsuda, Victor Poupet, Kota Sato:
A 6-state Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings. Fundam. Informaticae 126(2-3): 247-261 (2013) - [j23]Dansaku Nakayama, Naoshi Sakamoto, Katsunobu Imai:
A Transferring Protocol using Local Information on Ad Hoc Sensor Network and Its Behaviors. Int. J. Netw. Comput. 3(1): 170-180 (2013) - [c20]Jia Lee, Ferdinand Peper, Katsunobu Imai:
Computing on a Simple Asynchronous Cellular Automaton. CANDAR 2013: 505-509 - [c19]Kota Sato, Katsunobu Imai, Chuzo Iwamoto:
Universal Von Neumann Neighborhood Cellular Automata on Penrose Tilings. CANDAR 2013: 515-521 - 2012
- [j22]Jia Lee, Katsunobu Imai, Qingsheng Zhu:
Fluctuation-driven computing on number-conserving cellular automata. Inf. Sci. 187: 266-276 (2012) - [c18]Susumu Adachi, Jia Lee, Ferdinand Peper, Teijiro Isokawa, Katsunobu Imai:
Determining the Critical Temperature of the Continuous-State Game of Life. ACRI 2012: 83-90 - [c17]Katsunobu Imai, Takahiro Hatsuda, Victor Poupet, Kota Sato:
A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings. AUTOMATA & JAC 2012: 267-278 - 2011
- [c16]Dansaku Nakayama, Naoshi Sakamoto, Katsunobu Imai:
A Transferring Protocol with Local Information on an Ad-Hoc Sensor Network. ICNC 2011: 291-293 - 2010
- [c15]Katsunobu Imai, Artiom Alhazov
On Universality of Radius 1/2 Number-Conserving Cellular Automata. UC 2010: 45-55
2000 – 2009
- 2009
- [j21]Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto
On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four. IEICE Trans. Inf. Syst. 92-D(2): 255-257 (2009) - [j20]Naonori Tanimoto, Katsunobu Imai:
A Characterization of von Neumann Neighbor Number-Conserving Cellular Automata. J. Cell. Autom. 4(1): 39-54 (2009) - [c14]Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, Kenichi Morita:
On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata. IWNC 2009: 184-190 - 2008
- [j19]Chuzo Iwamoto
A Recursive Padding Technique on Nondeterministic Cellular Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2335-2340 (2008) - [c13]Naonori Tanimoto, Katsunobu Imai:
A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata. ACRI 2008: 244-251 - [c12]Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life. Automata 2008: 413-416 - [i1]Katsunobu Imai, Bruno Martin
Simulations between triangular and hexagonal number-conserving cellular automata. CoRR abs/0809.0355 (2008) - 2007
- [j18]Chuzo Iwamoto
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. Acta Informatica 44(5): 345-359 (2007) - [c11]Kenichi Morita, Jin-Shan Qi, Katsunobu Imai:
Pattern Generation and Parsing by Array Grammars. Formal Models, Languages and Applications 2007: 260-273 - [c10]Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520 - 2006
- [j17]Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. J. Cell. Autom. 1(4): 275-297 (2006) - 2005
- [c9]Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai:
Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148 - 2004
- [j16]Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita:
A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. IEICE Trans. Inf. Syst. 87-D(3): 694-699 (2004) - [j15]Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai:
Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. IEICE Trans. Inf. Syst. 87-D(3): 708-712 (2004) - [c8]Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu:
Hierarchies of DLOGTIME-Uniform Circuits. MCU 2004: 211-222 - 2003
- [j14]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. Fundam. Informaticae 58(2003): 261-271 (2003) - [j13]Jia Lee, Katsunobu Imai, Kenichi Morita
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. Theor. Comput. Sci. 304(1-3): 185-200 (2003) - 2002
- [j12]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita
A quadratic speedup theorem for iterative arrays. Acta Informatica 38(11/12): 847-858 (2002) - [j11]Katsunobu Imai, Takahiro Hori, Kenichi Morita
Self-Reproduction in Three-Dimensional Reversible Cellular Space. Artif. Life 8(2): 155-174 (2002) - [j10]Katsunobu Imai, Kenichi Morita, Kenji Sako:
Firing Squad Synchronization Problem in Number-Conserving Cellular Automata. Fundam. Informaticae 52(1-3): 133-141 (2002) - [j9]Chuzo Iwamoto
Constructible functions in cellular automata and their applications to hierarchy results. Theor. Comput. Sci. 270(1-2): 797-809 (2002) - [c7]Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374 - [c6]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 - [p1]Kenichi Morita, Yasuyuki Tojima, Katsunobu Imai, Tsuyoshi Ogiro:
Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spaces. Collision-Based Computing 2002: 161-199 - 2001
- [j8]Kenichi Morita
Number-Conserving Reversible Cellular Automata and Their Computation-Universality. RAIRO Theor. Informatics Appl. 35(3): 239-258 (2001) - [c5]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Speeding-Up Cellular Automata by Alternations. MCU 2001: 240-251 - [c4]Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita
A three-dimensional uniquely parsable array grammar that generates and parses cubes. IWCIA 2001: 339-354 - 2000
- [j7]Jia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai:
Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog. Grammars 3(1): 63-81 (2000) - [j6]Katsunobu Imai, Kenichi Morita
A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor. Comput. Sci. 231(2): 181-191 (2000)
1990 – 1999
- 1999
- [j5]Kenichi Morita
Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata. Int. J. Pattern Recognit. Artif. Intell. 13(4): 523-538 (1999) - [j4]Kenichi Morita
Universality of Reversible Hexagonal Cellular Automata. RAIRO Theor. Informatics Appl. 33(6): 535-550 (1999) - [j3]Kenichi Morita
Uniquely parsable array grammars for generating and parsing connected patterns. Pattern Recognit. 32(2): 269-276 (1999) - [c3]Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326 - 1998
- [c2]Katsunobu Imai, Kenichi Morita:
A computation-universal two-dimensional 8-state triangular reversible cellular automaton. MCU (2) 1998: 90-99 - 1996
- [j2]Katsunobu Imai, Kenichi Morita
Firing Squad Synchronization Problem in Reversible Cellular Automata. Theor. Comput. Sci. 165(2): 475-482 (1996) - [j1]Kenichi Morita
Self-Reproduction in a Reversible Cellular Space. Theor. Comput. Sci. 168(2): 337-366 (1996) - [c1]Kenichi Morita
Logical Universality and Self-Reproduction in Reversible Cellular Automata. ICES 1996: 152-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: