| On Trace Languages Generated by (Small) Spiking Neural P Systems. | 0 | 0.34 | 2017 |
| Cell-like spiking neural P systems | 25 | 0.68 | 2016 |
| Preface | 0 | 0.34 | 2015 |
| On the power of enzymatic numerical P systems | 13 | 0.73 | 2012 |
| Membrane Computing | 19 | 1.40 | 2010 |
| Membrane Computing: 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009. Revised Selected and Invited Papers | 27 | 2.36 | 2010 |
| Tissue P Systems With Cell Division | 1 | 0.34 | 2008 |
| Membrane Computing: Recent Developments and Applications (Extended Abstract). | 0 | 0.34 | 2008 |
| Spiking Neural P Systems: An Early Survey | 4 | 0.43 | 2007 |
| Membrane computing [and graph transformation] | 0 | 0.34 | 2007 |
| Computing Morphisms By Spiking Neural P Systems | 4 | 0.43 | 2007 |
| Spiking Neural P Systems with an Exhaustive Use of Rules. | 17 | 1.02 | 2007 |
| Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers | 26 | 1.79 | 2007 |
| An Universality Result For A (Mem)Brane Calculus Based On Mate/Drip Operations | 24 | 1.40 | 2006 |
| Event-related outputs of computations in P systems | 6 | 0.53 | 2006 |
| Turing Machines with Cells on the Tape | 2 | 0.44 | 2006 |
| Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems | 10 | 0.89 | 2006 |
| Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings | 18 | 2.92 | 2006 |
| Membrane Computing as a Framework for Modeling Economic Processes | 7 | 0.56 | 2005 |
| Symport/Antiport P Systems with Three Objects Are Universal | 21 | 1.80 | 2005 |
| Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers | 24 | 3.10 | 2005 |
| Tissue P systems with channel states | 66 | 2.83 | 2005 |
| P Transducers | 4 | 0.56 | 2005 |
| Bio-inspired computing paradigms (natural computing) | 2 | 0.41 | 2004 |
| Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday | 27 | 2.80 | 2004 |
| Membrane Computing after the Second Brainstorming Week Sevilla, February 2004 (Column: Natural Computing) | 0 | 0.34 | 2004 |
| Membrane computing: Some non-standard ideas | 2 | 0.43 | 2004 |
| Second Brainstorming Week on Membrane Computing | 8 | 0.86 | 2004 |
| P Systems with Tables of Rules | 7 | 0.58 | 2004 |
| Gemmating P systems: collapsing hierarchies | 4 | 0.61 | 2003 |
| Descriptional Complexity Issues in Membrane Computing. | 0 | 0.34 | 2003 |
| Tissue P systems | 75 | 4.72 | 2003 |
| Membrane Computing, International Workshop, WMC-CdeA 2002, Curtea de Arges, Romania, August 19-23, 2002, Revised Papers | 21 | 4.25 | 2003 |
| From Watson-Crick L systems to Darwinian P systems | 3 | 1.55 | 2003 |
| On three variants of rewriting P systems | 12 | 0.84 | 2003 |
| Membrane Computing: New Results, New Problems | 2 | 0.44 | 2002 |
| ReMembrane Systems with Coupled Transport: Universality and Normal Forms | 2 | 0.48 | 2002 |
| P Systems with Symport/Antiport Rules: The Traces of Objects | 7 | 0.95 | 2002 |
| A guide to membrane computing | 175 | 14.52 | 2002 |
| Computing by Communication in Networks of Membranes | 19 | 1.24 | 2002 |
| Membrane Computing: The Power of (Rule) Creation | 8 | 0.77 | 2002 |
| Topics in the theory of DNA computing | 4 | 0.62 | 2002 |
| Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View [Workshop on Multiset Processing, WMP 2000, Curtea de Arges, Romania, August 21-25, 2000] | 12 | 1.75 | 2001 |
| Computing with Membranes (P Systems): Universality Results | 10 | 1.56 | 2001 |
| Toward Soft Hardware | 0 | 0.34 | 2001 |
| Further Remarks on P Systems with Symport Rules | 4 | 1.13 | 2001 |
| Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin | 36 | 12.50 | 2001 |
| On the Power of P Systems with Valuations. | 0 | 0.34 | 2001 |
| Computing with shapes | 2 | 0.36 | 2001 |
| Computing with Membranes: Attacking NP-Complete Problems | 34 | 2.37 | 2000 |
