| Publication | Date of Publication | Type |
|---|
Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
Applied and Computational Harmonic Analysis | 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
Journal of Symbolic Computation | 2024-02-05 | Paper |
A Characterization of Perfect Strategies for Mirror Games
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation | 2023-11-03 | Paper |
VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities
Journal of Systems Science and Complexity | 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
Infinite Dimensional Analysis, Quantum Probability and Related Topics | 2021-02-10 | Paper |
Lifts of non-compact convex sets and cone factorizations
Journal of Systems Science and Complexity | 2021-01-22 | Paper |
Computing real radicals and \(S\)-radicals of polynomial systems
Journal of Symbolic Computation | 2020-09-19 | Paper |
On the complexity of computing real radicals of polynomial systems
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Polynomial time interactive proofs for linear algebra with exponential matrix dimensions and scalars given by polynomial time circuits
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 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
Journal of Systems Science and Complexity | 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
IEEE Transactions on Signal Processing | 2017-09-20 | Paper |
Numerical sparsity determination and early termination
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
| Computing Simple Multiple Zeros of Polynomial Systems | 2017-03-11 | Paper |
Verified error bounds for real solutions of positive-dimensional polynomial systems
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Computing rational solutions of linear matrix inequalities
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions
Proceedings of the 2009 conference on Symbolic numeric computation | 2017-02-03 | Paper |
Optimization problems over noncompact semialgebraic sets
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Optimizing a linear function over a noncompact real algebraic variety
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation | 2016-09-29 | Paper |
Optimizing a parametric linear function over a non-compact real algebraic variety
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Pseudofactors of multivariate polynomials
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Blind image deconvolution via fast approximate GCD
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Global optimization of polynomials using generalized critical values and sums of squares
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
Journal of Symbolic Computation | 2015-08-19 | Paper |
The minimum-rank Gram matrix completion via modified fixed point continuation method
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
Semidefinite representations of noncompact convex sets
SIAM Journal on Optimization | 2015-06-02 | Paper |
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
Computing real solutions of polynomial systems via low-rank moment matrix completion
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
Verified error bounds for isolated singular solutions of polynomial systems
SIAM Journal on Numerical Analysis | 2014-11-04 | Paper |
Computing the nearest singular univariate polynomials with given root multiplicities
Theoretical Computer Science | 2013-11-29 | Paper |
Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
Theoretical Computer Science | 2013-11-29 | Paper |
Computing the multiplicity structure of an isolated singular solution: case of breadth one
Journal of Symbolic Computation | 2012-05-07 | Paper |
Computing isolated singular solutions of polynomial systems: case of breadth one
SIAM Journal on Numerical Analysis | 2012-05-04 | Paper |
Global optimization of polynomials restricted to a smooth variety using sums of squares
Journal of Symbolic Computation | 2012-05-04 | Paper |
Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
Journal of Symbolic Computation | 2012-03-22 | Paper |
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
Journal of Symbolic Computation | 2011-12-21 | Paper |
Computing rational points in convex semialgebraic sets and sum of squares decompositions
SIAM Journal on Optimization | 2011-03-21 | Paper |
Geometric involutive bases and applications to approximate commutative algebra
Texts and Monographs in Symbolic Computation | 2010-07-30 | Paper |
A fast algorithm for solving the Sylvester structured total least squares problem
Signal Processing | 2010-05-19 | Paper |
| scientific article; zbMATH DE number 5679778 (Why is no real title available?) | 2010-03-10 | Paper |
| Hybrid symbolic-numeric computation | 2009-11-11 | Paper |
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
Journal of Symbolic Computation | 2009-03-25 | Paper |
Computing the multiplicity structure from geometric involutive form
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Approximate gcds of polynomials and sparse SOS relaxations
Theoretical Computer Science | 2009-01-08 | Paper |
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation | 2008-04-23 | Paper |
A structured rank-revealing method for Sylvester matrix
Journal of Computational and Applied Mathematics | 2008-02-06 | Paper |
Structured low rank approximation of a Bezout matrix
Mathematics in Computer Science | 2008-01-22 | Paper |
| scientific article; zbMATH DE number 5168246 (Why is no real title available?) | 2007-06-28 | Paper |
| Implementation of fast low rank approximation of a Sylvester matrix | 2007-06-28 | Paper |
| scientific article; zbMATH DE number 2236717 (Why is no real title available?) | 2005-12-08 | Paper |
Computer Algebra and Geometric Algebra with Applications
Lecture Notes in Computer Science | 2005-11-29 | Paper |
| scientific article; zbMATH DE number 2151203 (Why is no real title available?) | 2005-04-04 | Paper |
Approximate factorization of multivariate polynomials via differential equations
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
Hybrid method for computing the nearest singular polynomials
Japan Journal of Industrial and Applied Mathematics | 2005-01-14 | Paper |
DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
Computer Mathematics | 2004-01-28 | Paper |
| Approximate GCD of multivariate polynomials | 2003-07-21 | Paper |
ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION
Computer Mathematics | 2002-09-04 | Paper |
| scientific article; zbMATH DE number 1741315 (Why is no real title available?) | 2002-05-15 | Paper |
Approximate GCD of multivariate polynomials
RIMS Kokyuroku | 2001-09-17 | Paper |
| scientific article; zbMATH DE number 1500718 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1428941 (Why is no real title available?) | 2000-04-10 | Paper |
\(p\)-irreducibility of binding polynomials
Computers & Mathematics with Applications | 2000-01-20 | Paper |
Nearest singular polynomials
Journal of Symbolic Computation | 1999-03-22 | Paper |
Optimal algorithm for algebraic factoring
Journal of Computer Science and Technology | 1997-07-07 | Paper |
