| Publication | Date of Publication | Type |
|---|
| Sparse multiplication of multivariate linear differential operators | 2025-01-20 | Paper |
| On parametric linear system solving | 2022-12-21 | Paper |
Bit complexity for computing one point in each connected component of a smooth real algebraic set
Journal of Symbolic Computation | 2022-11-21 | Paper |
Bit complexity for computing one point in each connected component of a smooth real algebraic set
(available as arXiv preprint) | 2022-07-09 | Paper |
Efficient rational creative telescoping
Journal of Symbolic Computation | 2021-09-29 | Paper |
Subquadratic-time algorithms for normal bases
Computational Complexity | 2021-07-14 | Paper |
Efficient \(q\)-integer linear decomposition of multivariate polynomials
Journal of Symbolic Computation | 2021-06-03 | Paper |
Counting invariant subspaces and decompositions of additive polynomials
Journal of Symbolic Computation | 2021-02-18 | Paper |
On the bit complexity of finding points in connected components of a smooth real hypersurface
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Sparse multiplication for skew polynomials
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation | 2021-01-22 | Paper |
Computing nearby non-trivial Smith forms
Journal of Symbolic Computation | 2020-09-19 | Paper |
Efficient integer-linear decomposition of multivariate polynomials
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Quadratic-Time Algorithms for Normal Elements
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Computing the nearest rank-deficient matrix polynomial
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
Computing nearby non-trivial Smith forms
Proceedings of the 2018 ACM 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 |
Computing lower rank approximations of matrix polynomials
Journal of Symbolic Computation | 2020-01-15 | Paper |
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Towards factoring bivariate approximate polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Symbolic-numeric sparse interpolation of multivariate polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Computing GCRDs of approximate differential polynomials
Proceedings of the 2014 Symposium on Symbolic-Numeric Computation | 2016-09-29 | Paper |
Factorizations for difference operators
Advances in Difference Equations | 2016-09-02 | Paper |
A Symbolic Approach to Compute a Null-Space Basis in the Projection Method
Computer Mathematics | 2016-04-12 | Paper |
Computing Popov forms of matrices over PBW extensions
Computer Mathematics | 2016-04-12 | Paper |
Faster sparse multivariate polynomial interpolation of straight-line programs
Journal of Symbolic Computation | 2016-02-11 | Paper |
Factoring linear partial differential operators in \(n\) variables
Journal of Symbolic Computation | 2016-02-11 | Paper |
Sparse interpolation over finite fields via low-order roots of unity
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Factoring linear differential operators in \(n\) variables
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Composition collisions and projective polynomials: statement of results
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation | 2015-09-17 | Paper |
Relating \(p\)-adic eigenvalues and the local Smith normal form
Linear Algebra and its Applications | 2015-06-18 | Paper |
Diversification improves interpolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
Fast computation of Smith forms of sparse matrices over local rings
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
ACM 2007 Kanellakis Award honours Bruno Buchberger: innovator of automated tools for mathematics
ACM Communications in Computer Algebra | 2015-02-24 | Paper |
Faster sparse interpolation of straight-line programs
Computer Algebra in Scientific Computing | 2014-07-07 | Paper |
| Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices | 2014-01-26 | Paper |
Computing the Hermite form of a matrix of Ore polynomials
Journal of Algebra | 2013-08-26 | Paper |
Computing the Hermite form of a matrix of Ore polynomials
Journal of Algebra | 2013-08-26 | Paper |
Computing sparse multiples of polynomials
Algorithmica | 2013-01-28 | Paper |
A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials
Computer Algebra in Scientific Computing | 2012-09-21 | Paper |
In honour of the research and influence of Joachim von zur Gathen at 60
Journal of Symbolic Computation | 2012-05-04 | Paper |
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation | 2011-12-07 | Paper |
In honour of Keith Geddes on his 60th birthday
Journal of Symbolic Computation | 2011-06-01 | Paper |
Interpolation of shifted-lacunary polynomials
Computational Complexity | 2011-02-18 | Paper |
Computing sparse multiples of polynomials
Algorithms and Computation | 2010-12-09 | Paper |
| scientific article; zbMATH DE number 5679783 (Why is no real title available?) | 2010-03-10 | Paper |
On Computing the Hermite Form of a Matrix of Differential Polynomials
Computer Algebra in Scientific Computing | 2009-11-10 | Paper |
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation | 2009-06-11 | Paper |
On lacunary polynomial perfect powers
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
| Faster inversion and other black box matrix computations using efficient block projections | 2009-01-20 | Paper |
| New algorithms for exact and approximate polynomial decomposition | 2007-06-28 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2151191 (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 |
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Journal of Symbolic Computation | 2004-08-20 | Paper |
| scientific article; zbMATH DE number 2081147 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079841 (Why is no real title available?) | 2004-07-30 | Paper |
Efficient decomposition of separable algebras.
Journal of Symbolic Computation | 2004-06-22 | Paper |
Computing rational forms of integer matrices
Journal of Symbolic Computation | 2003-03-23 | Paper |
| scientific article; zbMATH DE number 1860706 (Why is no real title available?) | 2003-01-28 | Paper |
Fast computation of the Smith form of a sparse integer matrix
Computational Complexity | 2002-09-22 | Paper |
Efficient decomposition of associative algebras over finite fields
Journal of Symbolic Computation | 2002-07-17 | Paper |
| scientific article; zbMATH DE number 1263430 (Why is no real title available?) | 2001-08-28 | Paper |
| Integer roots for integer-power-content calculations | 2001-07-12 | Paper |
Factoring in skew-polynomial rings over finite fields
Journal of Symbolic Computation | 2000-06-27 | Paper |
| scientific article; zbMATH DE number 1254015 (Why is no real title available?) | 1999-09-29 | Paper |
| scientific article; zbMATH DE number 1262436 (Why is no real title available?) | 1999-09-05 | Paper |
| scientific article; zbMATH DE number 1254290 (Why is no real title available?) | 1999-07-12 | Paper |
| scientific article; zbMATH DE number 1256647 (Why is no real title available?) | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 1254241 (Why is no real title available?) | 1999-06-15 | Paper |
| scientific article; zbMATH DE number 1113837 (Why is no real title available?) | 1998-05-06 | Paper |
Nearly Optimal Algorithms for Canonical Matrix Forms
SIAM Journal on Computing | 1996-06-02 | Paper |
Constructing normal bases in finite fields
Journal of Symbolic Computation | 1990-01-01 | Paper |
