1. Jacques Dubrois and Jean-Guillaume Dumas, Efficient polynomial time algorithms computing industrial-strength primitive roots, Inform. Process. Lett. 97 (2006), no. 2, 41–45.[MR]
  2. Jean-Guillaume Dumas, Thierry Gautier, Pascal Giorgi, and Clément Pernet, Dense linear algebra over finite fields: The FFLAS and FFPACK packages, preprint (2006), 69 pages.[arXiv]
  3. Jean-Guillaume Dumas, Pascal Giorgi, and Clément Pernet, FFPACK: finite field linear algebra package, ISSAC '2004: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2004, pp. 119–126.[MR]
  4. Jean-Guillaume Dumas, Pascal Giorgi, and Clément Pernet, Dense linear algebra over word-size prime fields: The FFLAS and FFPACK packages, ACM Trans. Math. Softw. 35 (2008), no. 3, 1–42.[doi]
  5. Jean-Guillaume Dumas, Clément Pernet, and Zhendong Wan, Efficient computation of the characteristic polynomial, ISSAC'05: Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2005, pp. 140–147 (electronic).[MR/arXiv]
  6. Jean-Guillaume Dumas and Anna Urbanska, An introspective algorithm for the integer determinant, preprint (2006), 32 pages.[arXiv]