Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices. - B. David Saunders; Hans Schneider (Discret. Math., 1978)

A survey of available systems. - B. David Saunders (SIGSAM Bull., 1980)

An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations. - B. David Saunders (SYMSACC, 1981)

Abstracts. - B. David Saunders (SIGSAM Bull., 1981)

Algebra made mechanical. - B. David Saunders (SIGSAM Bull., 1981)

A Generalized Class of Polynomials that are Hard to Factor. - Erich L. Kaltofen; David R. Musser; B. David Saunders (SIAM J. Comput., 1983)

Operational Calculus Technique for Solving Differential Equations. - Nikolaos Glinos; B. David Saunders (EUROSAM, 1984)

An Algebraic Implementation of Packages. - Snorri Agnarsson; Mukkai S. Krishnamoorthy; B. David Saunders (European Conference on Computer Algebra (2), 1985)

An Extension of Liouville's Theorem on Integration in Finite Terms. - Michael F. Singer; B. David Saunders; Bob F. Caviness (SIAM J. Comput., 1985)

Transitive Closure and Related Semiring Properties via Eliminants. - S. Kamal Abdali; B. David Saunders (Theor. Comput. Sci., 1985)

Fast parallel algorithms for similarity of matrices. - Erich L. Kaltofen; Mukkai S. Krishnamoorthy; B. David Saunders (SYMSAC, 1986)

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. - Erich L. Kaltofen; Mukkai S. Krishnamoorthy; B. David Saunders (EUROCAL, 1987)

A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm. - B. David Saunders; Hong R. Lee; S. Kamal Abdali (ISSAC, 1989)

On Wiedemann's Method of Solving Sparse Linear Systems. - Erich L. Kaltofen; B. David Saunders (AAECC, 1991)

On Computing Sparse Shifts for Univariate Polynomials. - Yagati N. Lakshman; B. David Saunders (ISSAC, 1994)

Some Experiments with Parallel Bignum Arithmetic. - Bruce W. Char; Jeremy Johnson 001; David Saunders 002; Andrew P. Wack (PASCO, 1994)

Fraction Free Gaussian Elimination for Sparse Matrices. - Hong R. Lee; B. David Saunders (J. Symb. Comput., 1995)

Sparse Polynomial Interpolation in Nonstandard Bases. - Yagati N. Lakshman; B. David Saunders (SIAM J. Comput., 1995)

Sparse Shifts for Univariate Polynomials. - Yagati N. Lakshman; B. David Saunders (Appl. Algebra Eng. Commun. Comput., 1997)

Certifying inconsistency of sparse linear systems. - Mark Giesbrecht; Austin Lobo; David Saunders 002 (SIGSAM Bull., 1997)

Parametric linear systems: the two parameter case. - Mark Giesbrecht; David Saunders 002 (SIGSAM Bull., 1997)

Integer Smith form via the valence: experience with large sparse matrices from homology. - Jean-Guillaume Dumas; B. David Saunders; Gilles Villard (ISSAC, 2000)

Black box methods for least squares problems. - B. David Saunders (ISSAC, 2001)

On Efficient Sparse Integer Matrix Smith Normal Form Computations. - Jean-Guillaume Dumas; B. David Saunders; Gilles Villard (J. Symb. Comput., 2001)

Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms. - Jean-Guillaume Dumas; Frank Heckenbach; B. David Saunders; Volkmar Welker (Algebra, Geometry, and Software Systems, 2003)

Smith normal form of dense integer matrices fast algorithms into practice. - David Saunders 002; Zhendong Wan (ISSAC, 2004)

Signature of symmetric rational matrices and the unitary dual of lie groups. - Jeffrey Adams; B. David Saunders; Zhendong Wan (ISSAC, 2005)

LinBox and future high performance computer algebra. - Bruce W. Char; B. David Saunders; Bryan S. Youse (PASCO, 2007)

Efficient matrix rank computation with application to the study of strongly regular graphs. - John P. May; David Saunders 002; Zhendong Wan (ISSAC, 2007)

Numerical techniques for computing the inertia of products of matrices of rational numbers. - John P. May; B. David Saunders; David Harlan Wood (SNC, 2007)

On finding multiplicities of characteristic polynomial factors of black-box matrices. - Jean-Guillaume Dumas; Clément Pernet; B. David Saunders (ISSAC, 2009)

Large matrix, small rank. - B. David Saunders; Bryan S. Youse (ISSAC, 2009)

LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation. - Jean-Guillaume Dumas; Thierry Gautier; Clément Pernet; B. David Saunders (ICMS, 2010)

Abstract only: Bitslicing with matrix algorithms oblivious to the data compression. - Bryan S. Youse; B. David Saunders (ACM Commun. Comput. Algebra, 2010)

Quadratic-time certificates in linear algebra. - Erich L. Kaltofen; Michael Nehring; B. David Saunders (ISSAC, 2011)

Numeric-symbolic exact rational linear system solver. - B. David Saunders; David Harlan Wood; Bryan S. Youse (ISSAC, 2011)

Fast computation of Smith forms of sparse matrices over local rings. - Mustafa Elsheikh; Mark Giesbrecht; Andy Novocin; B. David Saunders (ISSAC, 2012)

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. - Gavin Harrison; Jeremy Johnson 001; B. David Saunders (ACM Commun. Comput. Algebra, 2013)

Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract. - Brice Boyer; Jean-Guillaume Dumas; Pascal Giorgi; Clément Pernet; B. David Saunders (ICMS, 2014)

Elements of Design for Containers and Solutions in the LinBox Library. - Brice Boyer; Jean-Guillaume Dumas; Pascal Giorgi; Clément Pernet; B. David Saunders (CoRR, 2014)

3-ranks for strongly regular graphs. - Andrew Novocin; David Saunders 002; Alexander Stachnik; Bryan S. Youse (PASCO, 2015)

Matrices with Two Nonzero Entries per Row. - B. David Saunders (ISSAC, 2015)

Probabilistic analysis of block wiedemann for leading invariant factors. - Gavin Harrison; Jeremy Johnson 001; B. David Saunders (ACM Commun. Comput. Algebra, 2016)

Compiler auto-vectorization of matrix multiplication modulo small primes. - Matthew A. Lambert; B. David Saunders (PASCO@ISSAC, 2017)

On Parametric Linear System Solving. - Robert M. Corless; Mark Giesbrecht; Leili Rafiee Sevyeri; B. David Saunders (CASC, 2020)

Equivalences for Linearizations of Matrix Polynomials. - Robert M. Corless; Leili Rafiee Sevyeri; B. David Saunders (ISSAC, 2021)