| |
Author |
Title |
Year |
Publication |
Volume |
Pages |
Links |
|
|
Alvarez-Miranda, E.; Pereira, J. |
On the complexity of assembly line balancing problems |
2019 |
Computers & Operations Research |
108 |
182-186 |
|
|
|
Araujo, J.; Ducoffe, G.; Nisse, N.; Suchan, K. |
On interval number in cycle convexity |
2018 |
Discrete Mathematics And Theoretical Computer Science |
20 |
35 pp |
|
|
|
Becker, F.; Montealegre, P.; Rapaport, I.; Todinca, I. |
The role of randomness in the broadcast congested clique model |
2021 |
Information and Computation |
281 |
104669 |
|
|
|
Bitar, N.; Goles, E.; Montealegre, P. |
COMPUTATIONAL COMPLEXITY OF BIASED DIFFUSION-LIMITED AGGREGATION |
2022 |
Siam Journal On Discrete Mathematics |
36 |
823-866 |
|
|
|
Dewitte, B.; Concha, E.; Saavedra, D.; Pizarro, O.; Martinez-Villalobos, C.; Gushchina, D.; Ramos, M.; Montecinos, A. |
The ENSO-induced South Pacific Meridional Mode |
2023 |
Frontiers in Climate |
4 |
18 pp |
|
|
|
Fomin, F.V.; Golovach, P.A.; Kratochvil, J.; Nisse, N.; Suchan, K. |
Pursuing a fast robber on a graph |
2010 |
Theoretical Computer Science |
411 |
1167-1181 |
|
|
|
Formenti, E.; Goles, E.; Martin, B. |
Computational Complexity of Avalanches in the Kadanoff Sandpile Model |
2012 |
Fundamenta Informaticae |
115 |
107-124 |
|
|
|
Gajardo, A.; Goles, E. |
Crossing information in two-dimensional Sandpiles |
2006 |
Theoretical Computer Science |
369 |
463-469 |
|
|
|
Gaspers, S.; Liedloff, M.; Stein, M.; Suchan, K. |
Complexity of splits reconstruction for low-degree trees |
2015 |
Discrete Applied Mathematics |
180 |
89-100 |
|
|
|
Goles, E.; Montealegre, P. |
Computational complexity of threshold automata networks under different updating schemes |
2014 |
Theoretical Computer Science |
559 |
3-19 |
|
|
|
Goles, E.; Montealegre, P. |
The complexity of the majority rule on planar graphs |
2015 |
Advances In Applied Mathematics |
64 |
111-123 |
|
|
|
Goles, E.; Montealegre, P. |
The complexity of the asynchronous prediction of the majority automata |
2020 |
Information and Computation |
274 |
|
|
|
|
Goles, E.; Moreira, A. |
Number-Conserving Cellular Automata and Communication Complexity: A Numerical Exploration Beyond Elementary CAs |
2012 |
Journal Of Cellular Automata |
7 |
151-165 |
|
|
|
Goles, E.; Palacios, A.G. |
Dynamical complexity in cognitive neural networks |
2007 |
Biological Research |
40 |
479-485 |
|
|
|
Goles, E.; Adamatzky, A.; Montealegre, P.; Rios-Wilson, M. |
Generating Boolean Functions on Totalistic Automata Networks |
2021 |
International Journal of Unconventional Computing |
16 |
343-391 |
|
|
|
Goles, E.; Guillon, P.; Rapaport, I. |
Traced communication complexity of cellular automata |
2011 |
Theoretical Computer Science |
412 |
3906-3916 |
|
|
|
Goles, E.; Lobos, F.; Montealegre, P.; Ruivo, ELP.; de Oliveira, PPB. |
Computational Complexity of the Stability Problem for Elementary Cellular Automata |
2020 |
Journal of Cellular Automata |
15 |
261-304 |
|
|
|
Goles, E.; Maldonado, D.; Montealegre, P. |
On the complexity of asynchronous freezing cellular automata |
2021 |
Information and Computation |
281 |
104764 |
|
|
|
Goles, E.; Maldonado, D.; Montealegre, P.; Ollinger, N. |
On the complexity of the stability problem of binary freezing totalistic cellular automata |
2020 |
Information And Computation |
274 |
21 pp |
|
|
|
Goles, E.; Meunier, P.E.; Rapaport, I.; Theyssier, G. |
Communication complexity and intrinsic universality in cellular automata |
2011 |
Theoretical Computer Science |
412 |
2-21 |
|
