Mark Giesbrecht

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 28

Top Venues

CoRR

ISSAC

J. Symb. Comput.

ACM Commun. Comput. Algebra

Publications

Jesse Elliott, Mark Giesbrecht, Éric Schost
Bit complexity for computing one point in each connected component of a smooth real algebraic set. J. Symb. Comput. 116 (2023)
Jesse Elliott, Mark Giesbrecht, Éric Schost
Bit complexity for computing one point in each connected component of a smooth real algebraic set. CoRR (2022)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima
Efficient rational creative telescoping. J. Symb. Comput. 109 (2022)
Mark Giesbrecht, Qiao-Long Huang, Éric Schost
Sparse Multiplication of Multivariate Linear Differential Operators. ISSAC (2021)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
-integer linear decomposition of multivariate polynomials. J. Symb. Comput. 107 (2021)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Subquadratic-Time Algorithms for Normal Bases. Comput. Complex. 30 (1) (2021)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing nearby non-trivial Smith forms. J. Symb. Comput. 102 (2021)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Counting invariant subspaces and decompositions of additive polynomials. J. Symb. Comput. 105 (2021)
Jesse Elliott, Mark Giesbrecht, Éric Schost
On the bit complexity of finding points in connected components of a smooth real hypersurface. ISSAC (2020)
Mark Giesbrecht, Joseph Haraldson, Erich Kaltofen
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Found. Comput. Math. 20 (2) (2020)
Mark Giesbrecht, Qiao-Long Huang, Éric Schost
Sparse multiplication for skew polynomials. ISSAC (2020)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing lower rank approximations of matrix polynomials. J. Symb. Comput. 98 (2020)
Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri, B. David Saunders
On Parametric Linear System Solving. CASC (2020)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
Efficient q-Integer Linear Decomposition of Multivariate Polynomials. CoRR (2020)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Subquadratic-Time Algorithms for Normal Bases. CoRR (2020)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
Efficient Integer-Linear Decomposition of Multivariate Polynomials. ISSAC (2019)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Quadratic-Time Algorithms for Normal Elements. ISSAC (2019)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
Efficient Rational Creative Telescoping. CoRR (2019)
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
Quadratic Probabilistic Algorithms for Normal Bases. CoRR (2019)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Counting invariant subspaces and decompositions of additive polynomials. CoRR (2019)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing Nearby Non-trivial Smith Forms. ISSAC (2018)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing Nearby Non-trivial Smith Forms. CoRR (2018)
Mark Giesbrecht, Joseph Haraldson, Erich Kaltofen
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. CoRR (2017)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing the Nearest Rank-Deficient Matrix Polynomial. ISSAC (2017)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing Lower Rank Approximations of Matrix Polynomials. CoRR (2017)
Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy
Factoring linear partial differential operators in n variables. J. Symb. Comput. 75 (2016)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. 75 (2016)
Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy
variables. ACM Commun. Comput. Algebra 49 (1) (2015)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Sparse interpolation over finite fields via low-order roots of unity. ISSAC (2014)
Mark Giesbrecht, Joseph Haraldson
Computing GCRDs of Approximate Differential Polynomials. CoRR (2014)
Mark Giesbrecht, Joseph Haraldson
Computing GCRDs of approximate differential polynomials. SNC (2014)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs. CoRR (2014)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR (2014)
Mustafa Elsheikh, Mark Giesbrecht
Relating $p$-Adic eigenvalues and the local Smith normal form. CoRR (2014)
Mustafa Elsheikh, Andy Novocin, Mark Giesbrecht
Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices. CoRR (2014)
Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy
variables. ISSAC (2014)
Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy
Factoring Differential Operators in n Variables. CoRR (2014)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster Sparse Interpolation of Straight-Line Programs. CASC (2013)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Recursive sparse interpolation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse interpolation of straight-line program CoRR (2013)
Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings CoRR (2012)
Mark Giesbrecht, Daniel Panario
In honour of the research and influence of Joachim von zur Gathen at 60. J. Symb. Comput. 47 (4) (2012)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing Sparse Multiples of Polynomials. Algorithmica 64 (3) (2012)
Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders
Fast computation of Smith forms of sparse matrices over local rings. ISSAC (2012)
Mark Giesbrecht, Nam Pham
A Symbolic Approach to Compute a Null-Space Basis in the Projection Method. ASCM (2012)
Mark Giesbrecht, Albert Heinle
A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials. CASC (2012)
Mark Giesbrecht, Daniel S. Roche
Diversification improves interpolation CoRR (2011)
Mark Giesbrecht, Myung Sub Kim
Computing the Hermite Form of a Matrix of Ore Polynomials CoRR (2011)
Mark Giesbrecht, Stephen M. Watt
In honour of Keith Geddes on his 60th birthday. J. Symb. Comput. 46 (7) (2011)
Mark Giesbrecht, Daniel S. Roche
Diversification improves interpolation. ISSAC (2011)
Mark Giesbrecht, Daniel S. Roche
Detecting lacunary perfect powers and computing their roots. J. Symb. Comput. 46 (11) (2011)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing sparse multiples of polynomials CoRR (2010)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Composition collisions and projective polynomials: statement of results. ISSAC (2010)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Abstract only: Complexity of sparsest multiple computation. ACM Commun. Comput. Algebra 44 (1/2) (2010)
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
Composition collisions and projective polynomials CoRR (2010)
Mark Giesbrecht
Some Results on the Functional Decomposition of Polynomials. CoRR (2010)
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Computing Sparse Multiples of Polynomials. ISAAC (1) (2010)
Mark Giesbrecht, Daniel S. Roche
Interpolation of Shifted-Lacunary Polynomials. Comput. Complex. 19 (3) (2010)
Mark Giesbrecht, George Labahn, Yang Zhang
Computing Popov Forms of Matrices Over PBW Extensions. ASCM (2009)
Mark Giesbrecht, Daniel S. Roche
Detecting lacunary perfect powers and computing their roots CoRR (2009)
Mark Giesbrecht, Myung Sub Kim
On computing the Hermite form of a matrix of differential polynomials CoRR (2009)
Mark Giesbrecht, George Labahn, Wen-shin Lee
Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput. 44 (8) (2009)
Mark Giesbrecht, Myung Sub Kim
On Computing the Hermite Form of a Matrix of Differential Polynomials. CASC (2009)
Daniel S. Roche, Mark Giesbrecht
Detecting polynomial perfect powers (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)
Mark Giesbrecht, Daniel S. Roche
Interpolation of Shifted-Lacunary Polynomials CoRR (2008)
Mark Giesbrecht, Daniel S. Roche
On lacunary polynomial perfect powers. ISSAC (2008)
John P. May, Mark Giesbrecht, Daniel S. Roche, Marc Moreno Maza, Yuzhen Xie
Automatic variable order selection for polynomial system solving (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)
Mark Giesbrecht
ACM 2007 Kanellakis Award Honours Bruno Buchberger Innovator of Automated Tools for Mathematics. ACM Commun. Comput. Algebra 42 (1-2) (2008)
Mark Giesbrecht, Ilias S. Kotsireas, Austin Lobo
ISSAC 2007 poster abstracts. ACM Commun. Comput. Algebra 41 (1-2) (2007)
Jason W. A. Selby, Fraser P. Ruffell, Mark Giesbrecht, Michael W. Godfrey
Examining the Effects of Global Data Usage on Software Maintainability. WCRE (2007)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections CoRR (2007)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Faster inversion and other black box matrix computations using efficient block projections. ISSAC (2007)
Jason W. A. Selby, Mark Giesbrecht
A Fine-Grained Analysis of the Performance and Power Benefits of Compiler Optimizations for Embedded Devices. Software Engineering Research and Practice (2006)
Mark Giesbrecht, George Labahn, Wen-shin Lee
Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software (2006)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Solving sparse rational linear systems. ISSAC (2006)
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard
Solving Sparse Integer Linear Systems CoRR (2006)
Mark Giesbrecht, George Labahn, Wen-shin Lee
Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC (2006)
Mark Giesbrecht, George Labahn, Yang Zhang
Computing Valuation Popov Forms. International Conference on Computational Science (3) (2005)
Cosmin E. Oancea, Jason W. A. Selby, Mark Giesbrecht, Stephen M. Watt
Distributed Models of Thread Level Speculation. PDPTA (2005)
Wayne Eberly, Mark Giesbrecht
Efficient decomposition of separable algebras. J. Symb. Comput. 37 (1) (2004)
Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima
Shiftless decomposition and polynomial-time rational summation. ISSAC (2003)
Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. J. Symb. Comput. 36 (3-4) (2003)
Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC (2002)
Mark Giesbrecht, Arne Storjohann
Computing Rational Forms of Integer Matrices. J. Symb. Comput. 34 (3) (2002)
Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt
Towards factoring bivariate approximate polynomials. ISSAC (2001)
Mark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann
Algorithms for Large Integer Matrix Problems. AAECC (2001)
Mark Giesbrecht
Fast computation of the Smith form of a sparse integer matrix. Comput. Complex. 10 (1) (2001)
Mark Giesbrecht
East Coast Computer Algebra Day. SIGSAM Bull. 34 (3) (2000)
Wayne Eberly, Mark Giesbrecht
Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29 (3) (2000)
Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, Stephen M. Watt
Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra. AISC (2000)
Wayne Eberly, Mark Giesbrecht, Gilles Villard
Computing the Determinant and Smith Form of an Integer Matrix. FOCS (2000)
Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, Stephen M. Watt
Approximate polynomial decomposition. ISSAC (1999)
Mark Giesbrecht, Austin Lobo, B. David Saunders
Certifying Inconsistency of Sparse Linear Systems. ISSAC (1998)
Mark Giesbrecht
Factoring in Skew-Polynomial Rings over Finite Fields. J. Symb. Comput. 26 (4) (1998)
Mark Giesbrecht, Austin Lobo, B. David Saunders
Certifying inconsistency of sparse linear systems. SIGSAM Bull. 31 (3) (1997)
Mark Giesbrecht
Efficient parallel solution of sparse systems of linear diophantine equations. PASCO (1997)
Mark Giesbrecht, B. David Saunders
Parametric linear systems: the two parameter case. SIGSAM Bull. 31 (3) (1997)
Wayne Eberly, Mark Giesbrecht
Efficient Decomposition of Associative Algebras. ISSAC (1996)
Mark Giesbrecht
Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. ANTS (1996)
Mark Giesbrecht
Nearly Optimal Algorithms for Canonical Matrix Forms. SIAM J. Comput. 24 (5) (1995)

Mark Giesbrecht.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mark Giesbrecht