B. David Saunders
Affiliations:- University of Delaware, Newark, DE, USA
According to our database1,
B. David Saunders
authored at least 46 papers
between 1978 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
1
1
1
1
1
3
2
2
1
2
1
1
1
1
1
2
1
1
2
1
2
3
1
1
1
1
1
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cis.udel.edu
-
on dl.acm.org
On csauthors.net:
Bibliography
2021
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021
2020
Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020
2017
Proceedings of the International Workshop on Parallel Symbolic Computation, 2017
2016
ACM Commun. Comput. Algebra, 2016
2015
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, 2015
2014
Elements of Design for Containers and Solutions in the LinBox Library - Extended Abstract.
Proceedings of the Mathematical Software - ICMS 2014, 2014
2013
ACM Commun. Comput. Algebra, 2013
2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011
2010
ACM Commun. Comput. Algebra, 2010
LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation.
Proceedings of the Mathematical Software, 2010
2009
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
On finding multiplicities of characteristic polynomial factors of black-box matrices.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
2007
Numerical techniques for computing the inertia of products of matrices of rational numbers.
Proceedings of the Symbolic-Numeric Computation, 2007
Efficient matrix rank computation with application to the study of strongly regular graphs.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007
Proceedings of the Parallel Symbolic Computation, 2007
2005
Proceedings of the Symbolic and Algebraic Computation, 2005
2004
Proceedings of the Symbolic and Algebraic Computation, 2004
2003
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003
2001
J. Symb. Comput., 2001
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001
2000
Integer Smith form via the valence: experience with large sparse matrices from homology.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000
1997
1995
1994
Some Experiments with Parallel Bignum Arithmetic.
Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994
1991
Proceedings of the Applied Algebra, 1991
1989
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989
1987
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices.
Proceedings of the EUROCAL '87, 1987
1986
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986
1985
Theor. Comput. Sci., 1985
SIAM J. Comput., 1985
1984
Proceedings of the EUROSAM 84, 1984
1983
1981
An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations.
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981
1980
1978
Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices.
Discret. Math., 1978