default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio E. Porreca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Oscar Defrain, Antonio E. Porreca
, Ekaterina Timofeeva:
Polynomial-delay generation of functional digraphs up to isomorphism. Discret. Appl. Math. 357: 24-33 (2024)- [j35]François Doré, Enrico Formenti, Antonio E. Porreca, Sara Riva:
Decomposition and factorisation of transients in functional graphs. Theor. Comput. Sci. 999: 114514 (2024) - [c27]François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland:
Roots in the Semiring of Finite Deterministic Dynamical Systems. AUTOMATA 2024: 120-132 - [i11]François Doré, Kévin Perrot, Antonio E. Porreca, Sara Riva, Marius Rolland:
Roots in the semiring of finite deterministic dynamical systems. CoRR abs/2405.09236 (2024) - [i10]Antonio E. Porreca:
Unconventional complexity classes in unconventional computing (extended abstract). CoRR abs/2405.16896 (2024) - 2023
- [i9]Antonio E. Porreca, Ekaterina Timofeeva:
Polynomial-delay generation of functional digraphs up to isomorphism. CoRR abs/2302.13832 (2023) - 2022
- [i8]François Doré, Enrico Formenti, Antonio E. Porreca, Sara Riva:
Algorithmic reconstruction of discrete dynamics. CoRR abs/2208.08310 (2022) - 2020
- [j34]Claudio Ferretti, Alberto Leporati, Luca Manzoni, Antonio E. Porreca:
The Many Roads to the Simulation of Reaction Systems. Fundam. Informaticae 171(1-4): 175-188 (2020) - [j33]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Shallow laconic P systems can count. J. Membr. Comput. 2(1): 49-58 (2020) - [j32]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
A Turing machine simulation by P systems without charges. J. Membr. Comput. 2(2): 71-79 (2020) - [j31]Luca Manzoni, Antonio E. Porreca, Grzegorz Rozenberg:
Facilitation in reaction systems. J. Membr. Comput. 2(3): 149-161 (2020) - [j30]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Simulating counting oracles with cooperation. J. Membr. Comput. 2(4): 303-310 (2020) - [j29]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Subroutines in P systems and closure properties of their complexity classes. Theor. Comput. Sci. 805: 193-205 (2020) - [i7]Caroline Gaze-Maillot, Antonio E. Porreca:
Profiles of dynamical systems and their algebra. CoRR abs/2008.00843 (2020)
2010 – 2019
- 2019
- [j28]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Complexity of the dynamics of reaction systems. Inf. Comput. 267: 96-109 (2019) - [j27]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca:
On the dynamical behaviour of linear higher-order cellular automata and its decidability. Inf. Sci. 486: 73-87 (2019) - [j26]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Characterizing PSPACE with shallow non-confluent P systems. J. Membr. Comput. 1(2): 75-84 (2019) - [c26]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca:
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata. LATA 2019: 95-107 - [i6]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Solving QSAT in sublinear depth. CoRR abs/1902.03879 (2019) - [i5]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
A Turing machine simulation by P systems without charges. CoRR abs/1902.03883 (2019) - [i4]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca:
On the dynamical behaviour of linear higher-order cellular automata and its decidability. CoRR abs/1902.06775 (2019) - [i3]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Characterizing PSPACE with shallow non-confluent P systems. CoRR abs/1902.09523 (2019) - [i2]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Complexity of the dynamics of reaction systems. CoRR abs/1903.07913 (2019) - [i1]Claudio Ferretti, Alberto Leporati, Luca Manzoni, Antonio E. Porreca:
The many roads to the simulation of reaction systems. CoRR abs/1904.07445 (2019) - 2018
- [c25]Alberto Dennunzio, Valentina Dorigatti, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Polynomial Equations over Finite, Discrete-Time Dynamical Systems. ACRI 2018: 298-306 - [c24]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Open Problems in Membrane Computing and How Not to Solve Them. Enjoying Natural Computing 2018: 182-191 - [c23]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Solving QSAT in Sublinear Depth. Int. Conf. on Membrane Computing 2018: 188-201 - 2017
- [j25]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Tissue P Systems with Small Cell Volume. Fundam. Informaticae 154(1-4): 261-275 (2017) - [j24]Marco S. Nobile, Antonio E. Porreca, Simone Spolaor, Luca Manzoni, Paolo Cazzaniga, Giancarlo Mauri, Daniela Besozzi:
Efficient Simulation of Reaction Systems on Graphics Processing Units. Fundam. Informaticae 154(1-4): 307-321 (2017) - [j23]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Characterising the complexity of tissue P systems with fission rules. J. Comput. Syst. Sci. 90: 115-128 (2017) - [j22]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca:
Computational complexity of finite asynchronous cellular automata. Theor. Comput. Sci. 664: 131-143 (2017) - [j21]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
A toolbox for simpler active membrane algorithms. Theor. Comput. Sci. 673: 42-57 (2017) - [j20]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
The counting power of P systems with antimatter. Theor. Comput. Sci. 701: 161-173 (2017) - [c22]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Solving a Special Case of the P Conjecture Using Dependency Graphs with Dissolution. Int. Conf. on Membrane Computing 2017: 196-213 - [e2]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Cellular Automata and Discrete Complex Systems - 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings. Lecture Notes in Computer Science 10248, Springer 2017, ISBN 978-3-319-58630-4 [contents] - 2016
- [j19]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Monodirectional P systems. Nat. Comput. 15(4): 551-564 (2016) - [j18]Sepinoud Azimi, Cristian Gratie, Sergiu Ivanov, Luca Manzoni, Ion Petre, Antonio E. Porreca:
Complexity of model checking for reaction systems. Theor. Comput. Sci. 623: 103-113 (2016) - [c21]Luca Manzoni, Antonio E. Porreca, Hiroshi Umeo:
The Firing Squad Synchronization Problem on Higher-Dimensional CA with Multiple Updating Cycles. CANDAR 2016: 258-261 - [c20]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Reachability in Resource-Bounded Reaction Systems. LATA 2016: 592-602 - [c19]Artiom Alhazov, Omar Belingheri, Rudolf Freund, Sergiu Ivanov, Antonio E. Porreca, Claudio Zandron:
Purely Catalytic P Systems over Integers and Their Generative Power. Int. Conf. on Membrane Computing 2016: 67-82 - [c18]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Shallow Non-confluent P Systems. Int. Conf. on Membrane Computing 2016: 307-316 - 2015
- [j17]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Membrane Division, Oracles, and the Counting Hierarchy. Fundam. Informaticae 138(1-2): 97-111 (2015) - [j16]Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron:
Recent complexity-theoretic results on P systems with active membranes. J. Log. Comput. 25(4): 1047-1071 (2015) - [j15]Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
On the complexity of occurrence and convergence problems in reaction systems. Nat. Comput. 14(1): 185-191 (2015) - [j14]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Ancestors, descendants, and gardens of Eden in reaction systems. Theor. Comput. Sci. 608: 16-26 (2015) - [c17]Giancarlo Mauri, Alberto Leporati, Luca Manzoni, Antonio E. Porreca, Claudio Zandron:
Complexity Classes for Membrane Systems: A Survey. LATA 2015: 56-69 - [c16]Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Preimage Problems for Reaction Systems. LATA 2015: 537-548 - [c15]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Tissue P Systems Can be Simulated Efficiently with Counting Oracles. Int. Conf. on Membrane Computing 2015: 251-261 - 2014
- [j13]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Constant-Space P Systems with Active Membranes. Fundam. Informaticae 134(1-2): 111-128 (2014) - [j12]Alberto Dennunzio, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca:
Preface. Int. J. Found. Comput. Sci. 25(4): 369-372 (2014) - [j11]Luca Manzoni, Diogo Poças, Antonio E. Porreca:
Simple reaction Systems and their Classification. Int. J. Found. Comput. Sci. 25(4): 441-458 (2014) - [j10]Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
P Systems with Active Membranes Working in Logarithmic Space. J. Autom. Lang. Comb. 19(1-4): 173-184 (2014) - [j9]Artiom Alhazov, Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Space complexity equivalence of P systems with active membranes and Turing machines. Theor. Comput. Sci. 529: 69-81 (2014) - [c14]Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Fixed Points and Attractors of Reaction Systems. CiE 2014: 194-203 - [c13]Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Cycles and Global Attractors of Reaction Systems. DCFS 2014: 114-125 - [c12]Claudio Zandron, Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca:
P Systems with Active Membranes Working in Sublinear Space. Int. Conf. on Membrane Computing 2014: 35-47 - [c11]Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Simulating Elementary Active Membranes - with an Application to the P Conjecture. Int. Conf. on Membrane Computing 2014: 284-299 - 2013
- [j8]Alberto Leporati, Antonio E. Porreca, Claudio Zandron, Giancarlo Mauri:
Improved Universality Results for Parallel Enzymatic Numerical P Systems. Int. J. Unconv. Comput. 9(5-6): 385-404 (2013) - [c10]Rudolf Freund, Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca, Sergey Verlan, Claudio Zandron:
Flattening in (Tissue) P Systems. Int. Conf. on Membrane Computing 2013: 173-188 - [c9]Alberto Leporati, Luca Manzoni, Antonio E. Porreca:
Flattening and Simulation of Asynchronous Divisionless P Systems with Active Membranes. Int. Conf. on Membrane Computing 2013: 238-248 - [c8]Alberto Leporati, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron:
Enzymatic Numerical P Systems Using Elementary Arithmetic Operations. Int. Conf. on Membrane Computing 2013: 249-264 - [c7]Luca Manzoni, Antonio E. Porreca:
Reaction Systems Made Simple - A Normal Form and a Classification Theorem. UCNC 2013: 150-161 - [e1]Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca:
Unconventional Computation and Natural Computation - 12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013. Proceedings. Lecture Notes in Computer Science 7956, Springer 2013, ISBN 978-3-642-39073-9 [contents] - 2012
- [b1]Antonio E. Porreca:
The time-space trade-off in membrane computing. University of Milan, Italy, 2012 - [j7]Antonio E. Porreca:
Review of algorithmic adventures: from knowledge to magic, by Juraj Hromković. SIGACT News 43(3): 22-24 (2012) - [c6]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
Sublinear-Space P Systems with Active Membranes. Int. Conf. on Membrane Computing 2012: 342-357 - 2011
- [j6]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
P Systems with Active Membranes Working in Polynomial Space. Int. J. Found. Comput. Sci. 22(1): 65-73 (2011) - [j5]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
Elementary Active Membranes Have the Power of Counting. Int. J. Nat. Comput. Res. 2(3): 35-48 (2011) - [j4]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
P systems with active membranes: trading time for space. Nat. Comput. 10(1): 167-182 (2011) - [c5]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
P Systems Simulating Oracle Computations. Int. Conf. on Membrane Computing 2011: 346-358 - 2010
- [j3]Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron:
Non-confluence in divisionless P systems with active membranes. Theor. Comput. Sci. 411(6): 878-887 (2010) - [c4]Giancarlo Mauri, Alberto Leporati, Antonio E. Porreca, Claudio Zandron:
Computational Complexity Aspects in Membrane Computing. CiE 2010: 317-320 - [c3]Antonio E. Porreca, Alberto Leporati, Claudio Zandron:
On a Powerful Class of Non-universal P Systems with Active Membranes. Developments in Language Theory 2010: 364-375 - [c2]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
P Systems with Elementary Active Membranes: Beyond NP and coNP. Int. Conf. on Membrane Computing 2010: 338-347
2000 – 2009
- 2009
- [j2]Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
Introducing a Space Complexity Measure for P Systems. Int. J. Comput. Commun. Control 4(3): 301-310 (2009) - [c1]Andrea Valsecchi, Antonio E. Porreca, Alberto Leporati, Giancarlo Mauri, Claudio Zandron:
An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes. Workshop on Membrane Computing 2009: 461-478 - 2006
- [j1]Antonio E. Porreca, Giancarlo Mauri, Claudio Zandron:
Complexity classes for membrane systems. RAIRO Theor. Informatics Appl. 40(2): 141-162 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
