Andrei Paun

According to our database1, Andrei Paun authored at least 83 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Further Properties of Self-assembly by Hairpin Formation.
Proceedings of the Unconventional Computation and Natural Computation, 2019

How Complex is to Solve a Hard Problem with Accepting Splicing Systems.
Proceedings of the 4th International Conference on Complexity, 2019

2018
Spiking Neural P Systems With Polarizations.
IEEE Trans. Neural Netw. Learning Syst., 2018

Small networks of polarized splicing processors are universal.
Natural Computing, 2018

One Dimensional DNA Tiles Self Assembly Model Simulation.
IJUC, 2018

Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request.
Int. J. Neural Syst., 2018

Universal enzymatic numerical P systems with small number of enzymatic variables.
SCIENCE CHINA Information Sciences, 2018

DNA-Guided Assembly of Nanocellulose Meshes.
Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

A Look at the Descriptional Complexity of SNQ P Systems.
Proceedings of the Enjoying Natural Computing, 2018

2017
Improvements on contours based segmentation for DNA microarray image processing.
Theor. Comput. Sci., 2017

On trace languages generated by (small) spiking neural P systems.
Theor. Comput. Sci., 2017

Spiking Neural P Systems with Rules on Synapses Working in Sum Spikes Consumption Strategy.
Fundam. Inform., 2017

P Systems Simulating Bacterial Conjugation: Universality and Properties.
Fundam. Inform., 2017

Networks of Polarized Splicing Processors.
Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017

2016
Numerical P systems with migrating variables.
Theor. Comput. Sci., 2016

A failure index for HPC applications.
J. Parallel Distrib. Comput., 2016

2015
On the Universality of Axon P Systems.
IEEE Trans. Neural Netw. Learning Syst., 2015

Segmenting microarray images using a contour-based method.
Theor. Comput. Sci., 2015

2014
Three Universal Homogeneous Spiking Neural P Systems Using Max Spike.
Fundam. Inform., 2014

2013
P systems with proteins on membranes characterize PSPACE.
Theor. Comput. Sci., 2013

2012
A Case-Study on the Influence of Noise to Log-Gain Principles for Flux Dynamic Discovery.
Proceedings of the Membrane Computing, 2012

2011
A review of the nondeterministic waiting time algorithm.
Natural Computing, 2011

P Systems with proteins on Membranes: a Survey.
Int. J. Found. Comput. Sci., 2011

Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines.
Proceedings of the Membrane Computing, 2011

Poster: Biochemical signaling: A discrete simulation with memory enhancement.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2009
Discrete Modeling of Biochemical Signaling with Memory Enhancement.
Trans. Computational Systems Biology, 2009

On the Hopcroft's minimization technique for DFA and DFCA.
Theor. Comput. Sci., 2009

Sequential SNP systems based on min/max spike number.
Theor. Comput. Sci., 2009

The Nondeterministic Waiting Time Algorithm: A Review
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

On the Power of Computing with Proteins on Membranes.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

2008
Computing with cells: membrane systems - some complexity issues.
IJPEDS, 2008

Spiking neural P systems with extended rules: universality and languages.
Natural Computing, 2008

Discrete Nondeterministic Modeling of the Fas Pathway.
Int. J. Found. Comput. Sci., 2008

Hopcroft's Minimization Technique: Queues or Stacks?.
Proceedings of the Implementation and Applications of Automata, 2008

Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation.
Proceedings of the Membrane Computing - 9th International Workshop, 2008

Sequentiality Induced by Spike Number in SNP Systems.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007
Membrane Systems.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Normal forms for spiking neural P systems.
Theor. Comput. Sci., 2007

Small universal spiking neural P systems.
Biosystems, 2007

On Flip-Flop Membrane Systems with Proteins.
Proceedings of the Membrane Computing, 8th International Workshop, 2007

2006
Incremental construction of minimal deterministic finite cover automata.
Theor. Comput. Sci., 2006

P Systems with Proteins on Membranes.
Fundam. Inform., 2006

On Spiking Neural P Systems and Partially Blind Counter Machines.
Proceedings of the Unconventional Computation, 5th International Conference, 2006

Modeling Signal Transduction Using P Systems.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

P Systems with Symport/Antiport and Time.
Proceedings of the Membrane Computing, 7th International Workshop, 2006

Computing with Spiking Neural P Systems: Traces and Small Universal Systems.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

P Systems with Proteins on Membranes and Membrane Division.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

On Trace Languages Generated by (Small) Spiking Neural P Systems.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Tight Bounds for the State Complexity of Deterministic Cover Automata.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
P systems with active membranes and without polarizations.
Soft Comput., 2005

Optimal results for the computational completeness of gemmating (tissue) P systems.
Int. J. Found. Comput. Sci., 2005

Results on Transforming NFA into DFCA.
Fundam. Inform., 2005

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata.
Proceedings of the Implementation and Application of Automata, 2005

Counting Time in Computing with Cells.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Results on Catalytic and Evolution-Communication P Systems.
New Generation Comput., 2004

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets.
Proceedings of the Implementation and Application of Automata, 2004

P Systems Generating Trees.
Proceedings of the Membrane Computing, 5th International Workshop, 2004

Computing Beyond the Turing Limit Using the H Systems.
Proceedings of the DNA Computing, 10th International Workshop on DNA Computing, 2004

Gemmating P Systems are Computationally Complete with Four Membranes.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Lower bounds for NFA to DCFA Transformations.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

On the Universality of P Systems with Minimal Symport/Antiport Rules.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Counting The Number Of Minimal Dfca Obtained By Merging States.
Int. J. Found. Comput. Sci., 2003

Universality of Minimal Symport/Antiport: Five Membranes Suffice.
Proceedings of the Membrane Computing, International Workshop, 2003

2002
The Power of Communication: P Systems with Symport/Antiport.
New Generation Comput., 2002

P Systems with Global Rules.
Theory Comput. Syst., 2002

On the Power of P Systems with Symport Rules.
J. UCS, 2002

Computing by Communication in Networks of Membranes.
Int. J. Found. Comput. Sci., 2002

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Int. J. Found. Comput. Sci., 2002

ReMembrane Systems with Coupled Transport: Universality and Normal Forms.
Fundam. Inform., 2002

Membrane Computing: New Results, New Problems.
Bulletin of the EATCS, 2002

Membrane Systems with Symport/Antiport Rules: Universality Results.
Proceedings of the Membrane Computing, International Workshop, 2002

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata.
Proceedings of the Implementation and Application of Automata, 2002

Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport.
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

2001
Further Remarks on P Systems with Symport Rules.
Sci. Ann. Cuza Univ., 2001

On P Systems with Global Rules.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

On membrane computing based on splicing.
Proceedings of the Where Mathematics, 2001

String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
On the Diameter of Various Classes of H Systems.
Journal of Automata, Languages and Combinatorics, 2000

An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Proceedings of the Implementation and Application of Automata, 2000

On P Systems with Active Membranes.
Proceedings of the Unconventional Models of Computation, 2000

1999
On Time-Varying H Systems.
Bulletin of the EATCS, 1999

State and Transition Complexity of Watson-Crick Finite Automata.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1997
Controlled H Systems of Small Radius.
Fundam. Inform., 1997


  Loading...