Giancarlo Mauri

From MaRDI portal
Person:243594

Available identifiers

zbMath Open mauri.giancarloDBLP79/4374WikidataQ54201216 ScholiaQ54201216MaRDI QIDQ243594

List of research outcomes





PublicationDate of PublicationType
Spiking neural P systems: main ideas and results2023-08-31Paper
Evaluating space measures in P systems2023-08-29Paper
On the complexity of approximately matching a string to a directed graph2022-10-13Paper
Depth-two P systems can simulate Turing machines with \textbf{NP} oracles2022-02-21Paper
A Turing machine simulation by P systems without charges2021-09-14Paper
Simulating counting oracles with cooperation2021-09-14Paper
Alternative space definitions for P systems with active membranes2021-09-14Paper
Shallow laconic P-systems can count2021-09-14Paper
Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity2021-05-11Paper
Complexity issues of string to graph approximate matching2020-07-27Paper
The longest filled common subsequence problem2020-05-25Paper
Characterizing PSPACE with shallow non-confluent P systems2020-02-24Paper
Subroutines in P systems and closure properties of their complexity classes2020-01-08Paper
Comparing incomplete sequences via longest common subsequence2019-11-13Paper
Solving QSAT in sublinear depth2019-10-10Paper
Monodirectional P systems2019-07-10Paper
On the tractability of finding disjoint clubs in a network2019-06-18Paper
Covering a Graph with Clubs2019-05-24Paper
Open problems in membrane computing and how not to solve them2019-01-15Paper
Covering with clubs: complexity and approximability2018-09-06Paper
Solving a special case of the P conjecture using dependency graphs with dissolution2018-05-16Paper
Efficient Simulation of Reaction Systems on Graphics Processing Units2018-01-19Paper
Tissue P Systems with Small Cell Volume2018-01-19Paper
The counting power of P systems with antimatter2017-12-06Paper
Characterising the complexity of tissue P systems with fission rules2017-09-15Paper
A toolbox for simpler active membrane algorithms2017-05-02Paper
Shallow Non-confluent P Systems2017-04-12Paper
Computational complexity of finite asynchronous cellular automata2017-03-16Paper
https://portal.mardi4nfdi.de/entity/Q29691092017-03-14Paper
https://portal.mardi4nfdi.de/entity/Q55070682016-12-16Paper
A study on learning robustness using asynchronous 1D cellular automata rules2016-07-08Paper
Membrane division, oracles, and the counting hierarchy2016-05-11Paper
Complexity Classes for Membrane Systems: A Survey2016-04-08Paper
\(m\)-asynchronous cellular automata: from fairness to quasi-fairness2016-04-06Paper
Tissue P Systems Can be Simulated Efficiently with Counting Oracles2016-02-26Paper
Recent complexity-theoretic results on P systems with active membranes2016-01-28Paper
P Systems with Active Membranes Working in Sublinear Space2015-12-02Paper
Simulating Elementary Active Membranes2015-12-02Paper
Restricted and swap common superstring: a multivariate algorithmic perspective2015-09-02Paper
Self-stabilization in membrane systems2015-08-06Paper
Constant-Space P Systems with Active Membranes2015-06-26Paper
Bounded Extrinsic Noises Affecting Biochemical Networks with Low Molecule Numbers2015-05-22Paper
CAPRI: Efficient Inference of Cancer Progression Models from Cross-sectional Data2014-08-19Paper
Stochastic hybrid automata with delayed transitions to model biochemical systems with delays2014-06-06Paper
A study of search algorithms' optimization speed2014-04-08Paper
Flattening in (Tissue) P Systems2014-03-28Paper
Enzymatic Numerical P Systems Using Elementary Arithmetic Operations2014-03-28Paper
Space complexity equivalence of P systems with active membranes and Turing machines2014-03-19Paper
The \(l\)-diversity problem: tractability and approximability2014-01-13Paper
Communication via mobile vesicles in brane calculi2013-12-06Paper
Inferring tree causal models of cancer progression with probability raising2013-11-25Paper
Sublinear-Space P Systems with Active Membranes2013-04-16Paper
Restricted and Swap Common Superstring: A Parameterized View2013-01-07Paper
An excursion in reaction systems: from computer science to biology2012-10-11Paper
P Systems Simulating Oracle Computations2012-06-08Paper
A distance between populations for one-point crossover in genetic algorithms2012-05-30Paper
A study of the neutrality of Boolean function landscapes in genetic programming2012-05-14Paper
Picture Languages Generated by Assembling Tiles2011-11-22Paper
On the Complexity of the l-diversity Problem2011-08-17Paper
P systems with active membranes: Trading time for space2011-05-23Paper
PSYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE2011-02-23Paper
MODELING DIFFUSION IN A SIGNAL TRANSDUCTION PATHWAY: THE USE OF VIRTUAL VOLUMES IN P SYSTEMS2011-02-23Paper
P Systems with Elementary Active Membranes: Beyond NP and coNP2011-01-21Paper
A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms2010-10-04Paper
Fingerprint clustering with bounded number of missing values2010-09-16Paper
Computational Complexity Aspects in Membrane Computing2010-07-29Paper
Pattern Discovery in RNA Secondary Structure Using Affix Trees2010-04-06Paper
An application of kernel methods to gene cluster temporal meta-analysis2010-03-19Paper
Non-confluence in divisionless P systems with active membranes2010-02-19Paper
Energy-Based Models of P Systems2010-01-26Paper
An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes2010-01-26Paper
A Novel Variant of P Systems for the Modelling and Simulation of Biochemical Systems2010-01-26Paper
Uniform solutions to SAT and subset sum by spiking neural P systems2010-01-25Paper
Complexity aspects of polarizationless membrane systems2010-01-25Paper
(Tissue) P systems with cell polarity2010-01-12Paper
How Redundant Is Your Universal Computation Device?2009-07-28Paper
First Steps Towards a Wet Implementation for τ-DPP2009-07-28Paper
Membrane Computing2009-05-15Paper
Aspects of Molecular Computing2009-05-14Paper
Analysis and Simulation of Dynamics in Probabilistic P Systems2009-04-02Paper
Picture Languages Generated by Assembling Tiles2009-04-02Paper
A Decision Procedure for Reflexive Regular Splicing Languages2009-03-26Paper
On the computational efficiency of polarizationless recognizer P systems with strong division and dissolution2009-02-12Paper
Clustering Dependencies with Support Vectors2009-01-07Paper
Seasonal variance in P system models for metapopulations2008-11-10Paper
Solving the factorization problem with P systems2008-11-10Paper
Solving Numerical NP-Complete Problems with Spiking Neural P Systems2008-03-28Paper
Emergent pattern interpretation in vegetable population dynamics2008-03-06Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Membrane Systems and Their Application to Systems Biology2007-11-13Paper
Fingerprint Clustering with Bounded Number of Missing Values2007-09-14Paper
Tau Leaping Stochastic Simulation Method in P Systems2007-09-03Paper
Complexity classes for membrane systems2007-04-10Paper
Reversible P systems to simulate Fredkin circuits2007-01-19Paper
Membrane Computing2006-11-13Paper
Membrane Computing2006-11-13Paper
Membrane Computing2006-11-13Paper
https://portal.mardi4nfdi.de/entity/Q54859712006-09-06Paper
Supporting action-at-a-distance in situated cellular agents2006-06-19Paper
Linear splicing and syntactic monoid2006-04-28Paper
DYNAMICAL PROBABILISTIC P SYSTEMS2006-04-06Paper
New Computational Paradigms2006-01-11Paper
DNA Computing2006-01-10Paper
DNA Computing2006-01-10Paper
Computational Methods in Systems Biology2005-12-23Paper
On the power and size of extended gemmating P systems2005-12-13Paper
Machines, Computations, and Universality2005-12-08Paper
Machines, Computations, and Universality2005-12-08Paper
On the power of circular splicing2005-09-28Paper
Membrane Computing2005-09-14Paper
Regular splicing languages and subclasses2005-08-01Paper
Algorithms for pattern matching and discovery in RNA secondary structure2005-06-10Paper
On-line construction of compact directed acyclic word graphs2005-02-22Paper
Hierarchies of parallel rewriting P systems -- a survey2005-02-11Paper
Circular splicing and regularity2004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44705592004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44483622004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44520572004-02-11Paper
Gemmating P systems: Collapsing hierarchies.2003-08-17Paper
On three variants of rewriting P systems2003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44146902003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44138222003-07-21Paper
https://portal.mardi4nfdi.de/entity/Q44121012003-07-13Paper
A parallel algorithm for pattern discovery in biological sequences2003-01-21Paper
A duality theorem for two connectivity-preserving parallel shrinking transformations2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45364102002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q47791072002-11-24Paper
https://portal.mardi4nfdi.de/entity/Q47786692002-11-18Paper
Parallel simulation of reaction–diffusion phenomena in percolation processes2002-07-14Paper
Separating some splicing models.2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q45299792002-05-07Paper
https://portal.mardi4nfdi.de/entity/Q45299962002-05-07Paper
Cellular automata: From a theoretical parallel computational model to its application to complex systems2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27239452001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q27075412001-04-03Paper
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD2001-02-11Paper
https://portal.mardi4nfdi.de/entity/Q42467932000-08-24Paper
Nine test tubes generate any RE language2000-08-23Paper
https://portal.mardi4nfdi.de/entity/Q49426132000-03-15Paper
https://portal.mardi4nfdi.de/entity/Q49391992000-02-23Paper
Cellular automata in fuzzy backgrounds2000-01-24Paper
https://portal.mardi4nfdi.de/entity/Q42524231999-11-01Paper
https://portal.mardi4nfdi.de/entity/Q42692191999-10-31Paper
On the dynamical behavior of chaotic cellular automata1999-04-28Paper
Multilayered cellular automata1999-04-28Paper
https://portal.mardi4nfdi.de/entity/Q48446531996-05-05Paper
https://portal.mardi4nfdi.de/entity/Q43118511995-12-18Paper
https://portal.mardi4nfdi.de/entity/Q43206501995-02-02Paper
https://portal.mardi4nfdi.de/entity/Q42736661994-01-13Paper
On automata on infinite trees1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39712551992-06-25Paper
Membership problems for regular and context-free trace languages1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38215971988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37937291988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37827831987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37668501987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37636011986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36835391985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37501221985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37073781984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36819381984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33116471983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574521982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39471461982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33401791982-01-01Paper
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39698521981-01-01Paper
On efficient computation of the coefficients of some polynomials with applications to some enumeration problems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39235971981-01-01Paper
Sulla complessita di alcuni problemi di conteggio1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41980511979-01-01Paper
Three efficient algorithms for counting problems1979-01-01Paper
ANALYSIS AND COMPACTING OF MUSICAL TEXTS1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41432091977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41403901977-01-01Paper

Research outcomes over time

This page was built for person: Giancarlo Mauri