1. Eric Bach and Denis Charles, The hardness of computing an eigenform, Computational arithmetic geometry, Contemp. Math., vol. 463, Amer. Math. Soc., Providence, RI, 2008, pp. 9–15.[MR/arXiv]
  2. Denis Xavier Charles, Complex multiplication tests for elliptic curves, preprint (2004), 13 pages.[arXiv]
  3. Denis Charles, Kamal Jain, and Kristin Lauter, Signatures for network coding, International Journal of Information and Coding Theory 1 (2009), no. 1, 3–14.[link]
  4. Denis Charles and Kristin Lauter, Computing modular polynomials, LMS J. Comput. Math. 8 (2005), 195–204 (electronic).[MR]