Gabriela Jeronimo

Orcid: 0000-0001-7712-0359

According to our database1, Gabriela Jeronimo authored at least 28 papers between 2001 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Convergence Analysis of a Variable Projection Method for Regularized Separable Nonlinear Inverse Problems.
CoRR, 2024

Decision problem for a class of univariate Pfaffian functions.
Appl. Algebra Eng. Commun. Comput., 2024

2023
The Canny-Emiris Conjecture for the Sparse Resultant.
Found. Comput. Math., June, 2023

Weak identifiability for differential algebraic systems.
Adv. Appl. Math., June, 2023

2019
On the Multiplicity of Isolated Roots of Sparse Polynomial Systems.
Discret. Comput. Geom., 2019

2018
Sparse resultants and straight-line programs.
J. Symb. Comput., 2018

2016
A decision method for the integrability of differential-algebraic Pfaffian systems.
Adv. Appl. Math., 2016

2015
Effective differential Lüroth theorem.
ACM Commun. Comput. Algebra, 2015

2014
Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients.
J. Complex., 2014

A Probabilistic Symbolic Algorithm to Find the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set.
Discret. Comput. Geom., 2014

Elimination for Generic Sparse Polynomial Systems.
Discret. Comput. Geom., 2014

2013
On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications.
SIAM J. Optim., 2013

Affine solution sets of sparse polynomial systems.
J. Symb. Comput., 2013

Effective Differential Nullstellensatz for Ordinary DAE Systems over the Complex Numbers
CoRR, 2013

2012
Effective Differential Lüroth's Theorem
CoRR, 2012

2011
A geometric index reduction method for implicit systems of differential algebraic equations.
J. Symb. Comput., 2011

2010
Computing isolated roots of sparse polynomial systems in affine space.
Theor. Comput. Sci., 2010

On the minimum of a positive polynomial over the standard simplex.
J. Symb. Comput., 2010

On Sign Conditions Over Real Multivariate Polynomials.
Discret. Comput. Geom., 2010

2009
Deformation Techniques for Sparse Systems.
Found. Comput. Math., 2009

A parametric representation of totally mixed Nash equilibria.
Comput. Math. Appl., 2009

2007
Computing multihomogeneous resultants using straight-line programs.
J. Symb. Comput., 2007

2006
On the complexity of the resolvent representation of some prime differential ideals.
J. Complex., 2006

A linear algebra approach to the differentiation index of generic DAE systems
CoRR, 2006

2005
Subresultants and generic monomial bases.
J. Symb. Comput., 2005

2004
Computing generators of the ideal of a smooth affine algebraic variety.
J. Symb. Comput., 2004

The Computational Complexity of the Chow Form.
Found. Comput. Math., 2004

2001
Computing Chow Forms and Some Applications.
J. Algorithms, 2001


  Loading...