Eduardo Sáenz-de-Cabezón

Orcid: 0000-0002-5615-4194

According to our database1, Eduardo Sáenz-de-Cabezón authored at least 29 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Artificial Intelligence Models for Assessing the Evaluation Process of Complex Student Projects.
IEEE Trans. Learn. Technol., October, 2023

Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes.
CoRR, 2023

Sensitivity analysis of discrete preference functions using Koszul simplicial complexes.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Robustness Analysis of a Methodology to Detect Biases, Inconsistencies and Discrepancies in the Evaluation Process.
Proceedings of the International Joint Conference 16th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2023) 14th International Conference on EUropean Transnational Education (ICEUTE 2023), 2023

2022
Support posets of some monomial ideals.
Appl. Algebra Eng. Commun. Comput., 2022

An Algebraic Version of the Sum-of-disjoint-products Method for Multi-state System Reliability Analysis.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2021
A C++ class for multi-state algebraic reliability computations.
Reliab. Eng. Syst. Saf., 2021

Cellular reductions of the Pommaret-Seiler resolution for Quasi-stable ideals.
ACM Commun. Comput. Algebra, 2021

2019
Algebraic algorithms for the reliability analysis of multi-state <i>k</i>-out-of-<i>n</i> systems.
ACM Commun. Comput. Algebra, 2019

Monomial Resolutions for Efficient Computation of Simplicial Homology.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Efficient multicut enumeration of <i>k</i>-out-of-<i>n</i>: F and consecutive <i>k</i>-out-of-<i>n</i>: F systems.
Pattern Recognit. Lett., 2018

2017
Types of signature analysis in reliability based on Hilbert series.
J. Symb. Comput., 2017

2016
The Algebraic Method in Tree Percolation.
SIAM J. Discret. Math., 2016

2015
Hilbert Functions in Design for Reliability.
IEEE Trans. Reliab., 2015

On the free resolution induced by a Pommaret basis.
J. Symb. Comput., 2015

Editorial.
Appl. Algebra Eng. Commun. Comput., 2015

2014
Measuring the robustness of a network using minimal vertex covers.
Math. Comput. Simul., 2014

2013
Complexity and algorithms for Euler characteristic of simplicial complexes.
J. Symb. Comput., 2013

2012
Betti numbers of polynomial hierarchical models for experimental designs.
Ann. Math. Artif. Intell., 2012

Special issue on computer algebra in algebraic topology and its applications.
Appl. Algebra Eng. Commun. Comput., 2012

2011
Computational algebraic algorithms for the reliability of generalized k-out-of-n and related systems.
Math. Comput. Simul., 2011

A computer implementation of the partition of the unity procedure and its application to arthropod population dynamics. A case study on the European grape berry moth.
Math. Comput. Simul., 2011

Bordered magic squares: Elements for a comprehensive approach.
Ars Comb., 2011

2010
Computing the support of monomial iterated mapping cones.
J. Symb. Comput., 2010

Mincut ideals of two-terminal networks.
Appl. Algebra Eng. Commun. Comput., 2010

2009
Betti numbers and minimal free resolutions for multi-state system reliability bounds.
J. Symb. Comput., 2009

Efficient algorithms for the algebraic analysis of system reliability.
ACM Commun. Comput. Algebra, 2009

Multigraded Betti numbers without computing minimal free resolutions.
Appl. Algebra Eng. Commun. Comput., 2009

Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009


  Loading...