toggle visibility Search & Display Options

Select All    Deselect All
List View
 |   | 
   print
  Author (up) Title Year Publication Volume Pages Links
Allende, H.; Salas, R.; Moraga, C. A robust and effective learning algorithm for feedforward neural networks based on the influence function 2003 Lecture Notes in Computer Sciences 2652 28-36 details   pdf doi
Alvarez-Miranda, E.; Pereira, J. On the complexity of assembly line balancing problems 2019 Computers & Operations Research 108 182-186 details   doi
Alvarez-Miranda, E.; Pereira, J. Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach 2017 Computers & Operations Research 81 178-191 details   pdf doi
Araujo, J.; Ducoffe, G.; Nisse, N.; Suchan, K. On interval number in cycle convexity 2018 Discrete Mathematics And Theoretical Computer Science 20 35 pp details   pdf doi
Atkinson, J.; Maurelia, A. Redundancy-Based Trust in Question-Answering Systems 2017 Computer 50 58-65 details   pdf doi
de Figueiredo, C.M.H.; de Mello, C.P.; Ortiz, C. Edge colouring reduced indifference graphs 2000 Lecture Notes in Computer Sciences 1776 145-153 details   pdf doi
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 details   pdf doi
Ferran, S.; Beghelli, A.; Huerta-Canepa, G.; Jensen, F. Correctness assessment of a crowdcoding project in a computer programming introductory course 2018 Computer Applications In Engineering Education 26 162-170 details   pdf doi
Figueroa, A.; Atkinson, J. Dual-View Learning for Detecting Web Query Intents 2019 Computer 52 34-42 details   doi
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 details   pdf doi
Gajardo, A.; Goles, E. Crossing information in two-dimensional Sandpiles 2006 Theoretical Computer Science 369 463-469 details   pdf doi
Garreton, M.; Sanchez, R. Identifying an optimal analysis level in multiscalar regionalization: A study case of social distress in Greater Santiago 2016 Computers Environment And Urban Systems 56 14-24 details   pdf doi
Goles, E.; Guillon, P.; Rapaport, I. Traced communication complexity of cellular automata 2011 Theoretical Computer Science 412 3906-3916 details   pdf doi
Goles, E.; Meunier, P.E.; Rapaport, I.; Theyssier, G. Communication complexity and intrinsic universality in cellular automata 2011 Theoretical Computer Science 412 2-21 details   pdf doi
Goles, E.; Montealegre, P. Computational complexity of threshold automata networks under different updating schemes 2014 Theoretical Computer Science 559 3-19 details   pdf doi
Goles, E.; Montealegre, P.; Perrot, K.; Theyssier, G. On the complexity of two-dimensional signed majority cellular automata 2018 Journal Of Computer And System Sciences 91 1-32 details   pdf doi
Goles, E.; Montealegre, P.; Salo, V.; Torma, I. PSPACE-completeness of majority automata networks 2016 Theoretical Computer Science 609 118-128 details   pdf doi
Goles, E.; Montealegre-Barba, P.; Todinca, I. The complexity of the bootstraping percolation and other problems 2013 Theoretical Computer Science 504 73-82 details   pdf doi
Goles, E.; Moreira, A.; Rapaport, I. Communication complexity in number-conserving and monotone cellular automata 2011 Theoretical Computer Science 412 3616-3628 details   pdf doi
Goles, E.; Salinas, L. Comparison between parallel and serial dynamics of Boolean networks 2008 Theoretical Computer Science 396 247-253 details   pdf doi
Select All    Deselect All
List View
 |   | 
   print

Save Citations:
Export Records: