date_range Durée de 31 décembre 2009 à 31 décembre 2013 (48 mois)
euro 52 030,00 EUR

Sphère National.

Chercheurs

Publications liées au projet

Montrer par typologie

2013

  1. Certifying homological algorithms to study biomedical images

    Poza López de Echazarreta, María

  2. Certified symbolic manipulation: Bivariate simplicial polynomialsModos de exclusión de las mujeres en la sociedad actual

    Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

  3. On the Role of Formalization in Computational Mathematics

    Bulletin of the Belgian Mathematical Society - Simon Stevin

  4. Complexity and algorithms for Euler characteristic of simplicial complexes

    Journal of Symbolic Computation

  5. Alexander duality in experimental designs

    Annals of the Institute of Statistical Mathematics

  6. Verifying a plaftorm for digital imaging: A multi-tool strategy

    Lecture Notes in Computer Science

2012

  1. Towards a certified computation of homology groups for digital images

    Lectures Notes in Computer Science: Computational Topology in Image Context, 4th International Workshop, CTIC 2012, Bertinoro, Italy, May 28-30, 2012, Proceedings

  2. Programming before theorizing, a case study

    Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

  3. Verifying an algorithm computing Discrete Vector Fields for digital imaging

    Lecture Notes in Computer Science, Proceedings CICM 2012

  4. Computing the homology of groups: The geometric way

    Journal of Symbolic Computation

  5. Effective homotopy of fibrations

    Applicable Algebra in Engineering, Communications and Computing

  6. Betti numbers of polynomial hierarchical models for experimental designs

    Annals of Mathematics and Artificial Intelligence

  7. Formalization of a Normalization Theorem in Simplicial Topology

    Annals of Mathematics and Artificial Intelligence

  8. A parameterization process: From a functorial point of view

    International Journal of Foundations of Computer Science

2011

  1. Gestión mecanizada del conocimiento matemático en topología algebraica

    Heras Vicente, Jónathan

  2. Incidence Simplicial Matrices Formalized in Coq/SSReflect

    Lectures Notes in Computer Science: Intelligent Computer Mathematics 18th Symposium, Calculemus 2011, 10th International Conference, MKM 2011, Held as Part of CICM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings

  3. Teaching Geometry with TutorMates

    Proceedings ICCSA 2011

  4. fKenzo

    Gaceta de la Real Sociedad Matematica Española

  5. fKenzo: a user interface for computations in Algebraic Topology

    Journal of Symbolic Computation

  6. Computational algebraic algorithms for the reliability of generalized k-out-of-n and related systems

    Mathematics and Computers in Simulation

  7. Applying ACL2 to the Formalization of Algebraic Topology: Simplicial Polynomials

    Lecture Notes in Computer Science

  8. Effective homology of bicomplexes, formalized in Coq

    Theoretical Computer Science

2010

  1. Mediated access to Symbolic Computation systems

    Contribuciones científicas en honor de Mirian Andrés Gómez

  2. A project-based experience in database design learning

    Contribuciones científicas en honor de Mirian Andrés Gómez

  3. Spectral sequences

    Contribuciones científicas en honor de Mirian Andrés Gómez

  4. Computing in Coq with infinite algebraic data structures

    Proceedings CICM 2010

  5. Integrating multiple sources to answer questions in Algebraic Topology

    Lectures Notes in Computer Science: Intelligent Computer Mathematics10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010, and 9th International Conference, MKM 2010, Paris, France, July 5-10, 2010. Proceedings

  6. A case study of A8-structure

    Georgian Mathematical Journal

  7. Computing the first stages of the Bousfield-Kan spectral sequence

    Applicable Algebra in Engineering, Communications and Computing

  8. Generating certified code from Formal Proofs: a case study in Homological Algebra

    Formal Aspects of Computing

  9. A case-study in algebraic manipulation using mechanized reasoning tools

    International Journal of Computer Mathematics

2009

  1. Multigraded betti numbers without computing minimal free resolutions

    Applicable Algebra in Engineering, Communications and Computing