| 
Citations
 | 
   web
Allende, H., Salas, R., & Moraga, C. (2003). A robust and effective learning algorithm for feedforward neural networks based on the influence function. Lect. Notes Comput. Sc., 2652, 28–36.
toggle visibility
Alvarez-Miranda, E., & Pereira, J. (2017). Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. Comput. Oper. Res., 81, 178–191.
toggle visibility
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
Atkinson, J., & Maurelia, A. (2017). Redundancy-Based Trust in Question-Answering Systems. Computer, 50(1), 58–65.
toggle visibility
Averbakh, I., & Pereira, J. (2021). Tree optimization based heuristics and metaheuristics in network construction problems. Comput. Oper. Res., 128, 105190.
toggle visibility
Carrasco, R. A., Pruhs, K., Stein, C., & Verschae, J. (2018). The Online Set Aggregation Problem. In Lecture Notes in Computer Sciences (Vol. 10807, pp. 245–259).
toggle visibility
de Figueiredo, C. M. H., de Mello, C. P., & Ortiz, C. (2000). Edge colouring reduced indifference graphs. Lect. Notes Comput. Sc., 1776, 145–153.
toggle visibility
de Figueiredo, C. M. H., Meldanis, J., de Mello, C. P., & Ortiz, C. (2003). Decompositions for the edge colouring of reduced indifference graphs. Theor. Comput. Sci., 297(1-3), 145–155.
toggle visibility
Ferran, S., Beghelli, A., Huerta-Canepa, G., & Jensen, F. (2018). Correctness assessment of a crowdcoding project in a computer programming introductory course. Comput. Appl. Eng. Educ., 26(1), 162–170.
toggle visibility
Figueroa, A., & Atkinson, J. (2019). Dual-View Learning for Detecting Web Query Intents. Computer, 52(8), 34–42.
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
Fraigniaud, P., Montealegre-Barba, P., Oshman, R., Rapaport, I., & Todinca, I. (2019). On Distributed Merlin-Arthur Decision Protocols. In Lecture Notes in Computer Sciences (Vol. 11639).
toggle visibility
Gajardo, A., & Goles, E. (2006). Crossing information in two-dimensional Sandpiles. Theor. Comput. Sci., 369(1-3), 463–469.
toggle visibility
Garreton, M., & Sanchez, R. (2016). Identifying an optimal analysis level in multiscalar regionalization: A study case of social distress in Greater Santiago. Comput. Environ. Urban Syst., 56, 14–24.
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., & Salinas, L. (2008). Comparison between parallel and serial dynamics of Boolean networks. Theor. Comput. Sci., 396(1-3), 247–253.
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., Maldonado, D., Montealegre-Barba, P., & Ollinger, N. (2018). Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. In Lecture Notes in Computer Sciences (Vol. 11115, pp. 406–415).
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