Naoki Kamikawa

According to our database1, Naoki Kamikawa authored at least 22 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A New Class of the Smallest 4-State Semi-symmetric FSSP Partial Solutions for 1D Arrays.
Proceedings of the Cellular Automata, 2024

2021
A new class of the smallest FSSP partial solutions for 1D rings of length n=2<sup>k</sup>-1.
Acta Informatica, 2021

2020
A Realization of Real-time Sequence Generator for k-th Powers of Natural Numbers by One-Dimensional Cellular Automata.
Int. J. Netw. Comput., 2020

A construction of simple and smaller-state real-time generator for exponential sequences.
Artif. Life Robotics, 2020

2019
State-efficient realization of fault-tolerant FSSP algorithms.
Nat. Comput., 2019

Two Implementations of Real-Time Sequence Generator for {n^3 | n=1, 2, 3, ... } and Their Comparison.
Int. J. Netw. Comput., 2019

A Construction of Real-Time Sequence Generation Algorithm for {n<sup>4</sup> | n = 1, 2, 3, ...}.
Proceedings of the Seventh International Symposium on Computing and Networking Workshops, 2019

2018
The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

A Smaller-State Implementation of Real-Time Sequence Generator for {n^3 | n= 1, 2, 3, ...}.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays.
Proceedings of the Cellular Automata, 2018

2017
A New Class of the Smallest Four-State Partial FSSP Solutions for One-Dimensional Ring Cellular Automata.
Proceedings of the Parallel Computing Technologies, 2017

2016
A construction of five-state real-time Fibonacci sequence generator.
Artif. Life Robotics, 2016

2009
A Family of Smallest Symmetrical Four-State Firing Squad Synchronization Protocols for Ring Arrays.
Parallel Process. Lett., 2009

A Transition Rule Set for the First 2-D Optimum-Time Synchronization Algorithm.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009

2008
A Note on Sequence Generation Power of Communication-Restricted Cellular Automata with Small Number of States.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

A family of smallest symmetrical four-state firing squad synchronization protocols for one-dimensional ring cellular automata.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

About 4-States Solutions to the Firing Squad Synchronization Problem.
Proceedings of the Cellular Automata, 2008

2003
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton.
Fundam. Informaticae, 2003

A Synchronization Problem on 1-Bit Communication Cellular Automata.
Proceedings of the Computational Science - ICCS 2003, 2003

Efficient 1-Bit-Communication Cellular Algorithms.
Proceedings of the Modeling, 2003

2002
A Design of Real-Time Non-Regular Sequence Generation Algorithms and Their Implementations on Cellular Automata with 1-Bit Inter-Cell Communications.
Fundam. Informaticae, 2002

An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002


  Loading...