Controlled H Systems of Small Radius. - Andrei Paun (Fundam. Informaticae, 1997)

State and Transition Complexity of Watson-Crick Finite Automata. - Andrei Paun; Mihaela Paun (FCT, 1999)

On Time-Varying H Systems. - Andrei Paun (Bull. EATCS, 1999)

On P Systems with Active Membranes. - Andrei Paun (UMC, 2000)

An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. - Andrei Paun; Nicolae Santean; Sheng Yu 001 (CIAA, 2000)

On the Diameter of Various Classes of H Systems. - Andrei Paun (J. Autom. Lang. Comb., 2000)

String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. - Lila Kari; Andrei Paun (Words, Semigroups, and Transductions, 2001)

On membrane computing based on splicing. - Andrei Paun; Mihaela Paun (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Further Remarks on P Systems with Symport Rules. - Andrei Paun; Gheorghe Paun; Alfonso Rodríguez-Patón (Sci. Ann. Cuza Univ., 2001)

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. - Cezar Câmpeanu; Andrei Paun (CIAA, 2002)

Membrane Systems with Symport/Antiport Rules: Universality Results. - Rudolf Freund; Andrei Paun (WMC-CdeA, 2002)

Membrane Computing: New Results, New Problems. - Carlos Martín-Vide; Andrei Paun; Gheorghe Paun (Bull. EATCS, 2002)

ReMembrane Systems with Coupled Transport: Universality and Normal Forms. - Carlos Martín-Vide; Andrei Paun; Gheorghe Paun; Grzegorz Rozenberg (Fundam. Informaticae, 2002)

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. - Cezar Câmpeanu; Andrei Paun; Sheng Yu 001 (Int. J. Found. Comput. Sci., 2002)

Computing by Communication in Networks of Membranes. - Andrei Paun; Gheorghe Paun; Grzegorz Rozenberg (Int. J. Found. Comput. Sci., 2002)

On the Power of P Systems with Symport Rules. - Carlos Martín-Vide; Andrei Paun; Gheorghe Paun (J. Univers. Comput. Sci., 2002)

P Systems with Global Rules. - Andrei Paun (Theory Comput. Syst., 2002)

The Power of Communication: P Systems with Symport/Antiport. - Andrei Paun; Gheorghe Paun (New Gener. Comput., 2002)

Universality of Minimal Symport/Antiport: Five Membranes Suffice. - Francesco Bernardini; Andrei Paun (Workshop on Membrane Computing, 2003)

Counting The Number Of Minimal Dfca Obtained By Merging States. - Cezar Câmpeanu; Andrei Paun (Int. J. Found. Comput. Sci., 2003)

Unexpected universality results for three classes of P systems with symport/antiport. - Mihai Ionescu; Carlos Martín-Vide; Andrei Paun; Gheorghe Paun (Nat. Comput., 2003)

On the Universality of P Systems with Minimal Symport/Antiport Rules. - Lila Kari; Carlos Martín-Vide; Andrei Paun (Aspects of Molecular Computing, 2004)

Lower bounds for NFA to DCFA Transformations. - Cezar Câmpeanu; Andrei Paun (DCFS, 2004)

Gemmating P Systems are Computationally Complete with Four Membranes. - Rudolf Freund; Marion Oswald; Andrei Paun (DCFS, 2004)

Computing Beyond the Turing Limit Using the H Systems. - Cezar Câmpeanu; Andrei Paun (DNA, 2004)

P Systems Generating Trees. - Rudolf Freund; Marion Oswald; Andrei Paun (Workshop on Membrane Computing, 2004)

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. - Cezar Câmpeanu; Andrei Paun (CIAA, 2004)

Results on Catalytic and Evolution-Communication P Systems. - Shankara Narayanan Krishna; Andrei Paun (New Gener. Comput., 2004)

Counting Time in Computing with Cells. - Oscar H. Ibarra; Andrei Paun (DNA, 2005)

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. - Cezar Câmpeanu; Andrei Paun; Jason R. Smith 002 (CIAA, 2005)

Results on Transforming NFA into DFCA. - Cezar Câmpeanu; Lila Kari; Andrei Paun (Fundam. Informaticae, 2005)

Optimal results for the computational completeness of gemmating (tissue) P systems. - Rudolf Freund; Marion Oswald; Andrei Paun (Int. J. Found. Comput. Sci., 2005)

P systems with active membranes and without polarizations. - Rudolf Freund; Andrei Paun (Soft Comput., 2005)

Tight Bounds for the State Complexity of Deterministic Cover Automata. - Cezar Câmpeanu; Andrei Paun; Jason R. Smith 002 (DCFS, 2006)

On Trace Languages Generated by (Small) Spiking Neural P Systems. - Haiming Chen 001; Mihai Ionescu; Andrei Paun; Gheorghe Paun; Bianca Popa (DCFS, 2006)

P Systems with Proteins on Membranes and Membrane Division. - Andrei Paun; Bianca Popa (Developments in Language Theory, 2006)

Computing with Spiking Neural P Systems: Traces and Small Universal Systems. - Mihai Ionescu; Andrei Paun; Gheorghe Paun; Mario J. Pérez-Jiménez (DNA, 2006)

P Systems with Symport/Antiport and Time. - Hitesh Nagda; Andrei Paun; Alfonso Rodríguez-Patón (Workshop on Membrane Computing, 2006)

Modeling Signal Transduction Using P Systems. - Andrei Paun; Mario J. Pérez-Jiménez; Francisco José Romero-Campero (Workshop on Membrane Computing, 2006)

P Systems with Proteins on Membranes. - Andrei Paun; Bianca Popa (Fundam. Informaticae, 2006)

Incremental construction of minimal deterministic finite cover automata. - Cezar Câmpeanu; Andrei Paun; Jason R. Smith 002 (Theor. Comput. Sci., 2006)

On Flip-Flop Membrane Systems with Proteins. - Andrei Paun; Alfonso Rodríguez-Patón (Workshop on Membrane Computing, 2007)

Small universal spiking neural P systems. - Andrei Paun; Gheorghe Paun (Biosyst., 2007)

On the Hopcroft's minimization algorithm - Andrei Paun (CoRR, 2007)

Normal forms for spiking neural P systems. - Oscar H. Ibarra; Andrei Paun; Gheorghe Paun; Alfonso Rodríguez-Patón; Petr Sosík; Sara Woodworth (Theor. Comput. Sci., 2007)

Membrane Systems. - Andrei Paun; Oscar H. Ibarra (Handbook of Parallel Computing, 2007)

Sequentiality Induced by Spike Number in SNP Systems. - Oscar H. Ibarra; Andrei Paun; Alfonso Rodríguez-Patón (DNA, 2008)

Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation. - John Jack; Andrei Paun; Alfonso Rodríguez-Patón (Workshop on Membrane Computing, 2008)

Hopcroft's Minimization Technique: Queues or Stacks?. - Andrei Paun; Mihaela Paun; Alfonso Rodríguez-Patón (CIAA, 2008)

Discrete Nondeterministic Modeling of the Fas Pathway. - John Jack; Alfonso Rodríguez-Patón; Oscar H. Ibarra; Andrei Paun (Int. J. Found. Comput. Sci., 2008)

Spiking neural P systems with extended rules: universality and languages. - Haiming Chen 001; Mihai Ionescu; Tseren-Onolt Ishdorj; Andrei Paun; Gheorghe Paun; Mario J. Pérez-Jiménez (Nat. Comput., 2008)

On spiking neural P systems and partially blind counter machines. - Oscar H. Ibarra; Sara Woodworth; Fang Yu 001; Andrei Paun (Nat. Comput., 2008)

Computing with cells: membrane systems - some complexity issues. - Oscar H. Ibarra; Andrei Paun (Int. J. Parallel Emergent Distributed Syst., 2008)

On the Power of Computing with Proteins on Membranes. - Petr Sosík; Andrei Paun; Alfonso Rodríguez-Patón; David Pérez (Workshop on Membrane Computing, 2009)

The Nondeterministic Waiting Time Algorithm: A Review - John Jack; Andrei Paun (DCFS, 2009)

Sequential SNP systems based on min/max spike number. - Oscar H. Ibarra; Andrei Paun; Alfonso Rodríguez-Patón (Theor. Comput. Sci., 2009)

On the Hopcroft's minimization technique for DFA and DFCA. - Andrei Paun; Mihaela Paun; Alfonso Rodríguez-Patón (Theor. Comput. Sci., 2009)

Discrete Modeling of Biochemical Signaling with Memory Enhancement. - John Jack; Andrei Paun (Trans. Comp. Sys. Biology, 2009)

Poster: Biochemical signaling: A discrete simulation with memory enhancement. - Andrei Paun; Mihaela Paun; Alfonso Rodríguez-Patón; John Jack (ICCABS, 2011)

Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines. - Andrei Paun; Manuela Sidoroff (Int. Conf. on Membrane Computing, 2011)

P Systems with proteins on Membranes: a Survey. - Andrei Paun; Mihaela Paun; Alfonso Rodríguez-Patón; Manuela Sidoroff (Int. J. Found. Comput. Sci., 2011)

A review of the nondeterministic waiting time algorithm. - John Jack; Andrei Paun; Alfonso Rodríguez-Patón (Nat. Comput., 2011)

A Case-Study on the Influence of Noise to Log-Gain Principles for Flux Dynamic Discovery. - Tanvir Ahmed 003; Garrett DeLancy; Andrei Paun (Int. Conf. on Membrane Computing, 2012)

P systems with proteins on membranes characterize PSPACE. - Petr Sosík; Andrei Paun; Alfonso Rodríguez-Patón (Theor. Comput. Sci., 2013)

Three Universal Homogeneous Spiking Neural P Systems Using Max Spike. - Andrei Paun; Petr Sosík (Fundam. Informaticae, 2014)

Segmenting microarray images using a contour-based method. - Mihaela Paun; Yang Li 006; Yuan Cheng; Iris Tusa; Andrei Paun (Theor. Comput. Sci., 2015)

On the Universality of Axon P Systems. - Xingyi Zhang 001; Linqiang Pan; Andrei Paun (IEEE Trans. Neural Networks Learn. Syst., 2015)

A failure index for HPC applications. - Andrei Paun; Clayton Chandler; Chokchai Leangsuksun; Mihaela Paun (J. Parallel Distributed Comput., 2016)

Numerical P systems with migrating variables. - Zhiqiang Zhang 002; Tingfang Wu; Andrei Paun; Linqiang Pan (Theor. Comput. Sci., 2016)

Networks of Polarized Splicing Processors. - Henning Bordihn; Victor Mitrana; Andrei Paun; Mihaela Paun (TPNC, 2017)

P Systems Simulating Bacterial Conjugation: Universality and Properties. - Andrei Paun; Alfonso Rodríguez-Patón (Fundam. Informaticae, 2017)

Spiking Neural P Systems with Rules on Synapses Working in Sum Spikes Consumption Strategy. - Yansen Su; Tingfang Wu; Fei Xu; Andrei Paun (Fundam. Informaticae, 2017)

On trace languages generated by (small) spiking neural P systems. - Haiming Chen 001; Mihai Ionescu; Andrei Paun; Gheorghe Paun (Theor. Comput. Sci., 2017)

Improvements on contours based segmentation for DNA microarray image processing. - Yang Li 006; Andrei Paun; Mihaela Paun (Theor. Comput. Sci., 2017)

A Look at the Descriptional Complexity of SNQ P Systems. - Andrei Paun; Florin-Daniel Bîlbîe (Enjoying Natural Computing, 2018)

DNA-Guided Assembly of Nanocellulose Meshes. - Alexandru Amarioarei; Gefry Barad; Eugen Czeizler; Ana-Maria Dobre; Corina Itcus; Victor Mitrana; Andrei Paun; Mihaela Paun; Frankie Spencer; Romica Trandafir; Iris Tusa (TPNC, 2018)

Universal enzymatic numerical P systems with small number of enzymatic variables. - Zhiqiang Zhang 002; Tingfang Wu; Andrei Paun; Linqiang Pan (Sci. China Inf. Sci., 2018)

Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request. - Tingfang Wu; Florin-Daniel Bîlbîe; Andrei Paun; Linqiang Pan; Ferrante Neri (Int. J. Neural Syst., 2018)

One Dimensional DNA Tiles Self Assembly Model Simulation. - Alexandru Amarioarei; Gefry Barad; Elena Czeizler; Eugen Czeizler; Ana-Maria Dobre; Corina Itcus; Andrei Paun; Mihaela Paun; Romica Trandafir; Iris Tusa (Int. J. Unconv. Comput., 2018)

Small networks of polarized splicing processors are universal. - Henning Bordihn; Victor Mitrana; Maria C. Negru; Andrei Paun; Mihaela Paun (Nat. Comput., 2018)

Spiking Neural P Systems With Polarizations. - Tingfang Wu; Andrei Paun; Zhiqiang Zhang 002; Linqiang Pan (IEEE Trans. Neural Networks Learn. Syst., 2018)

How Complex is to Solve a Hard Problem with Accepting Splicing Systems. - Victor Mitrana; Andrei Paun; Mihaela Paun (COMPLEXIS, 2019)

A Multi-agent Model for Cell Population. - Fernando Arroyo; Victor Mitrana; Andrei Paun; Mihaela Paun (KES-AMSTA, 2019)

Further Properties of Self-assembly by Hairpin Formation. - Henning Bordihn; Victor Mitrana; Andrei Paun; Mihaela Paun (UCNC, 2019)

Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application. - Andrei Paun; Florin-Daniel Bîlbîe (Int. J. Found. Comput. Sci., 2020)

On the group memory complexity of extended finite automata over groups. - Fernando Arroyo; Victor Mitrana; Andrei Paun; Mihaela Paun; José-Ramón Sánchez-Couso (J. Log. Algebraic Methods Program., 2020)

Non-preserving Accepting Splicing Systems. - Victor Mitrana; Andrei Paun; Mihaela Paun; José Ángel Sánchez Martín (J. Autom. Lang. Comb., 2021)

Hairpin completions and reductions: semilinearity properties. - Henning Bordihn; Victor Mitrana; Andrei Paun; Mihaela Paun (Nat. Comput., 2021)

Small SNQ P Systems with multiple types of spikes. - Florin-Daniel Bîlbîe; Andrei Paun (Theor. Comput. Sci., 2021)

Network analytics for drug repurposing in COVID-19. - Nicoleta Siminea; Victor-Bogdan Popescu; José Ángel Sánchez Martín; Daniela Florea; Georgiana Gavril; Ana Maria Gheorghe; Corina Itcus; Krishna Kanhaiya; Octavian Pacioglu; Laura Ioana Popa; Romica Trandafir; Maria Iris Tusa; et al. (Briefings Bioinform., 2022)

P systems with protein rules. - Yara Hamshawi; Florin-Daniel Bîlbîe; Andrei Paun; Assaf Malka; Ron Piran (J. Frankl. Inst., 2022)

Accepting multiple splicing systems. - José-Ramón Sánchez-Couso; Fernando Arroyo; Victor Mitrana; Andrei Paun; Mihaela Paun (J. King Saud Univ. Comput. Inf. Sci., 2022)

Jump Complexity of Deterministic Finite Automata with Translucent Letters. - Szilárd Zsolt Fazekas; Victor Mitrana; Andrei Paun; Mihaela Paun (ICTAC, 2024)

Distributed Reaction Systems Viewed as Multi-Agent Systems. - Victor Mitrana; Andrei Paun; Mihaela Paun (SISY, 2024)

Jump complexity of finite automata with translucent letters. - Victor Mitrana; Andrei Paun; Mihaela Paun; José-Ramón Sánchez-Couso (Theor. Comput. Sci., 2024)

Special issue on Foundational Methods in Systems Biology. - Ion Petre; Andrei Paun (Theor. Comput. Sci., 2024)