default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁgnes Szántó
Person information
- affiliation: North Carolina State University, Raleigh, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Angelos Mantzaflaris
, Bernard Mourrain, Ágnes Szántó:
A certified iterative method for isolated singular roots. J. Symb. Comput. 115: 223-247 (2023)- [j22]Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó:
Smooth points on semi-algebraic sets. J. Symb. Comput. 116: 183-212 (2023) - [j21]Tulay Ayyildiz Akoglu, Ágnes Szántó:
Certified Hermite matrices from approximate roots. J. Symb. Comput. 117: 101-118 (2023) - 2022
- [j20]Albert Cohen, Wolfgang Dahmen, Hans Z. Munthe-Kaas, Martín Sombra, Ágnes Szántó:
Correction to: Preface. Found. Comput. Math. 22(1): 313-314 (2022) - 2020
- [j19]Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó:
Smooth points on semi-algebraic sets. ACM Commun. Comput. Algebra 54(3): 105-108 (2020) - [j18]Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro:
Subresultants of (x-α)m and (x-β)n, Jacobi polynomials and complexity. J. Symb. Comput. 101: 330-351 (2020) - [c11]Angelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó:
Punctual Hilbert scheme and certified approximate singularities. ISSAC 2020: 336-343 - [i7]Katherine Harris, Jonathan D. Hauenstein, Ágnes Szántó:
Smooth Points on Semi-algebraic Sets. CoRR abs/2002.04707 (2020)
2010 – 2019
- 2019
- [j17]Albert Cohen, Wolfgang Dahmen, Hans Z. Munthe-Kaas, Martín Sombra, Ágnes Szántó:
Preface. Found. Comput. Math. 19(5): 963-964 (2019) - [c10]Tulay Ayyildiz Akoglu, Ágnes Szántó:
Certified Hermite Matrices from Approximate Roots - Univariate Case. MACIS 2019: 3-9 - 2018
- [j16]Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein, Ágnes Szántó:
Certifying solutions to overdetermined and singular polynomial systems over ℚ. J. Symb. Comput. 84: 147-171 (2018) - [c9]Gleb Pogudin, Ágnes Szántó:
Irredundant Triangular Decomposition. ISSAC 2018: 311-318 - [i6]Alin Bostan, Teresa Krick, Ágnes Szántó, Marcelo Valdettaro:
Subresultants of (x-α)m and (x-β)n, Jacobi polynomials and complexity. CoRR abs/1812.11789 (2018) - 2017
- [j15]Jonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó:
On deflation and multiplicity structure. J. Symb. Comput. 83: 228-253 (2017) - 2016
- [j14]Kosaku Nagasaka, Ágnes Szántó, Franz Winkler:
Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra. J. Symb. Comput. 75: 1-3 (2016) - 2015
- [j13]Carlos D'Andrea, Teresa Krick, Ágnes Szántó:
Subresultants, Sylvester sums and the rational interpolation problem. J. Symb. Comput. 68: 72-83 (2015) - [j12]Olivier Ruatta, Mark Sciabica, Ágnes Szántó:
Overdetermined Weierstrass iteration and the nearest consistent system. Theor. Comput. Sci. 562: 346-364 (2015) - [c8]Jonathan D. Hauenstein, Bernard Mourrain, Ágnes Szántó:
Certifying Isolated Singular Points and their Multiplicity Structure. ISSAC 2015: 213-220 - 2014
- [c7]Jonathan D. Hauenstein, Victor Y. Pan, Ágnes Szántó:
A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields. CASC 2014: 202-217 - [e1]Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, Ágnes Szántó:
International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014. ACM 2014, ISBN 978-1-4503-2501-1 [contents] - [i5]Olivier Ruatta, Mark Sciabica, Ágnes Szántó:
Over-constrained Weierstrass iteration and the nearest consistent system. CoRR abs/1401.5086 (2014) - [i4]Jonathan D. Hauenstein, Victor Y. Pan, Ágnes Szántó:
Global Newton Iteration over Archimedean and non-Archimedean Fields. CoRR abs/1404.5525 (2014) - [i3]Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein, Ágnes Szántó:
Certifying solutions to overdetermined and singular polynomial systems over Q. CoRR abs/1408.2721 (2014) - 2012
- [j11]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): 102-122 (2012) - [j10]Teresa Krick, Ágnes Szántó:
Sylvester's double sums: An inductive proof of the general case. J. Symb. Comput. 47(8): 942-953 (2012) - 2011
- [c6]Ágnes Szántó:
Symbolic-Numeric Solution of Ill-Conditioned Polynomial Systems (Survey Talk Overview) (Invited Talk). CASC 2011: 345-347 - [c5]Ágnes Szántó:
Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview. ISSAC 2011: 9-10
2000 – 2009
- 2009
- [j9]Scott R. Pope, Ágnes Szántó:
Nearest multivariate system with given root multiplicities. J. Symb. Comput. 44(6): 606-625 (2009) - [j8]Carlos D'Andrea, Hoon Hong, Teresa Krick, Ágnes Szántó:
Sylvester's double sums: The general case. J. Symb. Comput. 44(9): 1164-1175 (2009) - [i2]Itnuit Janovitz-Freireich, Bernard Mourrain, Lajos Rónyai, Ágnes Szántó:
On the Computation of Matrices of Traces and Radicals of Ideals. CoRR abs/0901.2778 (2009) - 2008
- [j7]Ágnes Szántó:
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin). J. Symb. Comput. 43(1): 46-74 (2008) - [c4]Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai:
Moment matrices, trace matrices and the radical of ideals. ISSAC 2008: 125-132 - [i1]Itnuit Janovitz-Freireich, Ágnes Szántó, Bernard Mourrain, Lajos Rónyai:
Moment matrices, trace matrices and the radical of ideals. CoRR abs/0812.0088 (2008) - 2007
- [j6]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): 290-297 (2007) - [j5]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): 393-425 (2007) - 2006
- [j4]Ágnes Szántó, Jan Verschelde, Zhonggang Zeng:
Symbolic-numeric computation and applications: list of abstracts. ACM Commun. Comput. Algebra 40(1): 15-17 (2006) - [c3]Itnuit Janovitz-Freireich, Lajos Rónyai, Ágnes Szántó:
Approximate radical of ideals with clusters of roots. ISSAC 2006: 146-153 - 2003
- [c2]Elizabeth L. Mansfield, Ágnes Szántó:
Elimination theory for differential difference polynomials. ISSAC 2003: 191-198
1990 – 1999
- 1997
- [c1]Ágnes Szántó:
Complexity of the Wu-Ritt decomposition. PASCO 1997: 139-149 - 1996
- [j3]Lajos Rónyai, Ágnes Szántó:
Primer-Field Complete Functions and Factoring Polynomials over Finite Fields. Comput. Artif. Intell. 15(6): 571-577 (1996) - [j2]Gábor Ivanyos, Ágnes Szántó:
Lattice basis reduction for indefinite forms and an application. Discret. Math. 153(1-3): 177-188 (1996) - 1994
- [j1]Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó:
Decomposition of Algebras over Fq(X1, ..., Xm). Appl. Algebra Eng. Commun. Comput. 5: 71-90 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
