The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrei Paun: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lila Kari, Carlos Martín-Vide, Andrei Paun
    On the Universality of P Systems with Minimal Symport/Antiport Rules. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:254-265 [Conf]
  2. Lila Kari, Andrei Paun
    String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:275-287 [Conf]
  3. Andrei Paun, Bianca Popa
    P Systems with Proteins on Membranes and Membrane Division. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:292-303 [Conf]
  4. Cezar Câmpeanu, Andrei Paun
    Computing Beyond the Turing Limit Using the H Systems. [Citation Graph (0, 0)][DBLP]
    DNA, 2004, pp:24-34 [Conf]
  5. Andrei Paun
    On P Systems with Global Rules. [Citation Graph (0, 0)][DBLP]
    DNA, 2001, pp:329-339 [Conf]
  6. Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
    Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport. [Citation Graph (0, 0)][DBLP]
    DNA, 2002, pp:281-290 [Conf]
  7. Mihai Ionescu, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez
    Computing with Spiking Neural P Systems: Traces and Small Universal Systems. [Citation Graph (0, 0)][DBLP]
    DNA, 2006, pp:1-16 [Conf]
  8. Oscar H. Ibarra, Andrei Paun
    Counting Time in Computing with Cells. [Citation Graph (0, 0)][DBLP]
    DNA, 2005, pp:112-128 [Conf]
  9. Andrei Paun, Mihaela Paun
    State and Transition Complexity of Watson-Crick Finite Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:409-420 [Conf]
  10. Andrei Paun, Mario J. Pérez-Jiménez, Francisco José Romero-Campero
    Modeling Signal Transduction Using P Systems. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:100-122 [Conf]
  11. Francesco Bernardini, Andrei Paun
    Universality of Minimal Symport/Antiport: Five Membranes Suffice. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2003, pp:43-54 [Conf]
  12. Hitesh Nagda, Andrei Paun, Alfonso Rodríguez-Patón
    P Systems with Symport/Antiport and Time. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2006, pp:463-476 [Conf]
  13. Rudolf Freund, Marion Oswald, Andrei Paun
    P Systems Generating Trees. [Citation Graph (0, 0)][DBLP]
    Workshop on Membrane Computing, 2004, pp:309-319 [Conf]
  14. Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun
    On Spiking Neural P Systems and Partially Blind Counter Machines. [Citation Graph (0, 0)][DBLP]
    UC, 2006, pp:113-129 [Conf]
  15. Andrei Paun
    On P Systems with Active Membranes. [Citation Graph (0, 0)][DBLP]
    UMC, 2000, pp:187-201 [Conf]
  16. Cezar Câmpeanu, Andrei Paun
    The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:67-76 [Conf]
  17. Cezar Câmpeanu, Andrei Paun
    Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:306-307 [Conf]
  18. Cezar Câmpeanu, Andrei Paun, Jason R. Smith
    An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:90-103 [Conf]
  19. Andrei Paun, Nicolae Santean, Sheng Yu
    An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2000, pp:243-251 [Conf]
  20. Rudolf Freund, Andrei Paun
    Membrane Systems with Symport/Antiport Rules: Universality Results. [Citation Graph (0, 0)][DBLP]
    WMC-CdeA, 2002, pp:270-287 [Conf]
  21. Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón
    Further Remarks on P Systems with Symport Rules. [Citation Graph (0, 0)][DBLP]
    Sci. Ann. Cuza Univ., 2001, v:10, n:, pp:3-18 [Journal]
  22. Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
    Membrane Computing: New Results, New Problems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:78, n:, pp:204-220 [Journal]
  23. Andrei Paun
    On Time-Varying H Systems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:67, n:, pp:157-164 [Journal]
  24. Cezar Câmpeanu, Lila Kari, Andrei Paun
    Results on Transforming NFA into DFCA. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:53-63 [Journal]
  25. Carlos Martín-Vide, Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg
    ReMembrane Systems with Coupled Transport: Universality and Normal Forms. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:49, n:1-3, pp:1-15 [Journal]
  26. Andrei Paun
    Controlled H Systems of Small Radius. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:2, pp:185-193 [Journal]
  27. Andrei Paun, Bianca Popa
    P Systems with Proteins on Membranes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:72, n:4, pp:467-483 [Journal]
  28. Cezar Câmpeanu, Andrei Paun
    Counting The Number Of Minimal Dfca Obtained By Merging States. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:995-1006 [Journal]
  29. Cezar Câmpeanu, Andrei Paun, Sheng Yu
    An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:1, pp:83-97 [Journal]
  30. Rudolf Freund, Marion Oswald, Andrei Paun
    Optimal results for the computational completeness of gemmating (tissue) P systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:929-942 [Journal]
  31. Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg
    Computing by Communication in Networks of Membranes. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:6, pp:779-798 [Journal]
  32. Andrei Paun
    On the Diameter of Various Classes of H Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2000, v:5, n:3, pp:315-324 [Journal]
  33. Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
    On the Power of P Systems with Symport Rules. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:317-331 [Journal]
  34. Andrei Paun
    P Systems with Global Rules. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:5, pp:471-481 [Journal]
  35. Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun
    Unexpected universality results for three classes of P systems with symport/antiport. [Citation Graph (0, 0)][DBLP]
    Natural Computing, 2003, v:2, n:4, pp:337-348 [Journal]
  36. Shankara Narayanan Krishna, Andrei Paun
    Results on Catalytic and Evolution-Communication P Systems. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2004, v:22, n:4, pp:- [Journal]
  37. Andrei Paun, Gheorghe Paun
    The Power of Communication: P Systems with Symport/Antiport. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 2002, v:20, n:3, pp:295-306 [Journal]
  38. Rudolf Freund, Andrei Paun
    P systems with active membranes and without polarizations. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2005, v:9, n:9, pp:657-663 [Journal]
  39. Cezar Câmpeanu, Andrei Paun, Jason R. Smith
    Incremental construction of minimal deterministic finite cover automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:135-148 [Journal]
  40. Oscar H. Ibarra, Andrei Paun, Gheorghe Paun, Alfonso Rodríguez-Patón, Petr Sosík, Sara Woodworth
    Normal forms for spiking neural P systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:2-3, pp:196-217 [Journal]
  41. Andrei Paun
    On the Hopcroft's minimization algorithm [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  42. Sequentiality Induced by Spike Number in SNP Systems. [Citation Graph (, )][DBLP]


  43. On Flip-Flop Membrane Systems with Proteins. [Citation Graph (, )][DBLP]


  44. Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation. [Citation Graph (, )][DBLP]


  45. On the Power of Computing with Proteins on Membranes. [Citation Graph (, )][DBLP]


  46. Hopcroft's Minimization Technique: Queues or Stacks?. [Citation Graph (, )][DBLP]


  47. The Nondeterministic Waiting Time Algorithm: A Review [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002