Departamento

Departamento de Ingeniería Informática

Cursos que dicta

Pregrado

• Lógica y Estructuras Discretas.
• Grafos y Algoritmos
• Algoritmos paralelos y grafos

Producción Científica

Publicaciones

E. Goles, D. Maldonado, P. Montealegre, and M. Rı́os-Wilson, “On the complexity of asynchronous freezing cellular automata,” Information and Computation, p. 104764, 2021. Conferencias con revisión por pares.

E. Goles, D. Maldonado, P. Montealegre, and N. Ollinger, “On the complexity of the stability problem of binary freezing totalistic cellular automata,” Information and Computation, p. 104535, 03 2020.

D. Maldonado, A. Gajardo, B. H. de Menibus, and A. Moreira, “Nontrivial turmites are turing-universal,” J. Cellular Automata, vol. 13, no. 5-6, pp. 373–392, 2018.

F. Becker, D. Maldonado, N. Ollinger, and G. Theyssier, “Universality in freezing cellular automata,” in Sailing Routes in the World of Computation – 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018, Proceedings, pp. 50–59, 2018. ·

E. Goles, D. Maldonado, P. Montealegre-Barba, and N. Ollinger, “Fast-parallel algorithms for freezing totalistic asynchronous cellular automata,” in Cellular Automata – 13th International Conference on Cellular Automata for Research and Industry, ACRI 2018, Como, Italy, September 17-21, 2018, Proceedings, pp. 406–415, 2018.

E. Goles, D. Maldonado, P. Montealegre, and N. Ollinger, “On the computational complexity of the freezing non-strict majority automata,” in Cellular Automata and Discrete Complex Systems – 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings, pp. 109–119, 2017.

Líneas de Investigación

• Autómatas celulares.
• Dinámicas discretas.
• Complejidad computacional.