default search action
Sergey Verlan
Serghei Verlan
Person information
- affiliation: University Paris Est Créteil, LACL, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j53]Jun Liu
, Leiya Wang, Gexiang Zhang
Universal enzymatic numerical P systems with small number of enzymatic rules. Theor. Comput. Sci. 1004: 114630 (2024) - 2023
- [j52]Sergey Verlan
A tutorial on the formal framework for spiking neural P systems. Nat. Comput. 22(1): 181-194 (2023) - [j51]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan
Numerical networks of cells. Theor. Comput. Sci. 958: 113873 (2023) - 2022
- [j50]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan
Tissue P Systems with Vesicles of Multisets. Int. J. Found. Comput. Sci. 33(3&4): 179-202 (2022) - [j49]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan
Regulated Insertion-Deletion Systems. J. Autom. Lang. Comb. 27(1-3): 15-45 (2022) - [c50]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan
Prescribed Teams of Rules Working on Several Objects. MCU 2022: 27-41 - 2021
- [b2]Gexiang Zhang
Membrane Computing Models: Implementations. Springer 2021, ISBN 978-981-16-1565-8, pp. 1-279 - [j48]Gexiang Zhang
An Overview of Hardware Implementation of Membrane Computing Models. ACM Comput. Surv. 53(4): 90:1-90:38 (2021) - [j47]Jérôme Durand-Lose, Jarkko Kari, Sergey Verlan
Preface. Fundam. Informaticae 181(2-3) (2021) - [j46]Zeyi Shang, Sergey Verlan, Gexiang Zhang, Haina Rong:
FPGA Implementation of Numerical P Systems. Int. J. Unconv. Comput. 16(2-3): 279-302 (2021) - [j45]Artiom Alhazov
Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete. J. Membr. Comput. 3(4): 233-245 (2021) - [j44]Sergiu Ivanov, Sergey Verlan
Single semi-contextual insertion-deletion systems. Nat. Comput. 20(4): 703-712 (2021) - 2020
- [j43]Sergey Verlan
A formal framework for spiking neural P systems. J. Membr. Comput. 2(4): 355-368 (2020) - [j42]El Habib Boudjema, Sergey Verlan
VYPER: Vulnerability detection in binary code. Secur. Priv. 3(2) (2020) - [j41]Sergey Verlan
Universal insertion grammars of size two. Theor. Comput. Sci. 843: 153-163 (2020)
2010 – 2019
- 2019
- [j40]Rudolf Freund, Vladimir Rogojin, Sergey Verlan
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors. Int. J. Found. Comput. Sci. 30(6-7): 1005-1027 (2019) - [j39]Susan Stepney, Sergey Verlan
UCNC 2018 special issue editorial. Nat. Comput. 18(3): 513-514 (2019) - 2018
- [j38]Artiom Alhazov
Extended spiking neural P systems with white hole rules and their red-green variants. Nat. Comput. 17(2): 297-310 (2018) - [c49]Artiom Alhazov
Chocolate P Automata. Enjoying Natural Computing 2018: 1-20 - [c48]Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan:
Tissue P Systems with Point Mutation Rules. Int. Conf. on Membrane Computing 2018: 33-56 - [p3]Artiom Alhazov
Small Universal Reversible Counter Machines. Reversibility and Universality 2018: 433-446 - [e3]Jérôme Durand-Lose, Sergey Verlan
Machines, Computations, and Universality - 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, Proceedings. Lecture Notes in Computer Science 10881, Springer 2018, ISBN 978-3-319-92401-4 [contents] - [e2]Susan Stepney
Unconventional Computation and Natural Computation - 17th International Conference, UCNC 2018, Fontainebleau, France, June 25-29, 2018, Proceedings. Lecture Notes in Computer Science 10867, Springer 2018, ISBN 978-3-319-92434-2 [contents] - 2017
- [j37]Sergiu Ivanov, Sergey Verlan
Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems. Fundam. Informaticae 155(1-2): 163-185 (2017) - [c47]Rudolf Freund, Vladimir Rogojin, Sergey Verlan
Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors. DCFS 2017: 140-151 - [c46]Erzsébet Csuhaj-Varjú, Sergey Verlan
Bi-simulation Between P Colonies and P Systems with Multi-stable Catalysts. Int. Conf. on Membrane Computing 2017: 105-117 - [c45]Erzsébet Csuhaj-Varjú, Sergey Verlan
Computationally Complete Generalized Communicating P Systems with Three Cells. Int. Conf. on Membrane Computing 2017: 118-128 - [c44]Henning Fernau
Universal Matrix Insertion Grammars with Small Size. UCNC 2017: 182-193 - [c43]Artiom Alhazov
(Tissue) P Systems with Vesicles of Multisets. AFL 2017: 11-25 - 2016
- [j36]Juan Quiros, Sergey Verlan, Julian Viejo, Alejandro Millán, Manuel J. Bellido:
Fast Hardware Implementations of Static P Systems. Comput. Informatics 35(3): 687-718 (2016) - [j35]Artiom Alhazov, Sergiu Ivanov, Elisabeth Pelz, Sergey Verlan:
Small Universal Deterministic Petri Nets with Inhibitor Arcs. J. Autom. Lang. Comb. 21(1-2): 7-26 (2016) - [c42]Artiom Alhazov
P Systems Working in Maximal Variants of the Set Derivation Mode. Int. Conf. on Membrane Computing 2016: 83-102 - [c41]Igor Potapov, Olena Prianychnykova, Sergey Verlan
Insertion-Deletion Systems over Relational Words. RP 2016: 177-191 - 2015
- [j34]Sergiu Ivanov, Sergey Verlan
Random Context and Semi-conditional Insertion-deletion Systems. Fundam. Informaticae 138(1-2): 127-144 (2015) - [j33]Svetlana Cojocaru
Preface. Fundam. Informaticae 138(1-2) (2015) - [c40]Sergey Verlan
Universality in Molecular and Cellular Computing. CiE 2015: 95-104 - [c39]Sergiu Ivanov, Sergey Verlan
Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States. MCU 2015: 79-93 - [c38]Artiom Alhazov
Bridging Deterministic P Systems and Conditional Grammars. Int. Conf. on Membrane Computing 2015: 63-76 - [c37]Rudolf Freund, Sergiu Ivanov, Sergey Verlan
P Systems with Generalized Multisets Over Totally Ordered Abelian Groups. Int. Conf. on Membrane Computing 2015: 117-136 - [i7]Igor Potapov, Olena Prianychnykova, Sergey Verlan:
On insertion-deletion systems over relational words. CoRR abs/1510.03231 (2015) - 2014
- [j32]Sergiu Ivanov, Yurii Rogozhin, Sergey Verlan:
Small Universal Networks of Evolutionary Processors. J. Autom. Lang. Comb. 19(1-4): 133-144 (2014) - [j31]Rudolf Freund, Yurii Rogozhin, Sergey Verlan
Generating and accepting P systems with minimal left and right insertion and deletion. Nat. Comput. 13(2): 257-268 (2014) - [c36]Artiom Alhazov
Small Universal Devices. Computing with New Resources 2014: 249-263 - [c35]Sergiu Ivanov, Elisabeth Pelz, Sergey Verlan
Small Universal Non-deterministic Petri Nets with Inhibitor Arcs. DCFS 2014: 186-197 - [c34]Artiom Alhazov
Promoters and Inhibitors in Purely Catalytic P Systems. Int. Conf. on Membrane Computing 2014: 126-138 - 2013
- [j30]Rudolf Freund, Ignacio Pérez-Hurtado
A formalization of membrane systems with dynamically evolving structures. Int. J. Comput. Math. 90(4): 801-815 (2013) - [c33]Sergey Verlan
Using the Formal Framework for P Systems. Int. Conf. on Membrane Computing 2013: 56-79 - [c32]Rudolf Freund, Alberto Leporati, Giancarlo Mauri
Flattening in (Tissue) P Systems. Int. Conf. on Membrane Computing 2013: 173-188 - [c31]Sergiu Ivanov, Sergey Verlan
About One-Sided One-Symbol Insertion-Deletion P Systems. Int. Conf. on Membrane Computing 2013: 225-237 - [i6]Sergiu Ivanov, Elisabeth Pelz, Sergey Verlan:
Small Universal Petri Nets with Inhibitor Arcs. CoRR abs/1312.4414 (2013) - 2012
- [j29]Iurie Rogojin, Serghei Verlan:
P systems based on tag operations. Comput. Sci. J. Moldova 20(3): 366-373 (2012) - [j28]Artiom Alhazov
On Small Universal Splicing Systems. Int. J. Found. Comput. Sci. 23(7): 1423-1438 (2012) - [j27]Ion Petre
Matrix insertion-deletion systems. Theor. Comput. Sci. 456: 80-88 (2012) - [c30]Artiom Alhazov
Sequential P Systems with Regular Control. Int. Conf. on Membrane Computing 2012: 112-127 - [c29]Sergey Verlan
Fast Hardware Implementations of P Systems. Int. Conf. on Membrane Computing 2012: 404-423 - [c28]Rudolf Freund, Yurii Rogozhin, Sergey Verlan
P Systems with Minimal Left and Right Insertion and Deletion. UCNC 2012: 82-93 - [e1]Marian Gheorghe, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sergey Verlan:
Membrane Computing - 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7184, Springer 2012, ISBN 978-3-642-28023-8 [contents] - 2011
- [j26]Serghei Verlan:
Abstracts of Doctor Habilitatus Thesis. Comput. Sci. J. Moldova 18(3): 367-370 (2011) - [j25]Antoine Spicher, Sergey Verlan:
Generalized Communicating P Systems Working in Fair Sequential Mode. Sci. Ann. Comput. Sci. 21(2): 227-247 (2011) - [j24]Artiom Alhazov
P Systems with Insertion and Deletion Exo-Operations. Fundam. Informaticae 110(1-4): 13-28 (2011) - [j23]Sergey Verlan
Universality of Splicing Test Tube Systems with Two Tubes. Fundam. Informaticae 110(1-4): 329-342 (2011) - [j22]Artiom Alhazov
Small Universal Tvdh and Test Tube Systems. Int. J. Found. Comput. Sci. 22(1): 143-154 (2011) - [j21]Rudolf Freund, Sergey Verlan
(Tissue) P systems working in the k-restricted minimally or maximally parallel transition mode. Nat. Comput. 10(2): 821-833 (2011) - [j20]Alexander Krassovitskiy
Computational power of insertion-deletion (P) systems with rules of size two. Nat. Comput. 10(2): 835-852 (2011) - [j19]Erzsébet Csuhaj-Varjú, Sergey Verlan
On generalized communicating P systems with minimal interaction rules. Theor. Comput. Sci. 412(1-2): 124-135 (2011) - [j18]Artiom Alhazov
P systems with minimal insertion and deletion. Theor. Comput. Sci. 412(1-2): 136-144 (2011) - [j17]Artiom Alhazov
Minimization strategies for maximally parallel multiset rewriting systems. Theor. Comput. Sci. 412(17): 1581-1591 (2011) - [p2]Gemma Bel Enguix
On the Lower Bounds for Asymmetrical Insertion-deletion Languages. Biology, Computation and Linguistics 2011: 145-154 - [i5]Maurice Margenstern, Pascal Mayer, Sergey Verlan:
DNA Circuits Based on Isothermal Constrained Loop Extension DNA Amplification. CoRR abs/1105.1424 (2011) - [i4]Antoine Spicher, Sergey Verlan:
Generalized Communicating P Systems Working in Fair Sequential Model. CoRR abs/1108.3432 (2011) - [i3]Sergiu Ivanov, Sergey Verlan:
Random Context and Semi-Conditional Insertion-Deletion Systems. CoRR abs/1112.5947 (2011) - 2010
- [j16]Sergey Verlan
A sequence-based analysis of the pointer distribution of stichotrichous ciliates. Biosyst. 101(2): 109-116 (2010) - [j15]Artiom Alhazov, Elena Boian, Liudmila Burtseva, Constantin Ciubotaru, Svetlana Cojocaru, Alexandru Colesnicov, Valentina Demidova, Sergiu Ivanov, Veaceslav Macari, Galina Magariu, Ludmila Malahova, Vladimir Rogojin, Yurii Rogozhin, Tatiana Tofan, Sergey Verlan, Tatiana Verlan:
Investigations on Natural Computing in the Institute of Mathematics and Computer Science. Comput. Sci. J. Moldova 18(2): 101-138 (2010) - [j14]Sergey Verlan:
Recent Developments on Insertion-Deletion Systems. Comput. Sci. J. Moldova 18(2): 210-245 (2010) - [c27]Artiom Alhazov
A Small Universal Splicing P System. Int. Conf. on Membrane Computing 2010: 95-102 - [c26]Erzsébet Csuhaj-Varjú, György Vaszil, Sergey Verlan
On Generalized Communicating P Systems with One Symbol. Int. Conf. on Membrane Computing 2010: 160-174 - [c25]Rudolf Freund, Marian Kogler, Yurii Rogozhin, Sergey Verlan
Graph-Controlled Insertion-Deletion Systems. DCFS 2010: 88-98 - [p1]Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Small Size Insertion and Deletion Systems. Scientific Applications of Language Methods 2010: 459-524 - [i2]Artiom Alhazov, Sergey Verlan:
Minimization Strategies for Maximally Parallel Multiset Rewriting Systems. CoRR abs/1009.2706 (2010) - [i1]Ion Petre, Sergey Verlan:
Matrix Insertion-Deletion Systems. CoRR abs/1012.5248 (2010)
2000 – 2009
- 2009
- [j13]Artiom Alhazov
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. Fundam. Informaticae 91(1): 17-34 (2009) - [j12]Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan:
Maximal, Locally-Maximal, and Minimal Parallelism in Networks of Cells. Int. J. Unconv. Comput. 5(5): 391-409 (2009) - [c24]Sergey Verlan
Look-Ahead Evolution for P Systems. Workshop on Membrane Computing 2009: 479-485 - [c23]Rudolf Freund, Marian Kogler, Sergey Verlan:
P Automata with Controlled Use of Minimal Communication Rules. NCMA 2009: 107-120 - 2008
- [j11]Francesco Bernardini, Marian Gheorghe
How to Synchronize the Activity of All Components of a P System? Int. J. Found. Comput. Sci. 19(5): 1183-1198 (2008) - [j10]Erzsébet Csuhaj-Varjú, Sergey Verlan
On length-separating test tube systems. Nat. Comput. 7(2): 167-181 (2008) - [j9]Sergey Verlan
Generalized communicating P systems. Theor. Comput. Sci. 404(1-2): 170-184 (2008) - [c22]Alexander Krassovitskiy
Further Results on Insertion-Deletion Systems with One-Sided Contexts. LATA 2008: 333-344 - [c21]Artiom Alhazov
Fast Synchronization in P Systems. Workshop on Membrane Computing 2008: 118-128 - [c20]Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Computational Power of P Systems with Small Size Insertion and Deletion Rules. CSP 2008: 108-117 - [c19]Sergey Verlan, Yurii Rogozhin:
New Choice for Small Universal Devices: Symport/Antiport P Systems. CSP 2008: 235-241 - 2007
- [j8]Artiom Alhazov
Minimal Cooperation in Symport/antiport Tissue P Systems. Int. J. Found. Comput. Sci. 18(1): 163-180 (2007) - [j7]Sergey Verlan:
On Minimal Context-Free Insertion-Deletion Systems. J. Autom. Lang. Comb. 12(1-2): 317-328 (2007) - [j6]Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil, Sergey Verlan
On small universal antiport P systems. Theor. Comput. Sci. 372(2-3): 152-164 (2007) - [c18]Francesco Bernardini, Marian Gheorghe
Producer/Consumer in Membrane Systems and Petri Nets. CiE 2007: 43-52 - [c17]Artiom Alhazov
Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. MCU 2007: 110-121 - [c16]Artiom Matveevici, Yurii Rogozhin, Sergey Verlan
Insertion-Deletion Systems with One-Sided Contexts. MCU 2007: 205-217 - [c15]Rudolf Freund, Sergey Verlan
A Formal Framework for Static (Tissue) P Systems. Workshop on Membrane Computing 2007: 271-284 - 2006
- [c14]Erzsébet Csuhaj-Varjú, Sergey Verlan
Length-Separating Test Tube Systems. DNA 2006: 58-70 - [c13]Sergey Verlan
Computational Completeness of Tissue P Systems with Conditional Uniport. Workshop on Membrane Computing 2006: 521-535 - 2005
- [j5]Maurice Margenstern, Sergey Verlan, Yurii Rogozhin:
Time-Varying Distributed H Systems: An Overview. Fundam. Informaticae 64(1-4): 291-306 (2005) - [j4]Sergey Verlan, Maurice Margenstern:
About Splicing P Systems with One Membrane. Fundam. Informaticae 65(3): 279-290 (2005) - [j3]Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan
Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2): 339-348 (2005) - [j2]Sergey Verlan
A boundary result on enhanced time-varying distributed H systems with parallel computations. Theor. Comput. Sci. 344(2-3): 226-242 (2005) - [c12]Sergey Verlan:
On minimal context-free insertion-deletion systems. DCFS 2005: 285-292 - [c11]Yurii Rogozhin, Sergey Verlan
On the Rule Complexity of Universal Tissue P Systems. Workshop on Membrane Computing 2005: 356-362 - [c10]Francesco Bernardini, Francisco José Romero-Campero
On P Systems with Bounded Parallelism. SYNASC 2005: 399-406 - 2004
- [b1]Serghei Verlan:
Systèmes de Head et applications à la bio-informatique. (Head systems and applications to bio-informatics). University of Metz, France, 2004 - [c9]Sergey Verlan
Communicating Distributed H Systems with Alternating Filters. Aspects of Molecular Computing 2004: 367-384 - [c8]Sergey Verlan
Tissue P Systems with Minimal Symport/Antiport. Developments in Language Theory 2004: 418-430 - [c7]Artiom Alhazov
Communicative P Systems with Minimal Cooperation. Workshop on Membrane Computing 2004: 161-177 - 2003
- [c6]Sergey Verlan:
A Frontier Result on Enhanced Time-Varying Distributed H Systems with Parallel Computations. DCFS 2003: 221-232 - [c5]Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
Context-Free Insertion-Deletion Systems. DCFS 2003: 265-273 - [c4]Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. DNA 2003: 48-53 - [c3]Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
P Systems with Cutting/Recombination Rules Assigned to Membranes. Workshop on Membrane Computing 2003: 191-202 - [c2]Sergey Verlan
About Splicing P Systems with Immediate Communication and Non-extended Splicing P Systems. Workshop on Membrane Computing 2003: 369-382 - 2002
- [j1]Serghei Verlan:
On enhanced time-varying distributed H systems. Comput. Sci. J. Moldova 10(3): 263-279 (2002) - [c1]Maurice Margenstern, Yurii Rogozhin, Sergey Verlan
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. DNA 2002: 326-336
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-18 19:29 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: