George Labahn

3.9k total citations
94 papers, 2.1k citations indexed

About

George Labahn is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Applied Mathematics. According to data from OpenAlex, George Labahn has authored 94 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 29 papers in Artificial Intelligence and 15 papers in Applied Mathematics. Recurrent topics in George Labahn's work include Polynomial and algebraic computation (43 papers), Coding theory and cryptography (23 papers) and Matrix Theory and Algorithms (13 papers). George Labahn is often cited by papers focused on Polynomial and algebraic computation (43 papers), Coding theory and cryptography (23 papers) and Matrix Theory and Algorithms (13 papers). George Labahn collaborates with scholars based in Canada, France and United States. George Labahn's co-authors include Peter Forsyth, Bernhard Beckermann, K. O. Geddes, S. R. Czapor, Y. d’Halluin, Arne Storjohann, K. M. Heal, Michael Monagan, Yu Huang and Howard Cheng and has published in prestigious journals such as Mathematics of Computation, Pattern Recognition and SIAM Journal on Numerical Analysis.

In The Last Decade

George Labahn

92 papers receiving 1.9k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
George Labahn Canada	25	1.0k	532	434	270	218	94	2.1k
Marc Quincampoix France	24	591 0.6×	239 0.4×	392 0.9×	254 0.9×	104 0.5×	106	1.8k
Andrzej Lasota Poland	24	519 0.5×	250 0.5×	182 0.4×	312 1.2×	141 0.6×	97	3.3k
R. M. Dudley United States	27	480 0.5×	774 1.5×	735 1.7×	211 0.8×	144 0.7×	74	3.7k
Italo Capuzzo-Dolcetta Italy	8	975 0.9×	88 0.2×	508 1.2×	349 1.3×	235 1.1×	11	2.5k
Martino Bardi Italy	21	1.2k 1.2×	94 0.2×	568 1.3×	419 1.6×	323 1.5×	60	3.0k
Michel Ledoux France	30	531 0.5×	599 1.1×	523 1.2×	217 0.8×	567 2.6×	114	4.6k
Zvi Artstein Israel	29	857 0.8×	131 0.2×	138 0.3×	435 1.6×	82 0.4×	109	3.6k
Robert F. Tichy Austria	20	610 0.6×	311 0.6×	90 0.2×	478 1.8×	66 0.3×	146	2.0k
Christian Berg Denmark	25	602 0.6×	302 0.6×	209 0.5×	165 0.6×	90 0.4×	136	3.0k
Daniel W. Stroock United States	30	794 0.8×	309 0.6×	1.4k 3.2×	159 0.6×	144 0.7×	82	4.2k

Countries citing papers authored by George Labahn

Since Specialization

Citations

This map shows the geographic impact of George Labahn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by George Labahn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites George Labahn more than expected).

Fields of papers citing papers by George Labahn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by George Labahn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by George Labahn. The network helps show where George Labahn may publish in the future.

Co-authorship network of co-authors of George Labahn

This figure shows the co-authorship network connecting the top 25 collaborators of George Labahn. A scholar is included among the top collaborators of George Labahn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with George Labahn. George Labahn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Labahn, George, et al.. (2020). Homotopy techniques for solving sparse column support determinantal\n polynomial systems. arXiv (Cornell University). 4 indexed citations

Labahn, George, et al.. (2020). Dowsing for Math Answers with Tangent-L.. CLEF (Working Notes). 2 indexed citations

Zhou, Wei, George Labahn, & Arne Storjohann. (2014). A deterministic algorithm for inverting a polynomial matrix. Journal of Complexity. 31(2). 162–173. 6 indexed citations

Huang, Yu, Peter Forsyth, & George Labahn. (2013). Inexact arithmetic considerations for direct control and penalty methods: American options under jump diffusion. Applied Numerical Mathematics. 72. 33–51. 10 indexed citations

Barkatou, Moulay A., et al.. (2011). On simultaneous row and column reduction of higher-order linear differential systems. Journal of Symbolic Computation. 49. 45–64. 10 indexed citations

Labahn, George, et al.. (2011). Efficient algorithms for order basis computation. Journal of Symbolic Computation. 47(7). 793–819. 13 indexed citations

Forsyth, Peter, et al.. (2009). Valuing the Guaranteed Minimum Death Benefit Clause with Partial Withdrawals. Applied Mathematical Finance. 16(6). 451–496. 39 indexed citations

Labahn, George, et al.. (2009). Elastic matching in linear time and constant space. 13 indexed citations

Giesbrecht, Mark, George Labahn, & Wen-shin Lee. (2008). Symbolic–numeric sparse interpolation of multivariate polynomials. Journal of Symbolic Computation. 44(8). 943–959. 39 indexed citations

10.

Cheng, Howard & George Labahn. (2007). Output-sensitive modular algorithms for polynomial matrix normal forms. Journal of Symbolic Computation. 42(7). 733–750. 4 indexed citations

11.

Beckermann, Bernhard, George Labahn, & Gilles Villard. (2006). Normal forms for general polynomial matrices. Journal of Symbolic Computation. 41(6). 708–737. 24 indexed citations

12.

Beckermann, Bernhard, George Labahn, & Gilles Villard. (1999). Shifted normal forms of polynomial matrices. 189–196. 26 indexed citations

13.

Beckermann, Bernhard & George Labahn. (1998). When are Two Numerical Polynomials Relatively Prime?. Journal of Symbolic Computation. 26(6). 677–689. 35 indexed citations

14.

Beckermann, Bernhard & George Labahn. (1998). A Fast and Numerically Stable Euclidean-like Algorithm for Detecting Relatively Prime Numerical Polynomials. Journal of Symbolic Computation. 26(6). 691–714. 21 indexed citations

15.

Storjohann, Arne & George Labahn. (1997). A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix. Linear Algebra and its Applications. 253(1-3). 155–173. 13 indexed citations

16.

Beckermann, Bernhard & George Labahn. (1997). Recursiveness in matrix rational interpolation problems. Journal of Computational and Applied Mathematics. 77(1-2). 5–34. 30 indexed citations

17.

Labahn, George, et al.. (1995). Inversion of mosaic Hankel matrices via matrix polynomial systems. Linear Algebra and its Applications. 221. 253–279. 3 indexed citations

18.

Labahn, George, et al.. (1994). Inversion of Toeplitz structured matrices using only standard equations. Linear Algebra and its Applications. 207. 49–70. 9 indexed citations

19.

Labahn, George. (1992). Inversion components of block Hankel-like matrices. Linear Algebra and its Applications. 177. 7–48. 20 indexed citations

20.

Labahn, George, et al.. (1992). Inversion of Toeplitz matrices with only two standard equations. Linear Algebra and its Applications. 175. 143–158. 30 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact