Publications by Venue

Books

• K.O. Geddes, S.R. Czapor and G. Labahn, ''Algorithms for Computer Algebra'', Kluwer Academic Publishers, (1992), 585 pages.
  
  
• M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S. Vorketter, J. McCarron, P DeMarco, ''The Maple Introductory Programming Guide'', Springer-Verlag, (2003), 370 pages.
  
  
• M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S. Vorketter, J. McCarron, P DeMarco, ''The Maple Advanced Programming Guide'', Springer-Verlag, (2003), 430 pages.
  
  

  Special Issues

• Special Issue on Symbolic and Algebraic Computation: ISSAC 2021, Editors. F. Chyzak and G. Labahn, Journal of Symbolic Computation, (2023),
  
  
• Special Issue: Selected Extended Papers of ICMS 2018, Editors: J. H. Davenport, G. Labahn and J. Urban, Mathematics in Computer Science, Birkauser, (2018)
  
  

  Journals

  Papers in SIAM Journals

• P. Azimzadeh, E. Bayraktar, G. Labahn, Convergence of implicit schemes for Hamilton-Jacobi-Bellman quasi-variational Inequalities, SIAM Journal on Control and Optimization. 56(6) (2018) 3994-4016
  
  
• W. Ng, D.E. Chang and G. Labahn, Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom, SIAM Journal on Control and Optimization, 51(2) (2013) 881-905
  
  
• Y. Huang, P. Forsyth and G. Labahn, Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance, SIAM Journal of Numerical Analysis 50(4) (2012) 1861-1882
  
  
• Y. Huang, P.A. Forsyth and G. Labahn, Methods for pricing American options under regime switching, SIAM Journal on Scientific Computing 33(5) (2011) 2144-2168.
  
  
• Y. d'Halluin, P.A. Forsyth and G. Labahn, A Semi-Lagrangian approach for American Asian Options under Jump Diffusion, SIAM Journal of Scientific Computing, 27 (2005) 315-345.
  
  
• B. Beckermann and G. Labahn, Fraction-free Computation of Matrix Rational Interpolants and Matrix GCD's, SIAM J. Matrix Analysis and Applications, 22(1) (2000) 114-144.
  
  
• S. Cabay, A.R. Jones and G. Labahn, Computation of Numerical Pade-Hermite and Simultaneous Pade Systems I: Near Inversion of Generalized Sylvester Matrices , SIAM J. Matrix Analysis and Applications 17 (1996) 247-267.
  
  
• S. Cabay, A.R. Jones and G. Labahn, Computation of Numerical Pade-Hermite and Simultaneous Pade Systems II: A Weakly-Stable Algorithm , SIAM J. Matrix Analysis and Applications, 17, (1996), 268-297.
  
  
• B. Beckermann and G. Labahn, A uniform approach for the fast computation of Matrix-type Pade approximants, SIAM J. Matrix Analysis and Applications (1994), 804-823.
  
  
• G. Labahn, D.K. Choi and S. Cabay, Inverses of Block Hankel and Block Toeplitz Matrices , SIAM J. of Computing, 19 (1990), pp. 98-123.
  
  
• G. Labahn and S. Cabay, Matrix Pade Fractions and their Computation , SIAM J. of Computing, 18 (1989), pp. 639-657.
  
  

  Papers in Journal of Symbolic Computation

• J-C. Faugère, G. Labahn, M. Safey El Din, É. Schost and T. X. Vu, Computing critical points for invariant algebraic systems, Journal of Symbolic Computation. 116 (2023) 365-399
  
  
• S. Birmpilis, G. Labahn and A. Storjohann, A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix, Journal of Symbolic Computation. 116 (2023) 146-182
  
  
• M. Giesbrecht, H. Huang, G. Labahn and E. Zima, Efficient Rational Creative Telescoping, Journal of Symbolic Computation. 109 (2022) 57-87
  
  
• M. Giesbrecht, H. Huang, G. Labahn and E. Zima, Efficient q-Integer Linear Decomposition of Multivariate Polynomials, Journal of Symbolic Computation. 107 (2021) 122-144.
  
  
• M. Giesbrecht, J. Haraldson, G. Labahn, Computing Nearby Non-trivial Smith Forms, Journal of Symbolic Computation. 102 (2021) 304-327.
  
  
• M. Giesbrecht, J. Haraldson, G. Labahn, Computing Lower Rank Approximations of Matrix Polynomials, Journal of Symbolic Computation. 98 (2020) 225-245.
  
  
• M. Barkatou, C. El Bacha, G. Labahn and E. Pfluegel, On Simultaneous Row and Column Reduction of Higher-Order Linear Differential Systems, Journal of Symbolic Computation 49(1) (2013) 45-64
  
  
• W. Zhou and G. Labahn, Algorithms for Efficient Order Basis Computation, Journal of Symbolic Computation, 47(7) (2012) 793-819
  
  
• M. Giesbrecht, G. Labahn and W-s Lee, Symbolic-numeric Sparse Interpolation of Multivariate Polynomials, Journal of Symbolic Computation, 44(8) (2009) 943-959
  
  
• H. Cheng and G. Labahn, Output-sensitive Modular Algorithms for Polynomial Matrix Normal Forms, Journal of Symbolic Computation, 42(7) (2007) 733-750.
  
  
• B. Beckermann, G. Labahn and G. Villard, Normal Forms for General Polynomial Matrices, Journal of Symbolic Computation, 41(6) (2006) 708-737.
  
  
• B. Beckermann, H. Cheng and G. Labahn, Fraction-free Row Reduction of Matrices of Ore Polynomials, Journal of Symbolic Computation, 41(5) (2006) 513-543.
  
  
• B. Beckermann and G. Labahn, When are two numerical polynomials relatively prime?, Journal of Symbolic Computation 26 (1998) 677-689.
  
  
• B. Beckermann and G. Labahn, A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials, Journal of Symbolic Computation 26 (1998) 691-714.
  
  

  Papers in Numerische Mathematik

• B. Beckermann, G. Labahn, A. C. Matos, On rational functions without Froissart doublets. Numerische Mathematik. 138 (2018) 615-633
  
  
• Y. Huang, P. Forsyth and G. Labahn, Iterative methods for the solution of a singular control formulation of a GMWB pricing problem, Numerische Mathematik 122(1) (2012) 133-167
  
  
• B. Beckermann, G. Golub and G. Labahn, On the Numerical Condition of a Generalized Hankel Eigenvalue Problem, Numerische Mathematik, 106(1) (2007) 41-68.
  
  
• Y. d'Halluin, P.A. Forsyth, G. Labahn, A Penalty Method for American Options with Jump Diffusion Processes, Numerische Mathematik, 97:2 (2004) 321-352.
  
  

  Papers in Foundations of Computational Mathematics

• E. Hubert and G. Labahn, Scaling Invariants and Symmetry Reduction of Dynamical Systems, Foundations of Computational Mathematics, 13(4) (2013) 479-516
  
  

  Papers in Mathematics of Computation

• E. Hubert and G. Labahn, Computation of Invariants of Finite Abelian Groups, Mathematics of Computation, 85 (2016), 3029-3050.
  
  

  Papers in ACM Transactions of Algorithms

• S. Birmpilis, G. Labahn and A. Storjohann, A cubic algorithm for computing the Hermite normal form of a nonsingular integer matrix, ACM Tranactions of Algorithms. 19(4) (2023) 1-36.
  
  

  Papers in Linear Algebra and its Applications

• A. Storjohann and G. Labahn, A Fast Las Vegas Algorithm for Computing the Smith Normal Form of a Polynomial Matrix, Linear Algebra and its Applications. 253 (1997) 155-173.
  
  
• G. Labahn, B. Beckermann and S. Cabay, Inversion of Mosaic Hankel Matrices via Matrix Polynomial Systems , Linear Algebra and its Applications 221 (1995), 253-280.
  
  
• G. Labahn and T. Shalom, Inversion of Toeplitz Structured Matrices using only Standard Equations , Linear Algebra and its Applications 207 (1994), 49-70.
  
  
• G. Labahn, Inversion Components for Block Hankel-like Matrices , Linear Algebra and its Applications, 177 (1992), pp. 7-48.
  
  
• G. Labahn and T. Shalom, Inversion of Toeplitz Matrices with only Two Standard Equations , Linear Algebra and its Applications, 175 (1992), pp. 143-158.
  
  

  Papers in Journal of Complexity

• G. Labahn, M. Safey El Din, É. Schost and T. X. Vu, Homotopy techniques for solving sparse column support determinantal polynomial systems, Journal of Complexity. 86 (2021) 101557.
  
  
• G. Labahn, V. Neiger and W. Zhou, Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, Journal of Complexity. 42C (2017) pp. 44-71
  
  
• W. Zhou, G. Labahn and A. Storjohann, A deterministic algorithm for inverting a polynomial matrix , Journal of Complexity, 31(2) (2015) 162-173
  
  

  Papers in Journal of Computational and Applied Mathematics

• B. Beckermann and G. Labahn, Recursiveness in Matrix Rational Interpolation Problems, Journal of Computational and Applied Mathematics 77 (1997) 5-34.
  
  
• S. Cabay, G. Labahn and B. Beckermann, On the Theory and Computation of Non-perfect Pade-Hermite Approximants , Journal of Computational and Applied Mathematics, 39 (1992), pp. 295-313.
  
  

  Papers in Numerical Algorithms

• B. Beckermann and G. Labahn, A uniform approach for Hermite Pade and simultaneous Pade Approximants and their Matrix-type generalizations , Numerical Algorithms, 3 (1992), pp. 45-54.
  
  
• S. Cabay and G. Labahn, A Superfast Algorithm for Multi-dimensional Pade Approximation , Numerical Algorithms, 2 (1992), pp. 201-224.
  
  

  Papers in International Journal of Document Analysis and Recognition

• S. MacLean and G. Labahn, A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets, International Journal of Document Analysis and Recognition 16(2) (2013) 139-163
  
  
• S. MacLean, G. Labahn, E. Lank, M. Marzouk and D. Tausky, Grammar-based techniques for creating ground-truthed sketch corpora, International Journal of Document Analysis and Recognition, 14(1) (2011) 65-74.
  
  

  Papers in Journal of Computational Finance

• P. Forsyth and G. Labahn, ε-Monotone Fourier Methods for Optimal Stochastic Control in Finance. Journal of Computational Finance. 22(4) (2019) 25-71
  
  
• P.A. Forsyth and G. Labahn, Numerical Methods for Controlled Hamilton-Jacobi-Bellman PDEs in Finance, Journal of Computational Finance, 11(2) (2008) 1-44.
  
  

  Papers in Applied Mathematical Finance

• A.C. Belanger, P.A. Forsyth and G. Labahn, Valuing the Guaranteed Minimum Death Benefit Clause with Partial Withdrawals, Applied Mathematical Finance, 16(6) (2009) 451-496
  
  
• Y. d'Halluin, P.A. Forsyth, K.R. Vetzal, G. Labahn, A Numerical PDE Approach for Pricing Callable Bonds, Applied Mathematical Finance, 8 (2001) 49-77.
  
  

  Papers in Reliable Computing

• B. Beckermann and G. Labahn, Effective Computation of Rational Approximants and Interpolants, Reliable Computing 6 (2000) 365-390.
  
  

  Papers in ACM Transactions of Mathematical Software (TOMS)

• S. Cabay, A.R. Jones and G. Labahn, Experiments with a Weakly Stable Algorithm for Computing Pade-Hermite and Simultaneous Pade Approximants, ACM Transactions of Mathematical Software (TOMS) 23(1) (1997) 91-110.
  
  

  Papers in Applied Numerical Mathematics

• Y. Huang, P. Forsyth and G. Labahn, Inexact Arithmetic Considerations for Direct Control and Penalty Methods: American Options under Jump Diffusion, Applied Numerical Mathematics 72 (2013) 33-51.
  
  

  Papers in Journal of Scientific Computing

• J. Babbin, P. Forsyth and G. Labahn, A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching, Journal of Scientific Computing 58 (2014) 409-430.
  
  

  Papers in Pattern Recognition

• S. MacLean and G. Labahn, A Bayesian model for recognizing handwritten mathematical expressions. Pattern Recognition, 48 (2015) 2433-2445
  

  Papers in Advances in Applied Mathematics

• S. Chen, Q-H Hou, H. Huang, G. Labahn and R-H Wang, Constructing minimal telescopers for rational functions in three discrete variables, Advances in Applied Mathematics. 141 (2022) 102389
  
  

  Papers in Refereed Conferences

  Papers in ISSAC Conferences

• G. Labahn, C. Riener, M. Safey El Din, É. Schost and T. X. Vu, Faster real root decision algorithm for symmetric polynomials, Proceedings of ISSAC'23, July 24-27, Tromso. Norway, (2023) 452-460.
  
  
• G. Labahn, V. Neiger, T. X. Vu, W. Zhou, Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix, Proceedings of ISSAC'22, July 4-7, Lille, France, (2022) 351-360.
  
  
• R. Corless, G. Labahn, D. Piponi, L. R. Sevyeri, Bohemian Matrix Geometry, Proceedings of ISSAC'22, July 4-7, Lille, France, (2022)361-370.
  
  
• S. Birmpilis, G. Labahn, A. Storjohann, A Las Vegas Algorithm for Computing the Smith Form of a Nonsingular Integer Matrix, Proceedings of ISSAC'20, July 21-23, Kalamata, Greece, (2020) 38-45.
  (Winner of the ACM SIGSAM Distinguished Student Author Award)
  
  
• M. Giesbrecht, H. Huang, G. Labahn, E. Zima, Efficient Integer-Linear Decomposition of Multivariate Polynomials, Proceedings of ISSAC'19, July 15-18, Beijing, China, (2019), 171-178.
  
  
• S. Birmpilis, G. Labahn, A. Storjohann, Deterministic reduction of integer nonsingular linear system solving to matrix multiplication, Proceedings of ISSAC'19, July 15-18, Beijing, China, (2019), 58-65.
  
  
• M. Giesbrecht, J. Haraldson and G. Labahn, Computing nearby non-trivial Smith Forms, Proceedings of ISSAC'18, July 16-19, New York, (2018), 159-166.
  (Winner of the ACM SIGSAM Distinguished Student Author Award)
  
  
• M. Giesbrecht, J. Haraldson and G. Labahn, Computing the Nearest Rank-Deficient Matrix Polynomial, Proceedings of ISSAC'17, July 25-28, Kaiserslautern, Germany, (2017), 181-188.
  
  
• S. Chen, Q-H Hou, G. Labahn and R-H Wang, Existence Problem of Telescopers: Beyond the Bivariate Case, Proceedings of ISSAC'16, Waterloo, Canada, July 19-22, (2016) 167-174.
  
  
• W. Zhou and G. Labahn, Unimodular Completion of Polynomial Matrices, Proceedings of ISSAC'14, Kobe, Japan, July 23-25, (2014) 413-420.
  
  
• W. Zhou and G. Labahn, Computing Column Bases of Polynomial Matrices, Proceedings of ISSAC'13, Boston, USA, June 26-29, (2013) 379-386.
  
  
• E. Hubert and G. Labahn, Rational invariants of scalings from Hermite normal forms, Proceedings of ISSAC'12, Grenoble, France, July 22-25, (2012) 219-226
  
  
• W. Zhou, G. Labahn and A. Storjohann, Computing Minimal Nullspace Bases, Proceedings of ISSAC'12, Grenoble, France, July 22-25, (2012) 366-373
  (Winner of the ACM SIGSAM Distinguished Student Author Award)
  
  
• B. Beckermann and G. Labahn, Fraction-Free Computation of Simultaneous Pade Approximants, Proceedings of ISSAC'09, Seoul, Korea, ACM Press, (2009) 15-22
  
  
• W. Zhou and G. Labahn, Efficient Computation of Order Bases, Proceedings of ISSAC'09, Seoul, Korea, ACM Press, (2009) 375-382
  
  
• H. Cheng and G. Labahn, On Computing Polynomial GCD in Alternate Bases, Proceedings of ISSAC'06, Genoa, Italy, ACM Press, (2006) 47-54.
  
  
• M. Giesbrecht, G. Labahn and W-s Lee, Symbolic-numeric Sparse Interpolation of Multivariate Polynomials, Proceedings of ISSAC'06, Genoa, Italy, ACM Press, (2006) 116-123.
  
  
• G. Labahn and Ziming Li, Hyperexponential Solutions of Finite-rank Ideals in Orthogonal Ore Algebras, Proceedings of ISSAC'04, Santander, Spain, ACM Press, (2004) 213-220.
  
  
• R. Burger, G. Labahn and M. van Hoeij, Closed Form Solutions of Linear Odes having Elliptic Functions as Coefficients, Proceedings of ISSAC'04, Santander, Spain, ACM Press, (2004) 58-64.
  
  
• B. Beckermann, H. Cheng and G. Labahn, Fraction-free Row Reduction of Matrices of Skew Polynomials, Proceedings of ISSAC'02, Lille, France, ACM Press, (2002) 8-15.
  
  
• H. Cheng and G. Labahn, Computing all Factorizations in Zn[x], Proceedings of ISSAC'01, London, Canada, ACM Press, (2001) 64-71.
  
  
• B. Beckermann, G. Labahn and G. Villard, Shifted Normal Forms of Polynomial Matrices, Proceedings of ISSAC'99, Vancouver, ACM Press, (1999) 189-196.
  
  
• B. Beckermann, S. Cabay and G. Labahn, Fraction-free Computation of Matrix Pade Systems, Proceedings of ISSAC'97, Maui, ACM Press, (1997) 125-132.
  
  
• D.J. Jeffrey, G. Labahn, M. von Mohrenschildt and A.D. Rich, Integration of the signum, piecewise and related functions, Proceedings of ISSAC'97, Maui, ACM Press, (1997) 324-330.
  
  
• A. Storjohann and G. Labahn, Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices , Proceedings of ISSAC 96, ACM Press, (1996), pp. 259-266.
  
  
• A. Storjohann and G. Labahn, Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form computation , Proceedings of ISSAC 95, ACM Press, (1995), pp. 119-125.
  
  
• S. Cabay and G. Labahn, A Fast, Reliable Algorithm for Calculating Pade-Hermite Forms , Proceedings of ISSAC 89, (G.H. Gonnet ed.), ACM Press, (1989), pp. 95-100.
  
  
• G. Labahn and S. Cabay, Matrix Pade Fractions , Proceedings of EUROCAL 87, (J. Davenport ed.), Lecture Notes in Computer Science, Springer-Verlag, (1989), pp. 438-449.
  (EUROCAL was a predecessor of ISSAC)
  
  

  Papers in SBIM Conferences

• S. MacLean, D. Tausky, G. Labahn, E. Lank and M. Marzouk, Is the iPad useful for sketch input? A comparison with the Tablet PC, Proceedings of the 8th Eurographics Symposium on Sketch-Based Interfaces and Modeling (SBIM 2011), ACM, (2011) 7-14
  
  
• S. MacLean, D. Tausky, G. Labahn, E. Lank and M. Marzouk, Tools for the efficient generation of hand-drawn corpora based on context-free grammars, Proceedings of the 6th Eurographics Symposium on Sketch-Based Interfaces and Modeling (SBIM 2009). (2009) 125-132
  
  
• G. Labahn, E. Lank, M. Marzouk, A. Bunt, S. MacLean and D. Tausky, MathBrush: A Case Study for Pen-based Interactive Mathematics, Proceedings of the 5th Eurographics Symposium on Sketch-Based Interfaces and Modelling (SBIM 2008). (2008)
  
  
• D. Tausky, G. Labahn, E. Lank and M. Marzouk, Managing Ambiguity in Mathematical Matrices , Proceedings of the 4th Eurographics Symposium on Sketch-Based Interfaces and Modelling (SBIM 2007). (2007) 115-122.
  
  

  Papers in Asian Technology Conference in Mathematics

• K.O. Geddes and G. Labahn, Symbolic and Numeric Integration in Maple, Proceedings of the First Asian Technology Conference in Mathematics, (1995), pp. 377-386.
  
  
• K.O. Geddes and G. Labahn, The Maple Computer Algebra System, Proceedings of the First Asian Technology Conference in Mathematics, (1995), pp. 367-376.
  
  

  Papers in other Refereed Conferences

• S. MacLean and G. Labahn, Elastic matching in linear time and constant space, Proceedings of Ninth IAPR International Workshop on Document Analysis Systems, (Short paper), (2010) 551-554
  
  
• P. Davies, H. Cheng and G. Labahn, Computing Popov Form of General Ore Polynomial Matrices. Proceedings of Milestones in Computer Algebra (MICA) (2008) 149-156.
  
  
• G. Labahn, E. Lank, S. MacLean, M. Marzouk and D. Tausky, MathBrush: A System for Doing Math on Pen-Based Devices, Proceedings of The Eighth IAPR Workshop on Document Analysis Systems DAS 2008, September 16-19, Nara, Japan (2008) 599-606.
  
  
• H. Cheng and G. Labahn, Modular Computation for Matrices of Ore Polynomials, Proceedings of WSPC (In Honor of the 60-th birthday of Sergei Abramov), (2007) 43-66
  
  
• M. Giesbrecht, G. Labahn and Y. Zhang, Computing Valuation Popov Forms, Proceedings of CASC'2005, Lecture Notes on Computer Science 3516, Springer-Verlag, (2005) 619-626.
  
  
• M. Giesbrecht, G. Labahn and W-s Lee, Symbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation, Proceedings of Computer Algebra in Scientific Computing (CASC 2004), St. Petersburg, Russia, (2004)
  
  
• C.-P. Jeannerod and G. Labahn, The SNAP Package for Arithmetic with Numeric Polynomials, Proceedings of International Congress of Mathematical Software 2002, Beijing, China, (2002) 61-71.
  
  
• W. Heidrich, R. Bartels and G. Labahn, Fitting Uncertain Data with NURBS, Proceedings of Curves and Surfaces, Chamonix, France, (1997)
  
  
• M. Van Barel, B. Beckermann, A. Bultheel and G. Labahn, Matrix Rational Interpolation with Pole Information , Nonlinear Numerical Methods and Rational Approximation, (A. Cuyts ed.), Kluwer Academic Publishers, (1994), pp 137-148.
  
  
• S. Cabay and G. Labahn, Fast, Numerically Stable Inversion of Mosaic Hankel Matrices , Systems and Networks: Mathematical Theory and Applications, Volume II: Invited and Contributed Papers, (U. Helmke, R. Mennicken and J. Saurer, ed.) Akademie Verlag (1994), 625-630.
  
  
• T.C. Scott, R.A. Moore, G.J. Fee, M.B. Monagan, G. Labahn and K.O. Geddes, Perturbative Solutions of Quantum Mechanical Problems by Symbolic Computation: A Review, International J. of Modern Phys. C, 1 (1990), pp. 53-76.
  
  

  Refereed Workshops

• G. Labahn, S. MacLean, M. Marzouk, I. Rutherford and D. Tausky, A preliminary report on the MathBrush pen-math system , Proceedings of Maple Conference 2006, (2006) 162-178.
  
  
• G. Labahn and T. Humphries, Symbolic Integration of Jacobian Elliptic Functions in Maple , Proceedings of Maple Conference 2005, (2005) 331-339.
  
  
• M. Giesbrecht, G. Labahn and Y. Zhang, Computing Valuation Popov Forms, Proceedings of the Workshop on Computer Algebra Systems and their Applications (CASC'05) (2005).
  
  
• M. Giesbrecht, G. Labahn and W-s Lee, Symbolic-Numeric Sparse Polynomial Interpolation of Multivariate Polynomials, Proceedings 9th Rhine Workshop on Computer Algebra (2004).
  
  
• M. Giesbrecht, G. Labahn and W.-s. Lee, Symbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation. Proceedings of the Workshop on Computer Algebra in Scientific Computation (CASC'04) (2004) 195-206.
  
  

  Others

• G. Labahn, Closed Form PDF for Merton's Jump Diffusion Model , Working paper (2003)
  
  
• G. Labahn and M. Mutrie, Reduction of elliptic integrals to Legendre normal form, Department of Computer Science, University of Waterloo (1997) Preprint 97-21. 19 pages.
  
  
• G. Labahn, Solving Linear Differential Equations in Maple, MapleTech, 2 (1995), 20-28.
  

  Theses

• Pade Forms and Inverses of Block Hankel Matrices, PhD Thesis, Department of Computer Science, University of Alberta (1988)
  
  
• Matrix Pade Approximants M.Sc Thesis, Department of Computer Science, University of Alberta (1986)