Constructing Normal Bases in Finite Fields. - Joachim von zur Gathen; Mark Giesbrecht (J. Symb. Comput., 1990)

Fast Algorithms for Matrix Normal Forms - Mark Giesbrecht (FOCS, 1992)

Factoring in Skew-Polynomial Rings. - Mark Giesbrecht (LATIN, 1992)

Nearly optimal algorithms for canonical matrix forms. - Mark Giesbrecht (1993)

Fast Algorithms for Rational Forms of Integer Matrices. - Mark Giesbrecht (ISSAC, 1994)

Run-Time Parallelization of Irregular DOACROSS Loops. - V. Prasad Krothapalli; Thulasiraman Jeyaraman; Mark Giesbrecht (IRREGULAR, 1995)

Fast Computation of the Smith Normal Form of an Integer Matrix. - Mark Giesbrecht (ISSAC, 1995)

Nearly Optimal Algorithms for Canonical Matrix Forms. - Mark Giesbrecht (SIAM J. Comput., 1995)

Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. - Mark Giesbrecht (ANTS, 1996)

Efficient Decomposition of Associative Algebras. - Wayne Eberly; Mark Giesbrecht (ISSAC, 1996)

Efficient parallel solution of sparse systems of linear diophantine equations. - Mark Giesbrecht (PASCO, 1997)

Certifying inconsistency of sparse linear systems. - Mark Giesbrecht; Austin Lobo; David Saunders 002 (SIGSAM Bull., 1997)

Parametric linear systems: the two parameter case. - Mark Giesbrecht; David Saunders 002 (SIGSAM Bull., 1997)

Factoring in Skew-Polynomial Rings over Finite Fields. - Mark Giesbrecht (J. Symb. Comput., 1998)

Approximate polynomial decomposition. - Robert M. Corless; Mark Giesbrecht; David J. Jeffrey; Stephen M. Watt (ISSAC, 1999)

Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra. - Robert M. Corless; Mark Giesbrecht; Ilias S. Kotsireas; Stephen M. Watt (AISC, 2000)

Computing the Determinant and Smith Form of an Integer Matrix. - Wayne Eberly; Mark Giesbrecht; Gilles Villard (FOCS, 2000)

East Coast Computer Algebra Day. - Mark Giesbrecht (SIGSAM Bull., 2000)

Efficient Decomposition of Associative Algebras over Finite Fields. - Wayne Eberly; Mark Giesbrecht (J. Symb. Comput., 2000)

Algorithms for Large Integer Matrix Problems. - Mark Giesbrecht; Michael J. Jacobson Jr.; Arne Storjohann (AAECC, 2001)

Towards factoring bivariate approximate polynomials. - Robert M. Corless; Mark Giesbrecht; Mark van Hoeij; Ilias S. Kotsireas; Stephen M. Watt (ISSAC, 2001)

Fast computation of the Smith form of a sparse integer matrix. - Mark Giesbrecht (Comput. Complex., 2001)

Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. - Mark Giesbrecht; Erich L. Kaltofen; Wen-shin Lee (ISSAC, 2002)

Computing Rational Forms of Integer Matrices. - Mark Giesbrecht; Arne Storjohann (J. Symb. Comput., 2002)

Shiftless decomposition and polynomial-time rational summation. - Jürgen Gerhard; Mark Giesbrecht; Arne Storjohann; Eugene V. Zima (ISSAC, 2003)

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. - Mark Giesbrecht; Erich L. Kaltofen; Wen-shin Lee (J. Symb. Comput., 2003)

Efficient decomposition of separable algebras. - Wayne Eberly; Mark Giesbrecht (J. Symb. Comput., 2004)

Computing Valuation Popov Forms. - Mark Giesbrecht; George Labahn; Yang Zhang (International Conference on Computational Science (3), 2005)

Distributed Models of Thread Level Speculation. - Cosmin E. Oancea; Jason W. A. Selby; Mark Giesbrecht; Stephen M. Watt (PDPTA, 2005)

Probabilistically Stable Numerical Sparse Polynomial Interpolation. - Mark Giesbrecht; George Labahn; Wen-shin Lee (Challenges in Symbolic Computation Software, 2006)

Solving sparse rational linear systems. - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (ISSAC, 2006)

A Fine-Grained Analysis of the Performance and Power Benefits of Compiler Optimizations for Embedded Devices. - Jason W. A. Selby; Mark Giesbrecht (Software Engineering Research and Practice, 2006)

Solving Sparse Integer Linear Systems - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (CoRR, 2006)

Faster inversion and other black box matrix computations using efficient block projections. - Wayne Eberly; Mark Giesbrecht; Pascal Giorgi; Arne Storjohann; Gilles Villard (ISSAC, 2007)

Examining the Effects of Global Data Usage on Software Maintainability. - Jason W. A. Selby; Fraser P. Ruffell; Mark Giesbrecht; Michael W. Godfrey (WCRE, 2007)

ISSAC 2007 poster abstracts. - Mark Giesbrecht; Ilias S. Kotsireas; Austin Lobo (ACM Commun. Comput. Algebra, 2007)

On lacunary polynomial perfect powers. - Mark Giesbrecht; Daniel S. Roche (ISSAC, 2008)

ACM 2007 Kanellakis Award Honours Bruno Buchberger Innovator of Automated Tools for Mathematics. - Mark Giesbrecht (ACM Commun. Comput. Algebra, 2008)

Automatic variable order selection for polynomial system solving (abstract only). - John P. May; Mark Giesbrecht; Daniel S. Roche; Marc Moreno Maza; Yuzhen Xie (ACM Commun. Comput. Algebra, 2008)

Detecting polynomial perfect powers (abstract only). - Daniel S. Roche; Mark Giesbrecht (ACM Commun. Comput. Algebra, 2008)

Computing Popov Forms of Matrices Over PBW Extensions. - Mark Giesbrecht; George Labahn; Yang Zhang (ASCM, 2009)

On Computing the Hermite Form of a Matrix of Differential Polynomials. - Mark Giesbrecht; Myung Sub Kim (CASC, 2009)

Symbolic-numeric sparse interpolation of multivariate polynomials. - Mark Giesbrecht; George Labahn; Wen-shin Lee (J. Symb. Comput., 2009)

Composition collisions and projective polynomials: statement of results. - Joachim von zur Gathen; Mark Giesbrecht; Konstantin Ziegler (ISSAC, 2010)

Interpolation of Shifted-Lacunary Polynomials. - Mark Giesbrecht; Daniel S. Roche (Comput. Complex., 2010)

Abstract only: Complexity of sparsest multiple computation. - Mark Giesbrecht; Daniel S. Roche; Hrushikesh Tilak (ACM Commun. Comput. Algebra, 2010)

Some Results on the Functional Decomposition of Polynomials. - Mark Giesbrecht (CoRR, 2010)

Composition collisions and projective polynomials - Joachim von zur Gathen; Mark Giesbrecht; Konstantin Ziegler (CoRR, 2010)

Diversification improves interpolation. - Mark Giesbrecht; Daniel S. Roche (ISSAC, 2011)

Computing the Hermite Form of a Matrix of Ore Polynomials - Mark Giesbrecht; Myung Sub Kim (CoRR, 2011)

Detecting lacunary perfect powers and computing their roots. - Mark Giesbrecht; Daniel S. Roche (J. Symb. Comput., 2011)

In honour of Keith Geddes on his 60th birthday. - Mark Giesbrecht; Stephen M. Watt (J. Symb. Comput., 2011)

A Symbolic Approach to Compute a Null-Space Basis in the Projection Method. - Mark Giesbrecht; Nam Pham (ASCM, 2012)

A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials. - Mark Giesbrecht; Albert Heinle (CASC, 2012)

Fast computation of Smith forms of sparse matrices over local rings. - Mustafa Elsheikh; Mark Giesbrecht; Andy Novocin; B. David Saunders (ISSAC, 2012)

Computing Sparse Multiples of Polynomials. - Mark Giesbrecht; Daniel S. Roche; Hrushikesh Tilak (Algorithmica, 2012)

In honour of the research and influence of Joachim von zur Gathen at 60. - Mark Giesbrecht; Daniel Panario (J. Symb. Comput., 2012)

Algorithms for irreducibility testing and for constructing irreducible polynomials. - Mark Giesbrecht (Handbook of Finite Fields, 2013)

Faster Sparse Interpolation of Straight-Line Programs. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (CASC, 2013)

Recursive sparse interpolation. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (ACM Commun. Comput. Algebra, 2013)

Faster sparse interpolation of straight-line program - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (CoRR, 2013)

Sparse interpolation over finite fields via low-order roots of unity. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (ISSAC, 2014)

Factoring linear differential operators in n variables. - Mark Giesbrecht; Albert Heinle; Viktor Levandovskyy (ISSAC, 2014)

Computing GCRDs of approximate differential polynomials. - Mark Giesbrecht; Joseph Haraldson (SNC, 2014)

Faster sparse polynomial interpolation of straight-line programs over finite fields. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (CoRR, 2014)

Relating $p$-Adic eigenvalues and the local Smith normal form. - Mustafa Elsheikh; Mark Giesbrecht (CoRR, 2014)

Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices. - Mustafa Elsheikh; Andy Novocin; Mark Giesbrecht (CoRR, 2014)

Factoring Differential Operators in n Variables. - Mark Giesbrecht; Albert Heinle; Viktor Levandovskyy (CoRR, 2014)

On factoring differential and difference operators in n variables. - Mark Giesbrecht; Albert Heinle; Viktor Levandovskyy (ACM Commun. Comput. Algebra, 2015)

Faster sparse multivariate polynomial interpolation of straight-line programs. - Andrew Arnold; Mark Giesbrecht; Daniel S. Roche (J. Symb. Comput., 2016)

Factoring linear partial differential operators in n variables. - Mark Giesbrecht; Albert Heinle; Viktor Levandovskyy (J. Symb. Comput., 2016)

Computing the Nearest Rank-Deficient Matrix Polynomial. - Mark Giesbrecht; Joseph Haraldson; George Labahn (ISSAC, 2017)

Efficient Integer-Linear Decomposition of Multivariate Polynomials. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene V. Zima (ISSAC, 2019)

Quadratic-Time Algorithms for Normal Elements. - Mark Giesbrecht; Armin Jamshidpey; Éric Schost (ISSAC, 2019)

Quadratic Probabilistic Algorithms for Normal Bases. - Mark Giesbrecht; Armin Jamshidpey; Éric Schost (CoRR, 2019)

On Parametric Linear System Solving. - Robert M. Corless; Mark Giesbrecht; Leili Rafiee Sevyeri; B. David Saunders (CASC, 2020)

On the bit complexity of finding points in connected components of a smooth real hypersurface. - Jesse Elliott; Mark Giesbrecht; Éric Schost (ISSAC, 2020)

Sparse multiplication for skew polynomials. - Mark Giesbrecht; Qiao-Long Huang; Éric Schost (ISSAC, 2020)

Efficient q-Integer Linear Decomposition of Multivariate Polynomials. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene V. Zima (CoRR, 2020)

Computing Approximate Greatest Common Right Divisors of Differential Polynomials. - Mark Giesbrecht; Joseph Haraldson; Erich L. Kaltofen (Found. Comput. Math., 2020)

Computing lower rank approximations of matrix polynomials. - Mark Giesbrecht; Joseph Haraldson; George Labahn (J. Symb. Comput., 2020)

Sparse Multiplication of Multivariate Linear Differential Operators. - Mark Giesbrecht; Qiao-Long Huang; Éric Schost (ISSAC, 2021)

Subquadratic-Time Algorithms for Normal Bases. - Mark Giesbrecht; Armin Jamshidpey; Éric Schost (Comput. Complex., 2021)

Counting invariant subspaces and decompositions of additive polynomials. - Joachim von zur Gathen; Mark Giesbrecht; Konstantin Ziegler (J. Symb. Comput., 2021)

Computing nearby non-trivial Smith forms. - Mark Giesbrecht; Joseph Haraldson; George Labahn (J. Symb. Comput., 2021)

Efficient q-integer linear decomposition of multivariate polynomials. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene V. Zima (J. Symb. Comput., 2021)

Efficient rational creative telescoping. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene Zima (J. Symb. Comput., 2022)

Bit complexity for computing one point in each connected component of a smooth real algebraic set. - Jesse Elliott; Mark Giesbrecht; Éric Schost (J. Symb. Comput., 2023)

Functional decomposition of sparse polynomials (short talk abstract). - Mark Giesbrecht (SCSS (Work in Progress), 2024)