Matrix-Padé fractions. - George Labahn; Stanley Cabay (EUROCAL, 1987)

A Fast, Reliable Algorithm for Calculating Padé-Hermite Forms. - Stanley Cabay; George Labahn (ISSAC, 1989)

Matrix Padé Fractions and Their Computation. - George Labahn; Stanley Cabay (SIAM J. Comput., 1989)

The Inverses of Block Hankel and Block Toeplitz Matrices. - George Labahn; Dong-Koo Choi; Stanley Cabay (SIAM J. Comput., 1990)

Algorithms for computer algebra. - Keith O. Geddes; Stephen R. Czapor; George Labahn (Kluwer, 1992)

A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations. - Bernhard Beckermann; George Labahn (Numer. Algorithms, 1992)

A superfast algorithm for multi-dimensional Padé systems. - Stanley Cabay; George Labahn (Numer. Algorithms, 1992)

A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants. - Bernhard Beckermann; George Labahn (SIAM J. Matrix Anal. Appl., 1994)

Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation. - Arne Storjohann; George Labahn (ISSAC, 1995)

Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. - Arne Storjohann; George Labahn (ISSAC, 1996)

Computation of Numerical Padé-Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices. - Stanley Cabay; Anthony R. Jones; George Labahn (SIAM J. Matrix Anal. Appl., 1996)

Computation of Numerical Padé-Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm. - Stanley Cabay; Anthony R. Jones; George Labahn (SIAM J. Matrix Anal. Appl., 1996)

Fraction-free Computation of Catrix Padé Systems. - Bernhard Beckermann; Stanley Cabay; George Labahn (ISSAC, 1997)

Integration of the Signum, Piecewise and Related Functions. - David J. Jeffrey; George Labahn; Martin von Mohrenschildt; Albert D. Rich (ISSAC, 1997)

Algorithm 766: Experiments with a Weakly Stable Algorithm for Computing Padé-Hermite and Simultaneous Padé Approximants. - Stanley Cabay; Anthony R. Jones; George Labahn (ACM Trans. Math. Softw., 1997)

Poster Session Abstracts of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC 1998 Rostock, Germany August 13 - 15, 1998. - George Labahn; Mohamed Omar Rayes (SIGSAM Bull., 1998)

When are Two Numerical Polynomials Relatively Prime? - Bernhard Beckermann; George Labahn (J. Symb. Comput., 1998)

A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials. - Bernhard Beckermann; George Labahn (J. Symb. Comput., 1998)

Shifted Normal Forms of Polynomial Matrices. - Bernhard Beckermann; George Labahn; Gilles Villard (ISSAC, 1999)

Numerical methods for pricing callable bonds. - Yann d'Halluin; Peter A. Forsyth; Kenneth R. Vetzal; George Labahn (CIFEr, 2000)

Effective Computation of Rational Approximants and Interpolants. - Bernhard Beckermann; George Labahn (Reliab. Comput., 2000)

Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs. - Bernhard Beckermann; George Labahn (SIAM J. Matrix Anal. Appl., 2000)

Computing all factorizations in ***. - Howard Cheng; George Labahn (ISSAC, 2001)

Fraction-free row reduction of matrices of skew polynomials. - Bernhard Beckermann; Howard Cheng; George Labahn (ISSAC, 2002)

Closed form solutions of linear odes having elliptic function coefficients. - Reinhold Burger; George Labahn; Mark van Hoeij (ISSAC, 2004)

Hyperexponential solutions of finite-rank ideals in orthogonal ore rings. - George Labahn; Ziming Li 002 (ISSAC, 2004)

A penalty method for American options with jump diffusion processes. - Yann d'Halluin; Peter A. Forsyth; George Labahn (Numerische Mathematik, 2004)

Computing Valuation Popov Forms. - Mark Giesbrecht; George Labahn; Yang Zhang (International Conference on Computational Science (3), 2005)

A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion. - Yann d'Halluin; Peter A. Forsyth; George Labahn (SIAM J. Sci. Comput., 2005)

Probabilistically Stable Numerical Sparse Polynomial Interpolation. - Mark Giesbrecht; George Labahn; Wen-shin Lee (Challenges in Symbolic Computation Software, 2006)

MathBrush: An Experimental Pen-Based Math System. - George Labahn; Scott MacLean; Mirette S. Marzouk; Ian Rutherford; David Tausky (Challenges in Symbolic Computation Software, 2006)

On computing polynomial GCDs in alternate bases. - Howard Cheng; George Labahn (ISSAC, 2006)

Fraction-free row reduction of matrices of Ore polynomials. - Bernhard Beckermann; Howard Cheng; George Labahn (J. Symb. Comput., 2006)

Normal forms for general polynomial matrices. - Bernhard Beckermann; George Labahn; Gilles Villard (J. Symb. Comput., 2006)

Managing Ambiguity in Mathematical Matrices. - David Tausky; George Labahn; Edward Lank; Mirette S. Marzouk (SBIM, 2007)

Output-sensitive modular algorithms for polynomial matrix normal forms. - Howard Cheng; George Labahn (J. Symb. Comput., 2007)

On the numerical condition of a generalized Hankel eigenvalue problem. - Bernhard Beckermann; Gene H. Golub; George Labahn (Numerische Mathematik, 2007)

MathBrush: A System for Doing Math on Pen-Based Devices. - George Labahn; Edward Lank; Scott MacLean; Mirette S. Marzouk; David Tausky (Document Analysis Systems, 2008)

MathBrush: A Case Study for Pen-based Interactive Mathematics. - George Labahn; Edward Lank; Mirette S. Marzouk; Andrea Bunt; Scott MacLean; David Tausky (SBIM, 2008)

Computing polynomial LCM and GCD in lagrange basis. - Howard Cheng; George Labahn; Wei Zhou 029 (ACM Commun. Comput. Algebra, 2008)

A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices. - Howard Cheng; George Labahn (ASCM, 2009)

Computing Popov Forms of Matrices Over PBW Extensions. - Mark Giesbrecht; George Labahn; Yang Zhang (ASCM, 2009)

Fraction-free computation of simultaneous padé approximants. - Bernhard Beckermann; George Labahn (ISSAC, 2009)

Efficient computation of order bases. - Wei Zhou 029; George Labahn (ISSAC, 2009)

Tools for the Efficient Generation of Hand-Drawn Corpora Based on Context-Free Grammars. - Scott MacLean; David Tausky; George Labahn; Edward Lank; Mirette S. Marzouk (SBIM, 2009)

Applying linear algebra routines to modular ore polynomial matrix algorithms. - Howard Cheng; George Labahn (ACM Commun. Comput. Algebra, 2009)

Symbolic-numeric sparse interpolation of multivariate polynomials. - Mark Giesbrecht; George Labahn; Wen-shin Lee (J. Symb. Comput., 2009)

Analyzing sketch content using in-air packet information. - David Tausky; Edward Lank; Richard Mann; George Labahn (IUI, 2011)

Is the iPad useful for sketch input? A comparison with the Tablet PC. - Scott MacLean; David Tausky; George Labahn; Edward Lank; Mirette S. Marzouk (SBIM, 2011)

Grammar-based techniques for creating ground-truthed sketch corpora. - Scott MacLean; George Labahn; Edward Lank; Mirette S. Marzouk; David Tausky (Int. J. Document Anal. Recognit., 2011)

Methods for Pricing American Options under Regime Switching. - Yiqing Huang; Peter A. Forsyth; George Labahn (SIAM J. Sci. Comput., 2011)

Rational invariants of scalings from Hermite normal forms. - Evelyne Hubert; George Labahn (ISSAC, 2012)

Computing minimal nullspace bases. - Wei Zhou 029; George Labahn; Arne Storjohann (ISSAC, 2012)

Gröbner walk for computing matrix normal forms over Ore polynomials. - George Labahn; Johannes Middeke (ACM Commun. Comput. Algebra, 2012)

Efficient algorithms for order basis computation. - Wei Zhou 029; George Labahn (J. Symb. Comput., 2012)

Iterative methods for the solution of a singular control formulation of a GMWB pricing problem. - Yiqing Huang; Peter A. Forsyth; George Labahn (Numerische Mathematik, 2012)

Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance. - Yiqing Huang; Peter A. Forsyth; George Labahn (SIAM J. Numer. Anal., 2012)

Computing column bases of polynomial matrices. - Wei Zhou 029; George Labahn (ISSAC, 2013)

Scaling Invariants and Symmetry Reduction of Dynamical Systems. - Evelyne Hubert; George Labahn (Found. Comput. Math., 2013)

A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets. - Scott MacLean; George Labahn (Int. J. Document Anal. Recognit., 2013)

On simultaneous row and column reduction of higher-order linear differential systems. - Moulay A. Barkatou; Carole El Bacha; George Labahn; Eckhard Pflügel (J. Symb. Comput., 2013)

Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom. - Wai Man Ng; Dong Eui Chang; George Labahn (SIAM J. Control. Optim., 2013)

Unimodular completion of polynomial matrices. - Wei Zhou 029; George Labahn (ISSAC, 2014)

Fast and deterministic computation of the determinant of a polynomial matrix. - Wei Zhou 029; George Labahn (CoRR, 2014)

A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching. - Josh Babbin; Peter A. Forsyth; George Labahn (J. Sci. Comput., 2014)

Dynamical systems and scaling invariants. - George Labahn (ACM Commun. Comput. Algebra, 2015)

Rational invariants of finite abelian groups. - George Labahn (ACM Commun. Comput. Algebra, 2015)

Sparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251). - Annie A. M. Cuyt; George Labahn; Avraham Sidi; Wen-shin Lee (Dagstuhl Reports, 2015)

A deterministic algorithm for inverting a polynomial matrix. - Wei Zhou 029; George Labahn; Arne Storjohann (J. Complex., 2015)

A Bayesian model for recognizing handwritten mathematical expressions. - Scott MacLean; George Labahn (Pattern Recognit., 2015)

Existence Problem of Telescopers: Beyond the Bivariate Case. - Shaoshi Chen; Qing-Hu Hou; George Labahn; Rong-Hua Wang (ISSAC, 2016)

Thematic program in computer algebra: July 1 - Dec 31, 2015. - George Labahn; Stephen M. Watt (ACM Commun. Comput. Algebra, 2016)

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix. - George Labahn; Wei Zhou 029 (CoRR, 2016)

Computation of invariants of finite abelian groups. - Evelyne Hubert; George Labahn (Math. Comput., 2016)

Computing the Nearest Rank-Deficient Matrix Polynomial. - Mark Giesbrecht; Joseph Haraldson; George Labahn (ISSAC, 2017)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. - George Labahn; Vincent Neiger; Wei Zhou 029 (J. Complex., 2017)

On rational functions without Froissart doublets. - Bernhard Beckermann; George Labahn; Ana C. Matos (Numerische Mathematik, 2018)

Convergence of Implicit Schemes for Hamilton-Jacobi-Bellman Quasi-Variational Inequalities. - Parsiad Azimzadeh; Erhan Bayraktar; George Labahn (SIAM J. Control. Optim., 2018)

Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication. - Stavros Birmpilis; George Labahn; Arne Storjohann (ISSAC, 2019)

Efficient Integer-Linear Decomposition of Multivariate Polynomials. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene V. Zima (ISSAC, 2019)

Dowsing for Math Answers with Tangent-L. - Yin Ki Ng; Dallas J. Fraser; Besat Kassaie; George Labahn; Mirette S. Marzouk; Frank Wm. Tompa; Kevin Wang (CLEF (Working Notes), 2020)

A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix. - Stavros Birmpilis; George Labahn; Arne Storjohann (ISSAC, 2020)

Efficient q-Integer Linear Decomposition of Multivariate Polynomials. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene V. Zima (CoRR, 2020)

Computing lower rank approximations of matrix polynomials. - Mark Giesbrecht; Joseph Haraldson; George Labahn (J. Symb. Comput., 2020)

Foreword. - George Labahn; James H. Davenport; Josef Urban (Math. Comput. Sci., 2020)

Homotopy techniques for solving sparse column support determinantal polynomial systems. - George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Complex., 2021)

Computing nearby non-trivial Smith forms. - Mark Giesbrecht; Joseph Haraldson; George Labahn (J. Symb. Comput., 2021)

Efficient q-integer linear decomposition of multivariate polynomials. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene V. Zima (J. Symb. Comput., 2021)

Bohemian Matrix Geometry. - Robert M. Corless; George Labahn; Dan Piponi; Leili Rafiee Sevyeri (ISSAC, 2022)

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. - George Labahn; Vincent Neiger; Thi Xuan Vu; Wei Zhou 029 (ISSAC, 2022)

Constructing minimal telescopers for rational functions in three discrete variables. - Shaoshi Chen; Qing-Hu Hou; Hui Huang; George Labahn; Rong-Hua Wang (Adv. Appl. Math., 2022)

Efficient rational creative telescoping. - Mark Giesbrecht; Hui Huang; George Labahn; Eugene Zima (J. Symb. Comput., 2022)

Faster real root decision algorithm for symmetric polynomials. - George Labahn; Cordian Riener; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (ISSAC, 2023)

A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. - Stavros Birmpilis; George Labahn; Arne Storjohann (J. Symb. Comput., 2023)

Special issue on Symbolic and Algebraic Computation: ISSAC 2021. - Frédéric Chyzak; George Labahn (J. Symb. Comput., 2023)

Computing critical points for invariant algebraic systems. - Jean-Charles Faugère; George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Symb. Comput., 2023)

A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix. - Stavros Birmpilis; George Labahn; Arne Storjohann (ACM Trans. Algorithms, 2023)