( en | de | ru )

 

Disambiguation of "Sené, Sylvain"

Author of the publication

copydeleteadd this publication to your clipboard
Non-Deterministic Updates of Boolean Networks.

, and . AUTOMATA, volume 90 of OASIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anuradha Seneviratne

Stephanie Seneff

Jörg Senekowitsch

Clara Seneca

Miriam Sénécheau

 

Other publications of authors with the same name

Reconstruction of Boolean Regulatory Models of Flower Development Exploiting an Evolution Strategy., , and . CEC, page 1-8. IEEE, (2018)Influence des conditions de bord dans les réseaux d'automates booléens à seuil et application à la biologie. (Influence of Boundary Conditions in Threshold Boolean Automata Networks and Application to Biology).. Joseph Fourier University, Grenoble, France, (2008)On Boolean Automata Isolated Cycles and Tangential Double-Cycles Dynamics., , , , and . Automata and Complexity, 42, page 145-178. Springer, (2022)Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks., , , and . Nat. Comput., 19 (2): 295-319 (2020)Preface., and . Nat. Comput., 19 (1): 1-2 (2020)Phase transitions in stochastic non-linear threshold Boolean automata networks on Z2: The boundary impact., and . Adv. Appl. Math., (2018)#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method., , , and . CoRR, (2020)Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics., and . CiE, volume 13967 of Lecture Notes in Computer Science, page 214-228. Springer, (2023)#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method., , and . CiE, volume 12098 of Lecture Notes in Computer Science, page 326-338. Springer, (2020)On the Complexity of Acyclic Modules in Automata Networks., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 168-180. Springer, (2020)