B. David Saunders Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-Guillaume Dumas, Clément Pernet, B. David Saunders: On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC 2009: 135-142
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLB. David Saunders, Bryan S. Youse: Large matrix, small rank. ISSAC 2009: 317-324
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-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
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn P. May, B. David Saunders, Zhendong Wan: Efficient matrix rank computation with application to the study of strongly regular graphs. ISSAC 2007: 277-284
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBruce W. Char, B. David Saunders, Bryan S. Youse: LinBox and future high performance computer algebra. PASCO 2007: 102-103
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn 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
2005
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeffrey Adams, B. David Saunders, Zhendong Wan: Signature of symmetric rational matrices and the unitary dual of lie groups. ISSAC 2005: 13-20
2004
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLB. David Saunders, Zhendong Wan: Smith normal form of dense integer matrices fast algorithms into practice. ISSAC 2004: 274-281
2003
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLB. David Saunders: Black box methods for least squares problems. ISSAC 2001: 297-302
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark Giesbrecht, A. Lobo, B. David Saunders: Certifying Inconsistency of Sparse Linear Systems. ISSAC 1998: 113-119
1997
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYagati N. Lakshman, B. David Saunders: Sparse Shifts for Univariate Polynomials. Appl. Algebra Eng. Commun. Comput. 8(6): 561-562 (1997)
1996
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYagati N. Lakshman, B. David Saunders: Sparse Shifts for Univariate Polynomia. Appl. Algebra Eng. Commun. Comput. 7(5): 351-364 (1996)
1995
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHong R. Lee, B. David Saunders: Fraction Free Gaussian Elimination for Sparse Matrices. J. Symb. Comput. 19(5): 393-402 (1995)
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYagati N. Lakshman, B. David Saunders: Sparse Polynomial Interpolation in Nonstandard Bases. SIAM J. Comput. 24(2): 387-397 (1995)
1994
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYagati N. Lakshman, B. David Saunders: On Computing Sparse Shifts for Univariate Polynomials. ISSAC 1994: 108-113
1991
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErich Kaltofen, B. David Saunders: On Wiedemann's Method of Solving Sparse Linear Systems. AAECC 1991: 29-38
1989
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLB. David Saunders, Hong R. Lee, S. Kamal Abdali: A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm. ISSAC 1989: 298-307
1987
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErich 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
1985
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSnorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders: An Algebraic Implementation of Packages. European Conference on Computer Algebra (2) 1985: 291-302
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael F. Singer, B. David Saunders, B. F. Caviness: An Extension of Liouville's Theorem on Integration in Finite Terms. SIAM J. Comput. 14(4): 966-990 (1985)
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLS. Kamal Abdali, B. David Saunders: Transitive Closure and Related Semiring Properties via Eliminants. Theor. Comput. Sci. 40: 257-274 (1985)
1984
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNikolaos Glinos, B. David Saunders: Operational Calculus Technique for Solving Differential Equations. EUROSAM 1984: 23-34
1983
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErich 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)

Coauthor Index

1S. Kamal Abdali [3] [7]
2Jeffrey Adams [20]
3Snorri Agnarsson [5]
4B. F. Caviness [4]
5Bruce W. Char [22]
6Jean-Guillaume Dumas [15] [16] [18] [24] [26]
7Mark Giesbrecht [14]
8Nikolaos Glinos [2]
9Frank Heckenbach [18]
10Erich Kaltofen [1] [6] [8]
11Mukkai S. Krishnamoorthy [5] [6]
12Yagati N. Lakshman [9] [10] [12] [13]
13Hong R. Lee [7] [11]
14A. Lobo [14]
15John P. May [21] [23]
16David R. Musser [1]
17Clément Pernet [24] [26]
18Michael F. Singer [4]
19Gilles Villard [15] [16]
20Zhendong Wan [19] [20] [23]
21Volkmar Welker [18]
22David Harlan Wood [21]
23Bryan S. Youse [22] [25]

Colors in the list of coauthors

Copyright © Fri Nov 27 15:43:12 2009 by Michael Ley (ley@uni-trier.de)