| Publication | Date of Publication | Type |
|---|
| Hermite rational function interpolation with error correction | 2022-12-21 | Paper |
| A note on sparse polynomial interpolation in Dickson polynomial basis | 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 | 2021-02-22 | Paper |
| Foreword | 2021-02-18 | Paper |
| On computing the degree of a Chebyshev polynomial from its value | 2021-02-18 | Paper |
| Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits | 2020-09-09 | Paper |
| Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction | 2020-09-09 | Paper |
| Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases | 2020-09-09 | Paper |
| Computing approximate greatest common right divisors of differential polynomials | 2020-04-01 | Paper |
| Elimination-based certificates for triangular equivalence and rank profiles | 2020-01-15 | Paper |
| Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix | 2017-05-10 | Paper |
| Numerical Sparsity Determination and Early Termination | 2017-05-10 | Paper |
| Sparse multivariate function recovery from values with noise and outlier errors | 2017-02-10 | Paper |
| Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields | 2017-02-03 | 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 |
| Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation | 2016-09-29 | Paper |
| Cleaning-up data for sparse model synthesis | 2016-09-29 | Paper |
| Numerical linear system solving with parametric entries by error correction | 2016-09-29 | Paper |
| Error-Correcting Sparse Interpolation in the Chebyshev Basis | 2016-09-29 | Paper |
| Symbolic Computation and Complexity Theory Transcript of My Talk | 2016-04-12 | Paper |
| Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations | 2016-04-12 | Paper |
| Sparse multivariate function recovery with a small number of evaluations | 2016-02-11 | Paper |
| Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm | 2015-11-26 | Paper |
| Essentially optimal interactive certificates in linear algebra | 2015-11-11 | Paper |
| Sparse polynomial interpolation codes and their decoding beyond half the minimum distance | 2015-11-11 | Paper |
| Sparse multivariate function recovery with a high error rate in the evaluations | 2015-11-11 | Paper |
| Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method | 2015-09-17 | Paper |
| On the complexity of factoring bivariate supersparse (Lacunary) polynomials | 2015-07-16 | Paper |
| Generic matrix multiplication and memory management in linBox | 2015-07-16 | Paper |
| Quadratic-time certificates in linear algebra | 2015-06-09 | Paper |
| Supersparse black box rational function interpolation | 2015-06-09 | Paper |
| Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values | 2015-03-27 | Paper |
| Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions | 2015-03-27 | Paper |
| Irreducible polynomials and barker sequences | 2015-02-24 | Paper |
| On the matrix berlekamp-massey algorithm | 2014-12-05 | Paper |
| A fraction free matrix Berlekamp/Massey algorithm | 2014-02-19 | Paper |
| The “Seven Dwarfs” of Symbolic Computation | 2012-09-14 | Paper |
| On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field | 2012-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113718 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3105511 | 2012-01-05 | Paper |
| Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients | 2011-12-21 | Paper |
| Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices | 2011-04-16 | Paper |
| Efficiently certifying non-integer powers | 2011-02-18 | Paper |
| Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares | 2010-07-30 | Paper |
| Expressing a fraction of two determinants as a determinant | 2009-01-20 | Paper |
| Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5301671 | 2009-01-20 | Paper |
| Approximate factorization of multivariate polynomials using singular value decomposition | 2008-04-23 | Paper |
| Deterministic distinct-degree factorization of polynomials over finite fields | 2007-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447170 | 2007-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660637 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660663 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660691 | 2005-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660696 | 2005-04-04 | Paper |
| Approximate factorization of multivariate polynomials via differential equations | 2005-03-14 | Paper |
| On the complexity of computing determinants | 2005-03-01 | Paper |
| Early termination in sparse interpolation algorithms | 2004-08-20 | Paper |
| Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases | 2004-08-20 | Paper |
| Computing the sign or the value of the determinant of an integer matrix, a complexity survey. | 2004-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550785 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790434 | 2003-01-28 | Paper |
| Efficient matrix preconditioners for black box linear algebra | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234262 | 2002-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234290 | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234327 | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228446 | 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 | 2001-06-21 | Paper |
| Distributed matrix-free solution of large sparse linear systems over finite fields | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234088 | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226960 | 1999-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226959 | 1999-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232504 | 1999-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227349 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227353 | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232469 | 1999-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227301 | 1999-02-23 | Paper |
| Subquadratic-time factoring of polynomials over finite fields | 1998-06-14 | Paper |
| Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems | 1995-09-07 | Paper |
| Process scheduling in DSC and the large sparse linear systems challenge | 1995-08-16 | Paper |
| Effective Noether irreducibility forms and applications | 1995-07-13 | Paper |
| Integer division in residue number systems | 1995-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279517 | 1994-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038737 | 1993-05-18 | Paper |
| On fast multiplication of polynomials over arbitrary algebras | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976505 | 1992-06-26 | Paper |
| Computing the irreducible real factors and components of an algebraic curve | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3971984 | 1992-06-25 | Paper |
| Dagwood | 1992-06-25 | Paper |
| Parallel algorithms for matrix normal forms | 1990-01-01 | Paper |
| Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators | 1990-01-01 | Paper |
| Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields | 1989-01-01 | Paper |
| Greatest common divisors of polynomials given by straight-line programs | 1988-01-01 | Paper |
| Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits | 1988-01-01 | Paper |
| Analysis of the binary complexity of asymptotically fast algorithms for linear system solving | 1988-01-01 | Paper |
| Deterministic irreducibility testing of polynomials over large finite fields | 1987-01-01 | Paper |
| Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727384 | 1986-01-01 | Paper |
| Factoring sparse multivariate polynomials | 1985-01-01 | Paper |
| Fast parallel absolute irreducibility testing | 1985-01-01 | Paper |
| Effective Hilbert irreducibility | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728091 | 1985-01-01 | Paper |
| Factorization of Multivariate Polynomials Over Finite Fields | 1985-01-01 | Paper |
| Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3743382 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3706495 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3708089 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3708879 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041304 | 1983-01-01 | Paper |
| A Generalized Class of Polynomials that are Hard to Factor | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336683 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3668871 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933737 | 1981-01-01 | Paper |
