Marco Montalva-Medel

Orcid: 0000-0002-7264-9840

According to our database1, Marco Montalva-Medel authored at least 15 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Symmetrizable Boolean networks.
Inf. Sci., May, 2023

2022
On the complexity of generalized Q2R automaton.
Adv. Appl. Math., 2022

Thermodynamics of Small Systems Through a Reversible and Conservative Discrete Automaton.
Proceedings of the Automata and Complexity, 2022

2020
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations.
Nat. Comput., 2020

Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations.
Inf. Comput., 2020

2019
Block invariance and reversibility of one dimensional linear cellular automata.
Adv. Appl. Math., 2019

2018
A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update.
Nat. Comput., 2018

Block Invariance in a Family of Elementary Cellular Automata.
J. Cell. Autom., 2018

2015
Block Invariance in Elementary Cellular Automata.
J. Cell. Autom., 2015

2014
Dynamical and topological robustness of the mammalian cell cycle network: A reverse engineering approach.
Biosyst., 2014

Attraction Basins in a Lac Operon Model Under Different Update Schedules.
Proceedings of the Fourteenth International Conference on the Simulation and Synthesis of Living Systems, 2014

2013
On the number of update digraphs and its relation with the feedback arc sets and tournaments.
Discret. Appl. Math., 2013

On the preservation of limit cycles in Boolean networks under different updating schemes.
Proceedings of the Twelfth European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, 2013

2011
Combinatorics on update digraphs in Boolean networks.
Discret. Appl. Math., 2011

2008
On the complexity of feedback set problems in signed digraphs.
Electron. Notes Discret. Math., 2008


  Loading...