| Publication | Date of Publication | Type |
|---|
| Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time | 2025-01-06 | Paper |
| Lower bounds of functions on finite abelian groups | 2024-08-22 | Paper |
| Two-step Newton's method for deflation-one singular zeros of analytic systems | 2024-02-05 | Paper |
| A Characterization of Perfect Strategies for Mirror Games | 2023-11-03 | Paper |
| VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities | 2023-09-22 | Paper |
| The non-Archimedean Nirgendsnegativsemidefinitheitsstellensatz is not true | 2023-03-10 | Paper |
| A Field-Theoretic Approach to Unlabeled Sensing | 2023-03-02 | Paper |
| Lower Bounds of Functions on Finite Abelian Groups | 2023-02-04 | Paper |
| The integral closure of a primary ideal is not always primary | 2022-10-30 | Paper |
| Fourier sum of squares certificates | 2022-07-17 | Paper |
| Extensions of S-Lemma for Noncommutative Polynomials | 2022-07-02 | Paper |
| Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time | 2022-01-11 | Paper |
| Quantum Strassen’s theorem | 2021-02-10 | Paper |
| Lifts of non-compact convex sets and cone factorizations | 2021-01-22 | Paper |
| Computing real radicals and \(S\)-radicals of polynomial systems | 2020-09-19 | Paper |
| Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits | 2020-09-09 | Paper |
| On the Complexity of Computing Real Radicals of Polynomial Systems | 2020-09-09 | Paper |
| Symmetric Tensor Decompositions On Varieties | 2020-03-22 | Paper |
| On isolation of singular zeros of multivariate analytic systems | 2019-04-16 | Paper |
| Global optimization of polynomials over real algebraic sets | 2019-03-06 | Paper |
| Computing multiple zeros of polynomial systems: case of breadth one (invited talk) | 2018-02-23 | Paper |
| <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials | 2017-09-20 | Paper |
| Numerical Sparsity Determination and Early Termination | 2017-05-10 | Paper |
| Computing Simple Multiple Zeros of Polynomial Systems | 2017-03-11 | Paper |
| Computing rational solutions of linear matrix inequalities | 2017-02-10 | Paper |
| Verified error bounds for real solutions of positive-dimensional polynomial systems | 2017-02-10 | Paper |
| Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials | 2017-02-03 | Paper |
| A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions | 2017-02-03 | Paper |
| Optimizing a linear function over a noncompact real algebraic variety | 2016-09-29 | Paper |
| Optimization Problems over Noncompact Semialgebraic Sets | 2016-09-29 | Paper |
| Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety | 2016-09-29 | Paper |
| Pseudofactors of multivariate polynomials | 2015-11-26 | Paper |
| Global optimization of polynomials using generalized critical values and sums of squares | 2015-09-17 | Paper |
| Blind image deconvolution via fast approximate GCD | 2015-09-17 | Paper |
| Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method | 2015-09-17 | Paper |
| A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals | 2015-08-19 | Paper |
| The minimum-rank gram matrix completion via modified fixed point continuation method | 2015-06-09 | Paper |
| Semidefinite Representations of Noncompact Convex Sets | 2015-06-02 | Paper |
| Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions | 2015-03-27 | Paper |
| Computing real solutions of polynomial systems via low-rank moment matrix completion | 2015-03-27 | Paper |
| Computing the nearest singular univariate polynomials with given root multiplicities | 2013-11-29 | Paper |
| Global optimization of polynomials restricted to a smooth variety using sums of squares | 2012-05-04 | Paper |
| Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms | 2012-03-22 | Paper |
| Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients | 2011-12-21 | Paper |
| Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions | 2011-03-21 | Paper |
| Geometric Involutive Bases and Applications to Approximate Commutative Algebra | 2010-07-30 | Paper |
| A fast algorithm for solving the Sylvester structured total least squares problem | 2010-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5188225 | 2010-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3640380 | 2009-11-11 | Paper |
| Solving polynomial systems via symbolic-numeric reduction to geometric involutive form | 2009-03-25 | Paper |
| Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars | 2009-01-20 | Paper |
| Computing the multiplicity structure from geometric involutive form | 2009-01-20 | Paper |
| Approximate gcds of polynomials and sparse SOS relaxations | 2009-01-08 | Paper |
| Approximate factorization of multivariate polynomials using singular value decomposition | 2008-04-23 | Paper |
| A structured rank-revealing method for Sylvester matrix | 2008-02-06 | Paper |
| Structured low rank approximation of a Bezout matrix | 2008-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447170 | 2007-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447171 | 2007-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710751 | 2005-12-08 | Paper |
| Computer Algebra and Geometric Algebra with Applications | 2005-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660670 | 2005-04-04 | Paper |
| Approximate factorization of multivariate polynomials via differential equations | 2005-03-14 | Paper |
| Hybrid method for computing the nearest singular polynomials | 2005-01-14 | Paper |
| DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS | 2004-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2725944 | 2003-07-21 | Paper |
| ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329970 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2740672 | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499558 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948155 | 2000-04-10 | Paper |
| \(p\)-irreducibility of binding polynomials | 2000-01-20 | Paper |
| Nearest singular polynomials | 1999-03-22 | Paper |
| Optimal algorithm for algebraic factoring | 1997-07-07 | Paper |
