<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>RSS for Sergey Verlan</title><link>http://academic.research.microsoft.com/Rss.aspx?id=2603796</link><description>Search RSS feed for Microsoft Academic Search</description><generator>MSRA Libra RSS Burner</generator><copyright>(c)2008 Microsoft Corpration, All right reserved.</copyright><pubDate>Wed, 22 May 2013 12:13:40 GMT</pubDate><lastBuildDate>Wed, 22 May 2013 12:13:40 GMT</lastBuildDate><category /><item><title>Sergey Verlan (Personal Info)
      </title><link>http://academic.research.microsoft.com/Author/2603796</link><pubDate>Wed, 22 May 2013 12:13:40 GMT</pubDate><description><![CDATA[<p>Université de Paris XII Val de Marne<br/></p><p>
          Publications: 54</p><p>
          Citation Count: 163</p><p>
          G-index: 9</p><p>
         Field Rating: 7</p><p>Fields of study: <a href="http://academic.research.microsoft.com/RankList?entitytype=2&topDomainID=2&subDomainID=1&last=0&start=1&end=100">Algorithms &#38; Theory</a><span class="span-break" >,&nbsp;</span><a href="http://academic.research.microsoft.com/RankList?entitytype=2&topDomainID=2&subDomainID=22&last=0&start=1&end=100">Scientific Computing</a><span class="span-break" >,&nbsp;</span><a href="http://academic.research.microsoft.com/RankList?entitytype=2&topDomainID=4&subDomainID=0&last=0&start=1&end=100">Biology</a><br/></p><p>Homepage:
        <a href="http://lacl.univ-paris12.fr/Rapports/en/lacl/Author/VERLAN-S.html">http://lacl.univ-paris12.fr/Rapports/en/lacl/Author/VERLAN-S.html</a></p><p>
          Permanent Link:
          <a href="http://academic.research.microsoft.com/Author/2603796">http://academic.research.microsoft.com/Author/2603796</a></p>]]></description><guid isPermaLink="false">260401379http://lacl.univ-paris12.fr/Rapports/en/lacl/Author/VERLAN-S.htmlUniversité de Paris XII Val de Marne</guid></item><item><title>On generalized communicating P systems with minimal interaction rules</title><link>http://academic.research.microsoft.com/Publication/39329433</link><pubDate>Wed, 22 May 2013 12:13:40 GMT</pubDate><guid isPermaLink="false">260379639329433</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1146223'>Erzsébet Csuhaj-Varjú</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>TCS, vol. 412, no. 1-2, pp. 124-135, 2011</p><p>(Citations:1)</p>]]></description></item><item><title>P systems with minimal insertion and deletion</title><link>http://academic.research.microsoft.com/Publication/39329428</link><pubDate>Wed, 22 May 2013 12:13:39 GMT</pubDate><guid isPermaLink="false">260379639329428</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/3660006'>Alexander Krassovitskiy</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>TCS, vol. 412, no. 1-2, pp. 136-144, 2011</p><p>(Citations:1)</p>]]></description></item><item><title>Small Universal Tvdh and Test Tube Systems</title><link>http://academic.research.microsoft.com/Publication/39321453</link><pubDate>Wed, 22 May 2013 12:13:38 GMT</pubDate><guid isPermaLink="false">260379639321453</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/3588033'>Marian Kogler</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>IJFCS, vol. 22, no. 1, pp. 143-154, 2011</p><p />]]></description></item><item><title>DNA Circuits Based on Isothermal Constrained Loop Extension DNA Amplification</title><link>http://academic.research.microsoft.com/Publication/39315364</link><pubDate>Wed, 22 May 2013 12:13:37 GMT</pubDate><guid isPermaLink="false">260379639315364</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/34086730'>Pascal Mayer</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>CORR, vol. abs/1105.1, 2011</p><p />]]></description></item><item><title>Computational power of insertion–deletion (P) systems with rules of size two</title><link>http://academic.research.microsoft.com/Publication/15240603</link><pubDate>Wed, 22 May 2013 12:13:36 GMT</pubDate><guid isPermaLink="false">260379615240603</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/3660006'>Alexander Krassovitskiy</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>NC, vol. 10, no. 2, pp. 835-852, 2011</p><p />]]></description></item><item><title>Minimization strategies for maximally parallel multiset rewriting systems</title><link>http://academic.research.microsoft.com/Publication/39329525</link><pubDate>Wed, 22 May 2013 12:13:35 GMT</pubDate><guid isPermaLink="false">260379639329525</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>TCS, vol. 412, no. 17, pp. 1581-1591, 2011</p><p />]]></description></item><item><title>(Tissue) P systems working in the k -restricted minimally or maximally parallel transition mode</title><link>http://academic.research.microsoft.com/Publication/48767112</link><pubDate>Wed, 22 May 2013 12:13:34 GMT</pubDate><guid isPermaLink="false">260379648767112</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>NC, vol. 10, no. 2, pp. 821-833, 2011</p><p />]]></description></item><item><title>Minimization Strategies for Maximally Parallel Multiset Rewriting Systems</title><link>http://academic.research.microsoft.com/Publication/13984611</link><pubDate>Wed, 22 May 2013 12:13:33 GMT</pubDate><guid isPermaLink="false">260379613984611</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>CORR, vol. abs/1009.2, 2010</p><p>(Citations:4)</p>]]></description></item><item><title>Graph-Controlled Insertion-Deletion Systems</title><link>http://academic.research.microsoft.com/Publication/13758580</link><pubDate>Wed, 22 May 2013 12:13:32 GMT</pubDate><guid isPermaLink="false">260379613758580</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/3588033'>Marian Kogler</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>CORR, vol. abs/1008.1, 2010</p><p />]]></description></item><item><title>Graph-Controlled Insertion-Deletion Systems</title><link>http://academic.research.microsoft.com/Publication/27595648</link><pubDate>Wed, 22 May 2013 12:13:31 GMT</pubDate><guid isPermaLink="false">260379627595648</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/3588033'>Marian Kogler</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Electronic Proceedings in Theoretical Computer Science, vol. 31, pp. 88-98, 2010</p><p />]]></description></item><item><title>On Generalized Communicating P Systems with One Symbol</title><link>http://academic.research.microsoft.com/Publication/39275150</link><pubDate>Wed, 22 May 2013 12:13:30 GMT</pubDate><guid isPermaLink="false">260379639275150</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1146223'>Erzsébet Csuhaj-Varjú</a>,  <a href='http://academic.research.microsoft.com/Author/1402368'>György Vaszil</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 160-174, 2010</p><p />]]></description></item><item><title>A sequence-based analysis of the pointer distribution of stichotrichous ciliates</title><link>http://academic.research.microsoft.com/Publication/13999790</link><pubDate>Wed, 22 May 2013 12:13:29 GMT</pubDate><guid isPermaLink="false">260379613999790</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/533077'>Ion Petre</a></dl><p></p><p>Biosystems, vol. 101, no. 2, pp. 109-116, 2010</p><p />]]></description></item><item><title>A Small Universal Splicing P System</title><link>http://academic.research.microsoft.com/Publication/39275154</link><pubDate>Wed, 22 May 2013 12:13:28 GMT</pubDate><guid isPermaLink="false">260379639275154</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 95-102, 2010</p><p />]]></description></item><item><title>Matrix Insertion-Deletion Systems</title><link>http://academic.research.microsoft.com/Publication/27616981</link><pubDate>Wed, 22 May 2013 12:13:27 GMT</pubDate><guid isPermaLink="false">260379627616981</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/533077'>Ion Petre</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>CORR, vol. abs/1012.5, 2010</p><p />]]></description></item><item><title>Look-Ahead Evolution for P Systems</title><link>http://academic.research.microsoft.com/Publication/5671325</link><pubDate>Wed, 22 May 2013 12:13:26 GMT</pubDate><guid isPermaLink="false">26037965671325</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 479-485, 2009</p><p>(Citations:1)</p>]]></description></item><item><title>Computational Power of P Systems with Small Size Insertion and Deletion Rules</title><link>http://academic.research.microsoft.com/Publication/27595324</link><pubDate>Wed, 22 May 2013 12:13:25 GMT</pubDate><guid isPermaLink="false">260379627595324</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/3660006'>Alexander Krassovitskiy</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Electronic Proceedings in Theoretical Computer Science, vol. 1, pp. 108-117, 2009</p><p>(Citations:1)</p>]]></description></item><item><title>Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions</title><link>http://academic.research.microsoft.com/Publication/4761782</link><pubDate>Wed, 22 May 2013 12:13:24 GMT</pubDate><guid isPermaLink="false">26037964761782</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/3349670'>Marion Oswald</a>,  <a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>FUIN, vol. 91, no. 1, pp. 17-34, 2009</p><p />]]></description></item><item><title>New Choice for Small Universal Devices: Symport/Antiport P Systems</title><link>http://academic.research.microsoft.com/Publication/27595338</link><pubDate>Wed, 22 May 2013 12:13:23 GMT</pubDate><guid isPermaLink="false">260379627595338</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a></dl><p></p><p>Electronic Proceedings in Theoretical Computer Science, vol. 1, pp. 235-242, 2009</p><p />]]></description></item><item><title>Generalized communicating P systems</title><link>http://academic.research.microsoft.com/Publication/4411805</link><pubDate>Wed, 22 May 2013 12:13:22 GMT</pubDate><guid isPermaLink="false">26037964411805</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a></dl><p></p><p>TCS, vol. 404, no. 1-2, pp. 170-184, 2008</p><p>(Citations:7)</p>]]></description></item><item><title>How to Synchronize the Activity of All Components of a P System?</title><link>http://academic.research.microsoft.com/Publication/4676725</link><pubDate>Wed, 22 May 2013 12:13:21 GMT</pubDate><guid isPermaLink="false">26037964676725</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>IJFCS, vol. 19, no. 5, pp. 1183-1198, 2008</p><p>(Citations:6)</p>]]></description></item><item><title>Fast Synchronization in P Systems</title><link>http://academic.research.microsoft.com/Publication/4726633</link><pubDate>Wed, 22 May 2013 12:13:20 GMT</pubDate><guid isPermaLink="false">26037964726633</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 118-128, 2008</p><p>(Citations:5)</p>]]></description></item><item><title>Computational Power of P Systems with Small Size Insertion and Deletion Rules</title><link>http://academic.research.microsoft.com/Publication/4744367</link><pubDate>Wed, 22 May 2013 12:13:19 GMT</pubDate><guid isPermaLink="false">26037964744367</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/3660006'>Alexander Krassovitskiy</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>CORR, pp. 108-117, 2008</p><p>(Citations:2)</p>]]></description></item><item><title>On length-separating test tube systems</title><link>http://academic.research.microsoft.com/Publication/4402680</link><pubDate>Wed, 22 May 2013 12:13:18 GMT</pubDate><guid isPermaLink="false">26037964402680</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1146223'>Erzsébet Csuhaj-varjú</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>NC, vol. 7, no. 2, pp. 167-181, 2008</p><p />]]></description></item><item><title>New Choice for Small Universal Devices: Symport/Antiport P Systems</title><link>http://academic.research.microsoft.com/Publication/4744358</link><pubDate>Wed, 22 May 2013 12:13:17 GMT</pubDate><guid isPermaLink="false">26037964744358</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a></dl><p></p><p>CORR, pp. 235-241, 2008</p><p />]]></description></item><item><title>A sequence-based analysis of the pointer dis- tribution of ciliate genes</title><link>http://academic.research.microsoft.com/Publication/6122693</link><pubDate>Wed, 22 May 2013 12:13:16 GMT</pubDate><guid isPermaLink="false">26037966122693</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/533077'>Ion Petre</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>2008</p><p />]]></description></item><item><title>A Formal Framework for Static (Tissue) P Systems</title><link>http://academic.research.microsoft.com/Publication/4299838</link><pubDate>Wed, 22 May 2013 12:13:15 GMT</pubDate><guid isPermaLink="false">26037964299838</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 271-284, 2007</p><p>(Citations:9)</p>]]></description></item><item><title>On Minimal Context-Free Insertion-Deletion Systems</title><link>http://academic.research.microsoft.com/Publication/4395135</link><pubDate>Wed, 22 May 2013 12:13:14 GMT</pubDate><guid isPermaLink="false">26037964395135</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>JALC, vol. 12, no. 1-2, pp. 317-328, 2007</p><p>(Citations:9)</p>]]></description></item><item><title>On small universal antiport P systems</title><link>http://academic.research.microsoft.com/Publication/2515898</link><pubDate>Wed, 22 May 2013 12:13:13 GMT</pubDate><guid isPermaLink="false">26037962515898</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1146223'>Erzsébet Csuhaj-varjú</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/1402368'>György Vaszil</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>TCS, vol. 372, no. 2-3, pp. 152-164, 2007</p><p>(Citations:3)</p>]]></description></item><item><title>Insertion-Deletion Systems with One-Sided Contexts</title><link>http://academic.research.microsoft.com/Publication/4299617</link><pubDate>Wed, 22 May 2013 12:13:12 GMT</pubDate><guid isPermaLink="false">26037964299617</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/3637197'>Artiom Matveevici</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>MCU, pp. 205-217, 2007</p><p>(Citations:4)</p>]]></description></item><item><title>Partial Halting in P Systems Using Membrane Rules with Permitting Contexts</title><link>http://academic.research.microsoft.com/Publication/4299604</link><pubDate>Wed, 22 May 2013 12:13:11 GMT</pubDate><guid isPermaLink="false">26037964299604</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/3349670'>Marion Oswald</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>MCU, pp. 110-121, 2007</p><p>(Citations:3)</p>]]></description></item><item><title>Producer/Consumer in Membrane Systems and Petri Nets</title><link>http://academic.research.microsoft.com/Publication/2422099</link><pubDate>Wed, 22 May 2013 12:13:10 GMT</pubDate><guid isPermaLink="false">26037962422099</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>CIE, pp. 43-52, 2007</p><p>(Citations:4)</p>]]></description></item><item><title>Minimal Cooperation in Symport/antiport Tissue P Systems</title><link>http://academic.research.microsoft.com/Publication/2503462</link><pubDate>Wed, 22 May 2013 12:13:09 GMT</pubDate><guid isPermaLink="false">26037962503462</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>IJFCS, vol. 18, no. 1, pp. 163-180, 2007</p><p>(Citations:2)</p>]]></description></item><item><title>Computational Completeness of Tissue P Systems with Conditional Uniport</title><link>http://academic.research.microsoft.com/Publication/2462695</link><pubDate>Wed, 22 May 2013 12:13:08 GMT</pubDate><guid isPermaLink="false">26037962462695</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a></dl><p></p><p>Workshop on Membrane Computing, pp. 521-535, 2006</p><p>(Citations:1)</p>]]></description></item><item><title>Length-Separating Test Tube Systems</title><link>http://academic.research.microsoft.com/Publication/2426621</link><pubDate>Wed, 22 May 2013 12:13:07 GMT</pubDate><guid isPermaLink="false">26037962426621</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1146223'>Erzsébet Csuhaj-varjú</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>DNA, pp. 58-70, 2006</p><p />]]></description></item><item><title>Context-free insertion-deletion systems</title><link>http://academic.research.microsoft.com/Publication/1707641</link><pubDate>Wed, 22 May 2013 12:13:06 GMT</pubDate><guid isPermaLink="false">26037961707641</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/964197'>Gheorghe Paun</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>TCS, vol. 330, no. 2, pp. 339-348, 2005</p><p>(Citations:16)</p>]]></description></item><item><title>On the Rule Complexity of Universal Tissue P Systems</title><link>http://academic.research.microsoft.com/Publication/1865314</link><pubDate>Wed, 22 May 2013 12:13:05 GMT</pubDate><guid isPermaLink="false">26037961865314</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 356-362, 2005</p><p>(Citations:8)</p>]]></description></item><item><title>A boundary result on enhanced time-varying distributed H systems with parallel computations</title><link>http://academic.research.microsoft.com/Publication/1707862</link><pubDate>Wed, 22 May 2013 12:13:04 GMT</pubDate><guid isPermaLink="false">26037961707862</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>TCS, vol. 344, no. 2-3, pp. 226-242, 2005</p><p>(Citations:3)</p>]]></description></item><item><title>About Splicing P Systems with One Membrane</title><link>http://academic.research.microsoft.com/Publication/1714374</link><pubDate>Wed, 22 May 2013 12:13:03 GMT</pubDate><guid isPermaLink="false">26037961714374</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a></dl><p></p><p>FUIN, vol. 65, no. 3, pp. 279-290, 2005</p><p>(Citations:2)</p>]]></description></item><item><title>On P Systems with Bounded Parallelism</title><link>http://academic.research.microsoft.com/Publication/2483519</link><pubDate>Wed, 22 May 2013 12:13:02 GMT</pubDate><guid isPermaLink="false">26037962483519</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/3484352'>Francisco José Romero-campero</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/3338989'>Mario J. Pérez-jiménez</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/679689'>Natalio Krasnogor</a></dl><p></p><p>SYNASC, pp. 399-406, 2005</p><p>(Citations:3)</p>]]></description></item><item><title>Time-Varying Distributed H Systems: An Overview</title><link>http://academic.research.microsoft.com/Publication/1714371</link><pubDate>Wed, 22 May 2013 12:13:01 GMT</pubDate><guid isPermaLink="false">26037961714371</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a></dl><p></p><p>FUIN, vol. 64, no. 1-4, pp. 291-306, 2005</p><p>(Citations:1)</p>]]></description></item><item><title>Communicative P Systems with Minimal Cooperation</title><link>http://academic.research.microsoft.com/Publication/1865308</link><pubDate>Wed, 22 May 2013 12:13:00 GMT</pubDate><guid isPermaLink="false">26037961865308</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/1486310'>Vladimir Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 161-177, 2004</p><p>(Citations:13)</p>]]></description></item><item><title>Tissue P Systems with Minimal Symport/Antiport</title><link>http://academic.research.microsoft.com/Publication/1770615</link><pubDate>Wed, 22 May 2013 12:12:59 GMT</pubDate><guid isPermaLink="false">26037961770615</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>DLT, pp. 418-430, 2004</p><p>(Citations:4)</p>]]></description></item><item><title>Communicating Distributed H Systems with Alternating Filters</title><link>http://academic.research.microsoft.com/Publication/584359</link><pubDate>Wed, 22 May 2013 12:12:58 GMT</pubDate><guid isPermaLink="false">2603796584359</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Birthday ..., pp. 367-384, 2004</p><p>(Citations:2)</p>]]></description></item><item><title>Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved</title><link>http://academic.research.microsoft.com/Publication/459240</link><pubDate>Wed, 22 May 2013 12:12:57 GMT</pubDate><guid isPermaLink="false">2603796459240</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>DNA, pp. 48-53, 2003</p><p>(Citations:5)</p>]]></description></item><item><title>P Systems with Cutting/Recombination Rules Assigned to Membranes</title><link>http://academic.research.microsoft.com/Publication/688515</link><pubDate>Wed, 22 May 2013 12:12:56 GMT</pubDate><guid isPermaLink="false">2603796688515</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/716567'>Franziska Freund</a>,  <a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/3349670'>Marion Oswald</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 191-202, 2003</p><p>(Citations:2)</p>]]></description></item><item><title>About Splicing P Systems with Immediate Communication and Non-extended Splicing P Systems</title><link>http://academic.research.microsoft.com/Publication/688533</link><pubDate>Wed, 22 May 2013 12:12:55 GMT</pubDate><guid isPermaLink="false">2603796688533</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>Workshop on Membrane Computing, pp. 369-382, 2003</p><p>(Citations:2)</p>]]></description></item><item><title>Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations</title><link>http://academic.research.microsoft.com/Publication/459227</link><pubDate>Wed, 22 May 2013 12:12:54 GMT</pubDate><guid isPermaLink="false">2603796459227</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/3216295'>Yurii Rogozhin</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>DNA, pp. 326-336, 2002</p><p>(Citations:4)</p>]]></description></item><item><title>Partial Versus Total Halting in P Systems</title><link>http://academic.research.microsoft.com/Publication/5633570</link><pubDate>Wed, 22 May 2013 12:12:53 GMT</pubDate><guid isPermaLink="false">26037965633570</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1759647'>Artiom Alhazov</a>,  <a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/3349670'>Marion Oswald</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p>MA</p><p>(Citations:8)</p>]]></description></item><item><title>(Tissue) P Systems Working in the k-Restricted Minimally Parallel Derivation Mode</title><link>http://academic.research.microsoft.com/Publication/12804189</link><pubDate>Wed, 22 May 2013 12:12:52 GMT</pubDate><guid isPermaLink="false">260379612804189</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p /><p>(Citations:7)</p>]]></description></item><item><title>A Formal Framework for P Systems</title><link>http://academic.research.microsoft.com/Publication/4474083</link><pubDate>Wed, 22 May 2013 12:12:51 GMT</pubDate><guid isPermaLink="false">26037964474083</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1218188'>Rudolf Freund</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p /><p>(Citations:6)</p>]]></description></item><item><title>Networks of Cells and Petri Nets</title><link>http://academic.research.microsoft.com/Publication/6412396</link><pubDate>Wed, 22 May 2013 12:12:50 GMT</pubDate><guid isPermaLink="false">26037966412396</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p /><p>(Citations:6)</p>]]></description></item><item><title>Small Computationally Complete Symport/Antiport P Systems?</title><link>http://academic.research.microsoft.com/Publication/11067438</link><pubDate>Wed, 22 May 2013 12:12:49 GMT</pubDate><guid isPermaLink="false">260379611067438</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/1146223'>Erzsebet Csuhaj-Varju</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a>,  <a href='http://academic.research.microsoft.com/Author/1402368'>Gyorgy Vaszil</a>,  <a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a></dl><p></p><p /><p>(Citations:4)</p>]]></description></item><item><title>Generalized communicating P systems</title><link>http://academic.research.microsoft.com/Publication/11956582</link><pubDate>Wed, 22 May 2013 12:12:48 GMT</pubDate><guid isPermaLink="false">260379611956582</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a></dl><p></p><p /><p>(Citations:2)</p>]]></description></item><item><title>On Communication in Tissue P Systems: Conditional Uniport</title><link>http://academic.research.microsoft.com/Publication/4669413</link><pubDate>Wed, 22 May 2013 12:12:47 GMT</pubDate><guid isPermaLink="false">26037964669413</guid><description><![CDATA[<dl><a href='http://academic.research.microsoft.com/Author/2603796'>Sergey Verlan</a>,  <a href='http://academic.research.microsoft.com/Author/2844690'>Francesco Bernardini</a>,  <a href='http://academic.research.microsoft.com/Author/1013537'>Marian Gheorghe</a>,  <a href='http://academic.research.microsoft.com/Author/1427353'>Maurice Margenstern</a></dl><p></p><p>Workshop on Membrane Computing</p><p>(Citations:2)</p>]]></description></item></channel></rss>