default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDB. David Saunders
- > Home > Persons > B. David Saunders
Publications
- 2022
[j19]Gavin Harrison, Jeremy Johnson, B. David Saunders:
Probabilistic analysis of block Wiedemann for leading invariant factors. J. Symb. Comput. 108: 98-116 (2022)- 2021
- [c32]Robert M. Corless
, Leili Rafiee Sevyeri, B. David Saunders:
Equivalences for Linearizations of Matrix Polynomials. ISSAC 2021: 107-114 - [i7]Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders:
Equivalences for Linearizations of Matrix Polynomials. CoRR abs/2102.09726 (2021) - 2020
- [c31]Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri, B. David Saunders:
On Parametric Linear System Solving. CASC 2020: 188-205 - 2018
- [i6]Gavin Harrison, Jeremy R. Johnson, B. David Saunders:
Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors. CoRR abs/1803.03864 (2018) - 2016
- [j18]Gavin Harrison, Jeremy Johnson, B. David Saunders:
Probabilistic analysis of block wiedemann for leading invariant factors. ACM Commun. Comput. Algebra 50(4): 173-175 (2016) - [j17]Gavin Harrison, Jeremy Johnson, B. David Saunders:
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. J. Symb. Comput. 74: 55-69 (2016) - 2015
- [c29]Andrew Novocin, David Saunders, Alexander Stachnik, Bryan S. Youse:
3-ranks for strongly regular graphs. PASCO 2015: 101-108 - 2014
- [c27]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders:
Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. ICMS 2014: 654-662 - [i5]Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet, B. David Saunders:
Elements of Design for Containers and Solutions in the LinBox Library. CoRR abs/1407.3262 (2014) - [i4]Gavin Harrison, Jeremy R. Johnson, B. David Saunders:
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. CoRR abs/1412.5071 (2014) - 2013
- [j16]Gavin Harrison, Jeremy Johnson, B. David Saunders:
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. ACM Commun. Comput. Algebra 47(3/4): 118-119 (2013) - 2012
- [c26]Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders:
Fast computation of Smith forms of sparse matrices over local rings. ISSAC 2012: 146-153 - [i3]Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders:
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings. CoRR abs/1201.5365 (2012) - 2011
- [c25]Erich L. Kaltofen, Michael Nehring, B. David Saunders:
Quadratic-time certificates in linear algebra. ISSAC 2011: 171-176 - [c24]B. David Saunders, David Harlan Wood, Bryan S. Youse:
Numeric-symbolic exact rational linear system solver. ISSAC 2011: 305-312 - 2010
- [j15]Bryan S. Youse, B. David Saunders:
Abstract only: Bitslicing with matrix algorithms oblivious to the data compression. ACM Commun. Comput. Algebra 44(1/2): 26 (2010) - [c23]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. ICMS 2010: 77-83 - [i2]Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, B. David Saunders:
LinBox founding scope allocation, parallel building blocks, and separate compilation. CoRR abs/1009.1317 (2010) - 2009
- [c22]Jean-Guillaume Dumas, Clément Pernet, B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC 2009: 135-142 - [c21]B. David Saunders, Bryan S. Youse:
Large matrix, small rank. ISSAC 2009: 317-324 - [i1]Jean-Guillaume Dumas, Clément Pernet, B. David Saunders:
On finding multiplicities of characteristic polynomial factors of black-box matrices. CoRR abs/0901.4747 (2009) - 2007
- [c20]Bruce W. Char, B. David Saunders, Bryan S. Youse:
LinBox and future high performance computer algebra. PASCO 2007: 102-103 - [c19]John P. May, B. David Saunders, David Harlan Wood:
Numerical techniques for computing the inertia of products of matrices of rational numbers. SNC 2007: 125-132 - [c18]John P. May, David Saunders, Zhendong Wan:
Efficient matrix rank computation with application to the study of strongly regular graphs. ISSAC 2007: 277-284 - 2005
- [c17]Jeffrey Adams, B. David Saunders, Zhendong Wan:
Signature of symmetric rational matrices and the unitary dual of lie groups. ISSAC 2005: 13-20 - 2004
- [c16]David Saunders, Zhendong Wan:
Smith normal form of dense integer matrices fast algorithms into practice. ISSAC 2004: 274-281 - 2003
- [c15]Jean-Guillaume Dumas, Frank Heckenbach, B. David Saunders, Volkmar Welker:
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. Algebra, Geometry, and Software Systems 2003: 177-206 - 2001
- [j14]Jean-Guillaume Dumas, B. David Saunders, Gilles Villard:
On Efficient Sparse Integer Matrix Smith Normal Form Computations. J. Symb. Comput. 32(1/2): 71-99 (2001) - 2000
- [c13]Jean-Guillaume Dumas, B. David Saunders, Gilles Villard:
Integer Smith form via the valence: experience with large sparse matrices from homology. ISSAC 2000: 95-105 - 1998
- [c12]Mark Giesbrecht, Austin Lobo, B. David Saunders:
Certifying Inconsistency of Sparse Linear Systems. ISSAC 1998: 113-119 - 1997
- [j13]Yagati N. Lakshman, B. David Saunders:
Sparse Shifts for Univariate Polynomials. Appl. Algebra Eng. Commun. Comput. 8(6): 561-562 (1997) - [j12]Mark Giesbrecht, Austin Lobo, David Saunders:
Certifying inconsistency of sparse linear systems. SIGSAM Bull. 31(3): 40 (1997) - [j11]Mark Giesbrecht, David Saunders:
Parametric linear systems: the two parameter case. SIGSAM Bull. 31(3): 40 (1997) - 1996
- [j10]Yagati N. Lakshman, B. David Saunders:
Sparse shifts for univariate polynomials. Appl. Algebra Eng. Commun. Comput. 7(5): 351-364 (1996) - 1995
- [j8]Yagati N. Lakshman, B. David Saunders:
Sparse Polynomial Interpolation in Nonstandard Bases. SIAM J. Comput. 24(2): 387-397 (1995) - 1994
- [c11]Yagati N. Lakshman, B. David Saunders:
On Computing Sparse Shifts for Univariate Polynomials. ISSAC 1994: 108-113 - [c10]Bruce W. Char, Jeremy Johnson, David Saunders, Andrew P. Wack:
Some Experiments with Parallel Bignum Arithmetic. PASCO 1994: 94-103 - 1991
- [c9]Erich L. Kaltofen, B. David Saunders:
On Wiedemann's Method of Solving Sparse Linear Systems. AAECC 1991: 29-38 - 1987
- [c7]Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders:
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. EUROCAL 1987: 317-322 - 1986
- [c6]Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders:
Fast parallel algorithms for similarity of matrices. SYMSAC 1986: 65-70 - 1985
- [j7]Michael F. Singer, B. David Saunders, Bob F. Caviness:
An Extension of Liouville's Theorem on Integration in Finite Terms. SIAM J. Comput. 14(4): 966-990 (1985) - [c5]Snorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders:
An Algebraic Implementation of Packages. European Conference on Computer Algebra (2) 1985: 291-302 - 1983
- [j5]Erich L. Kaltofen, David R. Musser, B. David Saunders:
A Generalized Class of Polynomials that are Hard to Factor. SIAM J. Comput. 12(3): 473-483 (1983) - 1981
- [c3]Michael F. Singer, B. David Saunders, Bob F. Caviness:
An extension of Liouville's theorem on integration in finite terms. SYMSACC 1981: 23-24 - [c1]Erich L. Kaltofen, David R. Musser, B. David Saunders:
A generalized class of polynomials that are hard to factor. SYMSACC 1981: 188-194
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-02 23:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
