Ágnes Szántó

According to our database, Ágnes Szántó authored at least 36 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Certified Hermite matrices from approximate roots.

Tulay Ayyildiz Akoglu, Ágnes Szántó

J. Symb. Comput., July, 2023

A certified iterative method for isolated singular roots.

Angelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó

J. Symb. Comput., 2023

2022

Correction to: Preface.

Albert Cohen, Wolfgang Dahmen, Hans Z. Munthe-Kaas, Martín Sombra, Ágnes Szántó

Found. Comput. Math., 2022

2020

Subresultants of (<i>x</i>-<i>α</i>)^<i>m</i> and (<i>x</i>-<i>β</i>)^<i>n</i>, Jacobi polynomials and complexity.

Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro

J. Symb. Comput., 2020

Smooth points on semi-algebraic sets.

Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó

ACM Commun. Comput. Algebra, 2020

Punctual Hilbert scheme and certified approximate singularities.

Angelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

Preface.

Albert Cohen, Wolfgang Dahmen, Hans Z. Munthe-Kaas, Martín Sombra, Ágnes Szántó

Found. Comput. Math., 2019

Certified Hermite Matrices from Approximate Roots - Univariate Case.

Tulay Ayyildiz Akoglu, Ágnes Szántó

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2018

Certifying solutions to overdetermined and singular polynomial systems over ℚ.

Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein, Ágnes Szántó

J. Symb. Comput., 2018

Subresultants of (x-α)^m and (x-β)ⁿ, Jacobi polynomials and complexity.

Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro

CoRR, 2018

Irredundant Triangular Decomposition.

Gleb Pogudin, Ágnes Szántó

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

On deflation and multiplicity structure.

Jonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó

J. Symb. Comput., 2017

2016

Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra.

Kosaku Nagasaka, Ágnes Szántó, Franz Winkler

J. Symb. Comput., 2016

2015

Overdetermined Weierstrass iteration and the nearest consistent system.

Olivier Ruatta, Mark Sciabica, Ágnes Szántó

Theor. Comput. Sci., 2015

Subresultants, Sylvester sums and the rational interpolation problem.

Carlos D'Andrea, Teresa Krick, Ágnes Szántó

J. Symb. Comput., 2015

Certifying Isolated Singular Points and their Multiplicity Structure.

Jonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Over-constrained Weierstrass iteration and the nearest consistent system.

Olivier Ruatta, Mark Sciabica, Ágnes Szántó

CoRR, 2014

Global Newton Iteration over Archimedean and non-Archimedean Fields.

Jonathan D. Hauenstein, Victor Y. Pan, Ágnes Szántó

CoRR, 2014

A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields.

Jonathan D. Hauenstein, Victor Y. Pan, Ágnes Szántó

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2012

Sylvester's double sums: An inductive proof of the general case.

Teresa Krick, Ágnes Szántó

J. Symb. Comput., 2012

On the computation of matrices of traces and radicals of ideals.

Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó

J. Symb. Comput., 2012

2011

Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview.

Ágnes Szántó

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Symbolic-Numeric Solution of Ill-Conditioned Polynomial Systems (Survey Talk Overview) (Invited Talk).

Ágnes Szántó

Proceedings of the Computer Algebra in Scientific Computing - 13th International Workshop, 2011

2009

Nearest multivariate system with given root multiplicities.

Scott R. Pope, Ágnes Szántó

J. Symb. Comput., 2009

Sylvester's double sums: The general case.

Carlos D'Andrea, Hoon Hong, Teresa Krick, Ágnes Szántó

J. Symb. Comput., 2009

2008

Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin).

Ágnes Szántó

J. Symb. Comput., 2008

Moment matrices, trace matrices and the radical of ideals.

Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD.

Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó

Math. Comput. Sci., 2007

An elementary proof of Sylvester's double sums for subresultants.

Carlos D'Andrea, Hoon Hong, Teresa Krick, Ágnes Szántó

J. Symb. Comput., 2007

2006

Symbolic-numeric computation and applications: list of abstracts.

Ágnes Szántó, Jan Verschelde, Zhonggang Zeng

ACM Commun. Comput. Algebra, 2006

Approximate radical of ideals with clusters of roots.

Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2003

Elimination theory for differential difference polynomials.

Elizabeth L. Mansfield, Ágnes Szántó

Proceedings of the Symbolic and Algebraic Computation, 2003

1997

Complexity of the Wu-Ritt decomposition.

Ágnes Szántó

Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, 1997

1996

Lattice basis reduction for indefinite forms and an application.

Gábor Ivanyos, Ágnes Szántó

Discret. Math., 1996

Primer-Field Complete Functions and Factoring Polynomials over Finite Fields.

Lajos Rónyai, Ágnes Szántó

Comput. Artif. Intell., 1996

1994

Decomposition of Algebras over F_q(X₁, ..., X_m).

Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó

Appl. Algebra Eng. Commun. Comput., 1994