Mark Giesbrecht

2009
35	EE	Mark Giesbrecht, Daniel S. Roche: Detecting lacunary perfect powers and computing their roots CoRR abs/0901.1848: (2009)
2008
34	EE	Mark Giesbrecht, Daniel S. Roche: On lacunary polynomial perfect powers. ISSAC 2008: 103-110
2007
33	EE	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
32	EE	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
31	EE	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
30	EE	Mark Giesbrecht, George Labahn, Wen-shin Lee: Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software 2006
29	EE	Mark Giesbrecht, George Labahn, Wen-shin Lee: Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC 2006: 116-123
28	EE	Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving sparse rational linear systems. ISSAC 2006: 63-70
27		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
26	EE	Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving Sparse Integer Linear Systems CoRR abs/cs/0603082: (2006)
2005
25	EE	Mark Giesbrecht, George Labahn, Yang Zhang: Computing Valuation Popov Forms. International Conference on Computational Science (3) 2005: 619-626
24		Cosmin E. Oancea, Jason W. A. Selby, Mark Giesbrecht, Stephen M. Watt: Distributed Models of Thread Level Speculation. PDPTA 2005: 920-927
2004
23	EE	Wayne Eberly, Mark Giesbrecht: Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004)
2003
22	EE	Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima: Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126
21	EE	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
20	EE	Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee: Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108
19	EE	Mark Giesbrecht, Arne Storjohann: Computing Rational Forms of Integer Matrices. J. Symb. Comput. 34(3): 157-172 (2002)
2001
18	EE	Mark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann: Algorithms for Large Integer Matrix Problems. AAECC 2001: 297-307
17	EE	Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt: Towards factoring bivariate approximate polynomials. ISSAC 2001: 85-92
16	EE	Mark Giesbrecht: Fast computation of the Smith form of a sparse integer matrix. Computational Complexity 10(1): 41-69 (2001)
2000
15	EE	Robert M. Corless, Mark Giesbrecht, Ilias S. Kotsireas, Stephen M. Watt: Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra. AISC 2000: 174-183
14		Wayne Eberly, Mark Giesbrecht, Gilles Villard: Computing the Determinant and Smith Form of an Integer Matrix. FOCS 2000: 675-685
13		Wayne Eberly, Mark Giesbrecht: Efficient Decomposition of Associative Algebras over Finite Fields. J. Symb. Comput. 29(3): 441-458 (2000)
1999
12	EE	Robert M. Corless, Mark Giesbrecht, David J. Jeffrey, Stephen M. Watt: Approximate polynomial decomposition. ISSAC 1999: 213-219
1998
11	EE	Mark Giesbrecht, A. Lobo, B. David Saunders: Certifying Inconsistency of Sparse Linear Systems. ISSAC 1998: 113-119
10		Mark Giesbrecht: Factoring in Skew-Polynomial Rings over Finite Fields. J. Symb. Comput. 26(4): 463-486 (1998)
1996
9		Mark Giesbrecht: Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. ANTS 1996: 173-186
8	EE	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	EE	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	EE	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)

Coauthor Index

1	Robert M. Corless	[12] [15] [17]
2	Wayne Eberly	[8] [13] [14] [23] [26] [28] [31] [33]
3	Joachim von zur Gathen	[1]
4	Jürgen Gerhard	[22]
5	Pascal Giorgi	[26] [28] [31] [33]
6	Michael W. Godfrey	[32]
7	Mark van Hoeij	[17]
8	Michael J. Jacobson Jr.	[18]
9	David J. Jeffrey	[12]
10	Thulasiraman Jeyaraman	[7]
11	Erich Kaltofen	[20] [21]
12	Ilias S. Kotsireas	[15] [17]
13	V. Prasad Krothapalli	[7]
14	George Labahn	[25] [29] [30]
15	Wen-shin Lee	[20] [21] [29] [30]
16	A. Lobo	[11]
17	Cosmin E. Oancea	[24]
18	Daniel S. Roche	[34] [35]
19	Fraser P. Ruffell	[32]
20	B. David Saunders	[11]
21	Jason W. A. Selby	[24] [27] [32]
22	Arne Storjohann	[18] [19] [22] [26] [28] [31] [33]
23	Gilles Villard	[14] [26] [28] [31] [33]
24	Stephen M. Watt	[12] [15] [17] [24]
25	Yang Zhang	[25]
26	Eugene V. Zima	[22]

Colors in the list of coauthors