| Publication | Date of Publication | Type |
|---|
Combinatorial designs and cellular automata: a survey
Discrete Applied Mathematics | 2025-12-11 | Paper |
Cycles and global attractors of reactantless and inhibitorless reaction systems
Theoretical Computer Science | 2025-06-02 | Paper |
A topology for P-systems with active membranes
Journal of Membrane Computing | 2024-06-10 | Paper |
Search space reduction of asynchrony immune cellular automata
Natural Computing | 2024-02-09 | Paper |
Evolutionary strategies for the design of binary linear codes
Evolutionary Computation in Combinatorial Optimization | 2024-01-12 | Paper |
Fixed points and attractors of reactantless and inhibitorless reaction systems
Theoretical Computer Science | 2024-01-02 | Paper |
Heuristic search of (semi-)bent functions based on cellular automata
Natural Computing | 2023-09-01 | Paper |
Evaluating space measures in P systems
Journal of Membrane Computing | 2023-08-29 | Paper |
Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
Developments in Language Theory | 2023-06-30 | Paper |
Polynomial Equations over Finite, Discrete-Time Dynamical Systems
Developments in Language Theory | 2023-06-30 | Paper |
| A classification of S-boxes generated by Orthogonal Cellular Automata | 2023-03-09 | Paper |
| Building Correlation Immune Functions from Sets of Mutually Orthogonal Cellular Automata | 2022-07-17 | Paper |
| On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata | 2022-03-27 | Paper |
Exploring semi-bent Boolean functions arising from cellular automata
(available as arXiv preprint) | 2022-03-24 | Paper |
Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
Theoretical Computer Science | 2022-02-21 | Paper |
A Turing machine simulation by P systems without charges
Journal of Membrane Computing | 2021-09-14 | Paper |
Facilitation in reaction systems
Journal of Membrane Computing | 2021-09-14 | Paper |
Simulating counting oracles with cooperation
Journal of Membrane Computing | 2021-09-14 | Paper |
Alternative space definitions for P systems with active membranes
Journal of Membrane Computing | 2021-09-14 | Paper |
Shallow laconic P-systems can count
Journal of Membrane Computing | 2021-09-14 | Paper |
On the dynamical behaviour of linear higher-order cellular automata and its decidability
Information Sciences | 2020-12-10 | Paper |
The many roads to the simulation of reaction systems
Fundamenta Informaticae | 2020-06-21 | Paper |
Characterizing PSPACE with shallow non-confluent P systems
Journal of Membrane Computing | 2020-02-24 | Paper |
Characterizing PSPACE with shallow non-confluent P systems
Journal of Membrane Computing | 2020-02-24 | Paper |
Subroutines in P systems and closure properties of their complexity classes
Theoretical Computer Science | 2020-01-08 | Paper |
| Decidability of sensitivity and equicontinuity for linear higher-order cellular automata | 2019-12-04 | Paper |
Solving QSAT in sublinear depth
(available as arXiv preprint) | 2019-10-10 | Paper |
Monodirectional P systems
Natural Computing | 2019-07-10 | Paper |
Complexity of the dynamics of reaction systems
Information and Computation | 2019-05-29 | Paper |
| Open problems in membrane computing and how not to solve them | 2019-01-15 | Paper |
On the complexity of occurrence and convergence problems in reaction systems
Natural Computing | 2018-06-25 | Paper |
| Solving a special case of the P conjecture using dependency graphs with dissolution | 2018-05-16 | Paper |
Efficient simulation of reaction systems on graphics processing units
Fundamenta Informaticae | 2018-01-19 | Paper |
Tissue P systems with small cell volume
Fundamenta Informaticae | 2018-01-19 | Paper |
The counting power of P systems with antimatter
Theoretical Computer Science | 2017-12-06 | Paper |
Characterising the complexity of tissue P systems with fission rules
Journal of Computer and System Sciences | 2017-09-15 | Paper |
Runtime analysis of mutation-based geometric semantic genetic programming on Boolean functions
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII | 2017-07-14 | Paper |
A toolbox for simpler active membrane algorithms
Theoretical Computer Science | 2017-05-02 | Paper |
Shallow non-confluent P systems
Membrane Computing | 2017-04-12 | Paper |
Computational complexity of finite asynchronous cellular automata
Theoretical Computer Science | 2017-03-16 | Paper |
Geometric selective harmony search
Information Sciences | 2017-01-31 | Paper |
Asynchronous cellular automata and dynamical properties
Natural Computing | 2016-07-08 | Paper |
Limit properties of doubly quiescent m-asynchronous elementary cellular automata
Journal of Cellular Automata | 2016-06-10 | Paper |
Membrane division, oracles, and the counting hierarchy
Fundamenta Informaticae | 2016-05-11 | Paper |
Reachability in resource-bounded reaction systems
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Complexity classes for membrane systems: a survey
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Preimage problems for reaction systems
Language and Automata Theory and Applications | 2016-04-08 | Paper |
m-asynchronous cellular automata: from fairness to quasi-fairness
Natural Computing | 2016-04-06 | Paper |
Complexity of model checking for reaction systems
Theoretical Computer Science | 2016-03-31 | Paper |
Tissue P systems can be simulated efficiently with counting oracles
Membrane Computing | 2016-02-26 | Paper |
Ancestors, descendants, and gardens of Eden in reaction systems
Theoretical Computer Science | 2015-12-10 | Paper |
Simulating elementary active membranes
Membrane Computing | 2015-12-02 | Paper |
P Systems with Active Membranes Working in Sublinear Space
Membrane Computing | 2015-12-02 | Paper |
Reaction systems and extremal combinatorics properties
Theoretical Computer Science | 2015-09-16 | Paper |
Constant-space P systems with active membranes
Fundamenta Informaticae | 2015-06-26 | Paper |
Fixed points and attractors of reaction systems
Language, Life, Limits | 2015-02-25 | Paper |
The firing squad synchronization problem on CA with multiple updating cycles
Theoretical Computer Science | 2014-11-26 | Paper |
Simple reaction systems and their classification
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Cycles and global attractors of reaction systems
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Extremal combinatorics of reaction systems
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Flattening and simulation of asynchronous divisionless P systems with active membranes
Membrane Computing | 2014-03-28 | Paper |
Reaction systems made simple. A normal form and a classification theorem
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
Computing issues of asynchronous CA
Fundamenta Informaticae | 2013-01-14 | Paper |
A distance between populations for one-point crossover in genetic algorithms
Theoretical Computer Science | 2012-05-30 | Paper |
Computational aspects of asynchronous cellular automata
Developments in Language Theory | 2011-07-29 | Paper |
Some Formal Properties of Asynchronous Cellular Automata
Lecture Notes in Computer Science | 2010-10-04 | Paper |
