1. Aaron Bradord, Michael Monagan, and Colin Percival, Integer factorization and computing discrete logarithms in Maple, in Proceedings of the 2006 Maple Conference, 2006, pp. 2–13.
  2. Sara Khodadad and Michael Monagan, Fast rational function reconstruction, ISSAC 2006, ACM, New York, 2006, pp. 184–190.[MR]
  3. Jennifer de Kleine, Michael Monagan, and Allan Wittkopf, Algorithms for the non-monic case of the sparse modular GCD algorithm, Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation: ISSAC'05, ACM, New York, 2005, pp. 124–131 (electronic).[MR]
  4. Michael Monagan, Maximal quotient rational reconstruction: An almost optimal algorithm for rational reconstruction, ISSAC 2004, ACM, New York, 2004, pp. 243–249.[MR]
  5. Michael Monagan and Mark van Hoeij, A modular algorithm for computing polynomial GCDs over number fields presented with multiple extensions, preprint http://www.cecm.sfu.ca/CAG/papers/HoeijMonGCD.pdf, 36 pages.