On Wiedemann's method of solving sparse linear systems E Kaltofen, B David Saunders International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1991 | 240 | 1991 |

LinBox: A generic library for exact linear algebra JG Dumas, T Gautier, M Giesbrecht, P Giorgi, B Hovinen, E Kaltofen, ... Proceedings of the 2002 International Congress of Mathematical Software …, 2002 | 114 | 2002 |

On efficient sparse integer matrix Smith normal form computations JG Dumas, BD Saunders, G Villard Journal of Symbolic Computation 32 (1-2), 71-99, 2001 | 114 | 2001 |

Parallel algorithms for matrix normal forms E Kaltofen, MS Krishnamoorthy, BD Saunders Linear Algebra and its Applications 136, 189-208, 1990 | 99 | 1990 |

Fast parallel computation of Hermite and Smith forms of polynomial matrices E Kaltofen, MS Krishnamoorthy, BD Saunders SIAM Journal on Algebraic Discrete Methods 8 (4), 683-690, 1987 | 99 | 1987 |

Efficient matrix preconditioners for black box linear algebra L Chen, W Eberly, E Kaltofen, BD Saunders, WJ Turner, G Villard Linear Algebra and its Applications 343, 119-146, 2002 | 89 | 2002 |

Sparse polynomial interpolation in nonstandard bases YN Lakshman, BD Saunders SIAM Journal on Computing 24 (2), 387-397, 1995 | 68 | 1995 |

An extension of Liouville’s theorem on integration in finite terms MF Singer, BD Saunders, BF Caviness SIAM Journal on Computing 14 (4), 966-990, 1985 | 61 | 1985 |

A generalized class of polynomials that are hard to factor E Kaltofen, DR Musser, BD Saunders Proceedings of the fourth ACM symposium on Symbolic and algebraic …, 1981 | 53 | 1981 |

Certifying inconsistency of sparse linear systems M Giesbrecht, A Lobo, BD Saunders Proceedings of the 1998 international symposium on Symbolic and algebraic …, 1998 | 47 | 1998 |

Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices BD Saunders, H Schneider Discrete Mathematics 24 (2), 205-220, 1978 | 45 | 1978 |

Transitive closure and related semiring properties via eliminants SK Abdali, BD Saunders Theoretical Computer Science 40, 257-274, 1985 | 38 | 1985 |

A parallel implementation of the cylindrical algebraic decomposition algorithm BD Saunders, HR Lee, SK Abdali Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and …, 1989 | 34 | 1989 |

An implementation of Kovacic's algorithm for solving second order linear homogeneous differential equations BD Saunders Proceedings of the fourth ACM symposium on Symbolic and algebraic …, 1981 | 32 | 1981 |

Fraction free Gaussian elimination for sparse matrices HR Lee, BD Saunders Journal of symbolic computation 19 (5), 393-402, 1995 | 27 | 1995 |

Integer Smith form via the valence: experience with large sparse matrices from homology JG Dumas, BD Saunders, G Villard Proceedings of the 2000 international symposium on Symbolic and algebraic …, 2000 | 25 | 2000 |

Quadratic-time certificates in linear algebra EL Kaltofen, M Nehring, BD Saunders Proceedings of the 36th international symposium on Symbolic and algebraic …, 2011 | 24 | 2011 |

Sparse shifts for univariate polynomials YN Lakshman, BD Saunders Applicable Algebra in Engineering, Communication and Computing 7 (5), 351-364, 1996 | 21 | 1996 |

On computing sparse shifts for univariate polynomials YN Lakshman, BD Saunders Proceedings of the international symposium on Symbolic and algebraic …, 1994 | 17 | 1994 |

Cones, graphs and optimal scalings of matrices BD Saunders, H Schneider Linear and Multilinear Algebra 8 (2), 121-135, 1979 | 17 | 1979 |