Follow
Matías R. Bender
Matías R. Bender
Researcher @ INRIA Saclay - CMAP, École polytechnique
Verified email at inria.fr - Homepage
Title
Cited by
Cited by
Year
Toric eigenvalue methods for solving sparse polynomial systems
M Bender, S Telen
Mathematics of Computation 91 (337), 2397-2429, 2022
142022
Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case
M Bender, JC Faugere, E Tsigaridas
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
132018
Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
M Bender, JC Faugère, E Tsigaridas
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019
82019
Yet another eigenvalue algorithm for solving polynomial systems
MR Bender, S Telen
arXiv preprint arXiv:2105.08472, 2021
72021
Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors
M Bender, JC Faugere, A Mantzaflaris, E Tsigaridas
Proceedings of the 2018 ACM International Symposium on Symbolic and …, 2018
72018
A superfast randomized algorithm to decompose binary forms
MR Bender, JC Faugère, L Perret, E Tsigaridas
Proceedings of the ACM on International Symposium on Symbolic and Algebraic …, 2016
62016
Koszul-type determinantal formulas for families of mixed multilinear systems
MR Bender, JC Faugère, A Mantzaflaris, E Tsigaridas
SIAM Journal on Applied Algebra and Geometry 5 (4), 589–619, 2021
52021
Algorithms for sparse polynomial systems: Gröbner basis and resultants
MR Bender
Sorbonne Université, 2019
52019
A nearly optimal algorithm to decompose binary forms
MR Bender, JC Faugère, L Perret, E Tsigaridas
Journal of Symbolic Computation 105, 71-96, 2021
42021
Classifier construction in Boolean networks using algebraic methods
R Schwieger, MR Bender, H Siebert, C Haase
Computational Methods in Systems Biology: 18th International Conference …, 2020
12020
Dimension results for extremal-generic polynomial systems over complete toric varieties
M Bender, PJ Spaenlehauer
arXiv preprint arXiv:2305.07439, 2023
2023
Counting linear extensions with volume computation
R Ahmed, V Fisikopoulos, E Tsigaridas, M Bender
2022
Solving sparse polynomial systems using Groebner bases and resultants
MR Bender
Proceedings of the 2022 International Symposium on Symbolic and Algebraic …, 2022
2022
Efficient computation of multiparameter persistence
MR Bender, O Gäfvert, M Lesnick
2021
A Superfast Algorithm for the Decomposition of Binary Forms
MR Bender
Universidad de Buenos Aires, 2015
2015
The system can't perform the operation now. Try again later.
Articles 1–15