Martín Ríos Wilson

Orcid: 0000-0003-0339-0182

According to our database1, Martín Ríos Wilson authored at least 19 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Local Certification of Majority Dynamics.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

The Hardness of Local Certification of Finite-State Dynamics.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Asymptotic (a)Synchronism Sensitivity and Complexity of Elementary Cellular Automata.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Distributed maximal independent set computation driven by finite-state dynamics.
Int. J. Parallel Emergent Distributed Syst., 2023

On elementary cellular automata asymptotic (a)synchronism sensitivity and complexity.
CoRR, 2023

Dynamical Stability of Threshold Networks over Undirected Signed Graphs.
CoRR, 2023

Exploring Dynamics of Fungal Cellular Automata.
Proceedings of the Fungal Machines - Sensing and Computing with Fungi, 2023

2022
Exploring the Dynamics of Fungal Cellular Automata.
CoRR, 2022

Intrinsic Simulations and Universality in Automata Networks.
CoRR, 2022

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

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Computing Power of Hybrid Models in Synchronous Networks.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Computing the Probability of Getting Infected: On the Counting Complexity of Bootstrap Percolation.
Proceedings of the Automata and Complexity, 2022

2021
On automata networks dynamics : an approach based on computational complexity theory. (Sur la dynamique des réseaux d'automates: une approche basée sur la théorie de la complexité informatique).
PhD thesis, 2021

Generating Boolean Functions on Totalistic Automata Networks.
Int. J. Unconv. Comput., 2021

On the complexity of asynchronous freezing cellular automata.
Inf. Comput., 2021

On Symmetry versus Asynchronism: at the Edge of Universality in Automata Networks.
CoRR, 2021

On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics.
Proceedings of the Connecting with Computability, 2021

2019
On the Effects of Firing Memory in the Dynamics of Conjunctive Networks.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2019


  Loading...