George Labahn

According to our database1, George Labahn authored at least 88 papers between 1987 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2021
Computing nearby non-trivial Smith forms.
J. Symb. Comput., 2021

2020
Foreword.
Math. Comput. Sci., 2020

Computing lower rank approximations of matrix polynomials.
J. Symb. Comput., 2020

Computing critical points for invariant algebraic systems.
CoRR, 2020

Homotopy techniques for solving sparse column support determinantal polynomial systems.
CoRR, 2020

Efficient q-Integer Linear Decomposition of Multivariate Polynomials.
CoRR, 2020

A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Efficient Rational Creative Telescoping.
CoRR, 2019

Constructing minimal telescopers for rational functions in three discrete variables.
CoRR, 2019

Efficient Integer-Linear Decomposition of Multivariate Polynomials.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Convergence of Implicit Schemes for Hamilton-Jacobi-Bellman Quasi-Variational Inequalities.
SIAM J. Control. Optim., 2018

On rational functions without Froissart doublets.
Numerische Mathematik, 2018

2017
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix.
J. Complex., 2017

Computing the Nearest Rank-Deficient Matrix Polynomial.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Computation of invariants of finite abelian groups.
Math. Comput., 2016

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix.
CoRR, 2016

Thematic program in computer algebra: July 1 - Dec 31, 2015.
ACM Commun. Comput. Algebra, 2016

Existence Problem of Telescopers: Beyond the Bivariate Case.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
A Bayesian model for recognizing handwritten mathematical expressions.
Pattern Recognit., 2015

A deterministic algorithm for inverting a polynomial matrix.
J. Complex., 2015

Sparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251).
Dagstuhl Reports, 2015

Rational invariants of finite abelian groups.
ACM Commun. Comput. Algebra, 2015

Dynamical systems and scaling invariants.
ACM Commun. Comput. Algebra, 2015

2014
A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching.
J. Sci. Comput., 2014

Fast and deterministic computation of the determinant of a polynomial matrix.
CoRR, 2014

Unimodular completion of polynomial matrices.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom.
SIAM J. Control. Optim., 2013

On simultaneous row and column reduction of higher-order linear differential systems.
J. Symb. Comput., 2013

A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets.
Int. J. Document Anal. Recognit., 2013

Scaling Invariants and Symmetry Reduction of Dynamical Systems.
Found. Comput. Math., 2013

Computing column bases of polynomial matrices.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance.
SIAM J. Numer. Anal., 2012

Iterative methods for the solution of a singular control formulation of a GMWB pricing problem.
Numerische Mathematik, 2012

Efficient algorithms for order basis computation.
J. Symb. Comput., 2012

Gröbner walk for computing matrix normal forms over Ore polynomials.
ACM Commun. Comput. Algebra, 2012

Computing minimal nullspace bases.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Rational invariants of scalings from Hermite normal forms.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Methods for Pricing American Options under Regime Switching.
SIAM J. Sci. Comput., 2011

Grammar-based techniques for creating ground-truthed sketch corpora.
Int. J. Document Anal. Recognit., 2011

Is the iPad useful for sketch input? A comparison with the Tablet PC.
Proceedings of the 8th ACM SIGGRAPH / Eurographics Symposium on Sketch-Based Interfaces and Modeling, 2011

Analyzing sketch content using in-air packet information.
Proceedings of the 16th International Conference on Intelligent User Interfaces, 2011

2009
Symbolic-numeric sparse interpolation of multivariate polynomials.
J. Symb. Comput., 2009

Applying linear algebra routines to modular ore polynomial matrix algorithms.
ACM Commun. Comput. Algebra, 2009

Tools for the Efficient Generation of Hand-Drawn Corpora Based on Context-Free Grammars.
Proceedings of the 6th ACM SIGGRAPH / Eurographics Symposium on Sketch-Based Interfaces and Modeling, 2009

Efficient computation of order bases.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Fraction-free computation of simultaneous padé approximants.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Computing Popov Forms of Matrices Over PBW Extensions.
Proceedings of the Computer Mathematics, 2009

A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices.
Proceedings of the Computer Mathematics, 2009

2008
Computing polynomial LCM and GCD in lagrange basis.
ACM Commun. Comput. Algebra, 2008

MathBrush: A Case Study for Pen-based Interactive Mathematics.
Proceedings of the 5th Eurographics Workshop on Sketch-Based Interfaces and Modeling, 2008

MathBrush: A System for Doing Math on Pen-Based Devices.
Proceedings of the Eighth IAPR International Workshop on Document Analysis Systems, 2008

2007
On the numerical condition of a generalized Hankel eigenvalue problem.
Numerische Mathematik, 2007

Output-sensitive modular algorithms for polynomial matrix normal forms.
J. Symb. Comput., 2007

Managing Ambiguity in Mathematical Matrices.
Proceedings of the 4th Eurographics Workshop on Sketch-Based Interfaces and Modeling, 2007

2006
Normal forms for general polynomial matrices.
J. Symb. Comput., 2006

Fraction-free row reduction of matrices of Ore polynomials.
J. Symb. Comput., 2006

On computing polynomial GCDs in alternate bases.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

MathBrush: An Experimental Pen-Based Math System.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

Probabilistically Stable Numerical Sparse Polynomial Interpolation.
Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005
A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion.
SIAM J. Sci. Comput., 2005

Computing Valuation Popov Forms.
Proceedings of the Computational Science, 2005

2004
A penalty method for American options with jump diffusion processes.
Numerische Mathematik, 2004

Hyperexponential solutions of finite-rank ideals in orthogonal ore rings.
Proceedings of the Symbolic and Algebraic Computation, 2004

Closed form solutions of linear odes having elliptic function coefficients.
Proceedings of the Symbolic and Algebraic Computation, 2004

2002
Fraction-free row reduction of matrices of skew polynomials.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Computing all factorizations in ***.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs.
SIAM J. Matrix Anal. Appl., 2000

Effective Computation of Rational Approximants and Interpolants.
Reliab. Comput., 2000

Numerical methods for pricing callable bonds.
Proceedings of the IEEE/IAFE/INFORMS 2000 Conference on Computational Intelligence for Financial Engineering, 2000

1999
Shifted Normal Forms of Polynomial Matrices.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998
A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting Relatively Prime Numerical Polynomials.
J. Symb. Comput., 1998

When are Two Numerical Polynomials Relatively Prime?
J. Symb. Comput., 1998

Poster Session Abstracts of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC 1998 Rostock, Germany August 13 - 15, 1998.
SIGSAM Bull., 1998

1997
Algorithm 766: Experiments with a Weakly Stable Algorithm for Computing Padé-Hermite and Simultaneous Padé Approximants.
ACM Trans. Math. Softw., 1997

Integration of the Signum, Piecewise and Related Functions.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Fraction-free Computation of Catrix Padé Systems.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996
Computation of Numerical Padé-Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm.
SIAM J. Matrix Anal. Appl., 1996

Computation of Numerical Padé-Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices.
SIAM J. Matrix Anal. Appl., 1996

Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1992
A superfast algorithm for multi-dimensional Padé systems.
Numer. Algorithms, 1992

A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations.
Numer. Algorithms, 1992

Algorithms for computer algebra.
Kluwer, ISBN: 978-0-7923-9259-0, 1992

1990
The Inverses of Block Hankel and Block Toeplitz Matrices.
SIAM J. Comput., 1990

1989
Matrix Padé Fractions and Their Computation.
SIAM J. Comput., 1989

A Fast, Reliable Algorithm for Calculating Padé-Hermite Forms.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1987
Matrix-Padé fractions.
Proceedings of the EUROCAL '87, 1987


  Loading...