dblp.uni-trier.dewww.uni-trier.de

Andrei Paun

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
49EEAndrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón: Hopcroft's Minimization Technique: Queues or Stacks?. CIAA 2008: 78-91
48EEJohn Jack, Andrei Paun, Alfonso Rodríguez-Patón: Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation. Workshop on Membrane Computing 2008: 246-259
47EEOscar H. Ibarra, Andrei Paun: Computing with cells: membrane systems - some complexity issues. IJPEDS 23(5): 347-365 (2008)
46EEJohn Jack, Alfonso Rodríguez-Patón, Oscar H. Ibarra, Andrei Paun: Discrete Nondeterministic Modeling of the Fas Pathway. Int. J. Found. Comput. Sci. 19(5): 1147-1162 (2008)
45EEOscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun: On spiking neural P systems and partially blind counter machines. Natural Computing 7(1): 3-19 (2008)
44EEHaiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez: Spiking neural P systems with extended rules: universality and languages. Natural Computing 7(2): 147-166 (2008)
2007
43EEAndrei Paun, Alfonso Rodríguez-Patón: On Flip-Flop Membrane Systems with Proteins. Workshop on Membrane Computing 2007: 414-427
42EEAndrei Paun: On the Hopcroft's minimization algorithm CoRR abs/0705.1986: (2007)
41EEOscar H. Ibarra, Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón, Petr Sosík, Sara Woodworth: Normal forms for spiking neural P systems. Theor. Comput. Sci. 372(2-3): 196-217 (2007)
2006
40EEMihai Ionescu, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez: Computing with Spiking Neural P Systems: Traces and Small Universal Systems. DNA 2006: 1-16
39EEAndrei Paun, Bianca Popa: P Systems with Proteins on Membranes and Membrane Division. Developments in Language Theory 2006: 292-303
38EEOscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun: On Spiking Neural P Systems and Partially Blind Counter Machines. UC 2006: 113-129
37EEAndrei Paun, Mario J. Pérez-Jiménez, Francisco José Romero-Campero: Modeling Signal Transduction Using P Systems. Workshop on Membrane Computing 2006: 100-122
36EEHitesh Nagda, Andrei Paun, Alfonso Rodríguez-Patón: P Systems with Symport/Antiport and Time. Workshop on Membrane Computing 2006: 463-476
35EEAndrei Paun, Bianca Popa: P Systems with Proteins on Membranes. Fundam. Inform. 72(4): 467-483 (2006)
34EECezar Câmpeanu, Andrei Paun, Jason R. Smith: Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363(2): 135-148 (2006)
2005
33EECezar Câmpeanu, Andrei Paun, Jason R. Smith: An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA 2005: 90-103
32EEOscar H. Ibarra, Andrei Paun: Counting Time in Computing with Cells. DNA 2005: 112-128
31EECezar Câmpeanu, Lila Kari, Andrei Paun: Results on Transforming NFA into DFCA. Fundam. Inform. 64(1-4): 53-63 (2005)
30EERudolf Freund, Marion Oswald, Andrei Paun: Optimal results for the computational completeness of gemmating (tissue) P systems. Int. J. Found. Comput. Sci. 16(5): 929-942 (2005)
29EERudolf Freund, Andrei Paun: P systems with active membranes and without polarizations. Soft Comput. 9(9): 657-663 (2005)
2004
28EELila Kari, Carlos Martín-Vide, Andrei Paun: On the Universality of P Systems with Minimal Symport/Antiport Rules. Aspects of Molecular Computing 2004: 254-265
27EECezar Câmpeanu, Andrei Paun: Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA 2004: 306-307
26EECezar Câmpeanu, Andrei Paun: Computing Beyond the Turing Limit Using the H Systems. DNA 2004: 24-34
25EERudolf Freund, Marion Oswald, Andrei Paun: P Systems Generating Trees. Workshop on Membrane Computing 2004: 309-319
24EEShankara Narayanan Krishna, Andrei Paun: Results on Catalytic and Evolution-Communication P Systems. New Generation Comput. 22(4): (2004)
2003
23EEFrancesco Bernardini, Andrei Paun: Universality of Minimal Symport/Antiport: Five Membranes Suffice. Workshop on Membrane Computing 2003: 43-54
22EECezar Câmpeanu, Andrei Paun: Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14(6): 995-1006 (2003)
21EEMihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: Unexpected universality results for three classes of P systems with symport/antiport. Natural Computing 2(4): 337-348 (2003)
2002
20EECezar Câmpeanu, Andrei Paun: The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA 2002: 67-76
19EEMihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport. DNA 2002: 281-290
18EERudolf Freund, Andrei Paun: Membrane Systems with Symport/Antiport Rules: Universality Results. WMC-CdeA 2002: 270-287
17 Carlos Martín-Vide, Andrei Paun, Gheorghe Paun: Membrane Computing: New Results, New Problems. Bulletin of the EATCS 78: 204-220 (2002)
16 Carlos Martín-Vide, Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg: ReMembrane Systems with Coupled Transport: Universality and Normal Forms. Fundam. Inform. 49(1-3): 1-15 (2002)
15EECezar Câmpeanu, Andrei Paun, Sheng Yu: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. Int. J. Found. Comput. Sci. 13(1): 83-97 (2002)
14EEAndrei Paun, Gheorghe Paun, Grzegorz Rozenberg: Computing by Communication in Networks of Membranes. Int. J. Found. Comput. Sci. 13(6): 779-798 (2002)
13EECarlos Martín-Vide, Andrei Paun, Gheorghe Paun: On the Power of P Systems with Symport Rules. J. UCS 8(2): 317-331 (2002)
12 Andrei Paun, Gheorghe Paun: The Power of Communication: P Systems with Symport/Antiport. New Generation Comput. 20(3): 295-306 (2002)
11EEAndrei Paun: P Systems with Global Rules. Theory Comput. Syst. 35(5): 471-481 (2002)
2001
10 Sheng Yu, Andrei Paun: Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers Springer 2001
9EEAndrei Paun: On P Systems with Global Rules. DNA 2001: 329-339
8 Lila Kari, Andrei Paun: String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions 2001: 275-287
7 Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón: Further Remarks on P Systems with Symport Rules. Sci. Ann. Cuza Univ. 10: 3-18 (2001)
2000
6EEAndrei Paun, Nicolae Santean, Sheng Yu: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251
5 Andrei Paun: On P Systems with Active Membranes. UMC 2000: 187-201
4 Andrei Paun: On the Diameter of Various Classes of H Systems. Journal of Automata, Languages and Combinatorics 5(3): 315-324 (2000)
1999
3EEAndrei Paun, Mihaela Paun: State and Transition Complexity of Watson-Crick Finite Automata. FCT 1999: 409-420
2 Andrei Paun: On Time-Varying H Systems. Bulletin of the EATCS 67: 157-164 (1999)
1997
1 Andrei Paun: Controlled H Systems of Small Radius. Fundam. Inform. 31(2): 185-193 (1997)

Coauthor Index

1Francesco Bernardini [23]
2Cezar Câmpeanu [15] [20] [22] [26] [27] [31] [33] [34]
3Haiming Chen [44]
4Rudolf Freund [18] [25] [29] [30]
5Oscar H. Ibarra [32] [38] [41] [45] [46] [47]
6Mihai Ionescu (Armand-Mihai Ionescu) [19] [21] [40] [44]
7Tseren-Onolt Ishdorj [44]
8John Jack [46] [48]
9Lila Kari (Lila Santean) [8] [28] [31]
10Shankara Narayanan Krishna [24]
11Carlos Martín-Vide [13] [16] [17] [19] [21] [28]
12Hitesh Nagda [36]
13Marion Oswald [25] [30]
14Gheorghe Paun [7] [12] [13] [14] [16] [17] [19] [21] [40] [41] [44]
15Mihaela Paun [3] [49]
16Mario J. Pérez-Jiménez [37] [40] [44]
17Bianca Popa [35] [39]
18Alfonso Rodríguez-Patón [7] [36] [41] [43] [46] [48] [49]
19Francisco José Romero-Campero [37]
20Grzegorz Rozenberg [14] [16]
21Nicolae Santean [6]
22Jason R. Smith [33] [34]
23Petr Sosík [41]
24Sara Woodworth [38] [41] [45]
25Fang Yu [38] [45]
26Sheng Yu [6] [10] [15]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)