default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei Paun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Victor Mitrana
, Andrei Paun, Mihaela Paun, José-Ramón Sánchez-Couso:
Jump complexity of finite automata with translucent letters. Theor. Comput. Sci. 992: 114450 (2024)- [j54]Ion Petre, Andrei Paun:
Special issue on Foundational Methods in Systems Biology. Theor. Comput. Sci. 1005: 114641 (2024) - 2022
- [j53]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, Manuela Sidoroff, Mihaela Paun, Eugen Czeizler, Andrei Paun, Ion Petre:
Network analytics for drug repurposing in COVID-19. Briefings Bioinform. 23(1) (2022) - [j52]Yara Hamshawi, Florin-Daniel Bîlbîe, Andrei Paun, Assaf Malka, Ron Piran:
P systems with protein rules. J. Frankl. Inst. 359(8): 3779-3807 (2022) - [j51]José-Ramón Sánchez-Couso, Fernando Arroyo, Victor Mitrana, Andrei Paun, Mihaela Paun:
Accepting multiple splicing systems. J. King Saud Univ. Comput. Inf. Sci. 34(6 Part A): 2910-2915 (2022) - [e2]Ion Petre, Andrei Paun:
Computational Methods in Systems Biology - 20th International Conference, CMSB 2022, Bucharest, Romania, September 14-16, 2022, Proceedings. Lecture Notes in Computer Science 13447, Springer 2022, ISBN 978-3-031-15033-3 [contents] - 2021
- [j50]Victor Mitrana, Andrei Paun, Mihaela Paun, José Ángel Sánchez Martín:
Non-preserving Accepting Splicing Systems. J. Autom. Lang. Comb. 26(1-2): 109-124 (2021) - [j49]Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun:
Hairpin completions and reductions: semilinearity properties. Nat. Comput. 20(2): 193-203 (2021) - [j48]Florin-Daniel Bîlbîe, Andrei Paun:
Small SNQ P Systems with multiple types of spikes. Theor. Comput. Sci. 862: 14-23 (2021) - 2020
- [j47]Andrei Paun, Florin-Daniel Bîlbîe:
Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application. Int. J. Found. Comput. Sci. 31(1): 117-132 (2020) - [j46]Fernando Arroyo, Victor Mitrana, Andrei Paun, Mihaela Paun, José-Ramón Sánchez-Couso:
On the group memory complexity of extended finite automata over groups. J. Log. Algebraic Methods Program. 117: 100605 (2020)
2010 – 2019
- 2019
- [c40]Victor Mitrana, Andrei Paun, Mihaela Paun:
How Complex is to Solve a Hard Problem with Accepting Splicing Systems. COMPLEXIS 2019: 27-35 - [c39]Fernando Arroyo, Victor Mitrana, Andrei Paun, Mihaela Paun:
A Multi-agent Model for Cell Population. KES-AMSTA 2019: 95-104 - [c38]Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun:
Further Properties of Self-assembly by Hairpin Formation. UCNC 2019: 37-51 - 2018
- [j45]Zhiqiang Zhang, Tingfang Wu, Andrei Paun, Linqiang Pan:
Universal enzymatic numerical P systems with small number of enzymatic variables. Sci. China Inf. Sci. 61(9): 092103:1-092103:12 (2018) - [j44]Tingfang Wu, Florin-Daniel Bîlbîe, Andrei Paun, Linqiang Pan, Ferrante Neri:
Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request. Int. J. Neural Syst. 28(8): 1850013:1-1850013:19 (2018) - [j43]Alexandru Amarioarei, Gefry Barad, Elena Czeizler, Eugen Czeizler, Ana-Maria Dobre, Corina Itcus, Andrei Paun, Mihaela Paun, Romica Trandafir, Iris Tusa:
One Dimensional DNA Tiles Self Assembly Model Simulation. Int. J. Unconv. Comput. 13(4-5): 399-415 (2018) - [j42]Henning Bordihn, Victor Mitrana, Maria C. Negru, Andrei Paun, Mihaela Paun:
Small networks of polarized splicing processors are universal. Nat. Comput. 17(4): 799-809 (2018) - [j41]Tingfang Wu, Andrei Paun, Zhiqiang Zhang, Linqiang Pan:
Spiking Neural P Systems With Polarizations. IEEE Trans. Neural Networks Learn. Syst. 29(8): 3349-3360 (2018) - [c37]Andrei Paun, Florin-Daniel Bîlbîe:
A Look at the Descriptional Complexity of SNQ P Systems. Enjoying Natural Computing 2018: 228-236 - [c36]Alexandru Amarioarei, Gefry Barad, Eugen Czeizler, Ana-Maria Dobre, Corina Itcus, Victor Mitrana, Andrei Paun, Mihaela Paun, Frankie Spencer, Romica Trandafir, Iris Tusa:
DNA-Guided Assembly of Nanocellulose Meshes. TPNC 2018: 253-265 - 2017
- [j40]Andrei Paun, Alfonso Rodríguez-Patón:
P Systems Simulating Bacterial Conjugation: Universality and Properties. Fundam. Informaticae 153(1-2): 87-103 (2017) - [j39]Yansen Su, Tingfang Wu, Fei Xu, Andrei Paun:
Spiking Neural P Systems with Rules on Synapses Working in Sum Spikes Consumption Strategy. Fundam. Informaticae 156(2): 187-208 (2017) - [j38]Haiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun:
On trace languages generated by (small) spiking neural P systems. Theor. Comput. Sci. 682: 57-66 (2017) - [j37]Yang Li, Andrei Paun, Mihaela Paun:
Improvements on contours based segmentation for DNA microarray image processing. Theor. Comput. Sci. 701: 174-189 (2017) - [c35]Henning Bordihn, Victor Mitrana, Andrei Paun, Mihaela Paun:
Networks of Polarized Splicing Processors. TPNC 2017: 165-177 - 2016
- [j36]Andrei Paun, Clayton Chandler, Chokchai Leangsuksun, Mihaela Paun:
A failure index for HPC applications. J. Parallel Distributed Comput. 93-94: 146-153 (2016) - [j35]Zhiqiang Zhang, Tingfang Wu, Andrei Paun, Linqiang Pan:
Numerical P systems with migrating variables. Theor. Comput. Sci. 641: 85-108 (2016) - 2015
- [j34]Mihaela Paun, Yang Li, Yuan Cheng, Iris Tusa, Andrei Paun:
Segmenting microarray images using a contour-based method. Theor. Comput. Sci. 608: 108-118 (2015) - [j33]Xingyi Zhang, Linqiang Pan, Andrei Paun:
On the Universality of Axon P Systems. IEEE Trans. Neural Networks Learn. Syst. 26(11): 2816-2829 (2015) - 2014
- [j32]Andrei Paun, Petr Sosík:
Three Universal Homogeneous Spiking Neural P Systems Using Max Spike. Fundam. Informaticae 134(1-2): 167-182 (2014) - 2013
- [j31]Petr Sosík, Andrei Paun, Alfonso Rodríguez-Patón:
P systems with proteins on membranes characterize PSPACE. Theor. Comput. Sci. 488: 78-95 (2013) - 2012
- [c34]Tanvir Ahmed, Garrett DeLancy, Andrei Paun:
A Case-Study on the Influence of Noise to Log-Gain Principles for Flux Dynamic Discovery. Int. Conf. on Membrane Computing 2012: 88-100 - 2011
- [j30]Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón, Manuela Sidoroff:
P Systems with proteins on Membranes: a Survey. Int. J. Found. Comput. Sci. 22(1): 39-53 (2011) - [j29]John Jack, Andrei Paun, Alfonso Rodríguez-Patón:
A review of the nondeterministic waiting time algorithm. Nat. Comput. 10(1): 139-149 (2011) - [c33]Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón, John Jack:
Poster: Biochemical signaling: A discrete simulation with memory enhancement. ICCABS 2011: 257 - [c32]Andrei Paun, Manuela Sidoroff:
Sequentiality Induced by Spike Number in SNP Systems: Small Universal Machines. Int. Conf. on Membrane Computing 2011: 333-345
2000 – 2009
- 2009
- [j28]Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón:
On the Hopcroft's minimization technique for DFA and DFCA. Theor. Comput. Sci. 410(24-25): 2424-2430 (2009) - [j27]Oscar H. Ibarra, Andrei Paun, Alfonso Rodríguez-Patón:
Sequential SNP systems based on min/max spike number. Theor. Comput. Sci. 410(30-32): 2982-2991 (2009) - [j26]John Jack, Andrei Paun:
Discrete Modeling of Biochemical Signaling with Memory Enhancement. Trans. Comp. Sys. Biology 11: 200-215 (2009) - [c31]Petr Sosík, Andrei Paun, Alfonso Rodríguez-Patón, David Pérez:
On the Power of Computing with Proteins on Membranes. Workshop on Membrane Computing 2009: 448-460 - [c30]John Jack, Andrei Paun:
The Nondeterministic Waiting Time Algorithm: A Review. DCFS 2009: 29-46 - 2008
- [j25]John 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) - [j24]Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun:
On spiking neural P systems and partially blind counter machines. Nat. Comput. 7(1): 3-19 (2008) - [j23]Haiming 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. Nat. Comput. 7(2): 147-166 (2008) - [j22]Oscar H. Ibarra, Andrei Paun:
Computing with cells: membrane systems - some complexity issues. Int. J. Parallel Emergent Distributed Syst. 23(5): 347-365 (2008) - [c29]Oscar H. Ibarra, Andrei Paun, Alfonso Rodríguez-Patón:
Sequentiality Induced by Spike Number in SNP Systems. DNA 2008: 179-190 - [c28]John 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 - [c27]Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón:
Hopcroft's Minimization Technique: Queues or Stacks?. CIAA 2008: 78-91 - 2007
- [j21]Andrei Paun, Gheorghe Paun:
Small universal spiking neural P systems. Biosyst. 90(1): 48-60 (2007) - [j20]Oscar 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) - [c26]Andrei Paun, Alfonso Rodríguez-Patón:
On Flip-Flop Membrane Systems with Proteins. Workshop on Membrane Computing 2007: 414-427 - [r1]Andrei Paun, Oscar H. Ibarra:
Membrane Systems. Handbook of Parallel Computing 2007 - [i1]Andrei Paun:
On the Hopcroft's minimization algorithm. CoRR abs/0705.1986 (2007) - 2006
- [j19]Andrei Paun, Bianca Popa:
P Systems with Proteins on Membranes. Fundam. Informaticae 72(4): 467-483 (2006) - [j18]Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Incremental construction of minimal deterministic finite cover automata. Theor. Comput. Sci. 363(2): 135-148 (2006) - [c25]Haiming Chen, Mihai Ionescu, Andrei Paun, Gheorghe Paun, Bianca Popa:
On Trace Languages Generated by (Small) Spiking Neural P Systems. DCFS 2006: 94-105 - [c24]Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
Tight Bounds for the State Complexity of Deterministic Cover Automata. DCFS 2006: 223-231 - [c23]Andrei Paun, Bianca Popa:
P Systems with Proteins on Membranes and Membrane Division. Developments in Language Theory 2006: 292-303 - [c22]Mihai 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 - [c21]Andrei Paun, Mario J. Pérez-Jiménez, Francisco José Romero-Campero:
Modeling Signal Transduction Using P Systems. Workshop on Membrane Computing 2006: 100-122 - [c20]Hitesh Nagda, Andrei Paun, Alfonso Rodríguez-Patón:
P Systems with Symport/Antiport and Time. Workshop on Membrane Computing 2006: 463-476 - [c19]Oscar H. Ibarra, Sara Woodworth, Fang Yu, Andrei Paun:
On Spiking Neural P Systems and Partially Blind Counter Machines. UC 2006: 113-129 - 2005
- [j17]Cezar Câmpeanu, Lila Kari, Andrei Paun:
Results on Transforming NFA into DFCA. Fundam. Informaticae 64(1-4): 53-63 (2005) - [j16]Rudolf 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) - [j15]Rudolf Freund, Andrei Paun:
P systems with active membranes and without polarizations. Soft Comput. 9(9): 657-663 (2005) - [c18]Oscar H. Ibarra, Andrei Paun:
Counting Time in Computing with Cells. DNA 2005: 112-128 - [c17]Cezar Câmpeanu, Andrei Paun, Jason R. Smith:
An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata. CIAA 2005: 90-103 - 2004
- [j14]Shankara Narayanan Krishna, Andrei Paun:
Results on Catalytic and Evolution-Communication P Systems. New Gener. Comput. 22(4): 377-394 (2004) - [c16]Lila 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 - [c15]Cezar Câmpeanu, Andrei Paun:
Lower bounds for NFA to DCFA Transformations. DCFS 2004: 121-130 - [c14]Rudolf Freund, Marion Oswald, Andrei Paun:
Gemmating P Systems are Computationally Complete with Four Membranes. DCFS 2004: 191-203 - [c13]Cezar Câmpeanu, Andrei Paun:
Computing Beyond the Turing Limit Using the H Systems. DNA 2004: 24-34 - [c12]Rudolf Freund, Marion Oswald, Andrei Paun:
P Systems Generating Trees. Workshop on Membrane Computing 2004: 309-319 - [c11]Cezar Câmpeanu, Andrei Paun:
Tight Bounds for NFA to DFCA Transformations for Binary Alphabets. CIAA 2004: 306-307 - 2003
- [j13]Cezar Câmpeanu, Andrei Paun:
Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14(6): 995-1006 (2003) - [j12]Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun:
Unexpected universality results for three classes of P systems with symport/antiport. Nat. Comput. 2(4): 337-348 (2003) - [c10]Francesco Bernardini, Andrei Paun:
Universality of Minimal Symport/Antiport: Five Membranes Suffice. Workshop on Membrane Computing 2003: 43-54 - 2002
- [j11]Carlos Martín-Vide, Andrei Paun, Gheorghe Paun:
Membrane Computing: New Results, New Problems. Bull. EATCS 78: 204-220 (2002) - [j10]Carlos Martín-Vide, Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg:
ReMembrane Systems with Coupled Transport: Universality and Normal Forms. Fundam. Informaticae 49(1-3): 1-15 (2002) - [j9]Cezar 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) - [j8]Andrei Paun, Gheorghe Paun, Grzegorz Rozenberg:
Computing by Communication in Networks of Membranes. Int. J. Found. Comput. Sci. 13(6): 779-798 (2002) - [j7]Carlos Martín-Vide, Andrei Paun, Gheorghe Paun:
On the Power of P Systems with Symport Rules. J. Univers. Comput. Sci. 8(2): 317-331 (2002) - [j6]Andrei Paun:
P Systems with Global Rules. Theory Comput. Syst. 35(5): 471-481 (2002) - [j5]Andrei Paun, Gheorghe Paun:
The Power of Communication: P Systems with Symport/Antiport. New Gener. Comput. 20(3): 295-306 (2002) - [c9]Mihai 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 - [c8]Cezar Câmpeanu, Andrei Paun:
The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata. CIAA 2002: 67-76 - [c7]Rudolf Freund, Andrei Paun:
Membrane Systems with Symport/Antiport Rules: Universality Results. WMC-CdeA 2002: 270-287 - 2001
- [j4]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) - [c6]Lila Kari, Andrei Paun:
String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions 2001: 275-287 - [c5]Andrei Paun, Mihaela Paun:
On membrane computing based on splicing. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 409-422 - [c4]Andrei Paun:
On P Systems with Global Rules. DNA 2001: 329-339 - [e1]Sheng Yu, Andrei Paun:
Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers. Lecture Notes in Computer Science 2088, Springer 2001, ISBN 3-540-42491-1 [contents] - 2000
- [j3]Andrei Paun:
On the Diameter of Various Classes of H Systems. J. Autom. Lang. Comb. 5(3): 315-324 (2000) - [c3]Andrei Paun:
On P Systems with Active Membranes. UMC 2000: 187-201 - [c2]Andrei Paun, Nicolae Santean, Sheng Yu:
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251
1990 – 1999
- 1999
- [j2]Andrei Paun:
On Time-Varying H Systems. Bull. EATCS 67: 157-164 (1999) - [c1]Andrei Paun, Mihaela Paun:
State and Transition Complexity of Watson-Crick Finite Automata. FCT 1999: 409-420 - 1997
- [j1]Andrei Paun:
Controlled H Systems of Small Radius. Fundam. Informaticae 31(2): 185-193 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
