toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Goles, C., Dumais, J., & Douady, S. (2016). Fibonacci or quasi-symmetric phyllotaxis. Part I: why? Acta Soc. Bot. Pol., 85(4), 34 pp.
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., & 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., & Noual, M. (2012). Disjunctive networks and update schedules. Adv. Appl. Math., 48(5), 646–662.
toggle visibility
Goles, E., & Palacios, A. G. (2007). Dynamical complexity in cognitive neural networks. Biol. Res., 40(4), 479–485.
toggle visibility
Goles, E., & Rica, S. (2011). Irreversibility and spontaneous appearance of coherent behavior in reversible systems. Eur. Phys. J. D, 62(1), 127–137.
toggle visibility
Goles, E., & Ruz, G. A. (2015). Dynamics of neural networks over undirected graphs. Neural Netw., 63, 156–169.
toggle visibility
Goles, E., & Salinas, L. (2008). Comparison between parallel and serial dynamics of Boolean networks. Theor. Comput. Sci., 396(1-3), 247–253.
toggle visibility
Goles, E., & Salinas, L. (2010). Sequential operator for filtering cycles in Boolean networks. Adv. Appl. Math., 45(3), 346–358.
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., 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., Montalva, M., & Ruz, G. A. (2013). Deconstruction and Dynamical Robustness of Regulatory Networks: Application to the Yeast Cell Cycle Networks. Bull. Math. Biol., 75(6), 939–966.
toggle visibility
Goles, E., Montalva-Medel, M., Mortveit, H., & Ramirez-Flandes, S. (2015). Block Invariance in Elementary Cellular Automata. J. Cell. Autom., 10(1-2), 119–135.
toggle visibility
Goles, E., Montealegre, P., Salo, V., & Torma, I. (2016). PSPACE-completeness of majority automata networks. Theor. Comput. Sci., 609, 118–128.
toggle visibility
Goles, E., Montealegre, P., & Vera, J. (2016). Naming Game Automata Networks. J. Cell. Autom., 11(5-6), 497–521.
toggle visibility
Goles, E., Montealegre-Barba, P., & Todinca, I. (2013). The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci., 504, 73–82.
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
Gomez, A. J., Gonzalez, S., & Sorella, S. P. (2016). Yang-Mills-Chern-Simons system in the presence of a Gribov horizon with fundamental Higgs matter. J. Phys. A-Math. Theor., 49(6), 10 pp.
toggle visibility
Gonzalez, E., & Villena, M. (2011). Spatial Lanchester models. Eur. J. Oper. Res., 210(3), 706–715.
toggle visibility
Select All    Deselect All
 | 
Citations
 | 
   print