Antonio E. Porreca

According to our database1, Antonio E. Porreca authored at least 47 papers between 2006 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Polynomial Equations over Finite, Discrete-Time Dynamical Systems.
Proceedings of the Cellular Automata, 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

Computational complexity of finite asynchronous cellular automata.
Theor. Comput. Sci., 2017

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

Efficient Simulation of Reaction Systems on Graphics Processing Units.
Fundam. Inform., 2017

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

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

2016
Complexity of model checking for reaction systems.
Theor. Comput. Sci., 2016

Monodirectional P systems.
Natural Computing, 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

Reachability in Resource-Bounded Reaction Systems.
Proceedings of the Language and Automata Theory and Applications, 2016

The Firing Squad Synchronization Problem on Higher-Dimensional CA with Multiple Updating Cycles.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

2015
Ancestors, descendants, and gardens of Eden in reaction systems.
Theor. Comput. Sci., 2015

On the complexity of occurrence and convergence problems in reaction systems.
Natural Computing, 2015

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

Membrane Division, Oracles, and the Counting Hierarchy.
Fundam. Inform., 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

Preimage Problems for Reaction Systems.
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.
Journal of Automata, Languages and Combinatorics, 2014

Simple reaction Systems and their Classification.
Int. J. Found. Comput. Sci., 2014

Preface.
Int. J. Found. Comput. Sci., 2014

Constant-Space P Systems with Active Membranes.
Fundam. Inform., 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

Cycles and Global Attractors of Reaction Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Fixed Points and Attractors of Reaction Systems.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Improved Universality Results for Parallel Enzymatic Numerical P Systems.
IJUC, 2013

Reaction Systems Made Simple - A Normal Form and a Classification Theorem.
Proceedings of the Unconventional Computation and Natural Computation, 2013

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

Flattening and Simulation of Asynchronous Divisionless P Systems with Active Membranes.
Proceedings of the Membrane Computing, 2013

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

2012
Review of algorithmic adventures: from knowledge to magic, by Juraj Hromković.
SIGACT News, 2012

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

2011
P systems with active membranes: trading time for space.
Natural Computing, 2011

Elementary Active Membranes Have the Power of Counting.
IJNCR, 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

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
An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

2006
Complexity classes for membrane systems.
ITA, 2006


  Loading...