2007 |
26 | EE | Howard Cheng,
George Labahn:
Output-sensitive modular algorithms for polynomial matrix normal forms.
J. Symb. Comput. 42(7): 733-750 (2007) |
2006 |
25 | EE | George Labahn,
Scott MacLean,
Marzouk Mirette,
Ian Rutherford,
David Tausky:
MathBrush: An Experimental Pen-Based Math System.
Challenges in Symbolic Computation Software 2006 |
24 | EE | Mark Giesbrecht,
George Labahn,
Wen-shin Lee:
Probabilistically Stable Numerical Sparse Polynomial Interpolation.
Challenges in Symbolic Computation Software 2006 |
23 | EE | Mark Giesbrecht,
George Labahn,
Wen-shin Lee:
Symbolic-numeric sparse interpolation of multivariate polynomials.
ISSAC 2006: 116-123 |
22 | EE | Howard Cheng,
George Labahn:
On computing polynomial GCDs in alternate bases.
ISSAC 2006: 47-54 |
21 | EE | Bernhard Beckermann,
Howard Cheng,
George Labahn:
Fraction-free row reduction of matrices of Ore polynomials.
J. Symb. Comput. 41(5): 513-543 (2006) |
20 | EE | Bernhard Beckermann,
George Labahn,
Gilles Villard:
Normal forms for general polynomial matrices.
J. Symb. Comput. 41(6): 708-737 (2006) |
2005 |
19 | EE | Mark Giesbrecht,
George Labahn,
Yang Zhang:
Computing Valuation Popov Forms.
International Conference on Computational Science (3) 2005: 619-626 |
18 | EE | Yann d'Halluin,
Peter A. Forsyth,
George Labahn:
A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion.
SIAM J. Scientific Computing 27(1): 315-345 (2005) |
2004 |
17 | EE | George Labahn,
Ziming Li:
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings.
ISSAC 2004: 213-220 |
16 | EE | Reinhold Burger,
George Labahn,
Mark van Hoeij:
Closed form solutions of linear odes having elliptic function coefficients.
ISSAC 2004: 58-64 |
2002 |
15 | EE | Bernhard Beckermann,
Howard Cheng,
George Labahn:
Fraction-free row reduction of matrices of skew polynomials.
ISSAC 2002: 8-15 |
2001 |
14 | EE | Howard Cheng,
George Labahn:
Computing all factorizations in ***.
ISSAC 2001: 64-71 |
2000 |
13 | EE | Bernhard Beckermann,
George Labahn:
Effective Computation of Rational Approximants and Interpolants.
Reliable Computing 6(4): 365-390 (2000) |
1999 |
12 | EE | Bernhard Beckermann,
George Labahn,
Gilles Villard:
Shifted Normal Forms of Polynomial Matrices.
ISSAC 1999: 189-196 |
1998 |
11 | | Bernhard Beckermann,
George Labahn:
When are Two Numerical Polynomials Relatively Prime?
J. Symb. Comput. 26(6): 677-689 (1998) |
10 | | Bernhard Beckermann,
George Labahn:
A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials.
J. Symb. Comput. 26(6): 691-714 (1998) |
1997 |
9 | | Bernhard Beckermann,
Stanley Cabay,
George Labahn:
Fraction-free Computation of Catrix Padé Systems.
ISSAC 1997: 125-132 |
8 | | David J. Jeffrey,
George Labahn,
Martin von Mohrenschildt,
A. D. Rich:
Integration of the Signum, Piecewise and Related Functions.
ISSAC 1997: 324-330 |
7 | EE | Stanley Cabay,
Anthony R. Jones,
George Labahn:
Algorithm 766: Experiments with a Weakly Stable Algorithm for Computing Padé-Hermite and Simultaneous Padé Approximants.
ACM Trans. Math. Softw. 23(1): 91-110 (1997) |
1996 |
6 | EE | Arne Storjohann,
George Labahn:
Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices.
ISSAC 1996: 259-266 |
1995 |
5 | EE | Arne Storjohann,
George Labahn:
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation.
ISSAC 1995: 119-125 |
1990 |
4 | | George Labahn,
Dong-Koo Choi,
Stanley Cabay:
The Inverses of Block Hankel and Block Toeplitz Matrices.
SIAM J. Comput. 19(1): 98-123 (1990) |
1989 |
3 | EE | Stanley Cabay,
George Labahn:
A Fast, Reliable Algorithm for Calculating Padé-Hermite Forms.
ISSAC 1989: 95-100 |
2 | | George Labahn,
Stanley Cabay:
Matrix Padé Fractions and Their Computation.
SIAM J. Comput. 18(4): 639-657 (1989) |
1987 |
1 | | George Labahn,
Stanley Cabay:
Matrix-Padé fractions.
EUROCAL 1987: 438-449 |