B. David Saunders
Impact in
-
- Polynomial and algebraic computation
- Matrix Theory and Algorithms
- Complexity and Algorithms in Graphs
- Numerical Methods and Algorithms
- Advanced Graph Theory Research
-
- Advanced Combinatorial Mathematics
Papers in
-
- Matrix Theory and Algorithms 16
- Polynomial and algebraic computation 15
- Complexity and Algorithms in Graphs 8
- Advanced Graph Theory Research 5
-
- Graph theory and applications 3
- Co-authors
- Erich Kaltofen (7 shared papers)Mukkai S. Krishnamoorthy (3 shared papers)Hans Schneider (5 shared papers)Y. N. Lakshman (4 shared papers)Gilles Villard (3 shared papers)Jean‐Guillaume Dumas (1 shared paper)B. F. Caviness (2 shared papers)Michael F. Singer (2 shared papers)
- Journals
- Linear Algebra and its Applications (4 papers)SIAM Journal on Computing (3 papers)SIAM Review (1 paper)Electronic Journal of Linear Algebra (1 paper)Numerische Mathematik (1 paper)
- Partner nations
- United StatesCanadaFrance
In The Last Decade
B. David Saunders
40 papers receiving 361 citations
Peers
Comparison fields: 5 of 50
- Computational Theory and Mathematics 320
- Discrete Mathematics and Combinatorics 42
- Computational Mathematics 7
- Algebra and Number Theory 42
- Numerical Analysis 44
Countries citing papers authored by B. David Saunders
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
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-authors
The 21 scholars most cited alongside B. David Saunders, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 42 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1987 | 41 | |
| 2 | 1990 | 39 | |
| 3 | 2002 | 35 | |
| 4 | 2001 | 32 | |
| 5 | 1995 | 29 | |
| 6 | 1978 | 26 | |
| 7 | 1985 | 26 | |
| 8 | 1998 | 19 | |
| 9 | 1983 | 15 | |
| 10 | 1981 | 13 | |
| 11 | 1995 | 12 | |
| 12 | 1979 | 12 | |
| 13 | 1979 | 12 | |
| 14 | 1989 | 10 | |
| 15 | 1996 | 10 | |
| 16 | 1985 | 10 | |
| 17 | Computing the smith forms of integer matrices and solving related problems | 2005 | 10 |
| 18 | 2004 | 7 | |
| 19 | 1994 | 6 | |
| 20 | 1986 | 5 |
About B. David Saunders
B. David Saunders is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Artificial Intelligence, Numerical Analysis and Electrical and Electronic Engineering, having authored 42 papers that have together received 418 indexed citations. Recurring topics across this work include Matrix Theory and Algorithms (16 papers), Polynomial and algebraic computation (15 papers), Complexity and Algorithms in Graphs (8 papers), Coding theory and cryptography (6 papers), graph theory and CDMA systems (5 papers), Advanced Graph Theory Research (5 papers), Graph theory and applications (3 papers) and Advanced Combinatorial Mathematics (3 papers). The work is most often cited by research in Computational Theory and Mathematics (320 citations), Discrete Mathematics and Combinatorics (42 citations), Computational Mathematics (7 citations), Algebra and Number Theory (42 citations) and Numerical Analysis (44 citations). B. David Saunders has collaborated with scholars based in United States, Canada and France. Frequent co-authors include Erich Kaltofen, Mukkai S. Krishnamoorthy, Hans Schneider, Y. N. Lakshman, Gilles Villard, Jean‐Guillaume Dumas, B. F. Caviness, Michael F. Singer, Mark Giesbrecht and Chen Li. Their work appears in journals such as Linear Algebra and its Applications, SIAM Journal on Computing, SIAM Review, Electronic Journal of Linear Algebra and Numerische Mathematik.
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.