![]() | ![]() |
| 2012 | ||
|---|---|---|
| 52 | 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) | |
| 51 | 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) | |
| 2011 | ||
| 50 | Mark Giesbrecht, Daniel S. Roche: Diversification improves interpolation. ISSAC 2011: 123-130 | |
| 49 | Mark Giesbrecht, Daniel S. Roche: Diversification improves interpolation CoRR abs/1101.3682: (2011) | |
| 48 | Mark Giesbrecht, Myung Sub Kim: Computing the Hermite Form of a Matrix of Ore Polynomials CoRR abs/1109.3656: (2011) | |
| 47 | Mark Giesbrecht, Daniel S. Roche: Detecting lacunary perfect powers and computing their roots. J. Symb. Comput. 46(11): 1242-1259 (2011) | |
| 46 | Mark Giesbrecht, Stephen M. Watt: In honour of Keith Geddes on his 60th birthday. J. Symb. Comput. 46(7): 735-740 (2011) | |
| 2010 | ||
| 45 | Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak: Computing Sparse Multiples of Polynomials. ISAAC (1) 2010: 266-278 | |
| 44 | Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler: Composition collisions and projective polynomials: statement of results. ISSAC 2010: 123-130 | |
| 43 | Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler: Composition collisions and projective polynomials CoRR abs/1005.1087: (2010) | |
| 42 | Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak: Computing sparse multiples of polynomials CoRR abs/1009.3214: (2010) | |
| 41 | Mark Giesbrecht, Daniel S. Roche: Interpolation of Shifted-Lacunary Polynomials. Computational Complexity 19(3): 333-354 (2010) | |
| 2009 | ||
| 40 | Mark Giesbrecht, Myung Sub Kim: On Computing the Hermite Form of a Matrix of Differential Polynomials. CASC 2009: 118-129 | |
| 39 | Mark Giesbrecht, Daniel S. Roche: Detecting lacunary perfect powers and computing their roots CoRR abs/0901.1848: (2009) | |
| 38 | Mark Giesbrecht, Myung Sub Kim: On computing the Hermite form of a matrix of differential polynomials CoRR abs/0906.4121: (2009) | |
| 37 | Mark Giesbrecht, George Labahn, Wen-shin Lee: Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput. 44(8): 943-959 (2009) | |
| 2008 | ||
| 36 | Mark Giesbrecht, Daniel S. Roche: On lacunary polynomial perfect powers. ISSAC 2008: 103-110 | |
| 35 | Mark Giesbrecht, Daniel S. Roche: Interpolation of Shifted-Lacunary Polynomials CoRR abs/0810.5685: (2008) | |
| 2007 | ||
| 34 | 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 | |
| 33 | 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 | |
| 32 | 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 | ||
| 31 | Mark Giesbrecht, George Labahn, Wen-shin Lee: Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software 2006 | |
| 30 | Mark Giesbrecht, George Labahn, Wen-shin Lee: Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC 2006: 116-123 | |
| 29 | Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving sparse rational linear systems. ISSAC 2006: 63-70 | |
| 28 | 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 | |
| 27 | Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving Sparse Integer Linear Systems CoRR abs/cs/0603082: (2006) | |
| 2005 | ||
| 26 | Mark Giesbrecht, George Labahn, Yang Zhang: Computing Valuation Popov Forms. International Conference on Computational Science (3) 2005: 619-626 | |
| 25 | Cosmin E. Oancea, Jason W. A. Selby, Mark Giesbrecht, Stephen M. Watt: Distributed Models of Thread Level Speculation. PDPTA 2005: 920-927 | |
| 2004 | ||
| 24 | Wayne Eberly, Mark Giesbrecht: Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004) | |
| 2003 | ||
| 23 | Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima: Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126 | |
| 22 | 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): 401-424 (2003) | |
| 2002 | ||
| 21 | Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee: Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108 | |
| 20 | Mark Giesbrecht, Arne Storjohann: Computing Rational Forms of Integer Matrices. J. Symb. Comput. 34(3): 157-172 (2002) | |
| 2001 | ||
| 19 | Mark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann: Algorithms for Large Integer Matrix Problems. AAECC 2001: 297-307 | |
| 18 | Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt: Towards factoring bivariate approximate polynomials. ISSAC 2001: 85-92 | |
| 17 | Mark Giesbrecht: Fast computation of the Smith form of a sparse integer matrix. Computational Complexity 10(1): 41-69 (2001) | |
| 2000 | ||
| 16 | Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, Stephen M. Watt: Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra. AISC 2000: 174-183 | |
| 15 | Wayne Eberly, Mark Giesbrecht, Gilles Villard: Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685 | |
| 14 | Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29(3): 441-458 (2000) | |
| 1999 | ||
| 13 | Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, Stephen M. Watt: Approximate polynomial decomposition. ISSAC 1999: 213-219 | |
| 1998 | ||
| 12 | Mark Giesbrecht, A. Lobo, B. David Saunders: Certifying Inconsistency of Sparse Linear Systems. ISSAC 1998: 113-119 | |
| 11 | Mark Giesbrecht: Factoring in Skew-Polynomial Rings over Finite Fields. J. Symb. Comput. 26(4): 463-486 (1998) | |
| 1997 | ||
| 10 | Mark Giesbrecht: Efficient parallel solution of sparse systems of linear diophantine equations. PASCO 1997: 1-10 | |
| 1996 | ||
| 9 | Mark Giesbrecht: Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. ANTS 1996: 173-186 | |
| 8 | Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras. ISSAC 1996: 170-178 | |
| 1995 | ||
| 7 | V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mark Giesbrecht: Run-Time Parallelization of Irregular DOACROSS Loops. IRREGULAR 1995: 75-80 | |
| 6 | Mark Giesbrecht: Fast Computation of the Smith Normal Form of an Integer Matrix. ISSAC 1995: 110-118 | |
| 5 | Mark Giesbrecht: Nearly Optimal Algorithms for Canonical Matrix Forms. SIAM J. Comput. 24(5): 948-969 (1995) | |
| 1994 | ||
| 4 | Mark Giesbrecht: Fast Algorithms for Rational Forms of Integer Matrices. ISSAC 1994: 305-311 | |
| 1992 | ||
| 3 | Mark Giesbrecht: Fast Algorithms for Matrix Normal Forms FOCS 1992: 121-130 | |
| 2 | Mark Giesbrecht: Factoring in Skew-Polynomial Rings. LATIN 1992: 191-203 | |
| 1990 | ||
| 1 | Joachim von zur Gathen, Mark Giesbrecht: Constructing Normal Bases in Finite Fields. J. Symb. Comput. 10(6): 547-570 (1990) | |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page