| Publication | Date of Publication | Type |
|---|
| Computing higher polynomial discriminants | 2025-01-20 | Paper |
| Hermite interpolation with error correction. Fields of zero or large characteristic and large error rate | 2025-01-20 | Paper |
| The GKR protocol revisited. Nearly optimal prover-complexity for polynomial-time wiring algorithms and for primality testing in \(n^{\frac{1}{2}+o(1)}\) rounds | 2025-01-17 | Paper |
| Sparse polynomial Hermite interpolation | 2025-01-17 | Paper |
| Hermite rational function interpolation with error correction | 2022-12-21 | Paper |
A note on sparse polynomial interpolation in Dickson polynomial basis
ACM Communications in Computer Algebra | 2022-09-06 | Paper |
| A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields | 2022-04-06 | Paper |
Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Foreword
Journal of Symbolic Computation | 2021-02-18 | Paper |
On computing the degree of a Chebyshev polynomial from its value
Journal of Symbolic Computation | 2021-02-18 | Paper |
Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Early termination in parametric linear system solving and rational function vector recovery with error correction
Proceedings of the 2017 ACM on 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 |
Computing approximate greatest common right divisors of differential polynomials
Foundations of Computational Mathematics | 2020-04-01 | Paper |
Elimination-based certificates for triangular equivalence and rank profiles
Journal of Symbolic Computation | 2020-01-15 | Paper |
Numerical sparsity determination and early termination
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Sparse multivariate function recovery from values with noise and outlier errors
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 |
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
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 |
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation | 2016-09-29 | Paper |
Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation | 2016-09-29 | Paper |
Numerical linear system solving with parametric entries by error correction
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation | 2016-09-29 | Paper |
Error-correcting sparse interpolation in the Chebyshev basis
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation | 2016-09-29 | Paper |
Symbolic computation and complexity theory. Transcript of my talk
Computer Mathematics | 2016-04-12 | Paper |
Sparse polynomial interpolation by variable shift in the presence of noise and outliers in the evaluations
Computer Mathematics | 2016-04-12 | Paper |
Sparse multivariate function recovery with a small number of evaluations
Journal of Symbolic Computation | 2016-02-11 | Paper |
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Sparse multivariate function recovery with a high error rate in the evaluations
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Essentially optimal interactive certificates in linear algebra
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | 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 |
Generic matrix multiplication and memory management in LinBox
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
On the complexity of factoring bivariate supersparse (lacunary) polynomials
Proceedings of the 2005 international symposium on Symbolic and algebraic computation | 2015-07-16 | Paper |
Quadratic-time certificates in linear algebra
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
Supersparse black box rational function interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | 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 |
Irreducible polynomials and barker sequences
ACM Communications in Computer Algebra | 2015-02-24 | Paper |
On the matrix Berlekamp-Massey algorithm
ACM Transactions on Algorithms | 2014-12-05 | Paper |
A fraction free matrix Berlekamp/Massey algorithm
Linear Algebra and its Applications | 2014-02-19 | Paper |
The ``Seven Dwarfs of symbolic computation
Texts & Monographs in Symbolic Computation | 2012-09-14 | Paper |
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
Journal of Symbolic Computation | 2012-05-04 | Paper |
| Symmetric Determinantal Representation of Weakly-Skew Circuits | 2012-01-23 | Paper |
| Symmetric determinantal representation of formulas and weakly skew circuits | 2012-01-05 | 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 |
Mr. Smith goes to Las Vegas: randomized parallel computation of the Smith normal form of polynomial matrices
Lecture Notes in Computer Science | 2011-04-16 | Paper |
Efficiently certifying non-integer powers
Computational Complexity | 2011-02-18 | Paper |
Exact certification in global polynomial optimization via rationalizing sums-of-squares
Texts and Monographs in Symbolic Computation | 2010-07-30 | Paper |
Expressing a fraction of two determinants as a determinant
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 |
| On exact and approximate interpolation of sparse rational functions | 2009-01-20 | Paper |
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation | 2008-04-23 | Paper |
Deterministic distinct-degree factorization of polynomials over finite fields
Journal of Symbolic Computation | 2007-08-24 | Paper |
| scientific article; zbMATH DE number 5168246 (Why is no real title available?) | 2007-06-28 | Paper |
| scientific article; zbMATH DE number 2151173 (Why is no real title available?) | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2151196 (Why is no real title available?) | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2151228 (Why is no real title available?) | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 2151223 (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 |
On the complexity of computing determinants
Computational Complexity | 2005-03-01 | Paper |
Early termination in sparse interpolation algorithms
Journal of Symbolic Computation | 2004-08-20 | Paper |
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation | 2004-08-20 | Paper |
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
Journal of Computational and Applied Mathematics | 2004-01-26 | Paper |
| scientific article; zbMATH DE number 1795735 (Why is no real title available?) | 2003-06-11 | Paper |
| scientific article; zbMATH DE number 1860706 (Why is no real title available?) | 2003-01-28 | Paper |
Efficient matrix preconditioners for black box linear algebra
Linear Algebra and its Applications | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1263378 (Why is no real title available?) | 2002-01-29 | Paper |
| scientific article; zbMATH DE number 1263429 (Why is no real title available?) | 2002-01-27 | Paper |
| scientific article; zbMATH DE number 1263398 (Why is no real title available?) | 2002-01-27 | Paper |
| scientific article; zbMATH DE number 1256710 (Why is no real title available?) | 2002-01-21 | Paper |
Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
Journal of Symbolic Computation | 2001-06-21 | Paper |
Distributed matrix-free solution of large sparse linear systems over finite fields
Algorithmica | 2000-06-27 | Paper |
| scientific article; zbMATH DE number 1263216 (Why is no real title available?) | 1999-09-29 | Paper |
| scientific article; zbMATH DE number 1253982 (Why is no real title available?) | 1999-09-10 | Paper |
| scientific article; zbMATH DE number 1262454 (Why is no real title available?) | 1999-08-05 | Paper |
| scientific article; zbMATH DE number 1253981 (Why is no real title available?) | 1999-08-05 | Paper |
| scientific article; zbMATH DE number 1254299 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1254303 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1262424 (Why is no real title available?) | 1999-03-15 | Paper |
| scientific article; zbMATH DE number 1254255 (Why is no real title available?) | 1999-02-23 | Paper |
Subquadratic-time factoring of polynomials over finite fields
Mathematics of Computation | 1998-06-14 | Paper |
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
Mathematics of Computation | 1995-09-07 | Paper |
Process scheduling in DSC and the large sparse linear systems challenge
Journal of Symbolic Computation | 1995-08-16 | Paper |
Effective Noether irreducibility forms and applications
Journal of Computer and System Sciences | 1995-07-13 | Paper |
Integer division in residue number systems
IEEE Transactions on Computers | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 503196 (Why is no real title available?) | 1994-12-04 | Paper |
| scientific article; zbMATH DE number 177858 (Why is no real title available?) | 1993-05-18 | Paper |
On fast multiplication of polynomials over arbitrary algebras
Acta Informatica | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 19079 (Why is no real title available?) | 1992-06-26 | Paper |
Dagwood
ACM Transactions on Mathematical Software | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 15339 (Why is no real title available?) | 1992-06-25 | Paper |
Computing the irreducible real factors and components of an algebraic curve
Applicable Algebra in Engineering, Communication and Computing | 1992-06-25 | Paper |
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
Journal of Symbolic Computation | 1990-01-01 | Paper |
Parallel algorithms for matrix normal forms
Linear Algebra and its Applications | 1990-01-01 | Paper |
Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
Mathematics of Computation | 1989-01-01 | Paper |
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
SIAM Journal on Computing | 1988-01-01 | Paper |
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM | 1988-01-01 | Paper |
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
ACM SIGSAM Bulletin | 1988-01-01 | Paper |
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Deterministic irreducibility testing of polynomials over large finite fields
Journal of Symbolic Computation | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3958731 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3959562 (Why is no real title available?) | 1985-01-01 | Paper |
Factoring sparse multivariate polynomials
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
SIAM Journal on Computing | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3977110 (Why is no real title available?) | 1985-01-01 | Paper |
Effective Hilbert irreducibility
Information and Control | 1985-01-01 | Paper |
Fast parallel absolute irreducibility testing
Journal of Symbolic Computation | 1985-01-01 | Paper |
| Factorization of Multivariate Polynomials Over Finite Fields | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3934400 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3933181 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3935166 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3870586 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3834091 (Why is no real title available?) | 1983-01-01 | Paper |
A Generalized Class of Polynomials that are Hard to Factor
SIAM Journal on Computing | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3823145 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3750285 (Why is no real title available?) | 1981-01-01 | Paper |
