default search action
Mark Giesbrecht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c45]Mark Giesbrecht:
Functional decomposition of sparse polynomials (short talk abstract). SCSS (Work in Progress) 2024: 19-20 - 2023
- [j34]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: 72-97 (2023) - 2022
- [j33]Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima:
Efficient rational creative telescoping. J. Symb. Comput. 109: 57-87 (2022) - [i28]Jesse Elliott, Mark Giesbrecht, Éric Schost:
Bit complexity for computing one point in each connected component of a smooth real algebraic set. CoRR abs/2207.04289 (2022) - 2021
- [j32]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Subquadratic-Time Algorithms for Normal Bases. Comput. Complex. 30(1): 5 (2021) - [j31]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing nearby non-trivial Smith forms. J. Symb. Comput. 102: 304-327 (2021) - [j30]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. J. Symb. Comput. 105: 214-233 (2021) - [j29]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient q-integer linear decomposition of multivariate polynomials. J. Symb. Comput. 107: 122-144 (2021) - [c44]Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse Multiplication of Multivariate Linear Differential Operators. ISSAC 2021: 155-162 - 2020
- [j28]Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen
:
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Found. Comput. Math. 20(2): 331-366 (2020) - [j27]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing lower rank approximations of matrix polynomials. J. Symb. Comput. 98: 225-245 (2020) - [c43]Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri, B. David Saunders:
On Parametric Linear System Solving. CASC 2020: 188-205 - [c42]Jesse Elliott, Mark Giesbrecht, Éric Schost:
On the bit complexity of finding points in connected components of a smooth real hypersurface. ISSAC 2020: 170-177 - [c41]Mark Giesbrecht, Qiao-Long Huang, Éric Schost:
Sparse multiplication for skew polynomials. ISSAC 2020: 194-201 - [i27]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient q-Integer Linear Decomposition of Multivariate Polynomials. CoRR abs/2002.00124 (2020) - [i26]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Subquadratic-Time Algorithms for Normal Bases. CoRR abs/2005.03497 (2020)
2010 – 2019
- 2019
- [c40]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient Integer-Linear Decomposition of Multivariate Polynomials. ISSAC 2019: 171-178 - [c39]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Quadratic-Time Algorithms for Normal Elements. ISSAC 2019: 179-186 - [i25]Mark Giesbrecht, Armin Jamshidpey, Éric Schost:
Quadratic Probabilistic Algorithms for Normal Bases. CoRR abs/1903.03278 (2019) - [i24]Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima:
Efficient Rational Creative Telescoping. CoRR abs/1909.06898 (2019) - [i23]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Counting invariant subspaces and decompositions of additive polynomials. CoRR abs/1912.00212 (2019) - 2018
- [c38]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Nearby Non-trivial Smith Forms. ISSAC 2018: 159-166 - [i22]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Nearby Non-trivial Smith Forms. CoRR abs/1812.04590 (2018) - 2017
- [c37]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing the Nearest Rank-Deficient Matrix Polynomial. ISSAC 2017: 181-188 - [i21]Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen:
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. CoRR abs/1701.01994 (2017) - [i20]Mark Giesbrecht, Joseph Haraldson, George Labahn:
Computing Lower Rank Approximations of Matrix Polynomials. CoRR abs/1712.04007 (2017) - 2016
- [j26]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symb. Comput. 75: 4-24 (2016) - [j25]Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy:
Factoring linear partial differential operators in n variables. J. Symb. Comput. 75: 127-148 (2016) - 2015
- [j24]Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy:
On factoring differential and difference operators in n variables. ACM Commun. Comput. Algebra 49(1): 33 (2015) - 2014
- [c36]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Sparse interpolation over finite fields via low-order roots of unity. ISSAC 2014: 27-34 - [c35]Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy:
Factoring linear differential operators in n variables. ISSAC 2014: 194-201 - [c34]Mark Giesbrecht, Joseph Haraldson:
Computing GCRDs of approximate differential polynomials. SNC 2014: 78-87 - [i19]Mustafa Elsheikh, Mark Giesbrecht:
Relating $p$-Adic eigenvalues and the local Smith normal form. CoRR abs/1401.1773 (2014) - [i18]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR abs/1401.4744 (2014) - [i17]Mustafa Elsheikh, Andy Novocin, Mark Giesbrecht:
Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices. CoRR abs/1401.6667 (2014) - [i16]Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy:
Factoring Differential Operators in n Variables. CoRR abs/1404.0002 (2014) - [i15]Mark Giesbrecht, Joseph Haraldson:
Computing GCRDs of Approximate Differential Polynomials. CoRR abs/1406.0907 (2014) - [i14]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs. CoRR abs/1412.4088 (2014) - 2013
- [j23]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Recursive sparse interpolation. ACM Commun. Comput. Algebra 47(3/4): 104-105 (2013) - [c33]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
Faster Sparse Interpolation of Straight-Line Programs. CASC 2013: 61-74 - [p1]Mark Giesbrecht:
Algorithms for irreducibility testing and for constructing irreducible polynomials. Handbook of Finite Fields 2013: 374-379 - [i13]Andrew Arnold, Mark Giesbrecht, Daniel S. Roche:
Faster sparse interpolation of straight-line program. CoRR abs/1304.3483 (2013) - 2012
- [j22]Mark Giesbrecht, Daniel S. Roche
Computing Sparse Multiples of Polynomials. Algorithmica 64(3): 454-480 (2012) - [j21]Mark Giesbrecht, Daniel Panario
In honour of the research and influence of Joachim von zur Gathen at 60. J. Symb. Comput. 47(4): 355-357 (2012) - [c32]Mark Giesbrecht, Nam Pham:
A Symbolic Approach to Compute a Null-Space Basis in the Projection Method. ASCM 2012: 243-259 - [c31]Mark Giesbrecht, Albert Heinle:
A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials. CASC 2012: 117-128 - [c30]Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin
Fast computation of Smith forms of sparse matrices over local rings. ISSAC 2012: 146-153 - [i12]Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders:
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings. CoRR abs/1201.5365 (2012) - 2011
- [j20]Mark Giesbrecht, Stephen M. Watt:
In honour of Keith Geddes on his 60th birthday. J. Symb. Comput. 46(7): 735-740 (2011) - [j19]Mark Giesbrecht, Daniel S. Roche
Detecting lacunary perfect powers and computing their roots. J. Symb. Comput. 46(11): 1242-1259 (2011) - [c29]Mark Giesbrecht, Daniel S. Roche
Diversification improves interpolation. ISSAC 2011: 123-130 - [i11]Mark Giesbrecht, Daniel S. Roche:
Diversification improves interpolation. CoRR abs/1101.3682 (2011) - [i10]Mark Giesbrecht, Myung Sub Kim:
Computing the Hermite Form of a Matrix of Ore Polynomials. CoRR abs/1109.3656 (2011) - 2010
- [j18]Mark Giesbrecht, Daniel S. Roche
Interpolation of Shifted-Lacunary Polynomials. Comput. Complex. 19(3): 333-354 (2010) - [j17]Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Abstract only: Complexity of sparsest multiple computation. ACM Commun. Comput. Algebra 44(1/2): 25 (2010) - [c28]Mark Giesbrecht, Daniel S. Roche
Computing Sparse Multiples of Polynomials. ISAAC (1) 2010: 266-278 - [c27]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials: statement of results. ISSAC 2010: 123-130 - [i9]Mark Giesbrecht:
Some Results on the Functional Decomposition of Polynomials. CoRR abs/1004.5433 (2010) - [i8]Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials. CoRR abs/1005.1087 (2010) - [i7]Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak:
Computing sparse multiples of polynomials. CoRR abs/1009.3214 (2010)
2000 – 2009
- 2009
- [j16]Mark Giesbrecht, George Labahn, Wen-shin Lee:
Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput. 44(8): 943-959 (2009) - [c26]Mark Giesbrecht, George Labahn, Yang Zhang:
Computing Popov Forms of Matrices Over PBW Extensions. ASCM 2009: 61-65 - [c25]Mark Giesbrecht, Myung Sub Kim:
On Computing the Hermite Form of a Matrix of Differential Polynomials. CASC 2009: 118-129 - [i6]Mark Giesbrecht, Daniel S. Roche:
Detecting lacunary perfect powers and computing their roots. CoRR abs/0901.1848 (2009) - [i5]Mark Giesbrecht, Myung Sub Kim:
On computing the Hermite form of a matrix of differential polynomials. CoRR abs/0906.4121 (2009) - 2008
- [j15]Mark Giesbrecht:
ACM 2007 Kanellakis Award Honours Bruno Buchberger Innovator of Automated Tools for Mathematics. ACM Commun. Comput. Algebra 42(1-2): 37-38 (2008) - [j14]John P. May
Automatic variable order selection for polynomial system solving (abstract only). ACM Commun. Comput. Algebra 42(1-2): 83 (2008) - [j13]Daniel S. Roche, Mark Giesbrecht:
Detecting polynomial perfect powers (abstract only). ACM Commun. Comput. Algebra 42(1-2): 87 (2008) - [c24]Mark Giesbrecht, Daniel S. Roche:
On lacunary polynomial perfect powers. ISSAC 2008: 103-110 - [i4]Mark Giesbrecht, Daniel S. Roche:
Interpolation of Shifted-Lacunary Polynomials. CoRR abs/0810.5685 (2008) - 2007
- [j12]Mark Giesbrecht, Ilias S. Kotsireas, Austin Lobo:
ISSAC 2007 poster abstracts. ACM Commun. Comput. Algebra 41(1-2): 38-72 (2007) - [c23]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Faster inversion and other black box matrix computations using efficient block projections. ISSAC 2007: 143-150 - [c22]Jason W. A. Selby, Fraser P. Ruffell, Mark Giesbrecht, Michael W. Godfrey:
Examining the Effects of Global Data Usage on Software Maintainability. WCRE 2007: 60-69 - [i3]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections. CoRR abs/cs/0701188 (2007) - 2006
- [c21]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving sparse rational linear systems. ISSAC 2006: 63-70 - [c20]Mark Giesbrecht, George Labahn, Wen-shin Lee:
Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC 2006: 116-123 - [c19]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: 821-827 - [i2]Mark Giesbrecht, George Labahn, Wen-shin Lee:
Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software 2006 - [i1]Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard:
Solving Sparse Integer Linear Systems. CoRR abs/cs/0603082 (2006) - 2005
- [c18]Mark Giesbrecht, George Labahn, Yang Zhang:
Computing Valuation Popov Forms. International Conference on Computational Science (3) 2005: 619-626 - [c17]Cosmin E. Oancea, Jason W. A. Selby, Mark Giesbrecht, Stephen M. Watt:
Distributed Models of Thread Level Speculation. PDPTA 2005: 920-927 - 2004
- [j11]Wayne Eberly, Mark Giesbrecht:
Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004) - 2003
- [j10]Mark Giesbrecht, Erich L. Kaltofen
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. J. Symb. Comput. 36(3-4): 401-424 (2003) - [c16]Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima:
Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126 - 2002
- [j9]Mark Giesbrecht, Arne Storjohann:
Computing Rational Forms of Integer Matrices. J. Symb. Comput. 34(3): 157-172 (2002) - [c15]Mark Giesbrecht, Erich L. Kaltofen
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108 - 2001
- [j8]Mark Giesbrecht:
Fast computation of the Smith form of a sparse integer matrix. Comput. Complex. 10(1): 41-69 (2001) - [c14]Mark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann:
Algorithms for Large Integer Matrix Problems. AAECC 2001: 297-307 - [c13]Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt:
Towards factoring bivariate approximate polynomials. ISSAC 2001: 85-92 - 2000
- [j7]Mark Giesbrecht:
East Coast Computer Algebra Day. SIGSAM Bull. 34(3): 21-27 (2000) - [j6]Wayne Eberly, Mark Giesbrecht:
Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29(3): 441-458 (2000) - [c12]Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, Stephen M. Watt:
Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra. AISC 2000: 174-183 - [c11]Wayne Eberly, Mark Giesbrecht, Gilles Villard:
Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685
1990 – 1999
- 1999
- [c10]Robert M. Corless
Approximate polynomial decomposition. ISSAC 1999: 213-219 - 1998
- [j5]Mark Giesbrecht:
Factoring in Skew-Polynomial Rings over Finite Fields. J. Symb. Comput. 26(4): 463-486 (1998) - [c9]Mark Giesbrecht, Austin Lobo, B. David Saunders:
Certifying Inconsistency of Sparse Linear Systems. ISSAC 1998: 113-119 - 1997
- [j4]Mark Giesbrecht, Austin Lobo, David Saunders:
Certifying inconsistency of sparse linear systems. SIGSAM Bull. 31(3): 40 (1997) - [j3]Mark Giesbrecht, David Saunders:
Parametric linear systems: the two parameter case. SIGSAM Bull. 31(3): 40 (1997) - [c8]Mark Giesbrecht:
Efficient parallel solution of sparse systems of linear diophantine equations. PASCO 1997: 1-10 - 1996
- [c7]Mark Giesbrecht:
Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. ANTS 1996: 173-186 - [c6]Wayne Eberly, Mark Giesbrecht:
Efficient Decomposition of Associative Algebras. ISSAC 1996: 170-178 - 1995
- [j2]Mark Giesbrecht:
Nearly Optimal Algorithms for Canonical Matrix Forms. SIAM J. Comput. 24(5): 948-969 (1995) - [c5]V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mark Giesbrecht:
Run-Time Parallelization of Irregular DOACROSS Loops. IRREGULAR 1995: 75-80 - [c4]Mark Giesbrecht:
Fast Computation of the Smith Normal Form of an Integer Matrix. ISSAC 1995: 110-118 - 1994
- [c3]Mark Giesbrecht:
Fast Algorithms for Rational Forms of Integer Matrices. ISSAC 1994: 305-311 - 1993
- [b1]Mark Giesbrecht:
Nearly optimal algorithms for canonical matrix forms. University of Toronto, Canada, 1993 - 1992
- [c2]Mark Giesbrecht:
Fast Algorithms for Matrix Normal Forms. FOCS 1992: 121-130 - [c1]Mark Giesbrecht:
Factoring in Skew-Polynomial Rings. LATIN 1992: 191-203 - 1990
- [j1]Joachim von zur Gathen, Mark Giesbrecht:
Constructing Normal Bases in Finite Fields. J. Symb. Comput. 10(6): 547-570 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: