toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Alvarez-Miranda, E., & Pereira, J. (2019). On the complexity of assembly line balancing problems. Comput. Oper. Res., 108, 182–186.
toggle visibility
Araujo, J., Ducoffe, G., Nisse, N., & Suchan, K. (2018). On interval number in cycle convexity. Discret. Math. Theor. Comput. Sci., 20(1), 35 pp.
toggle visibility
Fomin, F. V., Golovach, P. A., Kratochvil, J., Nisse, N., & Suchan, K. (2010). Pursuing a fast robber on a graph. Theor. Comput. Sci., 411(7-9), 1167–1181.
toggle visibility
Formenti, E., Goles, E., & Martin, B. (2012). Computational Complexity of Avalanches in the Kadanoff Sandpile Model. Fundam. Inform., 115(1), 107–124.
toggle visibility
Gajardo, A., & Goles, E. (2006). Crossing information in two-dimensional Sandpiles. Theor. Comput. Sci., 369(1-3), 463–469.
toggle visibility
Gaspers, S., Liedloff, M., Stein, M., & Suchan, K. (2015). Complexity of splits reconstruction for low-degree trees. Discret Appl. Math., 180, 89–100.
toggle visibility
Goles, E., & Montealegre, P. (2014). Computational complexity of threshold automata networks under different updating schemes. Theor. Comput. Sci., 559, 3–19.
toggle visibility
Goles, E., & Montealegre, P. (2015). The complexity of the majority rule on planar graphs. Adv. Appl. Math., 64, 111–123.
toggle visibility
Goles, E., & Montealegre, P. (2020). The complexity of the asynchronous prediction of the majority automata. Inf. Comput., 274(SI).
toggle visibility
Goles, E., & Moreira, A. (2012). Number-Conserving Cellular Automata and Communication Complexity: A Numerical Exploration Beyond Elementary CAs. J. Cell. Autom., 7(2), 151–165.
toggle visibility
Goles, E., & Palacios, A. G. (2007). Dynamical complexity in cognitive neural networks. Biol. Res., 40(4), 479–485.
toggle visibility
Goles, E., Adamatzky, A., Montealegre, P., & Rios-Wilson, M. (2021). Generating Boolean Functions on Totalistic Automata Networks. Int. J. Unconv. Comput., 16(4), 343–391.
toggle visibility
Goles, E., Guillon, P., & Rapaport, I. (2011). Traced communication complexity of cellular automata. Theor. Comput. Sci., 412(30), 3906–3916.
toggle visibility
Goles, E., Lobos, F., Montealegre, P., Ruivo, E. L. P., & de Oliveira, P. P. B. (2020). Computational Complexity of the Stability Problem for Elementary Cellular Automata. J. Cell. Autom., 15(4), 261–304.
toggle visibility
Goles, E., Maldonado, D., Montealegre, P., & Ollinger, N. (2020). On the complexity of the stability problem of binary freezing totalistic cellular automata. Inf. Comput., 274, 21 pp.
toggle visibility
Goles, E., Meunier, P. E., Rapaport, I., & Theyssier, G. (2011). Communication complexity and intrinsic universality in cellular automata. Theor. Comput. Sci., 412(1-2), 2–21.
toggle visibility
Goles, E., Montealegre, P., Perrot, K., & Theyssier, G. (2018). On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci., 91, 1–32.
toggle visibility
Goles, E., Moreira, A., & Rapaport, I. (2011). Communication complexity in number-conserving and monotone cellular automata. Theor. Comput. Sci., 412(29), 3616–3628.
toggle visibility
Golovach, P. A., Heggernes, P., Lima, P. T., & Montealegre, P. (2020). Finding connected secluded subgraphs. J. Comput. Syst. Sci., 113, 101–124.
toggle visibility
Mascareno, A., Goles, E., & Ruz, G. A. (2016). Crisis in complex social systems: A social theory view illustrated with the chilean case. Complexity, 21(S2), 13–23.
toggle visibility
Select All    Deselect All
 | 
Citations
 | 
   print