1. J. E. Cremona, Algorithms for Modular Elliptic Curves, Cambridge University Press, Cambridge, 1997, pp. vi+376.[MR]
  2. J. E. Cremona, Unimodular integer circulants, Math. Comp. 77 (2008), no. 263, 1639–1652.[MR]
  3. J. E. Cremona, T. A. Fisher, C. O'Neil, D. Simon, and M. Stoll, Explicit n-descent on elliptic curves. I. Algebra, J. reine angew. Math. 615 (2008), 121–155.[MR]
  4. J. E. Cremona, T. A. Fisher, C. O'Neil, D. Simon, and M. Stoll, Explicit n-descent on elliptic curves, II: Geometry, J. reine angew. Math 2009 (2009), no. 632, 63–84.[arXiv]
  5. J. E. Cremona, T. A. Fisher, and M. Stoll, Minimisation and reduction of 2-, 3- and 4-coverings of elliptic curves, Algebra and Number Theory 4 (2010), no. 6, 763–820.[arXiv]
  6. J. E. Cremona and M. P. Lingham, Finding all elliptic curves with good reduction outside a given set of primes, Experiment. Math. 16 (2007), no. 3, 303–312.[MR]
  7. J. E. Cremona, M. Prickett, and Samir Siksek, Height difference bounds for elliptic curves over number fields, J. Number Theory 116 (2006), no. 1, 42–68.[MR]
  8. J. E. Cremona and D. Rusin, Efficient solution of rational conics, Math. Comp. 72 (2003), no. 243, 1417–1441 (electronic).[MR]
  9. John E. Cremona, A solution for note 84.35, The Mathematical Gazette 86 (2002), no. 505, 66–68.[link]
  10. John Cremona, The elliptic curve database for conductors to 130000, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 11–29.[MR]
  11. Mark van Hoeij and John Cremona, Solving conics over function fields, J. Théor. Nombres Bordeaux 18 (2006), no. 3, 595–606.[MR]
  12. Samir Siksek and John E. Cremona, On the Diophantine equation x2+7=ym, Acta Arith. 109 (2003), no. 2, 143–149.[MR]