Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up Algorithms. - María-Inés Fernández-Camacho; Jean-Marc Steyaert (Theor. Comput. Sci., 1990)

On Narrowing Strategies for Partial Non-Strict Functions. - David de Frutos-Escrig; María-Inés Fernández-Camacho (TAPSOFT, Vol.2, 1991)

Average-Case Analysis of Pattern-Matching in Trees under the BST Probability Model. - José-Ramón Sánchez-Couso; María-Inés Fernández-Camacho (ICALP, 1994)

Reductions in binary search trees. - José-Ramón Sánchez-Couso; María-Inés Fernández-Camacho (Theor. Comput. Sci., 2006)

Binary Search Trees, Recurrent Properties andWave Equations. - María-Inés Fernández-Camacho; José-Ramón Sánchez-Couso (Fundam. Informaticae, 2007)

Formal Specification of the Kademlia and the Kad Routing Tables in Maude. - Isabel Pita; María-Inés Fernández-Camacho (WADT, 2012)

Psi-series method for equality of random trees and quadratic convolution recurrences. - Hua-Huai Chern; María-Inés Fernández-Camacho; Hsien-Kuei Hwang; Conrado Martínez (Random Struct. Algorithms, 2014)