Contents - Student subdomain for University of Bath
Contents - Student subdomain for University of Bath
Contents - Student subdomain for University of Bath
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
250 BIBLIOGRAPHY<br />
[DL08] J.H. Davenport and P. Libbrecht. The Freedom to Extend<br />
OpenMath and its Utility. Mathematics in Computer Science<br />
2(2008/9), pages 379–398, 2008.<br />
[DM90]<br />
[DN07]<br />
[Dod66]<br />
[Doy99]<br />
[DS97]<br />
[DS00]<br />
[DT81]<br />
[DT90]<br />
[Duv87]<br />
[Fat03]<br />
[Fau02]<br />
[FGK + 94]<br />
[FGLM93]<br />
J.H. Davenport and M. Mignotte. On Finding the Largest Root <strong>of</strong><br />
a Polynomial. Modélisation Mathématique et Analyse Numérique,<br />
24:693–696, 1990.<br />
P. D’Alberto and A. Nicolau. Adaptive Strassen’s matrix multiplication.<br />
In Proceedings Supercomputing 2007, pages 284–292,<br />
2007.<br />
C.L. Dodgson. Condensation <strong>of</strong> determinants, being a new and<br />
brief method <strong>for</strong> computing their algebraic value. Proc. Roy. Soc.<br />
Ser. A, 15:150–155, 1866.<br />
N.J. Doye. Automated Coercion <strong>for</strong> Axiom. In S. Dooley, editor,<br />
Proceedings ISSAC ’99, pages 229–235, 1999.<br />
A. Dolzmann and Th. Sturm. Redlog: Computer Algebra Meets<br />
Computer Logic. ACM SIGSAM Bull. 2, 31:2–9, 1997.<br />
J.H. Davenport and G.C. Smith. Fast recognition <strong>of</strong> alternating<br />
and symmetric groups. J. Pure Appl. Algebra, 153:17–25, 2000.<br />
J.H. Davenport and B.M. Trager. Factorization over finitely generated<br />
fields. In Proceedings SYMSAC 81, pages 200–205, 1981.<br />
J.H. Davenport and B.M. Trager. Scratchpad’s View <strong>of</strong> Algebra<br />
I: Basic Commutative Algebra. In Proceedings DISCO ’90, 1990.<br />
D. Duval. Diverses Questions relatives au Calcul Formel avec les<br />
Nombres Algébriques. Thèse d’Etat, 1987.<br />
R.J. Fateman. Comparing the speed <strong>of</strong> programs <strong>for</strong> sparse polynomial<br />
multiplication. SIGSAM Bulletin 1, 37:4–15, 2003.<br />
J.-C. Faugère. A New Efficient Algorithm <strong>for</strong> Computing Gröbner<br />
Bases Without Reduction to Zero (F 5 ). In T. Mora, editor, Proceedings<br />
ISSAC 2002, pages 75–83, 2002.<br />
B. Fuchssteiner, K. Gottheil, A. Kemper, O. Kluge, K. Morisse,<br />
H. Naundorf, G. Oevel, T. Schulze, and W. Wiwianka. Mu-<br />
PAD Multi Processing Algebra Data Tool Tutorial (version 1.2).<br />
Birkhäuser Verlag, 1994.<br />
J.C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient Computation<br />
<strong>of</strong> Zero-Dimensional Gröbner Bases by Change <strong>of</strong> Ordering.<br />
J. Symbolic Comp., 16:329–344, 1993.