- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c25 |      | 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 | ||
| c24 | | Erich Kaltofen, Michael Nehring, B. David Saunders: Quadratic-time certificates in linear algebra. ISSAC 2011: 171-176 |
| c23 | | B. David Saunders, David Harlan Wood, Bryan S. Youse: Numeric-symbolic exact rational linear system solver. ISSAC 2011: 305-312 |
| 2010 | ||
| c22 | | 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 | ||
| c21 | | Jean-Guillaume Dumas, Clément Pernet, B. David Saunders: On finding multiplicities of characteristic polynomial factors of black-box matrices. ISSAC 2009: 135-142 |
| c20 | | |
| 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 | ||
| c19 | | Bruce W. Char, B. David Saunders, Bryan S. Youse: LinBox and future high performance computer algebra. PASCO 2007: 102-103 |
| c18 | | 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 |
| c17 | | John P. May, B. David Saunders, Zhendong Wan: Efficient matrix rank computation with application to the study of strongly regular graphs. ISSAC 2007: 277-284 |
| 2005 | ||
| c16 | | Jeffrey Adams, B. David Saunders, Zhendong Wan: Signature of symmetric rational matrices and the unitary dual of lie groups. ISSAC 2005: 13-20 |
| 2004 | ||
| c15 | | B. David Saunders, Zhendong Wan: Smith normal form of dense integer matrices fast algorithms into practice. ISSAC 2004: 274-281 |
| 2003 | ||
| c14 |  | 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 | ||
| j8 | | 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) |
| c13 | | |
| 2000 | ||
| c12 | | 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 | ||
| c11 | | Mark Giesbrecht, A. Lobo, B. David Saunders: Certifying Inconsistency of Sparse Linear Systems. ISSAC 1998: 113-119 |
| 1997 | ||
| j7 | | Yagati N. Lakshman, B. David Saunders: Sparse Shifts for Univariate Polynomials. Appl. Algebra Eng. Commun. Comput. 8(6): 561-562 (1997) |
| 1996 | ||
| j6 | | Yagati N. Lakshman, B. David Saunders: Sparse shifts for univariate polynomials. Appl. Algebra Eng. Commun. Comput. 7(5): 351-364 (1996) |
| 1995 | ||
| j5 | | Hong R. Lee, B. David Saunders: Fraction Free Gaussian Elimination for Sparse Matrices. J. Symb. Comput. 19(5): 393-402 (1995) |
| j4 | | Yagati N. Lakshman, B. David Saunders: Sparse Polynomial Interpolation in Nonstandard Bases. SIAM J. Comput. 24(2): 387-397 (1995) |
| 1994 | ||
| c10 | | Yagati N. Lakshman, B. David Saunders: On Computing Sparse Shifts for Univariate Polynomials. ISSAC 1994: 108-113 |
| 1991 | ||
| c9 | | Erich Kaltofen, B. David Saunders: On Wiedemann's Method of Solving Sparse Linear Systems. AAECC 1991: 29-38 |
| 1989 | ||
| c8 | | B. David Saunders, Hong R. Lee, S. Kamal Abdali: A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm. ISSAC 1989: 298-307 |
| 1987 | ||
| c7 | | Erich 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 Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders: Fast parallel algorithms for similarity of matrices. SYMSAC 1986: 65-70 |
| 1985 | ||
| j3 | | Michael 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) |
| j2 | | S. Kamal Abdali, B. David Saunders: Transitive Closure and Related Semiring Properties via Eliminants. Theor. Comput. Sci. 40: 257-274 (1985) |
| c5 | | Snorri Agnarsson, Mukkai S. Krishnamoorthy, B. David Saunders: An Algebraic Implementation of Packages. European Conference on Computer Algebra (2) 1985: 291-302 |
| 1984 | ||
| c4 | | Nikolaos Glinos, B. David Saunders: Operational Calculus Technique for Solving Differential Equations. EUROSAM 1984: 23-34 |
| 1983 | ||
| j1 | | Erich 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, B. F. Caviness: An extension of Liouville's theorem on integration in finite terms. SYMSACC 1981: 23-24 |
| c2 | | B. David Saunders: An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations. SYMSACC 1981: 105-108 |
| c1 | | Erich Kaltofen, David R. Musser, B. David Saunders: A generalized class of polynomials that are hard to factor. SYMSACC 1981: 188-194 |
Colors in the list of coauthors
Last update Mon May 20 07:33:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page