Natural Computing

Papers
(The TQCC of Natural Computing is 3. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-11-01 to 2025-11-01.)
ArticleCitations
Precise makespan optimization via hybrid genetic algorithm for scientific workflow scheduling problem54
An analysis of the relative effects of connectivity and coupling interactions on spin networks emulating the D-Wave 2000Q quantum annealer31
Computational complexity and pragmatic solutions for flexible tile based DNA self-assembly15
Verification and computation in restricted Tile Automata15
Gravitationally invariant subspaces in quantum computing11
Correction: Distinguishing genelet circuit input pulses via a pulse detector11
Inductive inference of Lindenmayer systems: algorithms and computational complexity10
Spiking neural P systems: main ideas and results10
Population-induced phase transitions and the verification of chemical reaction networks9
A formalization of co-transcriptional splicing as an operation on formal languages9
Solitaire of independence9
Associating parallel automata network dynamics and strictly one-way cellular automata8
Preface8
Simulating and validating virus machines8
The structural power of reconfigurable circuits in the amoebot model8
Spiking neural P systems and their semantics in Haskell8
Preface8
Palindromes in adjacent factor swap of a word8
A multipartite approach for the self-assembly of DNA graph structures7
Modernizing quantum annealing II: genetic algorithms with the inference primitive formalism7
Pure reaction automata7
Variants of string assembling systems6
Modelling and evaluating restricted ESNs on single- and multi-timescale problems6
Cellular automata and Kan extensions6
Koopman-based data-driven soft artificial life: obtaining rulesets from observed data6
Preface6
A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher5
Turning machines: a simple algorithmic model for molecular robotics5
GPU simulations of spiking neural P systems on modern web browsers4
Generalized marked systems4
Deep learning networks with rough-refinement optimization for food quality assessment4
A membrane computing approach to the generalized Nash equilibrium4
On the computational power of swarm automata using agents with position information4
A roadmap for solving optimization problems with estimation of distribution algorithms4
The busy beaver game for reaction systems4
Reaction systems with self distinction4
On the spectrum between reaction systems and string rewriting4
Reaction mining for reaction systems3
Programmable single-stranded architectures for computing3
Networks of splicing processors: path graph topology simulation3
On categorical approach to reaction systems3
Reaction systems with nondeterministic behaviour3
Ranks of functions specified by minimal reaction systems and induced by images of singletons3
Editorial for the special issue on DNA computing and molecular programming3
Evolving ensembles of heuristics for the travelling salesman problem3
Pure and mixed lexicographic-paretian many-objective optimization: state of the art3
CA-NN: a cellular automata neural network for handwritten pattern recognition3
Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies3
MRT-lattice Boltzmann hybrid model for the double diffusive mixed convection with thermodiffusion effect3
An exploration of reversible septenary number-conserving cellular automata: a survey of known methods3
Cellular automata simulations of the sintering behavior of ceramics driven by surface energy reduction3
A survey on learning models of spiking neural membrane systems3
Preface3
Algorithms for maximal existential and universal width3
Uniform robot relocation is hard in only two directions even without obstacles3
All optical half adder and subtractor using single 2D photonic crystal structure3
Synchronization of elementary cellular automata3
Proving new directed tile complexity lower bounds at temperature 1 by folding between 2D and just-barely 3D self-assembly3
ALCH: An imperative language for chemical reaction network-controlled tile assembly3
0.04595685005188