| Publication | Date of Publication | Type |
|---|
| A new fast root-finder for black box polynomials | 2025-01-08 | Paper |
| Nearly optimal black box polynomial root-finders | 2024-11-28 | Paper |
| Root-Squaring for Root-Finding | 2024-05-03 | Paper |
| Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues | 2023-10-04 | Paper |
| Accelerated subdivision for clustering roots of polynomials given by evaluation oracles | 2022-12-21 | Paper |
| Faster numerical univariate polynomial root-finding by means of subdivision iterations | 2022-12-21 | Paper |
| Acceleration of subdivision root-finding for sparse polynomials | 2022-12-21 | Paper |
| New Progress in Classic Area: Polynomial Root-squaring and Root-finding | 2022-05-30 | Paper |
| Root radii and subdivision for polynomial root-finding | 2022-03-24 | Paper |
| CUR LRA at Sublinear Cost Based on Volume Maximization | 2021-12-08 | Paper |
| New Practical Advances in Polynomial Root Clustering | 2021-12-08 | Paper |
| New progress in univariate polynomial root finding | 2021-01-22 | Paper |
| Root-finding with implicit deflation | 2020-04-29 | Paper |
| Old and new nearly optimal polynomial root-finders | 2020-04-29 | Paper |
| New practical advances in polynomial root clustering | 2019-11-15 | Paper |
| CUR Low Rank Approximation at Deterministic Sublinear Cost | 2019-07-21 | Paper |
| CUR Low Rank Approximation of a Matrix at Sublinear Cost | 2019-06-10 | Paper |
| Low Rank Approximation at Sublinear Cost | 2019-06-10 | Paper |
| More on low rank approximation of a matrix | 2019-06-10 | Paper |
| Superfast Approximate Linear Least Squares Solution of a Highly Overdetermined Linear System of Equations | 2019-06-09 | Paper |
| Some Recent and New Techniques for Superfast (Sublinear Cost) Low Rank Approximation | 2018-12-29 | Paper |
| Implementation of a near-optimal complex root clustering algorithm | 2018-08-17 | Paper |
| Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system | 2018-07-09 | Paper |
| Fast matrix multiplication and its algebraic neighbourhood | 2018-04-06 | Paper |
| Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation | 2018-04-05 | Paper |
| Superfast CUR Matrix Algorithms, Their Pre-Processing and Extensions | 2017-10-22 | Paper |
| Fast approximate computations with Cauchy matrices and polynomials | 2017-07-03 | Paper |
| Nearly optimal computations with structured matrices | 2017-06-13 | Paper |
| Accelerated approximation of the complex roots and factors of a univariate polynomial | 2017-06-13 | Paper |
| On the boolean complexity of real root refinement | 2017-02-10 | Paper |
| Univariate polynomials | 2017-02-03 | Paper |
| Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials | 2017-02-03 | Paper |
| Superfast Low-Rank Approximation and Least Squares Regression | 2016-11-02 | Paper |
| Nearly optimal computations with structured matrices | 2016-09-29 | Paper |
| Univariate polynomial root-finding by arming with constraints | 2016-09-29 | Paper |
| Accelerated approximation of the complex roots of a univariate polynomial | 2016-09-29 | Paper |
| Fast Derandomized Low-rank Approximation and Extensions | 2016-07-19 | Paper |
| New Results on CGR/CUR Approximation of a Matrix | 2016-07-16 | Paper |
| How Bad Are Vandermonde Matrices? | 2016-06-23 | Paper |
| Enhancing the Power of Cardinal's Algorithm | 2016-01-28 | Paper |
| Nearly optimal refinement of real roots of a univariate polynomial | 2015-12-08 | Paper |
| Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding | 2015-11-26 | Paper |
| Real and complex polynomial root-finding with eigen-solving and preprocessing | 2015-09-17 | Paper |
| Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation | 2015-06-18 | Paper |
| Randomized preconditioning of the MBA algorithm | 2015-06-09 | Paper |
| Transformations of matrix structures work again | 2014-11-17 | Paper |
| Better Late Than Never: Filling a Void in the History of Fast Matrix Multiplication and Tensor Decompositions | 2014-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921779 | 2014-10-13 | Paper |
| A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields | 2014-09-08 | Paper |
| Real Polynomial Root-Finding by Means of Matrix and Polynomial Iterations | 2014-09-08 | Paper |
| Polynomial Evaluation and Interpolation and Transformations of Matrix Structures | 2014-07-07 | Paper |
| Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions | 2014-06-24 | Paper |
| Root-squaring with DPR1 matrices | 2014-06-06 | Paper |
| Novel Approach to Real Polynomial Root-finding and Matrix Eigen-solving | 2014-04-27 | Paper |
| Computational complexity of computing polynomials over the fields of real and complex numbers | 2014-03-14 | Paper |
| Supporting GENP with Random Multipliers | 2013-12-13 | Paper |
| New Structured Matrix Methods for Real and Complex Polynomial Root-finding | 2013-11-23 | Paper |
| Transformations of Matrix Structures Work Again II | 2013-11-15 | Paper |
| Estimating the Norms of Random Circulant and Toeplitz Matrices and Their Inverses | 2013-11-15 | Paper |
| Randomized preprocessing versus pivoting | 2013-03-06 | Paper |
| Condition Estimation by Means of the Power Method | 2012-12-18 | Paper |
| Condition Numbers of Random Toeplitz and Circulant Matrices | 2012-12-18 | Paper |
| More on the Power of Randomized Matrix Computations | 2012-12-18 | Paper |
| Solving linear systems of equations with randomization, augmentation and aggregation | 2012-10-10 | Paper |
| Real and Complex Polynomial Root-Finding by Means of Eigen-Solving | 2012-09-21 | Paper |
| Root-Refining for a Polynomial Equation | 2012-09-21 | Paper |
| A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak | 2012-05-30 | Paper |
| Efficient polynomial root-refiners: a survey and new record efficiency estimates | 2012-05-28 | Paper |
| Root-finding by expansion with independent constraints | 2012-02-21 | Paper |
| Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization | 2012-02-05 | Paper |
| New progress in real and complex polynomial root-finding | 2011-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086667 | 2011-03-30 | Paper |
| Matrix computations and polynomial root-finding with preprocessing | 2011-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3162305 | 2010-10-19 | Paper |
| Advancing Matrix Computations with Randomized Preprocessing | 2010-06-22 | Paper |
| Randomized preprocessing of homogeneous linear systems of equations | 2010-05-11 | Paper |
| Additive preconditioning for matrix computations | 2010-02-09 | Paper |
| A new error-free floating-point summation algorithm | 2009-07-13 | Paper |
| New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration | 2009-03-10 | Paper |
| Schur aggregation for linear systems and determinants | 2009-01-08 | Paper |
| Additive preconditioning, eigenspaces, and the inverse iteration | 2008-12-02 | Paper |
| Eigen-solving via reduction to DPR1 matrices | 2008-10-22 | Paper |
| Degeneration of structured integer matrices modulo an integer | 2008-10-06 | Paper |
| Fast rectangular matrix multiplication and some applications | 2008-06-25 | Paper |
| Additive Preconditioning for Matrix Computations | 2008-06-05 | Paper |
| Additive preconditioning and aggregation in matrix computations | 2008-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447179 | 2007-06-28 | Paper |
| Coefficient-free adaptations of polynomial root-finders | 2006-02-02 | Paper |
| Homotopic residual correction processes | 2005-12-12 | Paper |
| The amended DSeSC power method for polynomial root-finding | 2005-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5460924 | 2005-07-20 | Paper |
| Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations | 2005-06-13 | Paper |
| Improved initialization of the accelerated and robust QR-like polynomial root-finding | 2005-04-15 | Paper |
| Acceleration of Euclidean algorithm and extensions | 2005-04-04 | Paper |
| Newton-like iteration based on a cubic polynomial for structured matrices | 2005-03-15 | Paper |
| An efficient solution for Cauchy-like systems of linear equations | 2005-03-08 | Paper |
| Improved algorithms for computing determinants and resultants | 2005-02-22 | Paper |
| On Rational Number Reconstruction and Approximation | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3156423 | 2005-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736841 | 2004-08-11 | Paper |
| Matrix structure and loss-resilient encoding/decoding | 2004-08-06 | Paper |
| Iterative inversion of structured matrices | 2004-08-06 | Paper |
| Inverse power and Durand-Kerner iterations for univariate polynomial root-finding | 2004-06-15 | Paper |
| Inversion of Displacement Operators | 2004-01-18 | Paper |
| Accelerated Solution of Multivariate Polynomial Systems of Equations | 2003-06-19 | Paper |
| Acceleration of Euclidean Algorithm and Rational Number Reconstruction | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789200 | 2003-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789203 | 2003-04-23 | Paper |
| Computation of approximate polynomial GCDs and an extension | 2003-01-14 | Paper |
| Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding | 2002-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552349 | 2002-09-02 | Paper |
| Asymptotic acceleration of solving multivariate polynomial systems of equations | 2002-08-01 | Paper |
| Symbolic and numeric methods for exploiting structure in constructing resultant matrices | 2002-06-11 | Paper |
| Structured matrices and Newton's iteration: unified approach | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2724557 | 2002-02-26 | Paper |
| New techniques for the computation of linear recurrence coefficients | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228446 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760974 | 2001-12-17 | Paper |
| Computation of a specified root of a polynomial system of equations using eigenvectors | 2001-12-03 | Paper |
| A new proximity test for polynomial zeros | 2001-11-12 | Paper |
| Superfast algorithms for Cauchy-like matrix computations and extensions | 2001-10-24 | Paper |
| Certification of numerical computation of the sign of the determinant of a matrix | 2001-08-09 | Paper |
| Multivariate polynomials, duality, and structured matrices | 2001-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526980 | 2001-02-28 | Paper |
| Bisection acceleration for the symmetric tridiagonal eigenvalue problem | 2000-10-22 | Paper |
| Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228445 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230334 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952723 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938647 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250166 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4257503 | 2000-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252352 | 2000-01-11 | Paper |
| Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. | 2000-01-01 | Paper |
| Lifting/descending processes for polynomial zeros. | 2000-01-01 | Paper |
| Single precision computation of the sign of algebraic predicates | 1999-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234196 | 1999-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226998 | 1999-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336109 | 1999-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234125 | 1999-06-29 | Paper |
| New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set | 1999-06-07 | Paper |
| Modular arithmetic for linear algebra computations in the real field | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232507 | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226961 | 1999-02-23 | Paper |
| Fast rectangular matrix multiplication and applications | 1999-02-14 | Paper |
| Multidimensional structured matrices and polynomial systems | 1999-01-19 | Paper |
| Sign determination in residue number systems | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395357 | 1998-10-05 | Paper |
| Planar Integer Linear Programming is NC Equivalent to Euclidean GCD | 1998-09-20 | Paper |
| Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real | 1998-09-20 | Paper |
| Techniques for exploiting structure in matrix formulae of the sparse resultant | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365459 | 1998-07-01 | Paper |
| Newton's iteration for inversion of Cauchy-like and other structured matrices | 1998-03-05 | Paper |
| Parallel computation of polynomial GCD and some related parallel computations over abstract fields | 1997-09-10 | Paper |
| Efficient parallel algorithms for computing all pair shortest paths in directed graphs | 1997-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128885 | 1997-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128928 | 1997-07-13 | Paper |
| Solving a Polynomial Equation: Some History and Recent Progress | 1997-06-12 | Paper |
| Optimal and nearly optimal algorithms for approximating polynomial zeros | 1997-03-25 | Paper |
| Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors | 1997-03-23 | Paper |
| On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors | 1997-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717956 | 1997-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875226 | 1996-09-04 | Paper |
| Weyl's quadtree algorithm for the unsymmetric eigenvalue problem | 1996-03-14 | Paper |
| On parallel computations with banded matrices | 1996-02-22 | Paper |
| Computing \(x^ m\mod p(x)\) and an application to splitting a polynomial into factors over a fixed disc | 1996-01-01 | Paper |
| Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant | 1995-12-12 | Paper |
| A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers | 1995-11-26 | Paper |
| Work-Preserving Speed-Up of Parallel Matrix Computations | 1995-11-01 | Paper |
| Parallel computation of a Krylov matrix for a sparse and structured input | 1995-10-30 | Paper |
| New Resultant Inequalities and Complex Polynomial Factorization | 1995-10-23 | Paper |
| An algebraic approach to approximate evaluation of a polynomial on a set of real points | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763399 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327499 | 1995-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327512 | 1995-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327513 | 1995-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327523 | 1995-04-09 | Paper |
| Simple multivariate polynomial multiplication | 1995-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314299 | 1994-11-21 | Paper |
| Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series | 1994-09-22 | Paper |
| A new algorithm for the symmetric tridiagonal eigenvalue problem | 1994-08-31 | Paper |
| Improved parallel solution of a triangular linear system | 1994-08-08 | Paper |
| Fast and Efficient Parallel Solution of Sparse Linear Systems | 1994-06-23 | Paper |
| Generalized compact multi-grid | 1993-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138975 | 1993-10-20 | Paper |
| Improved Parallel Polynomial Division | 1993-09-01 | Paper |
| Improved parallel computations with Toeplitz-like and Hankel-like matrices | 1993-08-25 | Paper |
| A new approach to fast polynomial interpolation and multipoint evaluation | 1993-07-21 | Paper |
| Binary segmentation for matrix and vector operations | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036590 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038722 | 1993-05-18 | Paper |
| Decreasing the Displacement Rank of a Matrix | 1993-05-16 | Paper |
| Polynomial division with a remainder by means of evaluation and interpolation | 1993-04-01 | Paper |
| Parametrization of Newton's iteration for computations with structured matrices and applications | 1993-04-01 | Paper |
| A fast, preconditioned conjugate gradient Toeplitz solver | 1993-04-01 | Paper |
| Improving the solution of the symmetric eigenvalue problem and an extension | 1993-04-01 | Paper |
| Complexity of Computations with Matrices and Polynomials | 1993-01-16 | Paper |
| Practical improvement of the divide-and-conquer eigenvalue algorithms | 1992-09-27 | Paper |
| Parallel solution of Toeplitzlike linear systems | 1992-09-26 | Paper |
| On practical algorithms for accelerated matrix multiplication | 1992-06-28 | Paper |
| The parallel computation of minimum cost paths in graphs by stream contraction | 1992-06-28 | Paper |
| On the evaluation of the eigenvalues of a banded Toeplitz block matrix | 1992-06-28 | Paper |
| Extended concept of significant digits and lower precision computations | 1992-06-28 | Paper |
| Compact Multigrid | 1992-06-28 | Paper |
| An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361793 | 1991-01-01 | Paper |
| Estimating the extremal eigenvalues of a symmetric matrix | 1990-01-01 | Paper |
| The modified barrier function method for linear programming and its extensions | 1990-01-01 | Paper |
| The bit-complexity of discrete solutions of partial differential equations: Compact multigrid | 1990-01-01 | Paper |
| On Computations with Dense Structured Matrices | 1990-01-01 | Paper |
| Fast evaluation and interpolation at the Chebyshev sets of points | 1989-01-01 | Paper |
| Parallel evaluation of the determinant and of the inverse of a matrix | 1989-01-01 | Paper |
| Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros | 1989-01-01 | Paper |
| Fast and efficient solution of path algebra problems | 1989-01-01 | Paper |
| Fast and efficient parallel solution of dense linear systems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833499 | 1989-01-01 | Paper |
| Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations | 1988-01-01 | Paper |
| Improved processor bounds for combinatorial problems in RNC | 1988-01-01 | Paper |
| Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices | 1988-01-01 | Paper |
| Algebraic complexity of computing polynomial zeros | 1987-01-01 | Paper |
| Sequential and parallel complexity of approximate evaluation of polynomial zeros | 1987-01-01 | Paper |
| Complexity of parallel matrix computations | 1987-01-01 | Paper |
| A logarithmic Boolean time algorithm for parallel polynomial division | 1987-01-01 | Paper |
| Fast parallel algorithms for polynomial division over an arbitrary field of constants | 1986-01-01 | Paper |
| The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms | 1986-01-01 | Paper |
| Polynomial division and its computational complexity | 1986-01-01 | Paper |
| Parallel nested dissection for path algebra computations | 1986-01-01 | Paper |
| Efficient parallel linear programming | 1986-01-01 | Paper |
| Fast and efficient linear programming and linear least-squares computations | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727383 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734987 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761693 | 1986-01-01 | Paper |
| On the complexity of a pivot step of the revised simplex algorithm | 1985-01-01 | Paper |
| Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power | 1985-01-01 | Paper |
| On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems | 1985-01-01 | Paper |
| The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms | 1985-01-01 | Paper |
| Fast finite methods for a system of linear inequalities | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698314 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732964 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5185922 | 1984-01-01 | Paper |
| How to multiply matrices faster | 1984-01-01 | Paper |
| The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations | 1984-01-01 | Paper |
| How Can We Speed Up Matrix Multiplication? | 1984-01-01 | Paper |
| The additive and logical complexities of linear and bilinear arithmetic algorithms | 1983-01-01 | Paper |
| The projective power method for the algebraic eigenvalue problem | 1983-01-01 | Paper |
| Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication | 1982-01-01 | Paper |
| The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic | 1982-01-01 | Paper |
| Fast matrix multiplication without APA-algorithms | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323263 | 1982-01-01 | Paper |
| The bit-operation complexity of matrix multiplication and of all pair shortest path problem | 1981-01-01 | Paper |
| New combinations of methods for the acceleration of matrix multiplication | 1981-01-01 | Paper |
| The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities | 1981-01-01 | Paper |
| The bit-complexity of arithmetic algorithms | 1981-01-01 | Paper |
| A unified approach to the analysis of bilinear algorithms | 1981-01-01 | Paper |
| Methods of aggregation | 1980-01-01 | Paper |
| New Fast Algorithms for Matrix Operations | 1980-01-01 | Paper |
| Convolution of vectors over the real field of constants by evaluation-interpolation algorithms | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5676984 | 1972-01-01 | Paper |
| On simultaneous evaluation of several polynomials of low degree (two to five) | 1968-01-01 | Paper |
| On simultaneous evaluation of several polynomials of low degree (two to five) | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5560620 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5538004 | 1965-01-01 | Paper |
| Schemes using preliminary treatment of coefficients for polynomial calculation. A program for automatic determination of parameters | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5510305 | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5724925 | 1961-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3280358 | 1959-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5512301 | 1958-01-01 | Paper |
| Accurate Low Rank Approximation at a Low Computational Cost | N/A | Paper |
| Good News for Polynomial Root-finding | N/A | Paper |
