1. José Luis Montaña, Cruz E. Borges. Lower Bounds for Approximation of some classes of Lebesgue Measurable functions by Sigmoidal Neural Networks . Proc. of 10th International Work-Conference on Artificial Neural Networks (IWANN2009).

  2. José Luis Montaña, Luis Miguel Pardo. On the Vapnik-Chervonenkis Dimension of Computer Programs which use Transcendental Elementary Operations. Annals of Mathematics and Artificial Intelligence. (2009). To appear.

  3. José Luis Montaña, César Luis Alonso, Cruz E. Borges. Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight-Line Programs. Proc. of 12th European Conference of Genetic Programming. EUROGP 2009. To appear.

  4. César Luis Alonso, José Luis Montaña, Jorge Puente, Cruz E, Borges. A new Linear Genetic Programming Approach based on Straight Line Programs: Theoretical and Experimental Aspects. International Journal of Artificial Intelligence Tools. (2009). To appear.

  5. César Luis Alonso, José Luis Montaña, Jorge Puente. Straight Line Programs: a new approach to Linear Genetic Programming. Proc.  20th IEEE Int'l Conference on Tools with Artificial Intelligence. (ICTAI 2008).

  6. José Luis Montaña. VCD Bounds for some GP Genotypes. Proc. 18th European Conference on Artificial Intelligence. ECAI 2008.

  7. José Luis Montaña, Luis M. Pardo, M. Callau: VC Dimension Bounds for Analytic Algebraic Computations. Proc. 14th Annual Computing and Combinatorics Conference.  COCOON 2008.

  8. José Luis Montaña, César Luis Alonso, Stefano Cagnoni, Mar Callau: Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies. Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings. Lecture Notes in Computer Science 4974 Springer 2008. EvoWorkshops 2008: 555-564

  9. César Luis Alonso, José Luis Montaña: Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations. Algorithmic Learning Theory, 18th International Conference,  Sendai, Japan, October 1-4, 2007, Proceedings. ALT 2007.

  10. César Luis Alonso, José Luis Montaña: Finiteness Properties of Some Families of GP-Trees. Current Topics in Artificial Intelligence, 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers. Lecture Notes in Computer Science 4788 Springer 2007.

  11. César Luis Alonso, David Alonso, Mar Callau, José Luis Montaña: A Word Equation Solver Based on Levensthein Distance.  MICAI 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings. Lecture Notes in Computer Science 4827 Springer 2007.

  12. José Luis Montaña, César Luis Alonso, Mikel Aldaz: VC dimension of formulae and Computer Programs.  SICO 2007.

  13. César Luis Alonso, Fernando Caro, José Luis Montaña: A Flipping Local search genetic algorithm for the Multidimensional Knapsack Problem.  Current Topics in Artificial Intelligence, 11th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2005, Santiago de Compostela, Spain, November 16-18, 2005, Revised Selected Papers. Lecture Notes in Computer Science 4177 Springer 2006 21-30.

  14. César Luis Alonso, José L. Montaña. A Genetic algorithm for MKP based on Approximate Solutions. EC2AI- ECAI Workshop on Evolutionary Computation. Riva da Garda (Italia), 2006.

  15. César L. Alonso; José L. Montaña; Luis M. Pardo. Sobre la Precisión de los Ejemplos en el Aprendizaje Probablemente Aproximadamente Correcto de Clases de Conceptos Definibles.   CEDI 2005. I Simposio de Inteligencia Computacional [SICO'05]. Actas del Congreso. Ignacio Rojas Ruiz-Héctor Pomares CIntas (eds.) Editorial Thomson. ISBN: 84-9732-44. Granada, 2005.

  16. César L. Alonso; Fernando Caro; José L. Montaña. Un Algoritmo Evolutivo para el Problema de la Mochila Multidimensional Basado en el Uso de un Esquema de Aproximación Polinomial para el Problema Unidimensional.  CEDI 2005. IV Congreso español sobre Metaheurísticas , Algoritmos Evolutivos y Bioinspirados (MAEB’05). Actas del Congreso. Ed Thomson. ISBN: 84-9732-467-6. pp.423-430. Granada, 2005.

  17. César Luis Alonso, José Luis Montaña, Luis Miguel Pardo: On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions.  Mathematical Foundations of Computer Science 2005, 30th International Symposium, Gdansk, Poland, August 29 - September 2, 2005, Proceedings. Lecture Notes in Computer Science 3618 Springer 2005. pp 83-94. MFCS 2005.

  18. César Luis Alonso, Fernando Caro, José Luis Montaña: An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers. Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15-18, 2005, Proceedings, Part II. Lecture Notes in Computer Science 3562 Springer 2005.pp 63-73.

  19. César Luis Alonso, Fátima Drubi, Judith Gómez-García, José Luis Montaña: Word Equation Systems: The Heuristic Approach. SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29 - October 1, 2004, Proceedings. Lecture Notes in Computer Science 3171 Springer 2004 83-92.

  20. César Luis Alonso, Fátima Drubi, José Luis Montaña: An Evolutionary Algorithm for Solving Word Equation Systems. Current Topics in Artificial Intelligence, 10th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2003, and 5th Conference on Technology Transfer, TTIA 2003, San Sebastian, Spain, November 12-14, 2003. Revised Selected Papers. Lecture Notes in Computer Science 3040 Springer 2004 147-156.

  21. Castro, D.; Montaña, J. L.; Pardo, L. M.; San Martín, J. The distribution of condition numbers of rational data of bounded bit length. Found. Comput. Math. 2 (2002), no. 1, 1--52.

  22. Aldaz, M.; Matera, G.; Montaña, J. L.; Pardo, L. M. A new method to obtain lower bounds for polynomial evaluation. Theoret. Comput. Sci. 259 (2001), no. 1-2, 577--596.

  23. Aldaz, M.; Heintz, J.; Matera, G.; Montaña, J. L.; Pardo, L. M. Time-space tradeoffs in algebraic complexity theory. Real computation and complexity (Schloss Dagstuhl, 1998). J. Complexity 16 (2000), no. 1, 2--49.

  24. Aldaz, Mikel; Heintz, Joos; Matera, Guillermo; Montaña, José L.; Pardo, Luis M. Combinatorial hardness proofs for polynomial evaluation (extended abstract). Mathematical foundations of computer science, 1998 (Brno), 167--175, MFCS 1998. Lecture Notes in Comput. Sci., 1450, Springer, Berlin, 1998.

  25. Aldaz, Mikel; Heintz, Joos; Matera, Guillermo; Montaña, José Luis; Pardo, Luis Miguel Time-space tradeoffs for polynomial evaluation. C. R. Acad. Sci. Paris Sér. I Math. 327 (1998), no. 10, 907--912.

  26. Montaña, J. L.; Pardo, Luis M. On Kolmogorov complexity in the real Turing machine setting. Inform. Process. Lett. 67 (1998), no. 2, 81--86.

  27. Giusti, M.; Heintz, J.; Hägele, K.; Morais, J. E.; Pardo, L. M.; Montaña, J. L. Lower bounds for Diophantine approximations. Algorithms for algebra (Eindhoven, 1996). J. Pure Appl. Algebra 117/118 (1997), 277--317.

  28. Montaña, J. L.; Morais, J. E.; Pardo, Luis M. Lower bounds for arithmetic networks. II. Sum of Betti numbers. Appl. Algebra Engrg. Comm. Comput. 7 (1996), no. 1, 41--51.

  29. Cucker, F.; Montaña, J. L.; Pardo, L. M. Models for parallel computation with real numbers. Number-theoretic and Algebraic Methods in Computer Science (Moscow, 1993), 53--63, World Sci. Publ., River Edge, NJ, 1995.

  30. Montaña, José L.; Pardo, Luis M.; Recio, Tomás A note on Rabin's width of a complete proof. Comput. Complexity 4 (1994), no. 1, 12--36.

  31. Cucker, F.; Montaña, J. L.; Pardo, L. M. A non-deterministic time hierarchy over the reals. Extracta Math. 8 (1993), no. 2-3, 87--91.

  32. Montaña, J. L.; Pardo, L. M.; Ramanakoraisina, R. An extension of Warren's lower bounds for approximations. J. Pure Appl. Algebra 87 (1993), no. 3, 251--258.

  33. Montaña, J. L.; Pardo, L. M. Lower bounds for arithmetic networks. Appl. Algebra Engrg. Comm. Comput. 4 (1993), no. 1, 1--24.

  34. Montaña, J. L.; Pardo, L. M.; Ramanakoraisina, R. Lower bounds for approximations. Extracta Math. 7 (1992), no. 1, 65--67.

  35. Montaña, J. L.; Pardo, L. M. Lower bounds for parallel arithmetic computations. Extracta Math. 7 (1992), no. 1, 35--37.

  36. Cucker, F.; Montaña, J. L.; Pardo, L. M. Time bounded computations over the reals. Internat. J. Algebra Comput. (1992), no. 4, 395--408.

  37. Montaña, José L.; Pardo, Luis M.; Recio, Tomas The nonscalar model of complexity in computational geometry. Effective methods in algebraic geometry (Castiglioncello, 1990), 347--361, Progr. Math., 94, Birkhäuser Boston, Boston, MA, 1991.