Publications

This is a list of publications using or citing Sage.
  1. Daniel J. Bernstein, Tanja Lange and Reza Rezaeian Farashahi, Binary Edwards Curves (19 pages), 2008; submitted
  2. William Stein, Christian Wuthrich, Computations About Tate-Shafarevich Groups Using Iwasawa Theory (37 pages), 2008; submitted
  3. Koopa Koo, William Stein, Gabor Wiese, On the generation of the coefficient field of a newform by a single Hecke eigenvalue (11 pages), 2008; submitted
  4. Dan Boneh, Craig Gentry, Michael Hamburg, Space-efficient identity based encryption without pairings (37 pages), Proceedings FOCS 2007; On page 10 they write "These performance numbers were obtained using the SAGE library."
  5. Patrick Ingram, Multiples of integral points on elliptic curves (29 pages), 2008.
  6. Nicholas J. Cavenagh, Carlo Hamalainen, Adrian M. Nelson, On completing three cyclic transversals to a latin square (13 pages), 2007.
  7. Chris A. Kurth, Ling Long, Computations with finite index subgroups of $PSL_2(\mathbb Z)$ using Farey symbols (16 pages), 2007.
  8. David Harvey, Efficient computation of p-adic heights (18 pages), 2007, to appear soon in LMS JCM.
  9. David Harvey, Kedlaya's algorithm in larger characteristic (21 pages), 2006, appeared in IMRN
  10. John Voight, Enumeration of totally real number fields of bounded root discriminant (14 pages), 2008.
  11. David Loeffler, Explicit calculations of automorphic forms for definite unitary groups (19 pages), 2008.
  12. Jonathan Sondow, Kyle Schalm, Which partial sums of the Taylor series for $e$ are convergents to $e$? (and a link to the primes 2, 5, 13, 37, 463) (13 pages), 2007.
  13. Dan Bernstein, Peter Birkner, Tanja Lange, Christiane Peters, Twisted Edwards Curves (13 pages), 2008. (There is a lot of Sage code in this paper.)
  14. Barry Mazur, Finding meaning in error terms (44 pages), Bull. Amer. Math. Soc. (2008).
  15. Barry Mazur, Controlling our errors, NATURE, Vol 443, 7 September 2006.
  16. K.S. Kedlaya, Search techniques for root-unitary polynomials, (version of 25 Sep 2007); to appear in Proceedings of the Special Session on Computational Arithmetic Geometry, Amer. Math. Soc. (K. Lauter and K. Ribet, eds.).
  17. David Joyner, William Stein http://www.ams.org/notices/200710/, Notices of the American Mathematical Society (link in the upper right).
  18. David Joyner, Quadratic residue codes and hyperelliptic curves, Provisionally accepted by Discrete Mathematics and Theoretical Computer Science, 2008.
  19. David Joyner, A primer on computational group homology and cohomology,, to appear in the Proceedings of the Gaglione conference, entitled Aspects of Infinite Groups (ed. Ben Fine), published by World Scientific Press, 2008.
  20. David Joyner and David Kohel, Groups and Sage, in Computational Group Theory and the Theory of Groups, AMS "Contemporary Mathematics" series vol. 470 (ed. Luise-Charlotte Kappe, Arturo Magidin, Robert Morse), 2008, pp. 115-140.
  21. Daniel Kane and Steven Sivek, On the S_n-modules generated by partitions of a given shape, Electron. J. Combin. 15(1) (2008), #R111.
  22. Kiran S. Kedlaya and Andrew V. Sutherland, Computing L-series of hyperelliptic curves, 2008.
  23. Pierre Guillot, The Cohomology of 2-Groups, 2008.
  24. Jason Grout, Jason Grout. The minimum rank problem over finite fields, 2007 (this is an extensive revision of a chapter of my dissertation).
  25. Jason Grout, Jason Grout. The minimum rank problem over finite fields. Dissertation at Brigham Young University, 2007.
  26. Dragos Cvetkovic and Jason Grout. Graphs with extremal energy should have a small number of distinct eigenvalues, 2007 (the published version does not have the Sage code, only the Mma code).
  27. Iftikhar A. Burhanuddin (2007), Some Computational Problems Motivated by the Birch and Swinnerton-Dyer Conjecture, Ph.D. (Computer Science) dissertation, University of Southern California, August 2007.
  28. Jaap Spies, Dancing School problems, Permanent solutions of Problem 29, NAW 5/7, nr. 4, December 2006, pp. 283-285
  29. David Kohel, Cryptography (and a local copy), 2007.
  30. Gregory Bard; Algorithms for Solving Linear and Polynomial Systems of Equations over Finite Fields with Applications to Cryptanalysis; Ph.D. thesis,) PDF (and a local copy), 2007.
  31. B. Bektemirov, B. Mazur, W. Stein and M. Watkins, Average ranks of elliptic curves: Tension between data and conjecture, Bulletins of the AMS, Volume 44, Number 2
  32. W. Stein, Modular Forms, a Computational Approach, Feb. 2007.
  33. D. Joyner and A. Ksir, Automorphism groups of some AG codes IEEE Trans. Info. Theory, vol 52, July 2006, pp 3325-3329.
  34. Stein et al., Verification of the Birch and Swinnerton-Dyer Conjecture for Specific Elliptic Curves, 2005.
  35. M. Albrecht Algebraic Attacks on the Courtois Toy Cipher, Cryptologia, Volume 32, Issue 3, July 2008, pages 220 - 276 (Diplomarbeit - Universitat, Bremen, Jan 2007)

Citing Sage

If you use Sage in a book, paper, website, etc., please email William Stein and reference Sage as follows: 
William Stein, Sage Mathematics Software (Version x.y.z),
The Sage Group, 2008, http://www.sagemath.org/
where you should change x.y.z. to the version of Sage that you used for the paper. In Bibtex: 
@manual{sage,
Key = {Sage},
Author = {William Stein},
Organization = {The Sage~Group},
Title = {{Sage}: {O}pen {S}ource {M}athematical {S}oftware ({V}ersion x.y.z)},
note = {{\tt http://www.sagemath.org}},
Year = 2008}
Or, 
\bibitem[Sage]{sage} Stein, William,
\emph{Sage: {O}pen {S}ource {M}athematical {S}oftware ({V}ersion x.y.z)},
The Sage~Group, 2008,
{\tt  http://www.sagemath.org}.
Also, be sure to find out what components of Sage, e.g., Numpy, PARI, GAP, that your calculation uses, and properly attribute those systems (for example, ask on sage-support). Similarly, consider finding out who wrote the Sage code you're using and acknowledge them explicitly as well.