Alberto Leporati

Int. J. Neural Syst., May, 2024

A Discrete Particle Swarm Optimizer for the Design of Cryptographic Boolean Functions.

[BibT_eX]

[DOI]

Luca Manzoni

CoRR, 2024

2023

Inferring P systems from their computing steps: An evolutionary approach.

[BibT_eX]

[DOI]

Swarm Evol. Comput., 2023

Exploiting Ethereum after "The Merge": The Interplay between PoS and MEV Strategies.

[BibT_eX]

[DOI]

Proceedings of the Italian Conference on Cyber Security (ITASEC 2023), 2023

Studying the Compounding Effect: The Role of Proof-of-Stake Parameters on Wealth Distribution.

[BibT_eX]

[DOI]

Proceedings of the Fifth Distributed Ledger Technology Workshop (DLT 2023), 2023

2022

Depth-two P systems can simulate Turing machines with NP oracles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Heuristic search of (semi-)bent functions based on cellular automata.

[BibT_eX]

[DOI]

Nat. Comput., 2022

Spiking neural P systems: main ideas and results.

[BibT_eX]

[DOI]

Nat. Comput., 2022

Evaluating space measures in P systems.

[BibT_eX]

[DOI]

J. Membr. Comput., 2022

Active P-Colonies.

[BibT_eX]

[DOI]

Inf. Sci., 2022

On Spiking Neural Membrane Systems with Neuron and Synapse Creation.

[BibT_eX]

[DOI]

Marco Gatti

Int. J. Neural Syst., 2022

On the Difficulty of Evolving Permutation Codes.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation - 25th European Conference, 2022

Evolutionary Construction of Perfectly Balanced Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2022

2021

Alternative space definitions for P systems with active membranes.

[BibT_eX]

[DOI]

J. Membr. Comput., 2021

Evolutionary algorithms for designing reversible cellular automata.

[BibT_eX]

[DOI]

Genet. Program. Evolvable Mach., 2021

Exploiting the Blockchain to Guarantee GDPR Compliance while Consents Evolve under Data Owners' Control.

[BibT_eX]

[DOI]

Massimiliano Calani

Giovanni Denaro

Proceedings of the Italian Conference on Cybersecurity, 2021

2020

Subroutines in P systems and closure properties of their complexity classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Simulating counting oracles with cooperation.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

A Turing machine simulation by P systems without charges.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

Shallow laconic P systems can count.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

The Evolution and Success of an Excellent Transdisciplinary Journal.

[BibT_eX]

[DOI]

Int. J. Neural Syst., 2020

The Many Roads to the Simulation of Reaction Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Mutually orthogonal latin squares based on cellular automata.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

An Evolutionary View on Reversible Shift-Invariant Transformations.

[BibT_eX]

[DOI]

Proceedings of the Genetic Programming - 23rd European Conference, 2020

Exploring Semi-bent Boolean Functions Arising from Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2020

2019

Characterizing PSPACE with shallow non-confluent P systems.

[BibT_eX]

[DOI]

J. Membr. Comput., 2019

Cellular automata based S-boxes.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

Transferable Anonymous Payments via TumbleBit in Permissioned Blockchains.

[BibT_eX]

[DOI]

Proceedings of the Second Distributed Ledger Technology Workshop, 2019

A blockchain technology for protection and probative value preservation of vehicle driver data.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Symposium on Consumer Technologies, 2019

Hyper-bent Boolean Functions and Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Genetic Programming - 22nd European Conference, 2019

2018

A cryptographic and coding-theoretic perspective on the global rules of cellular automata.

[BibT_eX]

[DOI]

Nat. Comput., 2018

The Design of (Almost) Disjunct Matrices by Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

Evolutionary Search of Binary Orthogonal Arrays.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Solving QSAT in Sublinear Depth.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2018

Time and Space Complexity of P Systems - And Why They Matter.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2018

Evolving Bent Quaternary Functions.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

Open Problems in Membrane Computing and How Not to Solve Them.

[BibT_eX]

[DOI]

Proceedings of the Enjoying Natural Computing, 2018

Inversion of Mutually Orthogonal Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2018

2017

The counting power of P systems with antimatter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

A toolbox for simpler active membrane algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Computing the periods of preimages in surjective cellular automata.

[BibT_eX]

[DOI]

Nat. Comput., 2017

Characterising the complexity of tissue P systems with fission rules.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Tissue P Systems with Small Cell Volume.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

Solving a Special Case of the P Conjecture Using Dependency Graphs with Dissolution.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2017

Evolving S-boxes based on cellular automata with genetic programming.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata.

[BibT_eX]

[DOI]

Enrico Formenti

Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016

Monodirectional P systems.

[BibT_eX]

[DOI]

Nat. Comput., 2016

Constructing Orthogonal Latin Squares from Linear Cellular Automata.

[BibT_eX]

[DOI]

Enrico Formenti

CoRR, 2016

Shallow Non-confluent P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Self-Protection Mechanisms for Web Applications - A Case Study.

[BibT_eX]

[DOI]

Claudia Raibulet

Andrea Metelli

Proceedings of the ENASE 2016, 2016

Resilient Vectorial Functions and Cyclic Codes Arising from Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2016

2015

Recent complexity-theoretic results on P systems with active membranes.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

Membrane Division, Oracles, and the Counting Hierarchy.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

A Genetic Algorithm for Evolving Plateaued Cryptographic Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing, 2015

Tissue P Systems Can be Simulated Efficiently with Counting Oracles.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2015

Complexity Classes for Membrane Systems: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

Heuristic Search by Particle Swarm Optimization of Boolean Functions for Cryptographic Applications.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

On the Periods of Spatially Periodic Preimages in Linear Bipermutive Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2015

2014

Space complexity equivalence of P systems with active membranes and Turing machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Cryptographic Properties of Bipermutive Cellular Automata Rules.

[BibT_eX]

[DOI]

J. Cell. Autom., 2014

P Systems with Active Membranes Working in Logarithmic Space.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Constant-Space P Systems with Active Membranes.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

P Systems with Active Membranes Working in Sublinear Space.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2014

Simulating Elementary Active Membranes - with an Application to the P Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2014

Sharing Secrets by Computing Preimages of Bipermutive Cellular Automata.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2014

2013

Improved Universality Results for Parallel Enzymatic Numerical P Systems.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2013

Characterizing the computational power of energy-based P systems.

[BibT_eX]

[DOI]

Artiom Alhazov

Marco Antoniotti

Int. J. Comput. Math., 2013

Enzymatic Numerical P Systems Using Elementary Arithmetic Operations.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2013

Flattening and Simulation of Asynchronous Divisionless P Systems with Active Membranes.

[BibT_eX]

[DOI]

Luca Manzoni

Antonio E. Porreca

Proceedings of the Membrane Computing, 2013

Computational Complexity of P Systems with Active Membranes.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2013

Flattening in (Tissue) P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2013

1-Resiliency of Bipermutive Cellular Automata Rules.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2013

2012

Asynchronous P systems with active membranes.

[BibT_eX]

[DOI]

Pierluigi Frisco

Gordon Govan

Theor. Comput. Sci., 2012

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Self-Stabilization in Membrane Systems.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2012

A Unifying Framework to Characterize the Power of a Language to Express Relations

[BibT_eX]

[DOI]

Paola Bonizzoni

Peter J. Cameron

Gianluca Della Vedova

CoRR, 2012

Sublinear-Space P Systems with Active Membranes.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2012

Discovering Gene-Drug Relationships for the Pharmacology of Cancer.

[BibT_eX]

[DOI]

Elisabetta Fersini

Enza Messina

Proceedings of the Advances on Computational Intelligence, 2012

2011

P systems with active membranes: trading time for space.

[BibT_eX]

[DOI]

Nat. Comput., 2011

Elementary Active Membranes Have the Power of Counting.

[BibT_eX]

[DOI]

Int. J. Nat. Comput. Res., 2011

P Systems with Active Membranes Working in Polynomial Space.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

From Energy-based to Quantum (inspired) P systems.

[BibT_eX]

[DOI]

ERCIM News, 2011

P Systems Simulating Oracle Computations.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2011

2010

Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Computing with energy and chemical reactions.

[BibT_eX]

[DOI]

Nat. Comput., 2010

Diagrams of States in Quantum Information: an Illustrative Tutorial.

[BibT_eX]

[DOI]

Sara Felloni

Giuliano Strini

Int. J. Unconv. Comput., 2010

P Systems with Elementary Active Membranes: Beyond NP and coNP.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2010

On a Powerful Class of Non-universal P Systems with Active Membranes.

[BibT_eX]

[DOI]

Antonio E. Porreca

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Computational Complexity Aspects in Membrane Computing.

[BibT_eX]

[DOI]

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009

Uniform solutions to SAT and Subset Sum by spiking neural P systems.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

Nat. Comput., 2009

Complexity aspects of polarizationless membrane systems.

[BibT_eX]

[DOI]

Claudio Ferretti

Mario J. Pérez-Jiménez

Miguel A. Gutiérrez-Naranjo

Nat. Comput., 2009

(Tissue) P systems with cell polarity.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

On the Computational Power of Spiking Neural P Systems.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2009

Introducing a Space Complexity Measure for P Systems.

[BibT_eX]

[DOI]

Int. J. Comput. Commun. Control, 2009

First Steps Towards a CPU Made of Spiking Neural P Systems.

[BibT_eX]

[DOI]

Int. J. Comput. Commun. Control, 2009

An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 10th International Workshop, 2009

Energy-Based Models of P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 10th International Workshop, 2009

Solving NP-Complete Problems by Spiking Neural P Systems with Budding Rules.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008

Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources.

[BibT_eX]

[DOI]

Tseren-Onolt Ishdorj

Nat. Comput., 2008

On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

Fundam. Informaticae, 2008

Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources.

[BibT_eX]

[DOI]

Miguel A. Gutiérrez-Naranjo

Fundam. Informaticae, 2008

Quantum conservative many-valued computing.

[BibT_eX]

[DOI]

Gianpiero Cattaneo

Roberto Leporini

Fuzzy Sets Syst., 2008

How Redundant Is Your Universal Computation Device?.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing - 9th International Workshop, 2008

2007

Three "quantum" algorithms to solve 3-SAT.

[BibT_eX]

[DOI]

Sara Felloni

Theor. Comput. Sci., 2007

Solving Numerical NP-Complete Problems with Spiking Neural P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 8th International Workshop, 2007

(UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 8th International Workshop, 2007

2006

P systems with input in binary form.

[BibT_eX]

[DOI]

Miguel A. Gutiérrez-Naranjo

Int. J. Found. Comput. Sci., 2006

Reversible P Systems to Simulate Fredkin Circuits.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

A Membrane Algorithm for the Min Storage Problem.

[BibT_eX]

[DOI]

Dario Pagani

Proceedings of the Membrane Computing, 7th International Workshop, 2006

2005

Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 6th International Workshop, 2005

P Systems with Memory.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 6th International Workshop, 2005

2004

Simulating the Fredkin Gate with Energy-Based P Systems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2004

Conservative Computations in Energy-Based P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 5th International Workshop, 2004

Universal Families of Reversible P Systems.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Sequential P Systems with Unit Rules and Energy Assigned to Membranes.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003

On the Computational Complexity of Conservative Computing.

[BibT_eX]

[DOI]