dblp.uni-trier.dewww.uni-trier.de

Mark Giesbrecht

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
35EEMark Giesbrecht, Daniel S. Roche: Detecting lacunary perfect powers and computing their roots CoRR abs/0901.1848: (2009)
2008
34EEMark Giesbrecht, Daniel S. Roche: On lacunary polynomial perfect powers. ISSAC 2008: 103-110
2007
33EEWayne 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
32EEJason 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
31EEWayne 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
30EEMark Giesbrecht, George Labahn, Wen-shin Lee: Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software 2006
29EEMark Giesbrecht, George Labahn, Wen-shin Lee: Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC 2006: 116-123
28EEWayne 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
26EEWayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne Storjohann, Gilles Villard: Solving Sparse Integer Linear Systems CoRR abs/cs/0603082: (2006)
2005
25EEMark 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
23EEWayne Eberly, Mark Giesbrecht: Efficient decomposition of separable algebras. J. Symb. Comput. 37(1): 35-81 (2004)
2003
22EEJürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima: Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126
21EEMark 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
20EEMark Giesbrecht, Erich Kaltofen, Wen-shin Lee: Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108
19EEMark Giesbrecht, Arne Storjohann: Computing Rational Forms of Integer Matrices. J. Symb. Comput. 34(3): 157-172 (2002)
2001
18EEMark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann: Algorithms for Large Integer Matrix Problems. AAECC 2001: 297-307
17EERobert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt: Towards factoring bivariate approximate polynomials. ISSAC 2001: 85-92
16EEMark Giesbrecht: Fast computation of the Smith form of a sparse integer matrix. Computational Complexity 10(1): 41-69 (2001)
2000
15EERobert 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
12EERobert M. Corless, Mark Giesbrecht, David J. Jeffrey, Stephen M. Watt: Approximate polynomial decomposition. ISSAC 1999: 213-219
1998
11EEMark 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
8EEWayne 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
6EEMark 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
4EEMark 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

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

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)