Sergey Verlan
Sergey Verlan
Associated professor (maître de conférences) in Computer Science, Université Paris Est Créteil
Verified email at u-pec.fr - Homepage
Title
Cited by
Cited by
Year
A formal framework for static (tissue) P systems
R Freund, S Verlan
International Workshop on Membrane Computing, 271-284, 2007
89*2007
Context-free insertion–deletion systems
M Margenstern, G Păun, Y Rogozhin, S Verlan
Theoretical computer science 330 (2), 339-348, 2005
792005
On minimal context-free insertion-deletion systems
S Verlan
J. Autom. Lang. Comb. 12 (1-2), 317-328, 2007
552007
Graph-controlled insertion-deletion systems
R Freund, M Kogler, Y Rogozhin, S Verlan
arXiv preprint arXiv:1008.1651, 2010
432010
Insertion-deletion systems with one-sided contexts
A Matveevici, Y Rogozhin, S Verlan
International Conference on Machines, Computations, and Universality, 205-217, 2007
382007
Computational power of insertion–deletion (P) systems with rules of size two
A Krassovitskiy, Y Rogozhin, S Verlan
Natural Computing 10 (2), 835-852, 2011
372011
Further results on insertion-deletion systems with one-sided contexts
A Krassovitskiy, Y Rogozhin, S Verlan
International Conference on Language and Automata Theory and Applications …, 2008
372008
On small universal antiport P systems
E Csuhaj-Varjú, M Margenstern, G Vaszil, S Verlan
Theoretical Computer Science 372 (2-3), 152-164, 2007
372007
Recent developments on insertion-deletion systems
S Verlan
Computer science journal of moldova 53 (2), 210-245, 2010
322010
On the rule complexity of universal tissue P systems
Y Rogozhin, S Verlan
International Workshop on Membrane Computing, 356-362, 2005
322005
Communicative P systems with minimal cooperation
A Alhazov, M Margenstern, V Rogozhin, Y Rogozhin, S Verlan
International Workshop on Membrane Computing, 161-177, 2004
312004
Flattening in (tissue) P systems
R Freund, A Leporati, G Mauri, AE Porreca, S Verlan, C Zandron
International Conference on Membrane Computing, 173-188, 2013
282013
Minimization strategies for maximally parallel multiset rewriting systems
A Alhazov, S Verlan
Theoretical Computer Science 412 (17), 1581-1591, 2011
282011
P systems with minimal insertion and deletion
A Alhazov, A Krassovitskiy, Y Rogozhin, S Verlan
Theoretical computer science 412 (1-2), 136-144, 2011
282011
Generalized communicating P systems
S Verlan, F Bernardini, M Gheorghe, M Margenstern
Theoretical Computer Science 404 (1-2), 170-184, 2008
282008
Time-varying distributed H systems with parallel computations: the problem is solved
M Margenstern, Y Rogozhin, S Verlan
International Workshop on DNA-Based Computers, 48-54, 2003
272003
Matrix insertion–deletion systems
I Petre, S Verlan
Theoretical Computer Science 456, 80-88, 2012
252012
How to Synchronize the Activity of All Components of a P System?
F Bernardini, M Gheorghe, M Margenstern, S Verlan
International Journal of Foundations of Computer Science 19 (05), 1183-1198, 2008
232008
Time-varying distributed H systems of degree 2 can carry out parallel computations
M Margenstern, Y Rogozhin, S Verlan
International Workshop on DNA-Based Computers, 326-336, 2002
232002
Computational power of P systems with small size insertion and deletion rules
A Krassovitskiy, Y Rogozhin, S Verlan
arXiv preprint arXiv:0906.3119, 2009
222009
The system can't perform the operation now. Try again later.
Articles 1–20