B. David Saunders

1.1k total citations
42 papers, 418 citations indexed

About

B. David Saunders is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, B. David Saunders has authored 42 papers receiving a total of 418 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 8 papers in Geometry and Topology and 8 papers in Artificial Intelligence. Recurrent topics in B. David Saunders's work include Matrix Theory and Algorithms (16 papers), Polynomial and algebraic computation (15 papers) and Complexity and Algorithms in Graphs (8 papers). B. David Saunders is often cited by papers focused on Matrix Theory and Algorithms (16 papers), Polynomial and algebraic computation (15 papers) and Complexity and Algorithms in Graphs (8 papers). B. David Saunders collaborates with scholars based in United States, Canada and France. B. David Saunders's co-authors include Erich Kaltofen, Hans Schneider, Mukkai S. Krishnamoorthy, Y. N. Lakshman, Gilles Villard, Jean‐Guillaume Dumas, B. F. Caviness, Michael F. Singer, Mark Giesbrecht and Wayne Eberly and has published in prestigious journals such as SIAM Review, SIAM Journal on Computing and Numerische Mathematik.

In The Last Decade

B. David Saunders

40 papers receiving 361 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
B. David Saunders United States	13	320	134	78	60	44	42	418
Gilles Villard France	16	409 1.3×	242 1.8×	105 1.3×	49 0.8×	34 0.8×	44	605
Olga Holtz United States	13	264 0.8×	115 0.9×	70 0.9×	56 0.9×	62 1.4×	30	577
S. R. Czapor Canada	7	224 0.7×	115 0.9×	30 0.4×	47 0.8×	37 0.8×	14	408
Richard Zippel United States	13	360 1.1×	257 1.9×	61 0.8×	63 1.1×	26 0.6×	28	614
Mark Giesbrecht Canada	14	409 1.3×	238 1.8×	83 1.1×	64 1.1×	41 0.9×	50	539
Dima Grigoriev France	12	377 1.2×	228 1.7×	32 0.4×	69 1.1×	30 0.7×	71	564
Wojciech A. Trybulec	13	322 1.0×	89 0.7×	94 1.2×	188 3.1×	28 0.6×	18	605
Arne Storjohann Canada	14	492 1.5×	290 2.2×	151 1.9×	64 1.1×	34 0.8×	53	631
Jaime Gutiérrez Spain	14	217 0.7×	177 1.3×	71 0.9×	148 2.5×	27 0.6×	60	492
Y. N. Lakshman United States	11	296 0.9×	97 0.7×	28 0.4×	20 0.3×	56 1.3×	17	392

Countries citing papers authored by B. David Saunders

Since Specialization

Citations

This map shows the geographic impact of B. David Saunders'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 B. David Saunders with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites B. David Saunders more than expected).

Fields of papers citing papers by B. David Saunders

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by B. David Saunders. 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 B. David Saunders. The network helps show where B. David Saunders may publish in the future.

Co-authorship network of co-authors of B. David Saunders

This figure shows the co-authorship network connecting the top 25 collaborators of B. David Saunders. A scholar is included among the top collaborators of B. David Saunders 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 B. David Saunders. B. David Saunders 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

Lambert, Matthew & B. David Saunders. (2017). Compiler auto-vectorization of matrix multiplication modulo small primes. 1–10. 1 indexed citations

Johnson, Jeremy, et al.. (2015). Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. Journal of Symbolic Computation. 74. 55–69. 1 indexed citations

Saunders, B. David, et al.. (2011). Numeric-symbolic exact rational linear system solver. 305–312. 3 indexed citations

Saunders, B. David, Arne Storjohann, & Gilles Villard. (2004). Matrix rank certification. Electronic Journal of Linear Algebra. 11. 7 indexed citations

Li, Chen, et al.. (2002). Efficient matrix preconditioners for black box linear algebra. Linear Algebra and its Applications. 343-344. 119–146. 35 indexed citations

Dumas, Jean‐Guillaume, B. David Saunders, & Gilles Villard. (2001). On Efficient Sparse Integer Matrix Smith Normal Form Computations. Journal of Symbolic Computation. 32(1-2). 71–99. 32 indexed citations

Saunders, B. David, et al.. (1995). Fraction Free Gaussian Elimination for Sparse Matrices. Journal of Symbolic Computation. 19(5). 393–402. 12 indexed citations

Lakshman, Y. N. & B. David Saunders. (1995). Sparse Polynomial Interpolation in Nonstandard Bases. SIAM Journal on Computing. 24(2). 387–397. 29 indexed citations

Kaltofen, Erich, Mukkai S. Krishnamoorthy, & B. David Saunders. (1990). Parallel algorithms for matrix normal forms. Linear Algebra and its Applications. 136. 189–208. 39 indexed citations

10.

Torgersen, Todd C., Maya Gokhale, & B. David Saunders. (1989). Algebraic techniques for automatic detection of parallelism. 1 indexed citations

11.

Kaltofen, Erich, Mukkai S. Krishnamoorthy, & B. David Saunders. (1987). Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices. SIAM Journal on Algebraic and Discrete Methods. 8(4). 683–690. 41 indexed citations

12.

Saunders, B. David, et al.. (1984). Operational Calculus Technique for Solving Differential Equations. 23–34. 2 indexed citations

13.

Berman, Abraham & B. David Saunders. (1981). Matrices with zero line sums and maximal rank. Linear Algebra and its Applications. 40. 229–235. 4 indexed citations

14.

Kaltofen, Erich, David R. Musser, & B. David Saunders. (1981). A generalized class of polynomials that are hard to factor. 188–194. 3 indexed citations

15.

Saunders, B. David. (1981). Abstracts. ACM SIGSAM Bulletin. 15(2). 6–7. 1 indexed citations

16.

Saunders, B. David & Hans Schneider. (1979). Applications of the Gordan–Stiemke Theorem in Combinatorial Matrix Theory. SIAM Review. 21(4). 528–541. 12 indexed citations

17.

Saunders, B. David & Hans Schneider. (1979). Cones, graphs and optimal scalings of matrices. Linear and Multilinear Algebra. 8(2). 121–135. 12 indexed citations

18.

Saunders, B. David & Hans Schneider. (1978). Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices. Discrete Mathematics. 24(2). 205–220. 26 indexed citations

19.

Saunders, B. David. (1977). A condition for the convexity of the norm-numerical range of a matrix. Linear Algebra and its Applications. 16(2). 167–175. 3 indexed citations

20.

Saunders, B. David, et al.. (1977). On the Geometry of Dual Pairs. Studies in Applied Mathematics. 56(1). 71–79. 1 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