Publications:

• Gleb Pogudin, Agnes Szanto: Irredundant Triangular Decomposition, Proceedings of the 2018 International Symposium on Symbolic and Algebraic Computation, 311-318, ACM, New York, (2018), preprint
  
  
• C. D'Andrea, T. Krick, A. Szanto and M. Valdettaro, Closed formula for univariate subresultants in multiple roots, accepted for MEGA 2017, preprint
  
  
• Tulay Ayyildiz Akoglu, Jonathan D. Hauenstein and Agnes Szanto: Certifying solutions to overdetermined and singular polynomial systems over Q, Journal of Symbolic Computation, 84, Pages 147-171, (2018), preprint
  
  
• A. Bostan, C. D'Andrea, T. Krick, A. Szanto and M. Valdettaro, Subresultants in multiple roots: an extremal case, Linear Algebra and its Applications, Volume 529, Pages 185–198, (2017), preprint
  
  
• Jonathan D. Hauenstein, Bernard Mourrain, and Agnes Szanto, On deflation and multiplicity structure, J. of Symbolic Computation, Vol. 83, 228–253, (2017), preprint
  
  
• T. Krick, A. Szanto, M. Valdettaro, Symmetric interpolation, Exchange Lemma and Sylvester sums, Communications in Algebra, Volume 45, no. 8, pages 3231--3250. (2017) preprint.
  
  
• Jonathan D. Hauenstein, Bernard Mourrain, and Agnes Szanto, Certifying isolated singular points and their multiplicity structure, Proceedings of the 2015 International Symposium on Symbolic and Algebraic Computation, 213-220, ACM, New York, (2015), preprint, computation page
  
  
• C. D'Andrea, T. Krick, A. Szanto: Subresultants, Sylvester sums and the rational interpolation problem, J. Symb. Comput. (2015), Volume 68, Part 1, Pages 72–83, preprint
  
  
• O.Ruatta, M. Sciabica, A. Szanto: Overdetermined Weierstrass iteration and the nearest consistent system. Theoret. Comput. Sci. 562 (2015), 346–364.  preprint
  
  
• Jonathan D. Hauenstein, Victor Pan and Agnes Szanto: A note on global Newton iteration over Archimedean and non-Archimedean fields, (2014),  Lecture Notes in Computer Science, 8660, 202-217, 2014, full version
  
  
• C. D'Andrea, T. Krick, A. Szanto: Subresultants in Multiple Roots, Linear Algebra Appl. 438, no.5, pages 1969-1989 (2013), preprint
  
  
• T. Krick, A. Szanto: Sylvester's double sums: an inductive proof of the general case, Journal of Symbolic Computation, Volume 47, Issue 8, Pages 942–953, (2012), preprint
  
  
• I. Janovitz-Freireich, B. Mourrain, L. Ronyai, A. Szanto: On the Computation of Matrices of Traces and Radicals of Ideals, Journal of Symbolic Computation, 47, pp. 102-122, (2012), preprint
  
  
• A. Szanto: Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview, Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, 9--10, ACM, New York, (2011)
  
  
• A. Szanto: Multivariate subresultants using Jouanolou matrices, Journal of Pure and Applied Algebra 214 (2010) pp. 1347–1369 , preprint
  
  
• O. Golubitsky , M. Kondratieva, A. Ovchinnikov, A. Szanto: A Bound for Orders in Differential Nullstellensatz, Journal of Algebra 322 (2009) 3852–3877, preprint
  
  
• C. D'Andrea, H. Hong, T. Krick, A. Szanto: Sylvester's Double Sums: the general case. Journal of Symbolic Computation, Volume 44, Issue 9, Pages 1164-1175 (2009), preprint
  
  
• S. Pope, A. Szanto: Nearest Multivariate System with Given Root Multiplicities, Journal of Symbolic Computation, 44 (2009), pp. 606-625, preprint
  
  
• I. Janovitz-Freireich, B. Mourrain, L. Ronyai, A. Szanto: Moment matrices, trace matrices and the radical of ideals, Proceedings of the 2008 International Symposium on Symbolic and Algebraic Computation, 125--132, ACM, New York, (2008) preprint
  
  
• A. Szanto, Solving over-determined systems by the subresultant method
  (with an appendix by Marc Chardin). Journal of Symbolic Computation, Vol 43/1 pp 46–74, (2008) preprint
  
  
• I. Janovitz-Freireich, L. Ronyai, A. Szanto: Approximate radical for clusters: a global approach using Gaussian elimination or SVD., Mathematics in Computer Science, Vol. 1, no. 2, pp 393–425, (2007), preprint
  
  
• C. D'Andrea, H. Hong, T. Krick, A. Szanto: A Simple Proof of Sylvester’s Double Sums for Subresultants, Journal of Symbolic Computation, 42 (2007) 290--–297, preprint
  
  
• I. Janovitz-Freireich, L. Ronyai, A. Szanto: Approximate Radical of Ideals with Clusters of Roots, Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, 146--153, ACM, New York, 2006,
  
  
• C. D'Andrea, T. Krick, A. Szanto: Multivariate Subresultants in Roots, J. Algebra 302 (2006), no. 1, 16--36, preprint
  
  
• E. L. Mansfield and A. Szanto: Elimination theory for differential difference polynomials, Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, 191--198 (electronic), ACM, New York, 2003.
  
  
• A. Szanto: Computation with polynomial systems, Ph.D. dissertation, 1999. Download
  
  
• A. Szanto: The computational complexity of the Wu-Ritt type unmixed decomposition of radical ideals, Proceedings of PASCO '97, ACM Press, pp. 139-149.
  
  
• L. Ronyai, A. Szanto, Prime-field-complete functions and factoring polynomials over finite fields, Computers and Artificial Intelligence, Vol.15, 1996, No. 6, pp. 571-577.
  
  
• G. Ivanyos, A. Szanto, Lattice basis reduction for indefinite forms and an application, Discrete Mathematics 153, (1996), pp. 177-188.
  
  
• G. Ivanyos, L. Ronyai, A. Szanto, Decomposition of Algebras over F_q(x_1, ..., x_m), Applicable Algebra in Engineering, Communication and Computing 5, (1994), No. 2, pp. 71-90.