Mark Giesbrecht

J. Symb. Comput., 2023

2022

Efficient rational creative telescoping.

[BibT_eX]

[DOI]

J. Symb. Comput., 2022

2021

Efficient q-integer linear decomposition of multivariate polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Computing nearby non-trivial Smith forms.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Counting invariant subspaces and decompositions of additive polynomials.

[BibT_eX]

[DOI]

Konstantin Ziegler

J. Symb. Comput., 2021

Subquadratic-Time Algorithms for Normal Bases.

[BibT_eX]

[DOI]

Armin Jamshidpey

Comput. Complex., 2021

Sparse Multiplication of Multivariate Linear Differential Operators.

[BibT_eX]

[DOI]

Qiao-Long Huang

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Computing lower rank approximations of matrix polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Computing Approximate Greatest Common Right Divisors of Differential Polynomials.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Found. Comput. Math., 2020

Efficient q-Integer Linear Decomposition of Multivariate Polynomials.

[BibT_eX]

[DOI]

CoRR, 2020

Sparse multiplication for skew polynomials.

[BibT_eX]

[DOI]

Qiao-Long Huang

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

On the bit complexity of finding points in connected components of a smooth real hypersurface.

[BibT_eX]

[DOI]

Jesse Elliott

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

On Parametric Linear System Solving.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019

Quadratic Probabilistic Algorithms for Normal Bases.

[BibT_eX]

[DOI]

Armin Jamshidpey

CoRR, 2019

Quadratic-Time Algorithms for Normal Elements.

[BibT_eX]

[DOI]

Armin Jamshidpey

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Efficient Integer-Linear Decomposition of Multivariate Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2017

Computing the Nearest Rank-Deficient Matrix Polynomial.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Factoring linear partial differential operators in n variables.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

Faster sparse multivariate polynomial interpolation of straight-line programs.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

2015

On factoring differential and difference operators in n variables.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

2014

Factoring Differential Operators in n Variables.

[BibT_eX]

[DOI]

CoRR, 2014

Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices.

[BibT_eX]

[DOI]

Mustafa Elsheikh

Andy Novocin

CoRR, 2014

Relating $p$-Adic eigenvalues and the local Smith normal form.

[BibT_eX]

[DOI]

Mustafa Elsheikh

CoRR, 2014

Faster sparse polynomial interpolation of straight-line programs over finite fields.

[BibT_eX]

[DOI]

CoRR, 2014

Computing GCRDs of approximate differential polynomials.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation 2014, 2014

Factoring linear differential operators in n variables.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Sparse interpolation over finite fields via low-order roots of unity.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

Faster sparse interpolation of straight-line program

[BibT_eX]

[DOI]

CoRR, 2013

Recursive sparse interpolation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2013

Faster Sparse Interpolation of Straight-Line Programs.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

Algorithms for irreducibility testing and for constructing irreducible polynomials.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

In honour of the research and influence of Joachim von zur Gathen at 60.

[BibT_eX]

[DOI]

Daniel Panario

J. Symb. Comput., 2012

Computing Sparse Multiples of Polynomials.

[BibT_eX]

[DOI]

Hrushikesh Tilak

Algorithmica, 2012

Fast computation of Smith forms of sparse matrices over local rings.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 14th International Workshop, 2012

A Symbolic Approach to Compute a Null-Space Basis in the Projection Method.

[BibT_eX]

[DOI]

Nam Pham

Proceedings of the Computer Mathematics, 2012

2011

In honour of Keith Geddes on his 60th birthday.

[BibT_eX]

[DOI]

Stephen M. Watt

J. Symb. Comput., 2011

Detecting lacunary perfect powers and computing their roots.

[BibT_eX]

[DOI]

J. Symb. Comput., 2011

Computing the Hermite Form of a Matrix of Ore Polynomials

[BibT_eX]

[DOI]

Myung Sub Kim

CoRR, 2011

Diversification improves interpolation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Composition collisions and projective polynomials

[BibT_eX]

[DOI]

Konstantin Ziegler

CoRR, 2010

Some Results on the Functional Decomposition of Polynomials.

[BibT_eX]

[DOI]

CoRR, 2010

Abstract only: Complexity of sparsest multiple computation.

[BibT_eX]

[DOI]

Hrushikesh Tilak

ACM Commun. Comput. Algebra, 2010

Interpolation of Shifted-Lacunary Polynomials.

[BibT_eX]

[DOI]

Comput. Complex., 2010

Composition collisions and projective polynomials: statement of results.

[BibT_eX]

[DOI]

Konstantin Ziegler

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

Symbolic-numeric sparse interpolation of multivariate polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2009

On Computing the Hermite Form of a Matrix of Differential Polynomials.

[BibT_eX]

[DOI]

Myung Sub Kim

Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

Computing Popov Forms of Matrices Over PBW Extensions.

[BibT_eX]

[DOI]

Yang Zhang

Proceedings of the Computer Mathematics, 2009

2008

Detecting polynomial perfect powers (abstract only).

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

Automatic variable order selection for polynomial system solving (abstract only).

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

ACM 2007 Kanellakis Award Honours Bruno Buchberger Innovator of Automated Tools for Mathematics.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2008

On lacunary polynomial perfect powers.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

ISSAC 2007 poster abstracts.

[BibT_eX]

[DOI]

Ilias S. Kotsireas

Austin Lobo

ACM Commun. Comput. Algebra, 2007

Examining the Effects of Global Data Usage on Software Maintainability.

[BibT_eX]

[DOI]

Proceedings of the 14th Working Conference on Reverse Engineering (WCRE 2007), 2007

Faster inversion and other black box matrix computations using efficient block projections.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

2006

Solving Sparse Integer Linear Systems

[BibT_eX]

[DOI]

CoRR, 2006

A Fine-Grained Analysis of the Performance and Power Benefits of Compiler Optimizations for Embedded Devices.

[BibT_eX]

Jason W. A. Selby

Proceedings of the International Conference on Software Engineering Research and Practice & Conference on Programming Languages and Compilers, 2006

Solving sparse rational linear systems.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Probabilistically Stable Numerical Sparse Polynomial Interpolation.

[BibT_eX]

[DOI]

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005

Distributed Models of Thread Level Speculation.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

Computing Valuation Popov Forms.

[BibT_eX]

[DOI]

Yang Zhang

Proceedings of the Computational Science, 2005

2004

Efficient decomposition of separable algebras.

[BibT_eX]

[DOI]

J. Symb. Comput., 2004

2003

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases.

[BibT_eX]

[DOI]

Erich L. Kaltofen

J. Symb. Comput., 2003

Shiftless decomposition and polynomial-time rational summation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Computing Rational Forms of Integer Matrices.

[BibT_eX]

[DOI]

Arne Storjohann

J. Symb. Comput., 2002

Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm.

[BibT_eX]

[DOI]

Erich L. Kaltofen

Proceedings of the Symbolic and Algebraic Computation, 2002

2001

Fast computation of the Smith form of a sparse integer matrix.

[BibT_eX]

[DOI]

Comput. Complex., 2001

Towards factoring bivariate approximate polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Algorithms for Large Integer Matrix Problems.

[BibT_eX]

[DOI]

Michael J. Jacobson Jr.

Arne Storjohann

Proceedings of the Applied Algebra, 2001

2000

Efficient Decomposition of Associative Algebras over Finite Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

East Coast Computer Algebra Day.

[BibT_eX]

[DOI]

SIGSAM Bull., 2000

Computing the Determinant and Smith Form of an Integer Matrix.

[BibT_eX]

[DOI]

Gilles Villard

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Symbolic Computation, 2000

1999

Approximate polynomial decomposition.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998

Factoring in Skew-Polynomial Rings over Finite Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 1998

1997

Parametric linear systems: the two parameter case.

[BibT_eX]

[DOI]

David Saunders

SIGSAM Bull., 1997

Certifying inconsistency of sparse linear systems.

[BibT_eX]

[DOI]

Austin Lobo

David Saunders

SIGSAM Bull., 1997

Efficient parallel solution of sparse systems of linear diophantine equations.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, 1997

1996

Efficient Decomposition of Associative Algebras.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995

Nearly Optimal Algorithms for Canonical Matrix Forms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Fast Computation of the Smith Normal Form of an Integer Matrix.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

Run-Time Parallelization of Irregular DOACROSS Loops.

[BibT_eX]

[DOI]

V. Prasad Krothapalli

Thulasiraman Jeyaraman

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994

Fast Algorithms for Rational Forms of Integer Matrices.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

Nearly optimal algorithms for canonical matrix forms.

[BibT_eX]

[DOI]

PhD thesis, 1993

1992

Factoring in Skew-Polynomial Rings.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

Fast Algorithms for Matrix Normal Forms

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990

Constructing Normal Bases in Finite Fields.

[BibT_eX]

[DOI]