References

• • [ABR02]

  • Selma Altınok, Gavin Brown, and Miles Reid. Fano 3-folds, K3 surfaces and graded rings. In Topology and geometry: commemorating SISTAG, volume 314 of Contemp. Math., pages 25–53. Amer. Math. Soc., Providence, RI, 2002.

• • [Betal03]

  • R. Beals and C. R. Leedham-Green and A. C. Niemeyer and C. E. Prager and A. Seress, A black-box algorithm for recognising finite symmetric and alternating groups. Trans. Amer. Math. Soc. to appear.

• • [BHKS]

  • K. Belabas, M. van Hoeij, J Klüners, A. Steel, Factoring polynomials over global fields, Journal de Théorie des Nombres de Bordeaux, 21 (2009), 15–39.

• • [Birch91]

  • B. J. Birch. Hecke actions on classes of ternary quadratic forms. Computational number theory (Debrecen, 1989), 191–212, de Gruyter, Berlin, 1991.

• • [BW01]

  • J. Boyer and W. Myrvold. Simplified O(n) Planarity Algorithms. Submitted, 2001.

• • [BCS]

  • W. Bosma, J. J. Cannon and A. Steel. Lattices of Compatibly Embedded Finite Fields, J. Symb. Comp. 24 (1997), pp. 351–369.

• • [BP00]

  • S. Bratus and I. Pak. Fast constructive recognition of a black box group isomorphic to S_n or A_n using Goldbach's conjecture. J. Symb. Comput. 29 (2000), pp. 33–57.

• • [Bro02]

  • Gavin Brown. Datagraphs in algebraic geometry. In Symbolic and Numerical Scientific Computing – Proc. of SNSC'01, volume 2630 of LNCS, Heidelberg, 2003. Springer-Verlag. F. Winkler and U. Langer (eds.).

• • [BuchSq]

  • J. Buchmann and D. Squirrel. Kernels of Integer Matrices via Modular Arithmetic. Technical Report No. TI-4/99, University of Darmstadt. < ftp://ftp.informatik.tu-darmstadt.de/pub/TI/TR/TI-99-04.ps.gz > .

• • [teske_bsgs]

  • J. Buchmann, M.J. Jacobson Jr., and E. Teske. On Some Computational Problems in Finite Abelian Groups. Mathematics of Computation, 66:1663–1687, 1997.

• • [BuSz]

  • Anita Buckley and Balázs SzendrH oi. The Riemann–Roch formula for 3-folds with canonical singularities and applications to Calabi–Yau 3-folds. 19pp preprint as math.AG/0309033, 2002

• • [CG97]

  • B.V. Cherkassky and A.V. Golberg. On Implementing the Push-Relabel Method for the Maximum Flow Problem. Algorithmica, 19:390–410, 1997.

• • [CGM98]

  • B.V. Cherkassky, A.V. Golberg, Paul Martin, J.C. Setubal, and J. Stolfi. Augment or Push? A Computational Study of Bipartite Matching and Unit Capacity Flow Algorithms. Technical report, NEC Research Institute, 1998.

• • [Crem97]

  • J. Cremona. Algorithms for modular elliptic curves. Second edition. Cambridge University Press, Cambridge, 1997.

• • [Derksen99]

  • H. Derksen. Computation of Invariants for Reductive Groups, Adv. Math 141 (1999), 366–384.

• • [Duval85]

  • J. Della Dora, C. Dicrescenzo and D. Duval. About a new method for computing in algebraic number fields, Proc. EUROCAL '85, Vol. 2. Lecture Notes in Computer Science (1985), 204, 289–290.

• • [Duv89]

  • Dominique Duval. Rational Puiseux Expansions. Compositio Mathematica, 70:119–154, 1989.

• • [Eich72]

  • M. Eichler. The basis problem for modular forms and the traces of the Hecke operators. Modular functions of one variable, I, 75–151, Lecture Notes in Math., 320, Springer, Berlin, 1973.

• • [Geb00]

  • V. Gebhardt. Constructing a short defining set of relations for a finite group. J. Algebra 233 (2000), pp. 526–542.

• • [GutMut01]

  • C. Gutwenger and P. Mutzel. A Linear Time Implementation of SPQR-Trees. In J. Marks, editor, Graph Drawing 2000, volume 1984 of Lecture Notes in Computer Science, pages 70–90. Springer-Verlag, 2001.

• • [HPS80]

  • H. Hijikata, A. Pizer, T. Shemanske. The basis problem for modular forms on Γ₀(N). Proc. Japan Acad. Ser. A Math. Sci. 56 (1980), no. 6, 280–284.

• • [HopTar73]

  • J.E. Hopcroft and R.E. Tarjan. Dividing a Graph into Triconnected Components. SIAM J. Comput., 2(3):135–158, 1973.

• • [KS01]

  • W. Kantor and A. Seress. Black box classical groups. Mem. Amer. Math. Soc. 149 (2001), no. 708.

• • [KemSte98]

  • G. Kemper and A. Steel. Some Algorithms in Invariant Theory of Finite Groups, Proceedings of the Euroconference on Computational Methods for Representations of Groups and Algebras, P. Dräxler, G.O. Michler, and C.M. Ringel, eds., Birkhäuser, Basel, 1998.

• • [Kemper99]

  • G. Kemper. An Algorithm to Calculate Optimal Homogeneous Systems of Parameters, JSC 27 2 (1999), 171–184

• • [Koh99]

  • D. R. Kohel. Hecke module structure of quaternions. Class Field Theory – it's Centenary and Prospect, K. Miyake, ed., The Advanced Studies in Pure Mathematics Series, Math. Soc. Japan, 2001.

• • [KohStei00]

  • D. R. Kohel and W. A. Stein. Component groups of quotients of J₀(N). Proceedings of ANTS IV, 2000.

• • [LaOd91]

  • B. A. LaMacchia and A. M. Odlyzko. Solving Large Sparse Linear Systems over Finite Fields, Advances in Cryptology: Proceedings of Crypto '90, A. Menezes, S. Vanstone, eds., Lecture Notes in Computer Science 537, Springer-Verlag, NY (1991), 109–133.

• • [L-GM02]

  • C. R. Leedham-Green and S. H. Murray. Variants of product replacement. Contemp. Math. 298 (2002), pp. 97–104.

• • [LS97]

  • E. M. Luks and A. Seress. Computing the Fitting subgroup and solvable radical of small-base permutation groups in nearly linear time. Groups and computation II (New Brunswick, NJ, 1995), 169–181, Amer. Math. Soc., 1997.

• • [Mest86]

  • J.-F. Mestre. Sur la méthode des graphes, Exemples et applications, Proceedings of the international conference on class numbers and fundamental units of algebraic number fields, Nagoya University, 1986, 217–242.

• • [McK98]

  • B. D. McKay. Isomorph-free exhaustive generation. J. Algorithms, 26 (1998), 306–324.

• • [McK81]

  • B. D. McKay. Practical Graph Isomorphism. Congressus Numerantium, 30 (1981), 45–87.

• • [MQB99]

  • J. Müller-Quade and T. Beth. Calculating Generators for Invariant Fields of Linear Algebraic Groups, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Honolulu, HI, 1999), LNCS 1719, Springer, 1999, 392–403.

• • [Neu86]

  • P. M. Neumann. Some algorithms for computing with finite permutation groups. Groups - St. Andrews 1985, London Math. Soc. Lecture Notes 121, 1986.

• • [Piz80]

  • A. Pizer. An algorithm for computing modular forms on Γ₀(N), J. Algebra 64 (1980), no. 2, 340–390.

• • [SuRe]

  • Miles Reid and Kaori Suzuki. Cascades of projections from log del Pezzo surfaces. In Number theory and algebraic geometry – to Peter Swinnerton-Dyer on his 75th birthday, pages 227–249. Cambridge University Press, Cambridge, 2003.

• • [RDU03]

  • C. M. Roney-Dougal and W. R. Unger. The affine primitive permutation groups of degree less than 1000. J. Symb. Comput. 35 (2003), pp. 421–439.

• • [RD05]

  • C. M. Roney-Dougal. The primitive groups of degree less than 2500. Submitted.

• • [AKS97]

  • A. Steel. A New Algorithm for the Computation of Canonical Forms of Matrices over Fields, J. Symb. Comp., 24 (1997), 409–432.

• • [ACF1]

  • A. Steel. A New Scheme for Computing with Algebraically Closed Fields, Proceedings of ANTS V, ed. C. Fieker and D.R. Kohel, Springer LCNS 2369 (2002), 493–507.

• • [ACF2]

  • A. Steel. Computing With Algebraic Closures, J. Symb. Comput., 45(3): 342–372 (2010).

• • [Insep]

  • A. Steel. Conquering Inseparability: Primary Decomposition and Multivariate Factorization over Algebraic Function Fields of Positive Characteristic. JSC 40 (2005), 1053–1075.

• • [IntMult]

  • A. Steel. Magma V2.12 is up to 2.3 times faster than GMP 4.1.4 for large integer multiplication, http://magma.maths.usyd.edu.au/users/allan/gb/.

• • [SteelGB]

  • A. Steel. Gröbner Basis Timings Page, http://magma.maths.usyd.edu.au/users/allan/gb/.

• • [WAS00]

  • W. A. Stein. Explicit approaches to the theory of modular abelian varieties. Ph.D. thesis, University of California, 2000.

• • [WAS07]

  • W. A. Stein. Modular forms: a computational approach, with an appendix by Paul Gunnels. Amer. Math. Soc. Graduate Studies in Mathematics, Volume 79 (2007).

• • [Wa78]

  • Robert J. Walker. Algebraic Curves, pages 98–99. Springer-Verlag, 1978.