Claudio Zandron

Orcid: 0000-0002-2163-7639

According to our database1, Claudio Zandron authored at least 104 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Preface.
J. Membr. Comput., December, 2023

On maximal parallel application of rules in rewriting P systems.
J. Membr. Comput., September, 2023

Preface of the special issue on computational complexity and complex systems.
J. Membr. Comput., September, 2023

Preface.
Nat. Comput., March, 2023

Monodirectional evolutional symport tissue P systems with channel states and cell division.
Sci. China Inf. Sci., March, 2023

On the computational efficiency of tissue P systems with evolutional symport/antiport rules.
Knowl. Based Syst., February, 2023

Inferring P systems from their computing steps: An evolutionary approach.
Swarm Evol. Comput., 2023

2022
Depth-two P systems can simulate Turing machines with NP oracles.
Theor. Comput. Sci., 2022

Spiking neural P systems: main ideas and results.
Nat. Comput., 2022

Evaluating space measures in P systems.
J. Membr. Comput., 2022

Active P-Colonies.
Inf. Sci., 2022

On Spiking Neural Membrane Systems with Neuron and Synapse Creation.
Int. J. Neural Syst., 2022

2021
Alternative space definitions for P systems with active membranes.
J. Membr. Comput., 2021

2020
Subroutines in P systems and closure properties of their complexity classes.
Theor. Comput. Sci., 2020

Bounding the space in P systems with active membranes.
J. Membr. Comput., 2020

Simulating counting oracles with cooperation.
J. Membr. Comput., 2020

A Turing machine simulation by P systems without charges.
J. Membr. Comput., 2020

Shallow laconic P systems can count.
J. Membr. Comput., 2020

Preface.
Fundam. Informaticae, 2020

2019
Characterizing PSPACE with shallow non-confluent P systems.
J. Membr. Comput., 2019

2018
Solving QSAT in Sublinear Depth.
Proceedings of the Membrane Computing, 2018

Open Problems in Membrane Computing and How Not to Solve Them.
Proceedings of the Enjoying Natural Computing, 2018

2017
The counting power of P systems with antimatter.
Theor. Comput. Sci., 2017

A toolbox for simpler active membrane algorithms.
Theor. Comput. Sci., 2017

Characterising the complexity of tissue P systems with fission rules.
J. Comput. Syst. Sci., 2017

Tissue P Systems with Small Cell Volume.
Fundam. Informaticae, 2017

Solving a Special Case of the P Conjecture Using Dependency Graphs with Dissolution.
Proceedings of the Membrane Computing, 2017

2016
Monodirectional P systems.
Nat. Comput., 2016

Shallow Non-confluent P Systems.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Purely Catalytic P Systems over Integers and Their Generative Power.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2015
Recent complexity-theoretic results on P systems with active membranes.
J. Log. Comput., 2015

Membrane Division, Oracles, and the Counting Hierarchy.
Fundam. Informaticae, 2015

Tissue P Systems Can be Simulated Efficiently with Counting Oracles.
Proceedings of the Membrane Computing, 2015

Complexity Classes for Membrane Systems: A Survey.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Space complexity equivalence of P systems with active membranes and Turing machines.
Theor. Comput. Sci., 2014

P Systems with Active Membranes Working in Logarithmic Space.
J. Autom. Lang. Comb., 2014

Constant-Space P Systems with Active Membranes.
Fundam. Informaticae, 2014

P Systems with Active Membranes Working in Sublinear Space.
Proceedings of the Membrane Computing, 2014

Simulating Elementary Active Membranes - with an Application to the P Conjecture.
Proceedings of the Membrane Computing, 2014

Exploiting Membrane Features to Compute.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Improved Universality Results for Parallel Enzymatic Numerical P Systems.
Int. J. Unconv. Comput., 2013

Enzymatic Numerical P Systems Using Elementary Arithmetic Operations.
Proceedings of the Membrane Computing, 2013

Flattening in (Tissue) P Systems.
Proceedings of the Membrane Computing, 2013

2012
Sublinear-Space P Systems with Active Membranes.
Proceedings of the Membrane Computing, 2012

2011
P systems with active membranes: trading time for space.
Nat. Comput., 2011

Elementary Active Membranes Have the Power of Counting.
Int. J. Nat. Comput. Res., 2011

P Systems with Active Membranes Working in Polynomial Space.
Int. J. Found. Comput. Sci., 2011

P Systems Simulating Oracle Computations.
Proceedings of the Membrane Computing, 2011

2010
Non-confluence in divisionless P systems with active membranes.
Theor. Comput. Sci., 2010

Preface.
Nat. Comput., 2010

P Systems with Elementary Active Membranes: Beyond NP and coNP.
Proceedings of the Membrane Computing, 2010

On a Powerful Class of Non-universal P Systems with Active Membranes.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Computational Complexity Aspects in Membrane Computing.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Nadia Busi (1968-2007).
Theor. Comput. Sci., 2009

Computational expressiveness of Genetic Systems.
Theor. Comput. Sci., 2009

Uniform solutions to SAT and Subset Sum by spiking neural P systems.
Nat. Comput., 2009

Complexity aspects of polarizationless membrane systems.
Nat. Comput., 2009

(Tissue) P systems with cell polarity.
Math. Struct. Comput. Sci., 2009

On the Computational Power of Spiking Neural P Systems.
Int. J. Unconv. Comput., 2009

Introducing a Space Complexity Measure for P Systems.
Int. J. Comput. Commun. Control, 2009

An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

Energy-Based Models of P Systems.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008
Foreword.
Theor. Comput. Sci., 2008

On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution.
Fundam. Informaticae, 2008

Simulation of a bounded symport/antiport P system with Brane calculi.
Biosyst., 2008

How Redundant Is Your Universal Computation Device?.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

2007
Multiset-Based Self-Assembly of Graphs.
Fundam. Informaticae, 2007

Solving Numerical NP-Complete Problems with Spiking Neural P Systems.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

On a Paun's Conjecture in Membrane Systems.
Proceedings of the Bio-inspired Modeling of Cognitive Tasks, 2007

Genetic Systems without Inhibition Rules.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Computing with Genetic Gates.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Complexity classes for membrane systems.
RAIRO Theor. Informatics Appl., 2006

Dynamical probabilistic P systems.
Int. J. Found. Comput. Sci., 2006

P systems with input in binary form.
Int. J. Found. Comput. Sci., 2006

Reversible P Systems to Simulate Fredkin Circuits.
Fundam. Informaticae, 2006

(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes.
Fundam. Informaticae, 2006

Preface.
Proceedings of the First Workshop on Membrane Computing and Biologically Inspired Process Calculi, 2006

Modeling and analysis of biological processes by mem(brane) calculi and systems.
Proceedings of the Winter Simulation Conference WSC 2006, 2006

Computing with Genetic Gates, Proteins, and Membranes.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

2005
On the power and size of extended gemmating P systems.
Soft Comput., 2005

Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

P Systems with Memory.
Proceedings of the Membrane Computing, 6th International Workshop, 2005

Analysis and Simulation of Dynamics in Probabilistic P Systems.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Hierarchies of Parallel Rewriting P Systems - A Survey.
New Gener. Comput., 2004

Simulating the Fredkin Gate with Energy-Based P Systems.
J. Univers. Comput. Sci., 2004

Conservative Computations in Energy-Based P Systems.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Universal Families of Reversible P Systems.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Sequential P Systems with Unit Rules and Energy Assigned to Membranes.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
On three variants of rewriting P systems.
Theor. Comput. Sci., 2003

Gemmating P systems: collapsing hierarchies.
Theor. Comput. Sci., 2003

Collapsing Hierarchies of Parallel Rewriting P Systems without Target Conflicts.
Proceedings of the Membrane Computing, International Workshop, 2003

Deadlock Decidability in Partial Parallel P Systems.
Proceedings of the DNA Computing, 9th International Workshop on DNA Based Computers, 2003

2002
Parallel Rewriting P Systems without Target Conflicts.
Proceedings of the Membrane Computing, International Workshop, 2002

Parallel Rewriting P Systems with Deadlock.
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

2001
On Variants of Communicating Distributed H Systems.
Fundam. Informaticae, 2001

Two Normal Forms for Rewriting P Systems.
Proceedings of the Machines, 2001

P Systems with Gemmation of Mobile Membranes.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

A Clause String DNA Algorithm for SAT.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

Splicing systems using merge and separate operations.
Proceedings of the Where Mathematics, 2001

2000
Nine test tubes generate any RE language.
Theor. Comput. Sci., 2000

Solving NP-Complete Problems Using P Systems with Active Membranes.
Proceedings of the Unconventional Models of Computation, 2000

1998
Nine Test Tubes Generate any <i>RE</i> Language.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
A Reduced Distributed Splicing System for RE Languages.
Proceedings of the New Trends in Formal Languages, 1997


  Loading...