Sergiu Ivanov

Orcid: 0000-0002-1537-6508

Affiliations:
  • Université Évry Paris-Saclay, France
  • Université Paris Est, France (former)


According to our database1, Sergiu Ivanov authored at least 64 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A P systems variant for reasoning about sequential controllability of Boolean networks.
Theor. Comput. Sci., August, 2023

Numerical networks of cells.
Theor. Comput. Sci., May, 2023

2022
Variants of derivation modes for which purely catalytic P systems are computationally complete.
Theor. Comput. Sci., 2022

Regulated Insertion-Deletion Systems.
J. Autom. Lang. Comb., 2022

P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks.
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

Prescribed Teams of Rules Working on Several Objects.
Proceedings of the Machines, Computations, and Universality - 9th International Conference, 2022

2021
Sequential reprogramming of biological network fate.
Theor. Comput. Sci., 2021

Single semi-contextual insertion-deletion systems.
Nat. Comput., 2021

Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete.
J. Membr. Comput., 2021

When catalytic P systems with one catalyst can be computationally complete.
J. Membr. Comput., 2021

P systems with limited number of objects.
J. Membr. Comput., 2021

Relations between Control Mechanisms for Sequential Grammars.
Fundam. Informaticae, 2021

Network modeling methods for precision medicine.
CoRR, 2021

Who Plays Complex Music? On the Correlations Between Structural and Behavioral Complexity Measures in Sign Boolean Networks.
Proceedings of the 21st IEEE International Conference on Bioinformatics and Bioengineering, 2021

2020
Time-freeness and clock-freeness and related concepts in P systems.
Theor. Comput. Sci., 2020

P systems with randomized right-hand sides of rules.
Theor. Comput. Sci., 2020

A formal framework for spiking neural P systems.
J. Membr. Comput., 2020

Controllability of reaction systems.
J. Membr. Comput., 2020

Bisimilar Conversion of Multi-valued Networks to Boolean Networks.
CoRR, 2020

Bisimilar Booleanization of multivalued networks.
Biosyst., 2020

A Methodology for Evaluating the Extensibility of Boolean Networks' Structure and Function.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Variants of P systems with activation and blocking of rules.
Nat. Comput., 2019

Register machines over groups.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

2018
Extended spiking neural P systems with white hole rules and their red-green variants.
Nat. Comput., 2018

P Systems with Activation and Blocking of Rules.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Tissue P Systems with Point Mutation Rules.
Proceedings of the Membrane Computing, 2018

Sequential Grammars with Activation and Blocking of Rules.
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

Chocolate P Automata.
Proceedings of the Enjoying Natural Computing, 2018

WEBRSIM: A Web-Based Reaction Systems Simulator.
Proceedings of the Enjoying Natural Computing, 2018

2017
Contextual array grammars with matrix control, regular control languages, and tissue P systems control.
Theor. Comput. Sci., 2017

SymPy: symbolic computing in Python.
PeerJ Comput. Sci., 2017

Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems.
Fundam. Informaticae, 2017

(Tissue) P Systems with Vesicles of Multisets.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Hierarchical P Systems with Randomized Right-Hand Sides of Rules.
Proceedings of the Membrane Computing, 2017

A Logical Constraint-based Approach to Infer and Explore Diversity and Composition in Thresholded Boolean Automaton Networks.
Proceedings of the Complex Networks & Their Applications VI, 2017

2016
Complexity of model checking for reaction systems.
Theor. Comput. Sci., 2016

SymPy: Symbolic computing in Python.
PeerJ Prepr., 2016

Small Universal Deterministic Petri Nets with Inhibitor Arcs.
J. Autom. Lang. Comb., 2016

Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.
Int. J. Unconv. Comput., 2016

Purely Catalytic P Systems over Integers and Their Generative Power.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

Simulating R Systems by P Systems.
Proceedings of the Membrane Computing - 17th International Conference, CMC 2016, Milan, 2016

2015
On the Power and Universality of Biologically-inspired Models of Computation. (Étude de la puissance d'expression et de l'universalité des modèles de calcul inspirés par la biologie).
PhD thesis, 2015

Dependency graphs and mass conservation in reaction systems.
Theor. Comput. Sci., 2015

Random Context and Semi-conditional Insertion-deletion Systems.
Fundam. Informaticae, 2015

Annotation on PhD Thesis.
Comput. Sci. J. Moldova, 2015

Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer ω-Languages.
Proceedings of the Unconventional Computation and Natural Computation, 2015

P Systems with Generalized Multisets Over Totally Ordered Abelian Groups.
Proceedings of the Membrane Computing, 2015

Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

2014
Small Universal Networks of Evolutionary Processors.
J. Autom. Lang. Comb., 2014

Length P Systems.
Fundam. Informaticae, 2014

Polymorphic P Systems with Non-cooperative Rules and No Ingredients.
Proceedings of the Membrane Computing, 2014

Small Universal Non-deterministic Petri Nets with Inhibitor Arcs.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
A formal framework for clock-free networks of cells.
Int. J. Comput. Math., 2013

Small Universal Petri Nets with Inhibitor Arcs.
CoRR, 2013

One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Array Insertion and Deletion P Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2013

About One-Sided One-Symbol Insertion-Deletion P Systems.
Proceedings of the Membrane Computing, 2013

2012
Static and Dynamic Membrane Structures.
Comput. Sci. J. Moldova, 2012

2011
Forward and Backward Chaining with P Systems.
Int. J. Nat. Comput. Res., 2011

Basic Concurrency Resolution in Clock-Free P Systems.
Proceedings of the Membrane Computing, 2011

2010
Membrane Systems Languages Are Polynomial-Time Parsable.
Comput. Sci. J. Moldova, 2010

Investigations on Natural Computing in the Institute of Mathematics and Computer Science.
Comput. Sci. J. Moldova, 2010

Polymorphic P Systems.
Proceedings of the Membrane Computing, 2010

The Family of Languages Generated by Non-cooperative Membrane Systems.
Proceedings of the Membrane Computing, 2010


  Loading...