Ágnes Szántó

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 15

Top Topics

Computer Algebra

Singular Points

Top Venues

J. Symb. Comput.

Found. Comput. Math.

Publications

Angelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó
A certified iterative method for isolated singular roots. J. Symb. Comput. 115 (2023)
Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó
Smooth points on semi-algebraic sets. J. Symb. Comput. 116 (2023)
Tulay Ayyildiz Akoglu, Ágnes Szántó
Certified Hermite matrices from approximate roots. J. Symb. Comput. 117 (2023)
Albert Cohen, Wolfgang Dahmen, Hans Z. Munthe-Kaas, Martín Sombra, Ágnes Szántó
Correction to: Preface. Found. Comput. Math. 22 (1) (2022)
Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó
Smooth Points on Semi-algebraic Sets. CoRR (2020)
Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro
, Jacobi polynomials and complexity. J. Symb. Comput. 101 (2020)
Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó
Smooth points on semi-algebraic sets. ACM Commun. Comput. Algebra 54 (3) (2020)
Angelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó
Punctual Hilbert scheme and certified approximate singularities. ISSAC (2020)
Tulay Ayyildiz Akoglu, Ágnes Szántó
Certified Hermite Matrices from Approximate Roots - Univariate Case. MACIS (2019)
Albert Cohen, Wolfgang Dahmen, Hans Z. Munthe-Kaas, Martín Sombra, Ágnes Szántó
Preface. Found. Comput. Math. 19 (5) (2019)
Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein, Ágnes Szántó
Certifying solutions to overdetermined and singular polynomial systems over ℚ. J. Symb. Comput. 84 (2018)
Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro
, Jacobi polynomials and complexity. CoRR (2018)
Gleb Pogudin, Ágnes Szántó
Irredundant Triangular Decomposition. ISSAC (2018)
Jonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó
On deflation and multiplicity structure. J. Symb. Comput. 83 (2017)
Kosaku Nagasaka, Ágnes Szántó, Franz Winkler
Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra. J. Symb. Comput. 75 (2016)
Jonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó
Certifying Isolated Singular Points and their Multiplicity Structure. ISSAC (2015)
Carlos D'Andrea, Teresa Krick, Ágnes Szántó
Subresultants, Sylvester sums and the rational interpolation problem. J. Symb. Comput. 68 (2015)
Olivier Ruatta, Mark Sciabica, Ágnes Szántó
Overdetermined Weierstrass iteration and the nearest consistent system. Theor. Comput. Sci. 562 (2015)
Olivier Ruatta, Mark Sciabica, Ágnes Szántó
Over-constrained Weierstrass iteration and the nearest consistent system. CoRR (2014)
Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein, Ágnes Szántó
Certifying solutions to overdetermined and singular polynomial systems over Q. CoRR (2014)
Jonathan D. Hauenstein, Victor Y. Pan, Ágnes Szántó
Global Newton Iteration over Archimedean and non-Archimedean Fields. CoRR (2014)
Jonathan D. Hauenstein, Victor Y. Pan, Ágnes Szántó
A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields. CASC (2014)
Teresa Krick, Ágnes Szántó
Sylvester's double sums: An inductive proof of the general case. J. Symb. Comput. 47 (8) (2012)
Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó
On the computation of matrices of traces and radicals of ideals. J. Symb. Comput. 47 (1) (2012)
Ágnes Szántó
Symbolic-Numeric Solution of Ill-Conditioned Polynomial Systems (Survey Talk Overview) (Invited Talk). CASC (2011)
Ágnes Szántó
Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview. ISSAC (2011)
Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó
On the Computation of Matrices of Traces and Radicals of Ideals CoRR (2009)
Scott R. Pope, Ágnes Szántó
Nearest multivariate system with given root multiplicities. J. Symb. Comput. 44 (6) (2009)
Carlos D'Andrea, Hoon Hong, Teresa Krick, Ágnes Szántó
Sylvester's double sums: The general case. J. Symb. Comput. 44 (9) (2009)
Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai
Moment matrices, trace matrices and the radical of ideals CoRR (2008)
Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai
Moment matrices, trace matrices and the radical of ideals. ISSAC (2008)
Ágnes Szántó
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin). J. Symb. Comput. 43 (1) (2008)
Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó
Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD. Math. Comput. Sci. 1 (2) (2007)
Carlos D'Andrea, Hoon Hong, Teresa Krick, Ágnes Szántó
An elementary proof of Sylvester's double sums for subresultants. J. Symb. Comput. 42 (3) (2007)
Ágnes Szántó, Jan Verschelde, Zhonggang Zeng
Symbolic-numeric computation and applications: list of abstracts. ACM Commun. Comput. Algebra 40 (1) (2006)
Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó
Approximate radical of ideals with clusters of roots. ISSAC (2006)
Elizabeth L. Mansfield, Ágnes Szántó
Elimination theory for differential difference polynomials. ISSAC (2003)
Ágnes Szántó
Complexity of the Wu-Ritt decomposition. PASCO (1997)
Gábor Ivanyos, Ágnes Szántó
Lattice basis reduction for indefinite forms and an application. Discret. Math. 153 (1-3) (1996)
Lajos Rónyai, Ágnes Szántó
Primer-Field Complete Functions and Factoring Polynomials over Finite Fields. Comput. Artif. Intell. 15 (6) (1996)
Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó
). Appl. Algebra Eng. Commun. Comput. 5 (1994)