Mark Giesbrecht

111 papers A* 2B 29Misc 3Journal 63Unranked 12

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