User Tools

Site Tools


en:publications

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
en:publications [2017/01/26 23:36]
sivanov [Conference and Workshop Articles] Update.
en:publications [2018/08/20 16:08] (current)
sivanov [Conference and Workshop Articles] Update.
Line 2: Line 2:
  
 ===== Publications ===== ===== Publications =====
-A list of my publications is also available on [[http://​dblp.uni-trier.de/​pers/​hd/​i/​Ivanov_0001:​Sergiu|dblp]] and on [[https://​scholar.google.com/​citations?​user=ZpISl3cAAAAJ|Google Scholar]].+A list of my publications is also available on [[http://​dblp.uni-trier.de/​pers/​hd/​i/​Ivanov_0001:​Sergiu|dblp]].
 ==== Journal Articles ==== ==== Journal Articles ====
 <​html>​ <​html>​
 <​table>​ <​table>​
 +
  
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​ijuc/​FreundIS16">​1</a>]+[<a name="​DBLP:​journals/​nc/​AlhazovFIOV18">​1</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Marion Oswald, and Sergey Verlan. 
 + ​Extended spiking neural P systems with white hole rules and their 
 +  red-green variants. 
 + <​em>​Natural Computing</​em>,​ 17(2):​297--310,​ 2018. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​s11047-017-9649-7">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​s11047-017-9649-7">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​fuin/​IvanovV17">​2</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Sergiu Ivanov and Sergey Verlan. 
 + ​Universality and computational completeness of controlled leftist 
 +  insertion-deletion systems. 
 + <​em>​Fundam. Inform.</​em>,​ 155(1-2):​163--185,​ 2017. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/​FI-2017-1580">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.3233/​FI-2017-1580">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​peerj-cs/​MeurerSPCKRKIMS17">​3</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Aaron Meurer, Christopher&​nbsp;​P. Smith, Mateusz Paprocki, Ondrej Cert&​iacute;​k,​ 
 +  Sergey&​nbsp;​B. Kirpichev, Matthew Rocklin, Amit Kumar, Sergiu Ivanov, Jason&​nbsp;​Keith 
 +  Moore, Sartaj Singh, Thilina Rathnayake, Sean Vig, Brian&​nbsp;​E. Granger, 
 +  Richard&​nbsp;​P. Muller, Francesco Bonazzi, Harsh Gupta, Shivam Vats, Fredrik 
 +  Johansson, Fabian Pedregosa, Matthew&​nbsp;​J. Curry, Andy&​nbsp;​R. Terrel, Step&​aacute;​n 
 +  Roucka, Ashutosh Saboo, Isuru Fernando, Sumith Kulal, Robert Cimrman, and 
 +  Anthony&​nbsp;​M. Scopatz. 
 + ​Sympy:​ symbolic computing in python. 
 + <​em>​PeerJ Computer Science</​em>,​ 3:e103, 2017. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.7717/​peerj-cs.103">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.7717/​peerj-cs.103">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​tcs/​AlhazovFFISS17">​4</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Artiom Alhazov, Henning Fernau, Rudolf Freund, Sergiu Ivanov, Rani Siromoney,​ 
 +  and K.&​nbsp;​G. Subramanian. 
 + ​Contextual array grammars with matrix control, regular control 
 +  languages, and tissue P systems control. 
 + <​em>​Theor. Comput. Sci.</​em>,​ 682:5--21, 2017. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​j.tcs.2017.03.012">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1016/​j.tcs.2017.03.012">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​ijuc/​FreundIS16">​5</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 24: Line 95:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​tcs/​AzimiG0MPP16">​2</a>]+[<a name="​DBLP:​journals/​jalc/​Alhazov0PV16">​6</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Artiom Alhazov, Sergiu Ivanov, Elisabeth Pelz, and Sergey Verlan. 
 + Small universal deterministic petri nets with inhibitor arcs. 
 + <​em>​Journal of Automata, Languages and Combinatorics</​em>,​ 
 +  21(1-2):​7--26,​ 2016. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.25596/​jalc-2016-007">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.25596/​jalc-2016-007">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​tcs/​AzimiG0MPP16">​7</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 32: Line 119:
  <​em>​Theor. Comput. Sci.</​em>,​ 623:​103--113,​ 2016.  <​em>​Theor. Comput. Sci.</​em>,​ 623:​103--113,​ 2016.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​j.tcs.2015.11.040">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​j.tcs.2015.11.040">​DOI</​a>&​nbsp;​| ​
-<a href="http://dx.doi.org/​10.1016/​j.tcs.2015.11.040">​http</​a>&​nbsp;​]+<a href="https://​doi.org/​10.1016/​j.tcs.2015.11.040">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​peerjpre/​MeurerSPCRK0MSR16">​8</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Aaron Meurer, Christopher&​nbsp;​P. Smith, Mateusz Paprocki, Ondrej Cert&​iacute;​k,​ 
 +  Matthew Rocklin, Amit Kumar, Sergiu Ivanov, Jason&​nbsp;​Keith Moore, Sartaj Singh, 
 +  Thilina Rathnayake, Sean Vig, Brian&​nbsp;​E. Granger, Richard&​nbsp;​P. Muller, Francesco 
 +  Bonazzi, Harsh Gupta, Shivam Vats, Fredrik Johansson, Fabian Pedregosa,​ 
 +  Matthew&​nbsp;​J. Curry, Ashutosh Saboo, Isuru Fernando, Sumith Kulal, Robert 
 +  Cimrman, and Anthony&​nbsp;​M. Scopatz. 
 + ​Sympy:​ Symbolic computing in python. 
 + <​em>​PeerJ PrePrints</​em>,​ 4:e2083, 2016. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.7287/​peerj.preprints.2083v2">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.7287/​peerj.preprints.2083v2">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​journals/​csjm/​000115">​9</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Sergiu Ivanov. 
 + ​Annotation on phd thesis. 
 + <​em>​The Computer Science Journal of Moldova</​em>,​ 23(3):​386--388,​ 2015. 
 +[&​nbsp;<​a href="​http://​www.math.md/​publications/​csjm/​issues/​v23-n3/​11989/​">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 40: Line 161:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​fuin/​0001V15">​3</a>]+[<a name="​DBLP:​journals/​fuin/​0001V15">​10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 47: Line 168:
  <​em>​Fundam. Inform.</​em>,​ 138(1-2):​127--144,​ 2015.  <​em>​Fundam. Inform.</​em>,​ 138(1-2):​127--144,​ 2015.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/​FI-2015-1203">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/​FI-2015-1203">​DOI</​a>&​nbsp;​| ​
-<a href="http://dx.doi.org/​10.3233/​FI-2015-1203">​http</​a>&​nbsp;​]+<a href="https://​doi.org/​10.3233/​FI-2015-1203">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 55: Line 176:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​tcs/​AzimiGIP15">​4</a>]+[<a name="​DBLP:​journals/​tcs/​AzimiGIP15">​11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 62: Line 183:
  <​em>​Theor. Comput. Sci.</​em>,​ 598:23--39, 2015.  <​em>​Theor. Comput. Sci.</​em>,​ 598:23--39, 2015.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​j.tcs.2015.02.014">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/​j.tcs.2015.02.014">​DOI</​a>&​nbsp;​| ​
-<a href="http://dx.doi.org/​10.1016/​j.tcs.2015.02.014">​http</​a>&​nbsp;​]+<a href="https://​doi.org/​10.1016/​j.tcs.2015.02.014">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 70: Line 191:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​fuin/​AlhazovF014">​5</a>]+[<a name="​DBLP:​journals/​fuin/​AlhazovF014">​12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 77: Line 198:
  <​em>​Fundam. Inform.</​em>,​ 134(1-2):​17--37,​ 2014.  <​em>​Fundam. Inform.</​em>,​ 134(1-2):​17--37,​ 2014.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/​FI-2014-1088">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/​FI-2014-1088">​DOI</​a>&​nbsp;​| ​
-<a href="http://dx.doi.org/​10.3233/​FI-2014-1088">​http</​a>&​nbsp;​]+<a href="https://​doi.org/​10.3233/​FI-2014-1088">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 85: Line 206:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​jalc/​0001RV14">​6</a>]+[<a name="​DBLP:​journals/​jalc/​0001RV14">​13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 92: Line 213:
  <​em>​Journal of Automata, Languages and Combinatorics</​em>,​  <​em>​Journal of Automata, Languages and Combinatorics</​em>,​
   19(1-4):​133--144,​ 2014.   19(1-4):​133--144,​ 2014.
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.25596/​jalc-2014-133">​DOI</​a>&​nbsp;​| ​
 +<a href="​https://​doi.org/​10.25596/​jalc-2014-133">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 99: Line 222:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​ijcm/​Ivanov13">​7</a>]+[<a name="​DBLP:​journals/​ijcm/​Ivanov13">​14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 106: Line 229:
  <​em>​Int. J. Comput. Math.</​em>,​ 90(4):​776--788,​ 2013.  <​em>​Int. J. Comput. Math.</​em>,​ 90(4):​776--788,​ 2013.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.1080/​00207160.2012.743652">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.1080/​00207160.2012.743652">​DOI</​a>&​nbsp;​| ​
-<a href="http://dx.doi.org/​10.1080/​00207160.2012.743652">​http</​a>&​nbsp;​]+<a href="https://​doi.org/​10.1080/​00207160.2012.743652">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 114: Line 237:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​csjm/​Ivanov12">​8</a>]+[<a name="​DBLP:​journals/​csjm/​Ivanov12">​15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 128: Line 251:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​ijncr/​IvanovARG11">​9</a>]+[<a name="​DBLP:​journals/​ijncr/​IvanovARG11">​16</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 136: Line 259:
  <​em>​IJNCR</​em>,​ 2(2):​56--66,​ 2011.  <​em>​IJNCR</​em>,​ 2(2):​56--66,​ 2011.
 [&​nbsp;<​a href="​http://​dx.doi.org/​10.4018/​jncr.2011040105">​DOI</​a>&​nbsp;​| ​ [&​nbsp;<​a href="​http://​dx.doi.org/​10.4018/​jncr.2011040105">​DOI</​a>&​nbsp;​| ​
-<a href="http://dx.doi.org/​10.4018/​jncr.2011040105">​http</​a>&​nbsp;​]+<a href="https://​doi.org/​10.4018/​jncr.2011040105">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 144: Line 267:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​csjm/​AlhazovBBCCCDIMMMRRTVV10">​10</a>]+[<a name="​DBLP:​journals/​csjm/​AlhazovBBCCCDIMMMRRTVV10">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 162: Line 285:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​csjm/​AlhazovCIR10">​11</a>]+[<a name="​DBLP:​journals/​csjm/​AlhazovCIR10">​18</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
Line 173: Line 296:
 </tr> </tr>
  
 +
 +</​table>​
 +</​html>​
 +
 +==== Conference and Workshop Articles ====
 +<​html>​
 +<​table>​
  
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="IvanovMarcus2015">12</a>]+[<a name="DBLP:​conf/​mcu/​AlhazovF018">1</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Sergiu Ivanov and Sergey Verlan. +Artiom Alhazov, Rudolf Freund, and Sergiu Ivanov
- On the lower bounds for leftist insertion-deletion languages. + ​Sequential grammars with activation and blocking of rules. 
- <​em>​Annals ​of the University of Bucharest (Informatics)</​em>,​ + In J&​eacute;​r&​ocirc;​me Durand-Lose ​and Sergey Verlan, editors, <em> 
-  ​LXII(2):77--88, 2015.+  ​Machines,​ Computations,​ and Universality ​8th International Conference, 
 +  MCU 2018, Fontainebleau,​ France, June 28-30, 2018, Proceedings</em>, volume 
 +  10881 of <​em>​Lecture Notes in Computer Science</em>, pages 51--68. Springer
 +  ​2018. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-319-92402-1\_3">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-319-92402-1\_3">​http</​a>&​nbsp;​]
  
 </td> </td>
 </tr> </tr>
-</​table>​ 
  
-</​html>​ 
  
-==== Conference ​and Workshop Articles ==== +<tr valign="​top">​ 
-<html>+<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​conf/​uc/​AlhazovF018">​2</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Artiom Alhazov, Rudolf Freund, ​and Sergiu Ivanov. 
 + P systems with activation and blocking of rules. 
 + In Susan Stepney and Sergey Verlan, editors, <​em>​Unconventional 
 +  Computation and Natural Computation - 17th International Conference, UCNC 
 +  2018, Fontainebleau,​ France, June 25-29, 2018, Proceedings</​em>,​ volume 10867 of 
 +  <​em>​Lecture Notes in Computer Science</​em>,​ pages 1--15. Springer, 2018. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-319-92435-9\_1">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-319-92435-9\_1">​http</​a>&​nbsp;​] 
 + 
 +</td> 
 +</tr>
  
-<​table>​ 
  
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/ijuc/FreundIS16">1</a>]+[<a name="​DBLP:​conf/complexnetworks/VuongCIGT17">3</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Rudolf Freund, Sergiu Ivanov, and Ludwig Staiger+Quoc-Trung Vuong, Roselyne Chauvin, Sergiu Ivanov, Nicolas Glade, and Laurent 
- Going beyond turing with P automata: Regular observer +  Trilling
-  ​<I>&omega;</I>-languages ​and partial adult halting. + A logical constraint-based approach to infer and explore diversity 
- <​em>​IJUC</​em>, ​12(1):51--692016+  ​and composition in thresholded boolean automaton networks. 
-[&​nbsp;<​a href="​http://​www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/​ijuc-volume-12-number-1-2016/ijuc-12-1-p-51-69/">​http</​a>&​nbsp;​]+ In Chantal Cherifi, Hocine Cherifi, M&aacute;rton Karsai, and Mirco 
 +  Musolesi, editors, ​<em>Complex Networks &amp; Their Applications VI - 
 +  Proceedings of Complex Networks 2017 (The Sixth International Conference on 
 +  Complex Networks ​and Their Applications),​ COMPLEX NETWORKS 2017, Lyon, 
 +  ​France,​ November 29 - December 1, 2017.</em>, volume 689 of <​em>​Studies in 
 +  Computational Intelligence</​em>, ​pages 567--579. Springer2017
 +[&​nbsp;<​a href="​http://​dx.doi.org/10.1007/978-3-319-72150-7\_46">​DOI<​/a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-319-72150-7\_46">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 212: Line 365:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/jalc/Alhazov0PV16">2</a>]+[<a name="​DBLP:​conf/membrane/AlhazovF017">4</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Artiom Alhazov, ​Sergiu Ivanov, Elisabeth Pelz, and Sergey Verlan+Artiom Alhazov, ​Rudolf Freund, and Sergiu Ivanov
- Small universal deterministic petri nets with inhibitor arcs+ Hierarchical P systems ​with randomized right-hand sides of rules
- <​em>​Journal of AutomataLanguages and Combinatorics</​em>,​ + In Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, and Claudio 
-  ​21(1-2):7--26, 2016.+  Zandron, editors, ​<em>Membrane Computing - 18th International Conference, 
 +  CMC 2017, Bradford, UK, July 25-28, 2017, Revised Selected Papers</​em>, ​volume 
 +  ​10725 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 15--39. Springer, 
 +  2017. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-319-73359-3\_2">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-319-73359-3\_2">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 226: Line 384:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​tcs/AzimiG0MPP16">3</a>]+[<a name="​DBLP:​journals/​corr/abs-1708-06458">5</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Sepinoud AzimiCristian Gratie, Sergiu Ivanov, ​Luca ManzoniIon Petreand +Artiom AlhazovRudolf Freund, Sergiu Ivanov, ​and Sergey Verlan. 
-  ​Antonio&nbsp;E. Porreca. + ​(tissue) P systems with vesicles of multisets. 
- Complexity of model checking for reaction systems. + In Erzs&​eacute;​bet Csuhaj-Varj&​uacute;​P&​aacute;​l D&​ouml;​m&​ouml;​si
- <​em>​Theor. Comput. Sci.</​em>, ​623:103--1132016+  ​and Gy&ouml;rgy Vaszil, editors, <​em>​Proceedings 15th International 
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/j.tcs.2015.11.040">​DOI</​a>&​nbsp;​|  +  ​Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, 
-<a href="http://dx.doi.org/10.1016/j.tcs.2015.11.040">​http</​a>&​nbsp;​]+  ​September 4-6, 2017.</em>, volume 252 of <​em>​EPTCS</​em>, ​pages 11--252017
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.4204/EPTCS.252.6">​DOI</​a>&​nbsp;​|  
 +<a href="https://​doi.org/​10.4204/EPTCS.252.6">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 242: Line 402:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/peerjpre/MeurerSPCRK0MSR16">4</a>]+[<a name="​DBLP:​conf/membrane/AlhazovAF016">6</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Aaron MeurerChristopher&​nbsp;​P. SmithMateusz Paprocki, Ondrej Cert&​iacute;​k,​ +Artiom AlhazovBogdan AmanRudolf Freundand Sergiu Ivanov
-  Matthew Rocklin, Amit Kumar, Sergiu Ivanov, ​Jason&​nbsp;​K. MooreSartaj Singh+ ​Simulating R systems by P systems. 
-  ​Thilina RathnayakeSean VigBrian&​nbsp;​E. GrangerRichard&​nbsp;​P. Muller, Francesco + In Alberto LeporatiGrzegorz RozenbergArto Salomaaand Claudio 
-  ​BonazziHarsh GuptaShivam VatsFredrik JohanssonFabian Pedregosa, +  ​Zandroneditors<​em>​Membrane Computing - 17th International Conference
-  Matthew&​nbsp;​J. CurryAshutosh Saboo, Isuru Fernando, Sumith Kulal, Robert +  ​CMC 2016MilanItalyJuly 25-292016Revised Selected Papers</​em>​volume 
-  ​Cimrman, and Anthony&​nbsp;​M. Scopatz. +  ​10105 of <em>Lecture Notes in Computer Science</​em>, ​pages 51--66. Springer, 
- ​Sympy:​ Symbolic computing in python. +  ​2016. 
- <em>PeerJ PrePrints</​em>, ​4:e2083, 2016. +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/978-3-319-54072-6\_4">​DOI</​a>&​nbsp;​|  
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.7287/peerj.preprints.2083v2">​DOI</​a>&​nbsp;​|  +<a href="https://​doi.org/​10.1007/978-3-319-54072-6\_4">​http</​a>&​nbsp;​]
-<a href="http://dx.doi.org/10.7287/peerj.preprints.2083v2">​http</​a>&​nbsp;​]+
  
 </td> </td>
Line 262: Line 421:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/fuin/​0001V15">​5</a>]+[<a name="​DBLP:​conf/membrane/​AlhazovBF0PZ16">​7</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Artiom Alhazov, Omar Belingheri, Rudolf Freund, Sergiu Ivanov, Antonio&​nbsp;​E. 
 +  Porreca, and Claudio Zandron. 
 + ​Purely catalytic P systems over integers and their generative 
 +  power. 
 + In Alberto Leporati, Grzegorz Rozenberg, Arto Salomaa, and Claudio 
 +  Zandron, editors, <​em>​Membrane Computing - 17th International Conference,​ 
 +  CMC 2016, Milan, Italy, July 25-29, 2016, Revised Selected Papers</​em>,​ volume 
 +  10105 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 67--82. Springer, 
 +  2016. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-319-54072-6\_5">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-319-54072-6\_5">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​conf/​mcu/​0001V15">​8</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Sergiu Ivanov and Sergey Verlan. Sergiu Ivanov and Sergey Verlan.
- Random context and semi-conditional ​insertion-deletion systems. + Universality of graph-controlled leftist ​insertion-deletion systems 
- <​em>​Fundam. Inform.</​em>, ​138(1-2):127--144, 2015. +  with two states
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/FI-2015-1203">​DOI</​a>&​nbsp;​|  + In J&​eacute;​r&​ocirc;​me Durand-Lose and Benedek Nagy, editors, ​<em> 
-<a href="http://dx.doi.org/10.3233/FI-2015-1203">​http</​a>&​nbsp;​]+  Machines, Computations,​ and Universality - 7th International Conference,​ 
 +  MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings</​em>,​ 
 +  volume 9288 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 79--93. 
 +  Springer, 2015. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/978-3-319-23111-2\_6">​DOI</​a>&​nbsp;​|  
 +<a href="https://​doi.org/​10.1007/978-3-319-23111-2\_6">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 277: Line 462:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/tcs/AzimiGIP15">6</a>]+[<a name="​DBLP:​conf/membrane/Freund0V15">9</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Sepinoud Azimi, Cristian Gratie, Sergiu Ivanov, and Ion Petre+Rudolf Freund, Sergiu Ivanov, and Sergey Verlan
- Dependency graphs and mass conservation in reaction ​systems. + systems ​with generalized multisets over totally ordered abelian 
- <​em>​Theor. Comput. Sci.</​em>, ​598:23--39, 2015. +  groups
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1016/j.tcs.2015.02.014">​DOI</​a>&​nbsp;​|  + In Grzegorz Rozenberg, Arto Salomaa, Jos&​eacute;&​nbsp;​M. Sempere, and 
-<a href="http://dx.doi.org/10.1016/j.tcs.2015.02.014">​http</​a>&​nbsp;​]+  Claudio Zandron, editors, ​<em>Membrane Computing - 16th International 
 +  Conference, CMC 2015, Valencia, Spain, August 17-21, 2015, Revised Selected 
 +  Papers</​em>, ​volume 9504 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 
 +  117--136. Springer, 2015. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/978-3-319-28475-0\_9">​DOI</​a>&​nbsp;​|  
 +<a href="https://​doi.org/​10.1007/978-3-319-28475-0\_9">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 292: Line 482:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/fuin/AlhazovF014">7</a>]+[<a name="​DBLP:​conf/uc/Freund0S15">10</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Artiom Alhazov, ​Rudolf Freund, ​and Sergiu Ivanov. +Rudolf Freund, Sergiu Ivanov, and Ludwig Staiger
- Length ​systems. + Going beyond turing with automata: Partial adult halting and 
- <em>FundamInform.</​em>, ​134(1-2):17--372014+  ​regular observer ​<I>&​omega;</​I>​-languages. 
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.3233/FI-2014-1088">​DOI</​a>&​nbsp;​|  + In Cristian&​nbsp;​SCalude and Michael&​nbsp;​J. Dinneen, editors, <​em>​ 
-<a href="http://dx.doi.org/10.3233/FI-2014-1088">​http</​a>&​nbsp;​]+  Unconventional Computation and Natural Computation - 14th International 
 +  Conference, UCNC 2015, Auckland, New Zealand, August 30 - September 3, 
 +  2015, Proceedings</​em>, ​volume 9252 of <​em>​Lecture Notes in Computer Science</​em>,​ 
 +  pages 169--180. Springer2015
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/978-3-319-21819-9\_12">​DOI</​a>&​nbsp;​|  
 +<a href="https://​doi.org/​10.1007/978-3-319-21819-9\_12">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 307: Line 502:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/jalc/0001RV14">8</a>]+[<a name="​DBLP:​conf/dcfs/0001PV14">11</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Sergiu Ivanov, ​Yurii Rogozhin, and Sergey Verlan. +Sergiu Ivanov, ​Elisabeth Pelz, and Sergey Verlan. 
- Small universal ​networks of evolutionary processors+ Small universal ​non-deterministic petri nets with inhibitor arcs
- <​em>​Journal ​of AutomataLanguages and Combinatorics</​em>,​ + In Helmut J&​uuml;​rgensen,​ Juhani Karhum&​auml;​ki,​ and Alexander 
-  ​19(1-4):133--144, 2014.+  Okhotin, editors, ​<em>Descriptional Complexity ​of Formal Systems - 16th 
 +  International WorkshopDCFS 2014, Turku, Finland, August 5-8, 2014. 
 +  Proceedings</​em>, ​volume 8614 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 
 +  ​186--197. Springer, 2014. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-319-09704-6\_17">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-319-09704-6\_17">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 321: Line 521:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/ijcm/Ivanov13">9</a>]+[<a name="​DBLP:​conf/membrane/Ivanov14">12</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Sergiu Ivanov. Sergiu Ivanov.
- A formal framework for clock-free networks of cells+ Polymorphic P systems with non-cooperative rules and no 
- <​em>​Int. J. Comput. Math.</​em>, ​90(4):776--7882013+  ingredients
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.1080/00207160.2012.743652">​DOI</​a>&​nbsp;​|  + In Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, Petr 
-<a href="http://dx.doi.org/10.1080/00207160.2012.743652">​http</​a>&​nbsp;​]+  Sos&​iacute;​k,​ and Claudio Zandron, editors, ​<em>Membrane Computing - 15th 
 +  International Conference, CMC 2014, Prague, Czech Republic, August 20-22, 
 +  2014, Revised Selected Papers</​em>, ​volume 8961 of <​em>​Lecture Notes in Computer 
 +  Science</​em>,​ pages 258--273. Springer2014
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/978-3-319-14370-5\_16">​DOI</​a>&​nbsp;​|  
 +<a href="https://​doi.org/​10.1007/978-3-319-14370-5\_16">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 336: Line 541:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/csjm/Ivanov12">10</a>]+[<a name="​DBLP:​conf/membrane/IvanovV13">13</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Sergiu Ivanov. +Sergiu Ivanov ​and Sergey Verlan
- Static and dynamic membrane structures+ About one-sided one-symbol insertion-deletion P systems
- <​em>​The Computer Science Journal ​of Moldova</​em>, ​20(3):374--4022012+ In Artiom Alhazov, Svetlana Cojocaru, Marian Gheorghe, Yurii 
-[&​nbsp;<​a href="​http://​www.math.md/publications/csjm/issues/v20-n3/11125/">​http</​a>&​nbsp;​]+  Rogozhin, Grzegorz Rozenberg, and Arto Salomaa, editors, ​<em>Membrane 
 +  Computing - 14th International Conference, CMC 2013, Chisin&#​x103;​u,​ 
 +  Republic ​of Moldova, August 20-23, 2013, Revised Selected Papers</​em>, ​volume 
 +  8340 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 225--237. Springer, 
 +  2013
 +[&​nbsp;<​a href="​http://​dx.doi.org/10.1007/978-3-642-54239-8\_16">​DOI<​/a>&​nbsp;​|  
 +<a href="​https:​//doi.org/10.1007/​978-3-642-54239-8\_16">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 350: Line 561:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/ijncr/IvanovARG11">11</a>]+[<a name="​DBLP:​conf/uc/FernauFISS13">14</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Sergiu Ivanov, ​Artiom Alhazov, Vladimir Rogojin, and Miguel&nbsp;A+Henning Fernau, Rudolf Freund, ​Sergiu Ivanov, ​Markus&​nbsp;​L. Schmid, and K.&nbsp;G
-  ​Guti&​eacute;​rrez-Naranjo+  ​Subramanian
- Forward ​and backward chaining with P systems. + Array insertion ​and deletion ​P systems. 
- <​em>​IJNCR</​em>, ​2(2):56--662011+ In Giancarlo Mauri, Alberto Dennunzio, Luca Manzoni, and Antonio&​nbsp;​E. 
-[&​nbsp;<​a href="​http://​dx.doi.org/​10.4018/jncr.2011040105">​DOI</​a>&​nbsp;​|  +  Porreca, editors, ​<em>Unconventional Computation and Natural Computation - 
-<a href="http://dx.doi.org/10.4018/jncr.2011040105">​http</​a>&​nbsp;​]+  12th International Conference, UCNC 2013, Milan, Italy, July 1-5, 2013. 
 +  Proceedings</​em>, ​volume 7956 of <​em>​Lecture Notes in Computer Science</​em>,​ pages 
 +  67--78. Springer2013
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/978-3-642-39074-6\_8">​DOI</​a>&​nbsp;​|  
 +<a href="https://​doi.org/​10.1007/978-3-642-39074-6\_8">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 366: Line 581:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/​csjm/AlhazovBBCCCDIMMMRRTVV10">12</a>]+[<a name="​DBLP:​journals/​corr/FreundIOS13">15</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
-Artiom AlhazovElena BoianLiudmila BurtsevaConstantin Ciubotaru, Svetlana +Rudolf FreundSergiu IvanovMarion Oswaldand K.&​nbsp;​G. Subramanian. 
-  ​CojocaruAlexandru ColesnicovValentina Demidova, Sergiu Ivanov, Veaceslav + ​One-dimensional array grammars and P systems with array insertion 
-  ​MacariGalina MagariuLudmila MalahovaVladimir Rogojin, Yurii Rogozhin+  ​and deletion rules. 
-  ​Tatiana TofanSergey Verlanand Tatiana Verlan. + In Turlough Neary and Matthew Cookeditors<​em>​Proceedings 
- ​Investigations on natural computing in the institute of mathematics +  ​MachinesComputations and Universality 2013MCU 2013Z&​uuml;​rich
-  and computer science. +  ​SwitzerlandSeptember 9-112013.</em>, volume 128 of <​em>​EPTCS</​em>, ​pages 
- <em>The Computer Science Journal ​of Moldova</​em>, ​18(2):101--1382010+  62--752013
-[&​nbsp;<​a href="​http://​www.math.md/publications/csjm/issues/v18-n2/10280/">​http</​a>&​nbsp;​]+[&​nbsp;<​a href="​http://​dx.doi.org/10.4204/EPTCS.128.14">​DOI<​/a>&​nbsp;​|  
 +<a href="​https:​//doi.org/10.4204/​EPTCS.128.14">​http</​a>&​nbsp;​]
  
 </td> </td>
Line 384: Line 600:
 <tr valign="​top">​ <tr valign="​top">​
 <td align="​right"​ class="​bibtexnumber">​ <td align="​right"​ class="​bibtexnumber">​
-[<a name="​DBLP:​journals/csjm/​AlhazovCIR10">​13</a>]+[<a name="​DBLP:​conf/membrane/​Ivanov11">​16</​a>​] 
 +</​td>​ 
 +<td class="​bibtexitem">​ 
 +Sergiu Ivanov. 
 + Basic concurrency resolution in clock-free P systems. 
 + In Marian Gheorghe, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, 
 +  and Sergey Verlan, editors, <​em>​Membrane Computing - 12th International 
 +  Conference, CMC 2011, Fontainebleau,​ France, August 23-26, 2011, Revised 
 +  Selected Papers</​em>,​ volume 7184 of <​em>​Lecture Notes in Computer Science</​em>,​ 
 +  pages 226--242. Springer, 2011. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-28024-5\_16">​DOI</​a>&​nbsp;​|  
 +<a href="​https://​doi.org/​10.1007/​978-3-642-28024-5\_16">​http</​a>&​nbsp;​] 
 + 
 +</​td>​ 
 +</​tr>​ 
 + 
 + 
 +<tr valign="​top">​ 
 +<td align="​right"​ class="​bibtexnumber">​ 
 +[<a name="​DBLP:​conf/​membrane/​AlhazovCIR10">​17</a>]
 </td> </td>
 <td class="​bibtexitem">​ <td class="​bibtexitem">​
 Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, and Yurii Rogozhin. Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, and Yurii Rogozhin.
- Membrane systems ​languages ​are polynomial-time parsable+ The family of languages ​generated by non-cooperative membrane 
- <​em>​The Computer Science ​Journal of Moldova</​em>, ​18(2):139--148, 2010. +  systems
-[&​nbsp;<​a href="​http://​www.math.md/publications/csjm/issues/v18-n2/10282/">​http</​a>&​nbsp;​]+ In Marian Gheorghe, Thomas Hinze, Gheorghe Paun, Grzegorz Rozenberg,​ 
 +  and Arto Salomaa, editors, ​<em>Membrane Computing - 11th International 
 +  Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected 
 +  Papers</​em>,​ volume 6501 of <​em>​Lecture Notes in Computer Science</​em>, ​pages 
 +  65--80. Springer, 2010. 
 +[&​nbsp;<​a href="​http://​dx.doi.org/10.1007/978-3-642-18123-8\_8">​DOI<​/a>&​nbsp;​|  
 +<a href="​https:​//doi.org/10.1007/​978-3-642-18123-8\_8">​http</​a>&​nbsp;​]
  
 </td> </td>
 </tr> </tr>
-</​table>​ 
  
 +
 +<tr valign="​top">​
 +<td align="​right"​ class="​bibtexnumber">​
 +[<a name="​DBLP:​conf/​membrane/​AlhazovIR10">​18</​a>​]
 +</td>
 +<td class="​bibtexitem">​
 +Artiom Alhazov, Sergiu Ivanov, and Yurii Rogozhin.
 + ​Polymorphic P systems.
 + In Marian Gheorghe, Thomas Hinze, Gheorghe Paun, Grzegorz Rozenberg,
 +  and Arto Salomaa, editors, <​em>​Membrane Computing - 11th International
 +  Conference, CMC 2010, Jena, Germany, August 24-27, 2010. Revised Selected
 +  Papers</​em>,​ volume 6501 of <​em>​Lecture Notes in Computer Science</​em>,​ pages
 +  81--94. Springer, 2010.
 +[&​nbsp;<​a href="​http://​dx.doi.org/​10.1007/​978-3-642-18123-8\_9">​DOI</​a>&​nbsp;​| ​
 +<a href="​https://​doi.org/​10.1007/​978-3-642-18123-8\_9">​http</​a>&​nbsp;​]
 +
 +</td>
 +</tr>
 +
 +
 +</​table>​
 </​html>​ </​html>​
  
Line 432: Line 693:
  
 ---- ----
 +
 +==== Conference and Journal Rankings ====
 +
 +This section gives approximate values for ranks and impact factors for the journals I have published in and conferences I have participated to.  These values should be taken with a [[https://​en.wikipedia.org/​wiki/​Impact_factor#​Criticisms|grain of salt]], especially in the case of theoretical computer science.
 +
 +**Journals:​** Theoretical Computer Science (TCS) ''​rank A''​\ \ \ Fundamenta Informaticae (FI) ''​rank B''​\ \ \ Journal of Automata, Languages and Combinatorics (JALC) ''​rank C''​\ \ \ International Journal of Computer Mathematics (IJCM) ''​rank C''​\ \ \ International Journal of Unconventional Computing (IJUC) ''​h-index 12''​\ \ \ PeerJ ''​impact factor 2.183''​\ \ \ Computer Science Journal of Moldova (CSJM) ''​impact factor\ (2014)\ 0.1227''​
 +
 +**Conferences:​** Machines, Computations,​ and Universality (MCU) ''​rank B''​\ \ \ Unconventional Computation and Natural Computation (UCNC) ''​rank\ C''​
 +
 +----
 +
 ==== Technical Note ==== ==== Technical Note ====
 These lists were generated by [[http://​www.lri.fr/​~filliatr/​bibtex2html/​|bibtex2html]] using the following script: These lists were generated by [[http://​www.lri.fr/​~filliatr/​bibtex2html/​|bibtex2html]] using the following script:
en/publications.1485470174.txt.gz · Last modified: 2017/01/26 23:36 by sivanov