List View
 |   | 
   web
Author Title Year Publication Volume Pages
Araujo, J.; Ducoffe, G.; Nisse, N.; Suchan, K. On interval number in cycle convexity 2018 Discrete Mathematics And Theoretical Computer Science 20 35 pp
Goles, E.; Montealegre, P.; Salo, V.; Torma, I. PSPACE-completeness of majority automata networks 2016 Theoretical Computer Science 609 118-128
Goles, E.; Montealegre, P. Computational complexity of threshold automata networks under different updating schemes 2014 Theoretical Computer Science 559 3-19
Goles, E.; Montealegre-Barba, P.; Todinca, I. The complexity of the bootstraping percolation and other problems 2013 Theoretical Computer Science 504 73-82
Nisse, N.; Rapaport, I.; Suchan, K. Distributed computing of efficient routing schemes in generalized chordal graphs 2012 Theoretical Computer Science 444 17-27
Goles, E.; Moreira, A.; Rapaport, I. Communication complexity in number-conserving and monotone cellular automata 2011 Theoretical Computer Science 412 3616-3628
Goles, E.; Guillon, P.; Rapaport, I. Traced communication complexity of cellular automata 2011 Theoretical Computer Science 412 3906-3916
Goles, E.; Meunier, P.E.; Rapaport, I.; Theyssier, G. Communication complexity and intrinsic universality in cellular automata 2011 Theoretical Computer Science 412 2-21
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
Gajardo, A.; Goles, E. Crossing information in two-dimensional Sandpiles 2006 Theoretical Computer Science 369 463-469
Salinas, L.; Goles, E. Covering by squares 2008 Theoretical Computer Science 396 10-27
Goles, E.; Salinas, L. Comparison between parallel and serial dynamics of Boolean networks 2008 Theoretical Computer Science 396 247-253
de Figueiredo, C.M.H.; Meldanis, J.; de Mello, C.P.; Ortiz, C. Decompositions for the edge colouring of reduced indifference graphs 2003 Theoretical Computer Science 297 145-155