[ 2018 ]


[ 70 ]
Bernhard Beckermann, George Labahn, and Ana C. Matos. On rational functions without froissart doublets. Numerische Mathematik, 138:615--633, 2018. [ http ]
@article{DBLP:journals/nm/BeckermannLM18,
 author = {Bernhard Beckermann and
George Labahn and
Ana C. Matos},
 doi = {10.1007/s00211-017-0917-3},
 journal = {Numerische Mathematik},
 pages = {615--633},
 title = {On rational functions without Froissart doublets},
 url = {https://doi.org/10.1007/s00211-017-0917-3},
 volume = {138},
 year = {2018}
}



[ 2017 ]


[ 69 ]
Mark Giesbrecht, Joseph Haraldson, and George Labahn. Computing lower rank approximations of matrix polynomials. CoRR, abs/1712.04007, 2017. [ http ]
@article{DBLP:journals/corr/abs-1712-04007,
 author = {Mark Giesbrecht and
Joseph Haraldson and
George Labahn},
 journal = {CoRR},
 title = {Computing Lower Rank Approximations of Matrix Polynomials},
 url = {http://arxiv.org/abs/1712.04007},
 volume = {abs/1712.04007},
 year = {2017}
}

[ 68 ]
George Labahn, Vincent Neiger, and Wei Zhou. Fast, deterministic computation of the hermite normal form and determinant of a polynomial matrix. J. Complexity, 42:44--71, 2017. [ http ]
@article{DBLP:journals/jc/LabahnNZ17,
 author = {George Labahn and
Vincent Neiger and
Wei Zhou},
 doi = {10.1016/j.jco.2017.03.003},
 journal = {J. Complexity},
 pages = {44--71},
 title = {Fast, deterministic computation of the Hermite normal form and determinant
of a polynomial matrix},
 url = {https://doi.org/10.1016/j.jco.2017.03.003},
 volume = {42},
 year = {2017}
}

[ 67 ]
Mark Giesbrecht, Joseph Haraldson, and George Labahn. Computing the nearest rank-deficient matrix polynomial. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017, pages 181--188. ACM, 2017. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtHL17,
 author = {Mark Giesbrecht and
Joseph Haraldson and
George Labahn},
 booktitle = {Proceedings of the 2017 {ACM} on International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 2017, Kaiserslautern, Germany,
July 25-28, 2017},
 doi = {10.1145/3087604.3087648},
 editor = {Michael A. Burr and
Chee K. Yap and
Mohab Safey El Din},
 pages = {181--188},
 publisher = {{ACM}},
 title = {Computing the Nearest Rank-Deficient Matrix Polynomial},
 url = {http://doi.acm.org/10.1145/3087604.3087648},
 year = {2017}
}



[ 2016 ]


[ 66 ]
George Labahn and Stephen M. Watt. Thematic program in computer algebra: July 1 - dec 31, 2015. ACM Comm. Computer Algebra, 50:25--26, 2016. [ http ]
@article{DBLP:journals/cca/LabahnW16,
 author = {George Labahn and
Stephen M. Watt},
 doi = {10.1145/2930964.2930967},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {25--26},
 title = {Thematic program in computer algebra: July 1 - Dec 31, 2015},
 url = {http://doi.acm.org/10.1145/2930964.2930967},
 volume = {50},
 year = {2016}
}

[ 65 ]
Shaoshi Chen, Qing-Hu Hou, George Labahn, and Rong-Hua Wang. Existence problem of telescopers: Beyond the bivariate case. CoRR, abs/1601.03080, 2016. [ http ]
@article{DBLP:journals/corr/ChenHLW16,
 author = {Shaoshi Chen and
Qing{-}Hu Hou and
George Labahn and
Rong{-}Hua Wang},
 journal = {CoRR},
 title = {Existence Problem of Telescopers: Beyond the Bivariate Case},
 url = {http://arxiv.org/abs/1601.03080},
 volume = {abs/1601.03080},
 year = {2016}
}

[ 64 ]
George Labahn, Vincent Neiger, and Wei Zhou. Fast, deterministic computation of the hermite normal form and determinant of a polynomial matrix. CoRR, abs/1607.04176, 2016. [ http ]
@article{DBLP:journals/corr/LabahnNZ16,
 author = {George Labahn and
Vincent Neiger and
Wei Zhou},
 journal = {CoRR},
 title = {Fast, deterministic computation of the Hermite normal form and determinant
of a polynomial matrix},
 url = {http://arxiv.org/abs/1607.04176},
 volume = {abs/1607.04176},
 year = {2016}
}

[ 63 ]
George Labahn and Wei Zhou. A fast, deterministic algorithm for computing a hermite normal form of a polynomial matrix. CoRR, abs/1602.02049, 2016. [ http ]
@article{DBLP:journals/corr/LabahnZ16,
 author = {George Labahn and
Wei Zhou},
 journal = {CoRR},
 title = {A fast, deterministic algorithm for computing a Hermite Normal Form
of a polynomial matrix},
 url = {http://arxiv.org/abs/1602.02049},
 volume = {abs/1602.02049},
 year = {2016}
}

[ 62 ]
Evelyne Hubert and George Labahn. Computation of invariants of finite abelian groups. Math. Comput., 85:3029--3050, 2016. [ http ]
@article{DBLP:journals/moc/HubertL16,
 author = {Evelyne Hubert and
George Labahn},
 doi = {10.1090/mcom/3076},
 journal = {Math. Comput.},
 pages = {3029--3050},
 title = {Computation of invariants of finite abelian groups},
 url = {https://doi.org/10.1090/mcom/3076},
 volume = {85},
 year = {2016}
}

[ 61 ]
Shaoshi Chen, Qing-Hu Hou, George Labahn, and Rong-Hua Wang. Existence problem of telescopers: Beyond the bivariate case. In Sergei A. Abramov, Eugene V. Zima, and Xiao-Shan Gao, editors, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2016, Waterloo, ON, Canada, July 19-22, 2016, pages 167--174. ACM, 2016. [ http ]
@inproceedings{DBLP:conf/issac/ChenHLW16,
 author = {Shaoshi Chen and
Qing{-}Hu Hou and
George Labahn and
Rong{-}Hua Wang},
 booktitle = {Proceedings of the {ACM} on International Symposium on Symbolic and
Algebraic Computation, {ISSAC} 2016, Waterloo, ON, Canada, July 19-22,
2016},
 doi = {10.1145/2930889.2930895},
 editor = {Sergei A. Abramov and
Eugene V. Zima and
Xiao{-}Shan Gao},
 pages = {167--174},
 publisher = {{ACM}},
 title = {Existence Problem of Telescopers: Beyond the Bivariate Case},
 url = {http://doi.acm.org/10.1145/2930889.2930895},
 year = {2016}
}



[ 2015 ]


[ 60 ]
George Labahn. Rational invariants of finite abelian groups. ACM Comm. Computer Algebra, 49:31--32, 2015. [ http ]
@article{DBLP:journals/cca/Labahn15a,
 author = {George Labahn},
 doi = {10.1145/2768577.2768641},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {31--32},
 title = {Rational invariants of finite abelian groups},
 url = {http://doi.acm.org/10.1145/2768577.2768641},
 volume = {49},
 year = {2015}
}

[ 59 ]
George Labahn. Dynamical systems and scaling invariants. ACM Comm. Computer Algebra, 49:25, 2015. [ http ]
@article{DBLP:journals/cca/Labahn15,
 author = {George Labahn},
 doi = {10.1145/2768577.2768621},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {25},
 title = {Dynamical systems and scaling invariants},
 url = {http://doi.acm.org/10.1145/2768577.2768621},
 volume = {49},
 year = {2015}
}

[ 58 ]
Annie A. M. Cuyt, George Labahn, Avraham Sidi, and Wen-shin Lee. Sparse modelling and multi-exponential analysis (dagstuhl seminar 15251). Dagstuhl Reports, 5:48--69, 2015. [ http ]
@article{DBLP:journals/dagstuhl-reports/CuytLSL15,
 author = {Annie A. M. Cuyt and
George Labahn and
Avraham Sidi and
Wen{-}shin Lee},
 doi = {10.4230/DagRep.5.6.48},
 journal = {Dagstuhl Reports},
 pages = {48--69},
 title = {Sparse modelling and multi-exponential analysis (Dagstuhl Seminar
15251)},
 url = {https://doi.org/10.4230/DagRep.5.6.48},
 volume = {5},
 year = {2015}
}

[ 57 ]
Wei Zhou, George Labahn, and Arne Storjohann. A deterministic algorithm for inverting a polynomial matrix. J. Complexity, 31:162--173, 2015. [ http ]
@article{DBLP:journals/jc/ZhouLS15,
 author = {Wei Zhou and
George Labahn and
Arne Storjohann},
 doi = {10.1016/j.jco.2014.09.004},
 journal = {J. Complexity},
 pages = {162--173},
 title = {A deterministic algorithm for inverting a polynomial matrix},
 url = {https://doi.org/10.1016/j.jco.2014.09.004},
 volume = {31},
 year = {2015}
}

[ 56 ]
Scott MacLean and George Labahn. A bayesian model for recognizing handwritten mathematical expressions. Pattern Recognition, 48:2433--2445, 2015. [ http ]
@article{DBLP:journals/pr/MacLeanL15,
 author = {Scott MacLean and
George Labahn},
 doi = {10.1016/j.patcog.2015.02.017},
 journal = {Pattern Recognition},
 pages = {2433--2445},
 title = {A Bayesian model for recognizing handwritten mathematical expressions},
 url = {https://doi.org/10.1016/j.patcog.2015.02.017},
 volume = {48},
 year = {2015}
}



[ 2014 ]


[ 55 ]
Scott MacLean and George Labahn. A bayesian model for recognizing handwritten mathematical expressions. CoRR, abs/1409.5317, 2014. [ http ]
@article{DBLP:journals/corr/MacLeanL14,
 author = {Scott MacLean and
George Labahn},
 journal = {CoRR},
 title = {A Bayesian model for recognizing handwritten mathematical expressions},
 url = {http://arxiv.org/abs/1409.5317},
 volume = {abs/1409.5317},
 year = {2014}
}

[ 54 ]
Wei Zhou and George Labahn. Fast and deterministic computation of the determinant of a polynomial matrix. CoRR, abs/1409.5462, 2014. [ http ]
@article{DBLP:journals/corr/ZhouL14,
 author = {Wei Zhou and
George Labahn},
 journal = {CoRR},
 title = {Fast and deterministic computation of the determinant of a polynomial
matrix},
 url = {http://arxiv.org/abs/1409.5462},
 volume = {abs/1409.5462},
 year = {2014}
}

[ 53 ]
Josh Babbin, Peter A. Forsyth, and George Labahn. A comparison of iterated optimal stopping and local policy iteration for american options under regime switching. J. Sci. Comput., 58:409--430, 2014. [ http ]
@article{DBLP:journals/jscic/BabbinFL14,
 author = {Josh Babbin and
Peter A. Forsyth and
George Labahn},
 doi = {10.1007/s10915-013-9739-3},
 journal = {J. Sci. Comput.},
 pages = {409--430},
 title = {A Comparison of Iterated Optimal Stopping and Local Policy Iteration
for American Options Under Regime Switching},
 url = {https://doi.org/10.1007/s10915-013-9739-3},
 volume = {58},
 year = {2014}
}

[ 52 ]
Wei Zhou and George Labahn. Unimodular completion of polynomial matrices. In Katsusuke Nabeshima, Kosaku Nagasaka, Franz Winkler, and Ágnes Szántó, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014, pages 413--420. ACM, 2014. [ http ]
@inproceedings{DBLP:conf/issac/ZhouL14,
 author = {Wei Zhou and
George Labahn},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, {ISSAC}
'14, Kobe, Japan, July 23-25, 2014},
 doi = {10.1145/2608628.2608640},
 editor = {Katsusuke Nabeshima and
Kosaku Nagasaka and
Franz Winkler and
{'{A}}gnes Sz{'{a}}nt{'{o}}},
 pages = {413--420},
 publisher = {{ACM}},
 title = {Unimodular completion of polynomial matrices},
 url = {http://doi.acm.org/10.1145/2608628.2608640},
 year = {2014}
}



[ 2013 ]


[ 51 ]
Evelyne Hubert and George Labahn. Scaling invariants and symmetry reduction of dynamical systems. Foundations of Computational Mathematics, 13:479--516, 2013. [ http ]
@article{DBLP:journals/focm/HubertL13,
 author = {Evelyne Hubert and
George Labahn},
 doi = {10.1007/s10208-013-9165-9},
 journal = {Foundations of Computational Mathematics},
 pages = {479--516},
 title = {Scaling Invariants and Symmetry Reduction of Dynamical Systems},
 url = {https://doi.org/10.1007/s10208-013-9165-9},
 volume = {13},
 year = {2013}
}

[ 50 ]
Scott MacLean and George Labahn. A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets. IJDAR, 16:139--163, 2013. [ http ]
@article{DBLP:journals/ijdar/MacLeanL13,
 author = {Scott MacLean and
George Labahn},
 doi = {10.1007/s10032-012-0184-x},
 journal = {{IJDAR}},
 pages = {139--163},
 title = {A new approach for recognizing handwritten mathematics using relational
grammars and fuzzy sets},
 url = {https://doi.org/10.1007/s10032-012-0184-x},
 volume = {16},
 year = {2013}
}

[ 49 ]
Moulay A. Barkatou, Carole El Bacha, George Labahn, and Eckhard Pflügel. On simultaneous row and column reduction of higher-order linear differential systems. J. Symb. Comput., 49:45--64, 2013. [ http ]
@article{DBLP:journals/jsc/BarkatouBLP13,
 author = {Moulay A. Barkatou and
Carole El Bacha and
George Labahn and
Eckhard Pfl{"{u}}gel},
 doi = {10.1016/j.jsc.2011.12.016},
 journal = {J. Symb. Comput.},
 pages = {45--64},
 title = {On simultaneous row and column reduction of higher-order linear differential
systems},
 url = {https://doi.org/10.1016/j.jsc.2011.12.016},
 volume = {49},
 year = {2013}
}

[ 48 ]
Wai Man Ng, Dong Eui Chang, and George Labahn. Energy shaping for systems with two degrees of underactuation and more than three degrees of freedom. SIAM J. Control and Optimization, 51:881--905, 2013. [ http ]
@article{DBLP:journals/siamco/NgCL13,
 author = {Wai Man Ng and
Dong Eui Chang and
George Labahn},
 doi = {10.1137/11084995X},
 journal = {{SIAM} J. Control and Optimization},
 pages = {881--905},
 title = {Energy Shaping for Systems with Two Degrees of Underactuation and
More than Three Degrees of Freedom},
 url = {https://doi.org/10.1137/11084995X},
 volume = {51},
 year = {2013}
}

[ 47 ]
Wei Zhou and George Labahn. Computing column bases of polynomial matrices. In Manuel Kauers, editor, International Symposium on Symbolic and Algebraic Computation, ISSAC'13, Boston, MA, USA, June 26-29, 2013, pages 379--386. ACM, 2013. [ http ]
@inproceedings{DBLP:conf/issac/ZhouL13,
 author = {Wei Zhou and
George Labahn},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'13,
Boston, MA, USA, June 26-29, 2013},
 doi = {10.1145/2465506.2465947},
 editor = {Manuel Kauers},
 pages = {379--386},
 publisher = {{ACM}},
 title = {Computing column bases of polynomial matrices},
 url = {http://doi.acm.org/10.1145/2465506.2465947},
 year = {2013}
}



[ 2012 ]


[ 46 ]
George Labahn and Johannes Middeke. Gröbner walk for computing matrix normal forms over ore polynomials. ACM Comm. Computer Algebra, 46:106--107, 2012. [ http ]
@article{DBLP:journals/cca/LabahnM12,
 author = {George Labahn and
Johannes Middeke},
 doi = {10.1145/2429135.2429156},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {106--107},
 title = {Gr{"{o}}bner walk for computing matrix normal forms over Ore polynomials},
 url = {http://doi.acm.org/10.1145/2429135.2429156},
 volume = {46},
 year = {2012}
}

[ 45 ]
Wei Zhou and George Labahn. Efficient algorithms for order basis computation. J. Symb. Comput., 47:793--819, 2012. [ http ]
@article{DBLP:journals/jsc/ZhouL12,
 author = {Wei Zhou and
George Labahn},
 doi = {10.1016/j.jsc.2011.12.009},
 journal = {J. Symb. Comput.},
 pages = {793--819},
 title = {Efficient algorithms for order basis computation},
 url = {https://doi.org/10.1016/j.jsc.2011.12.009},
 volume = {47},
 year = {2012}
}

[ 44 ]
Y. Huang, Peter A. Forsyth, and George Labahn. Iterative methods for the solution of a singular control formulation of a GMWB pricing problem. Numerische Mathematik, 122:133--167, 2012. [ http ]
@article{DBLP:journals/nm/HuangFL12,
 author = {Y. Huang and
Peter A. Forsyth and
George Labahn},
 doi = {10.1007/s00211-012-0455-y},
 journal = {Numerische Mathematik},
 pages = {133--167},
 title = {Iterative methods for the solution of a singular control formulation
of a {GMWB} pricing problem},
 url = {https://doi.org/10.1007/s00211-012-0455-y},
 volume = {122},
 year = {2012}
}

[ 43 ]
Y. Huang, Peter A. Forsyth, and George Labahn. Combined fixed point and policy iteration for hamilton-jacobi-bellman equations in finance. SIAM J. Numerical Analysis, 50:1861--1882, 2012. [ http ]
@article{DBLP:journals/siamnum/HuangFL12,
 author = {Y. Huang and
Peter A. Forsyth and
George Labahn},
 doi = {10.1137/100812641},
 journal = {{SIAM} J. Numerical Analysis},
 pages = {1861--1882},
 title = {Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman
Equations in Finance},
 url = {https://doi.org/10.1137/100812641},
 volume = {50},
 year = {2012}
}

[ 42 ]
Evelyne Hubert and George Labahn. Rational invariants of scalings from hermite normal forms. In Joris van der Hoeven and Mark van Hoeij, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 219--226. ACM, 2012. [ http ]
@inproceedings{DBLP:conf/issac/HubertL12,
 author = {Evelyne Hubert and
George Labahn},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442862},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {219--226},
 publisher = {{ACM}},
 title = {Rational invariants of scalings from Hermite normal forms},
 url = {http://doi.acm.org/10.1145/2442829.2442862},
 year = {2012}
}

[ 41 ]
Wei Zhou, George Labahn, and Arne Storjohann. Computing minimal nullspace bases. In Joris van der Hoeven and Mark van Hoeij, editors, International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 366--373. ACM, 2012. [ http ]
@inproceedings{DBLP:conf/issac/ZhouLS12,
 author = {Wei Zhou and
George Labahn and
Arne Storjohann},
 booktitle = {International Symposium on Symbolic and Algebraic Computation, ISSAC'12,
Grenoble, France - July 22 - 25, 2012},
 doi = {10.1145/2442829.2442881},
 editor = {Joris van der Hoeven and
Mark van Hoeij},
 pages = {366--373},
 publisher = {{ACM}},
 title = {Computing minimal nullspace bases},
 url = {http://doi.acm.org/10.1145/2442829.2442881},
 year = {2012}
}



[ 2011 ]


[ 40 ]
Scott MacLean, George Labahn, Edward Lank, Mirette S. Marzouk, and David Tausky. Grammar-based techniques for creating ground-truthed sketch corpora. IJDAR, 14:65--74, 2011. [ http ]
@article{DBLP:journals/ijdar/MacLeanLLMT11,
 author = {Scott MacLean and
George Labahn and
Edward Lank and
Mirette S. Marzouk and
David Tausky},
 doi = {10.1007/s10032-010-0118-4},
 journal = {{IJDAR}},
 pages = {65--74},
 title = {Grammar-based techniques for creating ground-truthed sketch corpora},
 url = {https://doi.org/10.1007/s10032-010-0118-4},
 volume = {14},
 year = {2011}
}

[ 39 ]
Y. Huang, Peter A. Forsyth, and George Labahn. Methods for pricing american options under regime switching. SIAM J. Scientific Computing, 33:2144--2168, 2011. [ http ]
@article{DBLP:journals/siamsc/HuangFL11,
 author = {Y. Huang and
Peter A. Forsyth and
George Labahn},
 doi = {10.1137/110820920},
 journal = {{SIAM} J. Scientific Computing},
 pages = {2144--2168},
 title = {Methods for Pricing American Options under Regime Switching},
 url = {https://doi.org/10.1137/110820920},
 volume = {33},
 year = {2011}
}

[ 38 ]
David Tausky, Edward Lank, Richard Mann, and George Labahn. Analyzing sketch content using in-air packet information. In Pearl Pu, Michael J. Pazzani, Elisabeth André, and Doug Riecken, editors, Proceedings of the 16th International Conference on Intelligent User Interfaces, IUI 2011, Palo Alto, CA, USA, February 13-16, 2011, pages 403--406. ACM, 2011. [ http ]
@inproceedings{DBLP:conf/iui/TauskyLML11,
 author = {David Tausky and
Edward Lank and
Richard Mann and
George Labahn},
 booktitle = {Proceedings of the 16th International Conference on Intelligent User
Interfaces, {IUI} 2011, Palo Alto, CA, USA, February 13-16, 2011},
 doi = {10.1145/1943403.1943476},
 editor = {Pearl Pu and
Michael J. Pazzani and
Elisabeth Andr{'{e}} and
Doug Riecken},
 pages = {403--406},
 publisher = {{ACM}},
 title = {Analyzing sketch content using in-air packet information},
 url = {http://doi.acm.org/10.1145/1943403.1943476},
 year = {2011}
}

[ 37 ]
Scott MacLean, David Tausky, George Labahn, Edward Lank, and Mirette S. Marzouk. Is the ipad useful for sketch input? A comparison with the tablet PC. In Tracy Hammond and Andrew Nealen, editors, Sketch Based Interfaces and Modeling, Vancouver, BC, Canada, 5-7 August 2011. Proceedings, pages 7--14. Eurographics Association, 2011. [ http ]
@inproceedings{DBLP:conf/sbm/MacLeanTLLM11,
 author = {Scott MacLean and
David Tausky and
George Labahn and
Edward Lank and
Mirette S. Marzouk},
 booktitle = {Sketch Based Interfaces and Modeling, Vancouver, BC, Canada, 5-7 August
2011. Proceedings},
 doi = {10.2312/SBM/SBM11/007-014},
 editor = {Tracy Hammond and
Andrew Nealen},
 pages = {7--14},
 publisher = {Eurographics Association},
 title = {Is the iPad useful for sketch input? {A} comparison with the Tablet
{PC}},
 url = {https://doi.org/10.2312/SBM/SBM11/007-014},
 year = {2011}
}



[ 2010 ]




[ 2009 ]


[ 36 ]
Howard Cheng and George Labahn. Applying linear algebra routines to modular ore polynomial matrix algorithms. ACM Comm. Computer Algebra, 43:78--79, 2009. [ http ]
@article{DBLP:journals/cca/ChengL09,
 author = {Howard Cheng and
George Labahn},
 doi = {10.1145/1823931.1823937},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {78--79},
 title = {Applying linear algebra routines to modular ore polynomial matrix
algorithms},
 url = {http://doi.acm.org/10.1145/1823931.1823937},
 volume = {43},
 year = {2009}
}

[ 35 ]
Mark Giesbrecht, George Labahn, and Wen-shin Lee. Symbolic-numeric sparse interpolation of multivariate polynomials. J. Symb. Comput., 44:943--959, 2009. [ http ]
@article{DBLP:journals/jsc/GiesbrechtLL09,
 author = {Mark Giesbrecht and
George Labahn and
Wen{-}shin Lee},
 doi = {10.1016/j.jsc.2008.11.003},
 journal = {J. Symb. Comput.},
 pages = {943--959},
 title = {Symbolic-numeric sparse interpolation of multivariate polynomials},
 url = {https://doi.org/10.1016/j.jsc.2008.11.003},
 volume = {44},
 year = {2009}
}

[ 34 ]
Howard Cheng and George Labahn. A practical implementation of a modular algorithm for ore polynomial matrices. In Ruyong Feng, Wen-shin Lee, and Yosuke Sato, editors, Computer Mathematics, 9th Asian Symposium (ASCM 2009), Fukuoka, December 2009, 10th Asian Symposium (ASCM 2012), Beijing, October 2012, Contributed Papers and Invited Talks, pages 49--59. Springer, 2009. [ http ]
@inproceedings{DBLP:conf/ascm/ChengL09,
 author = {Howard Cheng and
George Labahn},
 booktitle = {Computer Mathematics, 9th Asian Symposium {(ASCM} 2009), Fukuoka,
December 2009, 10th Asian Symposium {(ASCM} 2012), Beijing, October
2012, Contributed Papers and Invited Talks},
 doi = {10.1007/978-3-662-43799-5_5},
 editor = {Ruyong Feng and
Wen{-}shin Lee and
Yosuke Sato},
 pages = {49--59},
 publisher = {Springer},
 title = {A Practical Implementation of a Modular Algorithm for Ore Polynomial
Matrices},
 url = {https://doi.org/10.1007/978-3-662-43799-5_5},
 year = {2009}
}

[ 33 ]
Mark Giesbrecht, George Labahn, and Yang Zhang. Computing popov forms of matrices over PBW extensions. In Ruyong Feng, Wen-shin Lee, and Yosuke Sato, editors, Computer Mathematics, 9th Asian Symposium (ASCM 2009), Fukuoka, December 2009, 10th Asian Symposium (ASCM 2012), Beijing, October 2012, Contributed Papers and Invited Talks, pages 61--65. Springer, 2009. [ http ]
@inproceedings{DBLP:conf/ascm/GiesbrechtLZ09,
 author = {Mark Giesbrecht and
George Labahn and
Yang Zhang},
 booktitle = {Computer Mathematics, 9th Asian Symposium {(ASCM} 2009), Fukuoka,
December 2009, 10th Asian Symposium {(ASCM} 2012), Beijing, October
2012, Contributed Papers and Invited Talks},
 doi = {10.1007/978-3-662-43799-5_6},
 editor = {Ruyong Feng and
Wen{-}shin Lee and
Yosuke Sato},
 pages = {61--65},
 publisher = {Springer},
 title = {Computing Popov Forms of Matrices Over {PBW} Extensions},
 url = {https://doi.org/10.1007/978-3-662-43799-5_6},
 year = {2009}
}

[ 32 ]
Bernhard Beckermann and George Labahn. Fraction-free computation of simultaneous padé approximants. In Jeremy R. Johnson, Hyungju Park, and Erich Kaltofen, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pages 15--22. ACM, 2009. [ http ]
@inproceedings{DBLP:conf/issac/BeckermannL09,
 author = {Bernhard Beckermann and
George Labahn},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings},
 doi = {10.1145/1576702.1576708},
 editor = {Jeremy R. Johnson and
Hyungju Park and
Erich Kaltofen},
 pages = {15--22},
 publisher = {{ACM}},
 title = {Fraction-free computation of simultaneous pad{'{e}} approximants},
 url = {http://doi.acm.org/10.1145/1576702.1576708},
 year = {2009}
}

[ 31 ]
Wei Zhou and George Labahn. Efficient computation of order bases. In Jeremy R. Johnson, Hyungju Park, and Erich Kaltofen, editors, Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pages 375--382. ACM, 2009. [ http ]
@inproceedings{DBLP:conf/issac/ZhouL09,
 author = {Wei Zhou and
George Labahn},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings},
 doi = {10.1145/1576702.1576753},
 editor = {Jeremy R. Johnson and
Hyungju Park and
Erich Kaltofen},
 pages = {375--382},
 publisher = {{ACM}},
 title = {Efficient computation of order bases},
 url = {http://doi.acm.org/10.1145/1576702.1576753},
 year = {2009}
}

[ 30 ]
Scott MacLean, David Tausky, George Labahn, Edward Lank, and Mirette S. Marzouk. Tools for the efficient generation of hand-drawn corpora based on context-free grammars. In Cindy Grimm and Joseph J. LaViola Jr., editors, Sketch Based Interfaces and Modeling, New Orleans, Louisiana, USA, 2009. Proceedings, pages 125--132. Eurographics Association, 2009. [ http ]
@inproceedings{DBLP:conf/sbm/MacLeanTLLM09,
 author = {Scott MacLean and
David Tausky and
George Labahn and
Edward Lank and
Mirette S. Marzouk},
 booktitle = {Sketch Based Interfaces and Modeling, New Orleans, Louisiana, USA,
2009. Proceedings},
 doi = {10.2312/SBM/SBM09/125-132},
 editor = {Cindy Grimm and
Joseph J. LaViola Jr.},
 pages = {125--132},
 publisher = {Eurographics Association},
 title = {Tools for the Efficient Generation of Hand-Drawn Corpora Based on
Context-Free Grammars},
 url = {https://doi.org/10.2312/SBM/SBM09/125-132},
 year = {2009}
}



[ 2008 ]


[ 29 ]
Howard Cheng, George Labahn, and Wei Zhou. Computing polynomial LCM and GCD in lagrange basis. ACM Comm. Computer Algebra, 42:129--130, 2008. [ http ]
@article{DBLP:journals/cca/ChengLZ08,
 author = {Howard Cheng and
George Labahn and
Wei Zhou},
 doi = {10.1145/1504347.1504353},
 journal = {{ACM} Comm. Computer Algebra},
 pages = {129--130},
 title = {Computing polynomial {LCM} and {GCD} in lagrange basis},
 url = {http://doi.acm.org/10.1145/1504347.1504353},
 volume = {42},
 year = {2008}
}

[ 28 ]
George Labahn, Edward Lank, Scott MacLean, Mirette S. Marzouk, and David Tausky. Mathbrush: A system for doing math on pen-based devices. In Koichi Kise and Hiroshi Sako, editors, The Eighth IAPR International Workshop on Document Analysis Systems, DAS 2008, September 16-19, 2008, Nara, Japan, pages 599--606. IEEE Computer Society, 2008. [ http ]
@inproceedings{DBLP:conf/das/LabahnLMMT08,
 author = {George Labahn and
Edward Lank and
Scott MacLean and
Mirette S. Marzouk and
David Tausky},
 booktitle = {The Eighth {IAPR} International Workshop on Document Analysis Systems,
{DAS} 2008, September 16-19, 2008, Nara, Japan},
 doi = {10.1109/DAS.2008.21},
 editor = {Koichi Kise and
Hiroshi Sako},
 pages = {599--606},
 publisher = {{IEEE} Computer Society},
 title = {MathBrush: {A} System for Doing Math on Pen-Based Devices},
 url = {https://doi.org/10.1109/DAS.2008.21},
 year = {2008}
}

[ 27 ]
George Labahn, Edward Lank, Mirette S. Marzouk, Andrea Bunt, Scott MacLean, and David Tausky. Mathbrush: A case study for pen-based interactive mathematics. In Christine Alvarado and Marie-Paule Cani, editors, Sketch Based Interfaces and Modeling, Annecy, France, 2008. Proceedings, pages 143--150. Eurographics Association, 2008. [ http ]
@inproceedings{DBLP:conf/sbm/LabahnLMBMT08,
 author = {George Labahn and
Edward Lank and
Mirette S. Marzouk and
Andrea Bunt and
Scott MacLean and
David Tausky},
 booktitle = {Sketch Based Interfaces and Modeling, Annecy, France, 2008. Proceedings},
 doi = {10.2312/SBM/SBM08/143-150},
 editor = {Christine Alvarado and
Marie{-}Paule Cani},
 pages = {143--150},
 publisher = {Eurographics Association},
 title = {MathBrush: {A} Case Study for Pen-based Interactive Mathematics},
 url = {https://doi.org/10.2312/SBM/SBM08/143-150},
 year = {2008}
}



[ 2007 ]


[ 26 ]
Howard Cheng and George Labahn. Output-sensitive modular algorithms for polynomial matrix normal forms. J. Symb. Comput., 42:733--750, 2007. [ http ]
@article{DBLP:journals/jsc/ChengL07,
 author = {Howard Cheng and
George Labahn},
 doi = {10.1016/j.jsc.2007.03.001},
 journal = {J. Symb. Comput.},
 pages = {733--750},
 title = {Output-sensitive modular algorithms for polynomial matrix normal forms},
 url = {https://doi.org/10.1016/j.jsc.2007.03.001},
 volume = {42},
 year = {2007}
}

[ 25 ]
Bernhard Beckermann, Gene H. Golub, and George Labahn. On the numerical condition of a generalized hankel eigenvalue problem. Numerische Mathematik, 106:41--68, 2007. [ http ]
@article{DBLP:journals/nm/BeckermannGL07,
 author = {Bernhard Beckermann and
Gene H. Golub and
George Labahn},
 doi = {10.1007/s00211-006-0054-x},
 journal = {Numerische Mathematik},
 pages = {41--68},
 title = {On the numerical condition of a generalized Hankel eigenvalue problem},
 url = {https://doi.org/10.1007/s00211-006-0054-x},
 volume = {106},
 year = {2007}
}

[ 24 ]
David Tausky, George Labahn, Edward Lank, and Mirette S. Marzouk. Managing ambiguity in mathematical matrices. In Michiel van de Panne and Eric Saund, editors, Sketch Based Interfaces and Modeling, Riverside, California, USA, 2007. Proceedings, pages 115--122. Eurographics Association, 2007. [ http ]
@inproceedings{DBLP:conf/sbm/TauskyLLM07,
 author = {David Tausky and
George Labahn and
Edward Lank and
Mirette S. Marzouk},
 booktitle = {Sketch Based Interfaces and Modeling, Riverside, California, USA,
2007. Proceedings},
 doi = {10.2312/SBM/SBM07/115-122},
 editor = {Michiel van de Panne and
Eric Saund},
 pages = {115--122},
 publisher = {Eurographics Association},
 title = {Managing Ambiguity in Mathematical Matrices},
 url = {https://doi.org/10.2312/SBM/SBM07/115-122},
 year = {2007}
}



[ 2006 ]


[ 23 ]
Bernhard Beckermann, Howard Cheng, and George Labahn. Fraction-free row reduction of matrices of ore polynomials. J. Symb. Comput., 41:513--543, 2006. [ http ]
@article{DBLP:journals/jsc/BeckermannCL06,
 author = {Bernhard Beckermann and
Howard Cheng and
George Labahn},
 doi = {10.1016/j.jsc.2005.10.002},
 journal = {J. Symb. Comput.},
 pages = {513--543},
 title = {Fraction-free row reduction of matrices of Ore polynomials},
 url = {https://doi.org/10.1016/j.jsc.2005.10.002},
 volume = {41},
 year = {2006}
}

[ 22 ]
Bernhard Beckermann, George Labahn, and Gilles Villard. Normal forms for general polynomial matrices. J. Symb. Comput., 41:708--737, 2006. [ http ]
@article{DBLP:journals/jsc/BeckermannLV06,
 author = {Bernhard Beckermann and
George Labahn and
Gilles Villard},
 doi = {10.1016/j.jsc.2006.02.001},
 journal = {J. Symb. Comput.},
 pages = {708--737},
 title = {Normal forms for general polynomial matrices},
 url = {https://doi.org/10.1016/j.jsc.2006.02.001},
 volume = {41},
 year = {2006}
}

[ 21 ]
Mark Giesbrecht, George Labahn, and Wen-shin Lee. Probabilistically stable numerical sparse polynomial interpolation. In Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt, editors, Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, volume 06271. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [ http ]
@inproceedings{DBLP:conf/dagstuhl/GiesbrechtLL06,
 author = {Mark Giesbrecht and
George Labahn and
Wen{-}shin Lee},
 booktitle = {Challenges in Symbolic Computation Software, 02.07. - 07.07.2006},
 editor = {Wolfram Decker and
Mike Dewar and
Erich Kaltofen and
Stephen M. Watt},
 publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
 title = {Probabilistically Stable Numerical Sparse Polynomial Interpolation},
 url = {http://drops.dagstuhl.de/opus/volltexte/2006/775},
 volume = {06271},
 year = {2006}
}

[ 20 ]
George Labahn, Scott MacLean, Mirette S. Marzouk, Ian Rutherford, and David Tausky. Mathbrush: An experimental pen-based math system. In Wolfram Decker, Mike Dewar, Erich Kaltofen, and Stephen M. Watt, editors, Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, volume 06271. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006. [ http ]
@inproceedings{DBLP:conf/dagstuhl/LabahnMMRT06,
 author = {George Labahn and
Scott MacLean and
Mirette S. Marzouk and
Ian Rutherford and
David Tausky},
 booktitle = {Challenges in Symbolic Computation Software, 02.07. - 07.07.2006},
 editor = {Wolfram Decker and
Mike Dewar and
Erich Kaltofen and
Stephen M. Watt},
 publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
 title = {MathBrush: An Experimental Pen-Based Math System},
 url = {http://drops.dagstuhl.de/opus/volltexte/2006/773},
 volume = {06271},
 year = {2006}
}

[ 19 ]
Howard Cheng and George Labahn. On computing polynomial gcds in alternate bases. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 47--54. ACM, 2006. [ http ]
@inproceedings{DBLP:conf/issac/ChengL06,
 author = {Howard Cheng and
George Labahn},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
 doi = {10.1145/1145768.1145783},
 editor = {Barry M. Trager},
 pages = {47--54},
 publisher = {{ACM}},
 title = {On computing polynomial GCDs in alternate bases},
 url = {http://doi.acm.org/10.1145/1145768.1145783},
 year = {2006}
}

[ 18 ]
Mark Giesbrecht, George Labahn, and Wen-shin Lee. Symbolic-numeric sparse interpolation of multivariate polynomials. In Barry M. Trager, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pages 116--123. ACM, 2006. [ http ]
@inproceedings{DBLP:conf/issac/GiesbrechtLL06,
 author = {Mark Giesbrecht and
George Labahn and
Wen{-}shin Lee},
 booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
 doi = {10.1145/1145768.1145792},
 editor = {Barry M. Trager},
 pages = {116--123},
 publisher = {{ACM}},
 title = {Symbolic-numeric sparse interpolation of multivariate polynomials},
 url = {http://doi.acm.org/10.1145/1145768.1145792},
 year = {2006}
}



[ 2005 ]


[ 17 ]
Yann d'Halluin, Peter A. Forsyth, and George Labahn. A semi-lagrangian approach for american asian options under jump diffusion. SIAM J. Scientific Computing, 27:315--345, 2005. [ http ]
@article{DBLP:journals/siamsc/dHalluinFL05,
 author = {Yann d'Halluin and
Peter A. Forsyth and
George Labahn},
 doi = {10.1137/030602630},
 journal = {{SIAM} J. Scientific Computing},
 pages = {315--345},
 title = {A Semi-Lagrangian Approach for American Asian Options under Jump Diffusion},
 url = {https://doi.org/10.1137/030602630},
 volume = {27},
 year = {2005}
}

[ 16 ]
Mark Giesbrecht, George Labahn, and Yang Zhang. Computing valuation popov forms. In Vaidy S. Sunderam, G. Dick van Albada, Peter M. A. Sloot, and Jack J. Dongarra, editors, Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part III, volume 3516, pages 619--626. Springer, 2005. [ http ]
@inproceedings{DBLP:conf/iccS/GiesbrechtLZ05,
 author = {Mark Giesbrecht and
George Labahn and
Yang Zhang},
 booktitle = {Computational Science - {ICCS} 2005, 5th International Conference,
Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part {III}},
 doi = {10.1007/11428862_84},
 editor = {Vaidy S. Sunderam and
G. Dick van Albada and
Peter M. A. Sloot and
Jack J. Dongarra},
 pages = {619--626},
 publisher = {Springer},
 title = {Computing Valuation Popov Forms},
 url = {https://doi.org/10.1007/11428862_84},
 volume = {3516},
 year = {2005}
}



[ 2004 ]


[ 15 ]
Yann d'Halluin, Peter A. Forsyth, and George Labahn. A penalty method for american options with jump diffusion processes. Numerische Mathematik, 97:321--352, 2004. [ http ]
@article{DBLP:journals/nm/dHalluinFL04,
 author = {Yann d'Halluin and
Peter A. Forsyth and
George Labahn},
 doi = {10.1007/s00211-003-0511-8},
 journal = {Numerische Mathematik},
 pages = {321--352},
 title = {A penalty method for American options with jump diffusion processes},
 url = {https://doi.org/10.1007/s00211-003-0511-8},
 volume = {97},
 year = {2004}
}

[ 14 ]
Reinhold Burger, George Labahn, and Mark van Hoeij. Closed form solutions of linear odes having elliptic function coefficients. In Jaime Gutierrez, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pages 58--64. ACM, 2004. [ http ]
@inproceedings{DBLP:conf/issac/BurgerLH04,
 author = {Reinhold Burger and
George Labahn and
Mark van Hoeij},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2004, Santander, Spain, July 4-7, 2004, Proceedings},
 doi = {10.1145/1005285.1005296},
 editor = {Jaime Gutierrez},
 pages = {58--64},
 publisher = {{ACM}},
 title = {Closed form solutions of linear odes having elliptic function coefficients},
 url = {http://doi.acm.org/10.1145/1005285.1005296},
 year = {2004}
}

[ 13 ]
George Labahn and Ziming Li. Hyperexponential solutions of finite-rank ideals in orthogonal ore rings. In Jaime Gutierrez, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pages 213--220. ACM, 2004. [ http ]
@inproceedings{DBLP:conf/issac/LabahnL04,
 author = {George Labahn and
Ziming Li},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2004, Santander, Spain, July 4-7, 2004, Proceedings},
 doi = {10.1145/1005285.1005317},
 editor = {Jaime Gutierrez},
 pages = {213--220},
 publisher = {{ACM}},
 title = {Hyperexponential solutions of finite-rank ideals in orthogonal ore
rings},
 url = {http://doi.acm.org/10.1145/1005285.1005317},
 year = {2004}
}



[ 2003 ]




[ 2002 ]


[ 12 ]
Bernhard Beckermann, Howard Cheng, and George Labahn. Fraction-free row reduction of matrices of skew polynomials. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings, pages 8--15. ACM, 2002. [ http ]
@inproceedings{DBLP:conf/issac/BeckermannCL02,
 author = {Bernhard Beckermann and
Howard Cheng and
George Labahn},
 booktitle = {Symbolic and Algebraic Computation, International Symposium {ISSAC}
2002, Lille, France, July 7-10, 2002, Proceedings},
 doi = {10.1145/780506.780508},
 editor = {Teo Mora},
 pages = {8--15},
 publisher = {{ACM}},
 title = {Fraction-free row reduction of matrices of skew polynomials},
 url = {http://doi.acm.org/10.1145/780506.780508},
 year = {2002}
}



[ 2001 ]


[ 11 ]
Howard Cheng and George Labahn. Computing all factorizations in ***. In Erich Kaltofen and Gilles Villard, editors, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001, pages 64--71. ACM, 2001. [ http ]
@inproceedings{DBLP:conf/issac/ChengL01,
 author = {Howard Cheng and
George Labahn},
 booktitle = {Proceedings of the 2001 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} 2001, {ORCCA} {\&} University of Western Ontario,
London, Ontario, Canada, July 22-25, 2001},
 doi = {10.1145/384101.384111},
 editor = {Erich Kaltofen and
Gilles Villard},
 pages = {64--71},
 publisher = {{ACM}},
 title = {Computing all factorizations in ***},
 url = {http://doi.acm.org/10.1145/384101.384111},
 year = {2001}
}



[ 2000 ]


[ 10 ]
Bernhard Beckermann and George Labahn. Effective computation of rational approximants and interpolants. Reliable Computing, 6:365--390, 2000. [ http ]
@article{DBLP:journals/rc/BeckermannL00,
 author = {Bernhard Beckermann and
George Labahn},
 doi = {10.1023/A:1009942122633},
 journal = {Reliable Computing},
 pages = {365--390},
 title = {Effective Computation of Rational Approximants and Interpolants},
 url = {https://doi.org/10.1023/A:1009942122633},
 volume = {6},
 year = {2000}
}

[ 9 ]
Bernhard Beckermann and George Labahn. Fraction-free computation of matrix rational interpolants and matrix gcds. SIAM J. Matrix Analysis Applications, 22:114--144, 2000. [ http ]
@article{DBLP:journals/siammax/BeckermannL00,
 author = {Bernhard Beckermann and
George Labahn},
 doi = {10.1137/S0895479897326912},
 journal = {{SIAM} J. Matrix Analysis Applications},
 pages = {114--144},
 title = {Fraction-Free Computation of Matrix Rational Interpolants and Matrix
GCDs},
 url = {https://doi.org/10.1137/S0895479897326912},
 volume = {22},
 year = {2000}
}

[ 8 ]
Yann d'Halluin, Peter A. Forsyth, Kenneth R. Vetzal, and George Labahn. Numerical methods for pricing callable bonds. In Proceedings of the IEEE/IAFE/INFORMS 2000 Conference on Computational Intelligence for Financial Engineering, CIFEr 2000, New York City, USA, March 28, 2000, pages 78--81. IEEE, 2000. [ http ]
@inproceedings{DBLP:conf/cifer/dHalluinFVL00,
 author = {Yann d'Halluin and
Peter A. Forsyth and
Kenneth R. Vetzal and
George Labahn},
 booktitle = {Proceedings of the {IEEE/IAFE/INFORMS} 2000 Conference on Computational
Intelligence for Financial Engineering, CIFEr 2000, New York City,
USA, March 28, 2000},
 doi = {10.1109/CIFER.2000.844604},
 pages = {78--81},
 publisher = {{IEEE}},
 title = {Numerical methods for pricing callable bonds},
 url = {https://doi.org/10.1109/CIFER.2000.844604},
 year = {2000}
}



[ 1999 ]


[ 7 ]
Bernhard Beckermann, George Labahn, and Gilles Villard. Shifted normal forms of polynomial matrices. In Keith O. Geddes, Bruno Salvy, and Samuel S. Dooley, editors, Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC '99, Vancouver, B.C., Canada, July 29-31, 1999, pages 189--196. ACM, 1999. [ http ]
@inproceedings{DBLP:conf/issac/BeckermannLV99,
 author = {Bernhard Beckermann and
George Labahn and
Gilles Villard},
 booktitle = {Proceedings of the 1999 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '99, Vancouver, B.C., Canada, July 29-31, 1999},
 doi = {10.1145/309831.309929},
 editor = {Keith O. Geddes and
Bruno Salvy and
Samuel S. Dooley},
 pages = {189--196},
 publisher = {{ACM}},
 title = {Shifted Normal Forms of Polynomial Matrices},
 url = {http://doi.acm.org/10.1145/309831.309929},
 year = {1999}
}



[ 1998 ]


[ 6 ]
George Labahn and Mohamed Omar Rayes. Poster session abstracts of the 1998 international symposium on symbolic and algebraic computation, ISSAC 1998 rostock, germany august 13 - 15, 1998. ACM SIGSAM Bulletin, 32:49--52, 1998. [ http ]
@article{DBLP:journals/cca/LabahnR98,
 author = {George Labahn and
Mohamed Omar Rayes},
 doi = {10.1145/297049.570087},
 journal = {{ACM} {SIGSAM} Bulletin},
 pages = {49--52},
 title = {Poster Session Abstracts of the 1998 International Symposium on Symbolic
and Algebraic Computation, {ISSAC} 1998 Rostock, Germany August 13
- 15, 1998},
 url = {http://doi.acm.org/10.1145/297049.570087},
 volume = {32},
 year = {1998}
}

[ 5 ]
Bernhard Beckermann and George Labahn. A fast and numerically stable euclidean-like algorithm for detecting relatively prime numerical polynomials. J. Symb. Comput., 26:691--714, 1998. [ http ]
@article{DBLP:journals/jsc/BeckermannL98a,
 author = {Bernhard Beckermann and
George Labahn},
 doi = {10.1006/jsco.1998.0235},
 journal = {J. Symb. Comput.},
 pages = {691--714},
 title = {A Fast and Numerically Stable Euclidean-Like Algorithm for Detecting
Relatively Prime Numerical Polynomials},
 url = {https://doi.org/10.1006/jsco.1998.0235},
 volume = {26},
 year = {1998}
}

[ 4 ]
Bernhard Beckermann and George Labahn. When are two numerical polynomials relatively prime? J. Symb. Comput., 26:677--689, 1998. [ http ]
@article{DBLP:journals/jsc/BeckermannL98,
 author = {Bernhard Beckermann and
George Labahn},
 doi = {10.1006/jsco.1998.0234},
 journal = {J. Symb. Comput.},
 pages = {677--689},
 title = {When are Two Numerical Polynomials Relatively Prime?},
 url = {https://doi.org/10.1006/jsco.1998.0234},
 volume = {26},
 year = {1998}
}



[ 1997 ]


[ 3 ]
Stanley Cabay, Anthony R. Jones, and George Labahn. Algorithm 766: Experiments with a weakly stable algorithm for computing padé-hermite and simultaneous padé approximants. ACM Trans. Math. Softw., 23:91--110, 1997. [ http ]
@article{DBLP:journals/toms/CabayJL97,
 author = {Stanley Cabay and
Anthony R. Jones and
George Labahn},
 doi = {10.1145/244768.244790},
 journal = {{ACM} Trans. Math. Softw.},
 pages = {91--110},
 title = {Algorithm 766: Experiments with a Weakly Stable Algorithm for Computing
Pad{'{e}}-Hermite and Simultaneous Pad{'{e}} Approximants},
 url = {http://doi.acm.org/10.1145/244768.244790},
 volume = {23},
 year = {1997}
}

[ 2 ]
Bernhard Beckermann, Stanley Cabay, and George Labahn. Fraction-free computation of catrix padé systems. In Bruce W. Char, Paul S. Wang, and Wolfgang Küchlin, editors, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC '97, Maui, Hawaii, USA, July 21-23, 1997, pages 125--132. ACM, 1997.
@inproceedings{DBLP:conf/issac/BeckermannCL97,
 author = {Bernhard Beckermann and
Stanley Cabay and
George Labahn},
 booktitle = {Proceedings of the 1997 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '97, Maui, Hawaii, USA, July 21-23, 1997},
 editor = {Bruce W. Char and
Paul S. Wang and
Wolfgang K{"{u}}chlin},
 pages = {125--132},
 publisher = {{ACM}},
 title = {Fraction-free Computation of Catrix Pad{'{e}} Systems},
 year = {1997}
}

[ 1 ]
David J. Jeffrey, George Labahn, Martin von Mohrenschildt, and Albert D. Rich. Integration of the signum, piecewise and related functions. In Bruce W. Char, Paul S. Wang, and Wolfgang Küchlin, editors, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC '97, Maui, Hawaii, USA, July 21-23, 1997, pages 324--330. ACM, 1997.
@inproceedings{DBLP:conf/issac/JeffreyLMR97,
 author = {David J. Jeffrey and
George Labahn and
Martin von Mohrenschildt and
Albert D. Rich},
 booktitle = {Proceedings of the 1997 International Symposium on Symbolic and Algebraic
Computation, {ISSAC} '97, Maui, Hawaii, USA, July 21-23, 1997},
 editor = {Bruce W. Char and
Paul S. Wang and
Wolfgang K{"{u}}chlin},
 pages = {324--330},
 publisher = {{ACM}},
 title = {Integration of the Signum, Piecewise and Related Functions},
 year = {1997}
}