Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Saunders, B.D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Black box methods for least squares problems
B.D. Saunders
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC'2001 (University of Western Ontario, London, Ontario, Canada, July 22-25, 2001)
, 2001, pp. 297-302
Certifying inconsistency of sparse linear systems
M. Giesbrecht
,
A. Lobo
,
B.D. Saunders
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, ISSAC'98 (University of Rostock, Germany, August 13-15, 1998)
, 1998, pp. 113-119
Mr.~Smith goes to Las Vegas: Randomized parallel computation of the Smith normal form of polynomial matrices
E. Kaltofen
,
M.S. Krishnamoorthy
,
B.D. Saunders
Lecture Notes in Computer Science
378
, 1989, pp. 317-322
Fast Parallel Algorithms for Similarity of Matrices
E. Kaltofen
,
M. Krishnamoorthy
,
B.D. Saunders
Proceedings of the 1986 Symposium on Symbolic and Algebraic Computation
, 1986, July, pp. 65-70
Transitive closure and related semiring properties via eliminants
S.K. Abdali
,
B.D. Saunders
Theoretical Computer Science
40
(2,3), 1985, pp. 257-274
An algebraic implementation of packages
S. Agnarsson
,
M.S. Krishnamoorthy
,
B.D. Saunders
Lecture Notes in Computer Science
204
, 1985, pp. 291-302
An Algebraic Implementation of Packages
Snorri Agnarsson
,
M.S. Krishnamoorthy
,
B.D. Saunders
Technical Report (85-13), 1985
Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
Erich Kaltofen
,
M. Krishnamoorthy
,
B.D. Saunders
Technical Report (85-11), 1985
An extension of Liouville's theorem on integration in finite terms
M.F. Singer
,
B.D. Saunders
,
B.F. Caviness
SIAM Journal on Computing
14
(4), 1985, November, pp. 966-990
Operational calculus techniques for solving differential equations
N. Glinos
,
B.D. Saunders
Lecture Notes in Computer Science
174
, 1984, pp. 23-34
A generalized class of polynomials that are hard to factor
E. Kaltofen
,
D.R. Musser
,
B.D. Saunders
SIAM Journal on Computing
12
(3), 1983, August, pp. 473-483