toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Goles, E., & Montealegre, P. (2020). The complexity of the asynchronous prediction of the majority automata. Inform. Comput., to appear.
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., & Montealegre, P. (2015). The complexity of the majority rule on planar graphs. Adv. Appl. Math., 64, 111–123.
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
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
Select All    Deselect All
 | 
Citations
 | 
   print