George Labahn

ORCID

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 41

Top Venues

Publications

Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Computing critical points for invariant algebraic systems. J. Symb. Comput. 116 (2023)
Frédéric Chyzak, George Labahn
Special issue on Symbolic and Algebraic Computation: ISSAC 2021. J. Symb. Comput. 116 (2023)
Stavros Birmpilis, George Labahn, Arne Storjohann
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix. ACM Trans. Algorithms 19 (4) (2023)
George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Faster real root decision algorithm for symmetric polynomials. ISSAC (2023)
Stavros Birmpilis, George Labahn, Arne Storjohann
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. J. Symb. Comput. 116 (2023)
George Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Faster real root decision algorithm for symmetric polynomials. CoRR (2023)
Robert M. Corless, George Labahn, Dan Piponi, Leili Rafiee Sevyeri
Bohemian Matrix Geometry. ISSAC (2022)
George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. ISSAC (2022)
Robert M. Corless, George Labahn, Dan Piponi, Leili Rafiee Sevyeri
Bohemian Matrix Geometry. CoRR (2022)
George Labahn, Vincent Neiger, Thi Xuan Vu, Wei Zhou
Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix. CoRR (2022)
Shaoshi Chen, Qing-Hu Hou, Hui Huang, George Labahn, Rong-Hua Wang
Constructing minimal telescopers for rational functions in three discrete variables. Adv. Appl. Math. 141 (2022)
Stavros Birmpilis, George Labahn, Arne Storjohann
A cubic algorithm for computing the Hermite normal form of a nonsingular integer matrix. CoRR (2022)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima
Efficient rational creative telescoping. J. Symb. Comput. 109 (2022)
Stavros Birmpilis, George Labahn, Arne Storjohann
A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. CoRR (2021)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
-integer linear decomposition of multivariate polynomials. J. Symb. Comput. 107 (2021)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing nearby non-trivial Smith forms. J. Symb. Comput. 102 (2021)
George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Homotopy techniques for solving sparse column support determinantal polynomial systems. J. Complex. 66 (2021)
Stavros Birmpilis, George Labahn, Arne Storjohann
A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix. ISSAC (2020)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing lower rank approximations of matrix polynomials. J. Symb. Comput. 98 (2020)
George Labahn, James H. Davenport, Josef Urban
Foreword. Math. Comput. Sci. 14 (3) (2020)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
Efficient q-Integer Linear Decomposition of Multivariate Polynomials. CoRR (2020)
Yin Ki Ng, Dallas J. Fraser, Besat Kassaie, George Labahn, Mirette S. Marzouk, Frank Wm. Tompa, Kevin Wang
Dowsing for Math Answers with Tangent-L. CLEF (Working Notes) (2020)
Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Computing critical points for invariant algebraic systems. CoRR (2020)
George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
Homotopy techniques for solving sparse column support determinantal polynomial systems. CoRR (2020)
Shaoshi Chen, Qing-Hu Hou, Hui Huang, George Labahn, Rong-Hua Wang
Constructing minimal telescopers for rational functions in three discrete variables. CoRR (2019)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
Efficient Integer-Linear Decomposition of Multivariate Polynomials. ISSAC (2019)
Stavros Birmpilis, George Labahn, Arne Storjohann
Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication. ISSAC (2019)
Mark Giesbrecht, Hui Huang, George Labahn, Eugene V. Zima
Efficient Rational Creative Telescoping. CoRR (2019)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing Nearby Non-trivial Smith Forms. ISSAC (2018)
Bernhard Beckermann, George Labahn, Ana C. Matos
On rational functions without Froissart doublets. Numerische Mathematik 138 (3) (2018)
Parsiad Azimzadeh, Erhan Bayraktar, George Labahn
Convergence of Implicit Schemes for Hamilton-Jacobi-Bellman Quasi-Variational Inequalities. SIAM J. Control. Optim. 56 (6) (2018)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing Nearby Non-trivial Smith Forms. CoRR (2018)
George Labahn, Vincent Neiger, Wei Zhou
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. J. Complex. 42 (2017)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing the Nearest Rank-Deficient Matrix Polynomial. ISSAC (2017)
Mark Giesbrecht, Joseph Haraldson, George Labahn
Computing Lower Rank Approximations of Matrix Polynomials. CoRR (2017)
Shaoshi Chen, Qing-Hu Hou, George Labahn, Rong-Hua Wang
Existence Problem of Telescopers: Beyond the Bivariate Case. ISSAC (2016)
George Labahn, Vincent Neiger, Wei Zhou
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. CoRR (2016)
George Labahn, Stephen M. Watt
Thematic program in computer algebra: July 1 - Dec 31, 2015. ACM Commun. Comput. Algebra 50 (1) (2016)
Evelyne Hubert, George Labahn
Computation of invariants of finite abelian groups. Math. Comput. 85 (302) (2016)
Shaoshi Chen, Qing-Hu Hou, George Labahn, Rong-Hua Wang
Existence Problem of Telescopers: Beyond the Bivariate Case. CoRR (2016)
George Labahn, Wei Zhou
A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix. CoRR (2016)
George Labahn
Rational invariants of finite abelian groups. ACM Commun. Comput. Algebra 49 (1) (2015)
Annie A. M. Cuyt, George Labahn, Avraham Sidi, Wen-shin Lee
Sparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251). Dagstuhl Reports 5 (6) (2015)
Scott MacLean, George Labahn
A Bayesian model for recognizing handwritten mathematical expressions. Pattern Recognit. 48 (8) (2015)
Wei Zhou, George Labahn, Arne Storjohann
A deterministic algorithm for inverting a polynomial matrix. J. Complex. 31 (2) (2015)
George Labahn
Dynamical systems and scaling invariants. ACM Commun. Comput. Algebra 49 (1) (2015)
Scott MacLean, George Labahn
A Bayesian model for recognizing handwritten mathematical expressions. CoRR (2014)
Wei Zhou, George Labahn
Unimodular completion of polynomial matrices. ISSAC (2014)
Josh Babbin, Peter A. Forsyth, George Labahn
A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching. J. Sci. Comput. 58 (2) (2014)
Wei Zhou, George Labahn
Fast and deterministic computation of the determinant of a polynomial matrix. CoRR (2014)
Wei Zhou, George Labahn
Computing column bases of polynomial matrices. ISSAC (2013)
Scott MacLean, George Labahn
A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets. Int. J. Document Anal. Recognit. 16 (2) (2013)
Evelyne Hubert, George Labahn
Scaling Invariants and Symmetry Reduction of Dynamical Systems. Found. Comput. Math. 13 (4) (2013)
Moulay A. Barkatou, Carole El Bacha, George Labahn, Eckhard Pflügel
On simultaneous row and column reduction of higher-order linear differential systems. J. Symb. Comput. 49 (2013)
Wai Man Ng, Dong Eui Chang, George Labahn
Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom. SIAM J. Control. Optim. 51 (2) (2013)
Y. Huang, Peter A. Forsyth, George Labahn
Iterative methods for the solution of a singular control formulation of a GMWB pricing problem. Numerische Mathematik 122 (1) (2012)
Y. Huang, Peter A. Forsyth, George Labahn
Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance. SIAM J. Numer. Anal. 50 (4) (2012)
Evelyne Hubert, George Labahn
Rational invariants of scalings from Hermite normal forms. ISSAC (2012)
George Labahn, Johannes Middeke
Gröbner walk for computing matrix normal forms over Ore polynomials. ACM Commun. Comput. Algebra 46 (3/4) (2012)
Wei Zhou, George Labahn
Efficient algorithms for order basis computation. J. Symb. Comput. 47 (7) (2012)
Wei Zhou, George Labahn, Arne Storjohann
Computing minimal nullspace bases. ISSAC (2012)
Scott MacLean, George Labahn, Edward Lank, Mirette S. Marzouk, David Tausky
Grammar-based techniques for creating ground-truthed sketch corpora. Int. J. Document Anal. Recognit. 14 (1) (2011)
David Tausky, Edward Lank, Richard Mann, George Labahn
Analyzing sketch content using in-air packet information. IUI (2011)
Scott MacLean, David Tausky, George Labahn, Edward Lank, Mirette S. Marzouk
Is the iPad useful for sketch input? A comparison with the Tablet PC. SBIM (2011)
Y. Huang, Peter A. Forsyth, George Labahn
Methods for Pricing American Options under Regime Switching. SIAM J. Sci. Comput. 33 (5) (2011)
Mark Giesbrecht, George Labahn, Yang Zhang
Computing Popov Forms of Matrices Over PBW Extensions. ASCM (2009)
Wei Zhou, George Labahn
Efficient computation of order bases. ISSAC (2009)
Howard Cheng, George Labahn
A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices. ASCM (2009)
Mark Giesbrecht, George Labahn, Wen-shin Lee
Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput. 44 (8) (2009)
Scott MacLean, David Tausky, George Labahn, Edward Lank, Mirette S. Marzouk
Tools for the Efficient Generation of Hand-Drawn Corpora Based on Context-Free Grammars. SBIM (2009)
Bernhard Beckermann, George Labahn
Fraction-free computation of simultaneous padé approximants. ISSAC (2009)
Howard Cheng, George Labahn
Applying linear algebra routines to modular ore polynomial matrix algorithms. ACM Commun. Comput. Algebra 43 (3/4) (2009)
Howard Cheng, George Labahn, Wei Zhou
Computing polynomial LCM and GCD in lagrange basis. ACM Commun. Comput. Algebra 42 (3) (2008)
George Labahn, Edward Lank, Scott MacLean, Mirette S. Marzouk, David Tausky
MathBrush: A System for Doing Math on Pen-Based Devices. Document Analysis Systems (2008)
George Labahn, Edward Lank, Mirette S. Marzouk, Andrea Bunt, Scott MacLean, David Tausky
MathBrush: A Case Study for Pen-based Interactive Mathematics. SBIM (2008)
Howard Cheng, George Labahn
Output-sensitive modular algorithms for polynomial matrix normal forms. J. Symb. Comput. 42 (7) (2007)
David Tausky, George Labahn, Edward Lank, Mirette S. Marzouk
Managing Ambiguity in Mathematical Matrices. SBIM (2007)
Bernhard Beckermann, Gene H. Golub, George Labahn
On the numerical condition of a generalized Hankel eigenvalue problem. Numerische Mathematik 106 (1) (2007)
George Labahn, Scott MacLean, Mirette S. Marzouk, Ian Rutherford, David Tausky
MathBrush: An Experimental Pen-Based Math System. Challenges in Symbolic Computation Software (2006)
Mark Giesbrecht, George Labahn, Wen-shin Lee
Probabilistically Stable Numerical Sparse Polynomial Interpolation. Challenges in Symbolic Computation Software (2006)
Bernhard Beckermann, George Labahn, Gilles Villard
Normal forms for general polynomial matrices. J. Symb. Comput. 41 (6) (2006)
Howard Cheng, George Labahn
On computing polynomial GCDs in alternate bases. ISSAC (2006)
Bernhard Beckermann, Howard Cheng, George Labahn
Fraction-free row reduction of matrices of Ore polynomials. J. Symb. Comput. 41 (5) (2006)
Mark Giesbrecht, George Labahn, Wen-shin Lee
Symbolic-numeric sparse interpolation of multivariate polynomials. ISSAC (2006)
Mark Giesbrecht, George Labahn, Yang Zhang
Computing Valuation Popov Forms. International Conference on Computational Science (3) (2005)
Yann d'Halluin, Peter A. Forsyth, George Labahn
A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion. SIAM J. Sci. Comput. 27 (1) (2005)
Yann d'Halluin, Peter A. Forsyth, George Labahn
A penalty method for American options with jump diffusion processes. Numerische Mathematik 97 (2) (2004)
George Labahn, Ziming Li
Hyperexponential solutions of finite-rank ideals in orthogonal ore rings. ISSAC (2004)
Reinhold Burger, George Labahn, Mark van Hoeij
Closed form solutions of linear odes having elliptic function coefficients. ISSAC (2004)
Bernhard Beckermann, Howard Cheng, George Labahn
Fraction-free row reduction of matrices of skew polynomials. ISSAC (2002)
Howard Cheng, George Labahn
Computing all factorizations in ***. ISSAC (2001)
Yann d'Halluin, Peter A. Forsyth, Kenneth R. Vetzal, George Labahn
Numerical methods for pricing callable bonds. CIFEr (2000)
Bernhard Beckermann, George Labahn
Effective Computation of Rational Approximants and Interpolants. Reliab. Comput. 6 (4) (2000)
Bernhard Beckermann, George Labahn
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs. SIAM J. Matrix Anal. Appl. 22 (1) (2000)
Bernhard Beckermann, George Labahn, Gilles Villard
Shifted Normal Forms of Polynomial Matrices. ISSAC (1999)
Bernhard Beckermann, George Labahn
When are Two Numerical Polynomials Relatively Prime? J. Symb. Comput. 26 (6) (1998)
Bernhard Beckermann, George Labahn
A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials. J. Symb. Comput. 26 (6) (1998)
George Labahn, Mohamed Omar Rayes
Poster Session Abstracts of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC 1998 Rostock, Germany August 13 - 15, 1998. SIGSAM Bull. 32 (2) (1998)
David J. Jeffrey, George Labahn, Martin von Mohrenschildt, Albert D. Rich
Integration of the Signum, Piecewise and Related Functions. ISSAC (1997)
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) (1997)

George Labahn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

George Labahn