# References

**[Dim]** **missing editor in Dimino**

**[vdGOS91]** G. van der Geer, F. Oort, and J. Steenbrink, editors. *Arithmetic Algebraic Geometry*, volume 89 of Progress in Mathematics, Basel, 1991. Birkhäuser Verlag.

**[JKS94]** Uwe Jannsen, Steven Kleiman, and Jean-Pierre Serre, editors. *Motives*, volume 55 of Proceedings of Symposia in Pure Mathematics, Providence, RI, 1994. American Mathematical Society.

**[Coh96a]** Henri Cohen, editor. *ANTS II*, volume 1122 of LNCS, Springer-Verlag, 1996.

**[Buh98]** Joe P. Buhler, editor. *ANTS III*, volume 1423 of LNCS, Springer-Verlag, 1998.

**[Bos00]** Wieb Bosma, editor. *ANTS IV*, volume 1838 of LNCS, Springer-Verlag, 2000.

**[FK02]** Claus Fieker and David R. Kohel, editors. *ANTS V*, volume 2369 of LNCS, Springer-Verlag, 2002.

**[Bue04]** D. Buell, editor. *ANTS VI*, volume 3076 of LNCS, Springer-Verlag, 2004.

**[HPP06]** F. Hess, S. Pauli, and M. Pohst, editors. *ANTS VII*, volume 4076 of LNCS, Springer-Verlag, 2006.

**[AD14]** **missing note in BarDok**

**[ABM99]** John Abbott, Manuel Bronstein, and Thom Mulders. Fast deterministic computation of determinants of dense matrices. In Sam Dooley, editor, *Proceedings ISSAC'99*, 197–204. New York, 1999. ACM Press.

**[AKluners99]** Vincenzo Acciaro and Jürgen Klüners. Computing Automorphisms of Abelian Number Fields. *Math. Comp.*, 68(227):1179–1186, 1999.

**[AL94]** William Adams and Philippe Loustaunau. *An introduction to Gröbner bases*. Volume 3 of Graduate studies in mathematics. American Mathematical Society, Providence, R.I., 1994.

**[AM94]** A. Adem and R.J. Milgram. *Cohomology of Finite Groups*. Grundlehren der Mathematischen Wissenschaften. Springer, Berlin-New York-Heidelberg, 1994.

**[AS04]** A. Agashe and W.\thinspace A. Stein. The manin constant, congruence primes, and the modular degree. Preprint, \biburl http://modular.fas.harvard.edu/papers/manin-agashe/, 2004.

**[AS05]** Amod Agashe and William Stein. Visible evidence for the Birch and Swinnerton-Dyer conjecture for modular abelian varieties of analytic rank zero. *Math. Comp.*, 74(249):455–484 (electronic), 2005. With an appendix by J. Cremona and B. Mazur.

**[AS02]** Amod Agashe and William A. Stein. \em Appendix to Joan-C. Lario and René Schoof: Some computations with Hecke rings and deformation rings. *submitted*, 2002.

**[AEVZ02]** E. Agrell, T. Eriksson, A. Vardy, and K. Zeger. Closest point search in lattices. *IEEE Transactions on Information Theory*, 48(8):2201–2214, 2002.

**[AHU74]** A.V. Aho, J.E. Hopcroft, and J.D. Ullman. *The Design and Analysis of Computer Algorithms*. Addison-Wesley, Reading, MA, 1974.

**[AMO93]** R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. *Network Flows, Theory, Algorithms, and Applications*. Prentice Hall, 1993.

**[Ajt98]** Miklós Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In *Proceedings of the 30th Symposium on the Theory of Computing (STOC 1998)*, 10–19. ACM, 1998.

**[Akh02]** Ali Akhavi. Random lattices, threshold phenomena and efficient reduction algorithms. *Theoretical Computer Science*, 287(2):359–385, 2002.

**[Alb42]** A. A. Albert. Non-associative algebras. I. Fundamental concepts and isotopy. *Ann. of Math. (2)*, 43:685–707, 1942. URL: [https://doi.org/10.2307/1968960](https://doi.org/10.2307/1968960), [doi:10.2307/1968960](https://doi.org/10.2307/1968960).

**[Alb61]** A. Adrian Albert. *Structure of Algebras*. American Mathematical Society, Providence, RI, 1961. Revised printing.

**[ACvHS17]** Emilio Allem, Juliane Capaverde, Mark van Hoeij, and Jonas Szutkoski. Functional decomposition using principal subfields. In *ISSAC '17, July 25-28, 2017, Kaiserslautern, Germany*. ACM, 2017. accepted. [doi:doi.org/10.1145/3087604.3087608](https://doi.org/doi.org/10.1145/3087604.3087608).

**[All84]** W.O. Alltop. A method for extending binary linear codes. *IEEE Trans. Inform. Theory*, 30:871 – 872, 1984.

**[AG12]** Gert Almkvist and Jesús Guillera. Ramanujan-like series for $1/\pi ^2$ and string theory. *Experimental Math.*, 21:223–234, 2012. URL: [http://dx.doi.org/10.1080/10586458.2012.656059](http://dx.doi.org/10.1080/10586458.2012.656059).

**[AB04]** Montserrat Alsina and Pilar Bayer. *Quaternion orders, quadratic forms, and Shimura curves*. Volume 22 of CRM Monograph Series. American Mathematical Society, Providence, RI, 2004. ISBN 0-8218-3359-6.

**[Altinok98]** Selma Altınok. *Graded Rings Corresponding to Polarised K3 Surfaces and Q-Fano $3$-folds*. PhD thesis, University of Warwick, 1998. \biburl http://www.maths.warwick.ac.uk/˜miles/students/Selma/.

**[AltinokBR02]** 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.

**[AMPS10a]** S. Ambrose, S.H. Murray, C.E. Praeger, and C. Schneider. Constructive membership testing in black-box classical groups. In *Proceedings of The Third International Congress on Mathematical Software*, number 6327 in Lecture Notes in Computer Science, 54–57. Basel, 2010. Springer.

**[AMPS10b]** S. Ambrose, S.H. Murray, C.E. Praeger, and C. Schneider. Constructive membership testing in black-box classical groups. In *Proceedings of The Third International Congress on Mathematical Software*, number 6327 in Lecture Notes in Computer Science, 54–57. Basel, 2010. Springer.

**[AKM+01]** Sang Yook An, Seog Young Kim, David C. Marshall, Susan H. Marshall, William G. McCallum, and Alexander R. Perlis. Jacobians of genus one curves. *J. Number Theory*, 90(2):304–315, 2001.

**[And77]** C.M. Andersen. Clebsch-Gordan series for symmetrized tensor products. *J. Math. Phys*, 8:988–997, 1977.

**[AAG99]** Iris Anshel, Michael Anshel, and Dorian Goldfeld. An algebraic method for public-key cryptography. *Math. Res. Lett.*, 6(3-4):287–291, 1999.

**[Arm71]** J. V. Armitage. Zeta functions with a zero at $s=1/2$. *Invent. Math.*, 15(3):199–205, 1971.

**[Arm83]** Mark Anthony Armstrong. *Basic topology*. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1983. ISBN 0-387-90839-0. Corrected reprint of the 1979 original.

**[AGZV85]** V. I. Arnold, S. M. Gusein-Zade, and A. N. Varchenko. *Singularities of Differentiable Maps Volume I*. Volume 82 of Monographs in Mathematics. Birkhauser, 1985.

**[AR84]** D. G. Arrell and E. F. Robertson. A modified Todd-Coxeter algorithm. In *Computational group theory (Durham, 1982)*, pages 27–32. Academic Press, London, 1984.

**[Art47]** E. Artin. Theory of braids. *Ann. of Math. (2)*, 48:101–126, 1947.

**[Art57]** E. Artin. *Geometric Algebra*. Interscience Publishers, New York, 1957.

**[ARVT05]** Michael Artin, Fernando Rodriguez-Villegas, and John Tate. On the Jacobians of plane cubics. *Adv. Math.*, 198(1):366–382, 2005.

**[Asc84]** M. Aschbacher. On the maximal subgroups of the finite classical groups. *Invent. Math*, 76:469–514, 1984.

**[Ash77]** Avner Ash. Deformation retracts with lowest possible dimension of arithmetic quotients of self-adjoint homogeneous cones. *Math. Ann.*, 225(1):69–76, 1977.

**[Ash94]** Avner Ash. Unstable cohomology of $\rm SL(n,\cal O)$. *J. Algebra*, 167(2):330–342, 1994.

**[AFI+22]** Eran Assaf, Dan Fretwell, Colin Ingalls, Adam Logan, Spencer Secord, and John Voight. Definite orthogonal modular forms: computations, excursions, and discoveries. *Res. Number Theory*, 8(4):Paper No. 70, 32, 2022. URL: [https://doi.org/10.1007/s40993-022-00373-2](https://doi.org/10.1007/s40993-022-00373-2), [doi:10.1007/s40993-022-00373-2](https://doi.org/10.1007/s40993-022-00373-2).

**[ALR+24]** Eran Assaf, Watson Ladd, Gustavo Rama, Gonzalo Tornaría, and John Voight. A database of paramodular forms from quinary orthogonal modular forms. In *LuCaNT: LMFDB, computation, and number theory*, volume 796 of Contemp. Math., pages 243–259. Amer. Math. Soc., [Providence], RI, [2024] ©2024. URL: [https://doi.org/10.1090/conm/796/16004](https://doi.org/10.1090/conm/796/16004), [doi:10.1090/conm/796/16004](https://doi.org/10.1090/conm/796/16004).

**[Atk67]** A. O. L. Atkin. Weierstrass points at cusps $\Gamma _o(N)$. *Ann. of Math. (2)*, 85:42–45, 1967.

**[AM93]** A. O. L. Atkin and F. Morain. Elliptic curves and primality proving. *Math. Comp.*, 61:29 – 68, 1993.

**[AL70]** A.O.L. Atkin and J. Lehner. Hecke operators on $\Gamma _0(N)$. *Math. Annalen*, 185:134–160, 1970.

**[Atk75]** M.D. Atkinson. An algorithm for finding the blocks of a permutation group. *Math. Comp.*, 29:911–913, 1975.

**[BGK+97]** L. Babai, A. J. Goodman, W. M. Kantor, E. M. Luks, and P. P. Pálfy. Short presentations for finite groups. *J. Algebra*, 194(1):79–112, 1997. URL: [https://doi.org/10.1006/jabr.1996.6980](https://doi.org/10.1006/jabr.1996.6980), [doi:10.1006/jabr.1996.6980](https://doi.org/10.1006/jabr.1996.6980).

**[BKPalfyS02]** L. Babai, W. M. Kantor, P. P. Pálfy, and Á. Seress. Black-box recognition of finite simple groups of lie type by statistics of element orders. *J. Group Theory*, 5:383–401, 2002.

**[BZ01]** N.S. Babu and K.H. Zimmermann. Decoding of linear codes over galois rings. *IEEE Trans. on Information Theory*, 47(4):1599–1603, 2001.

**[Bai96]** Georg Baier. Zum Round 4 Algorithmus. Master's thesis, Technische Universität Berlin, 1996. \biburl http://www.math.tu-berlin.de/∼kant/publications/diplom/baier.ps.gz.

**[BGJGP05]** M. Baker, E. Gonzalez-Jimenez, J. Gonzalez, and B. Poonen. Finiteness results for modular curves of genus at least 2. *Amer. J. Math.*, 127:1325–1387, 2005.

**[BV16a]** R. Barrolleta and M. Villanueva. Pd-sets for $\z _4$-linear codes: hadamard and kerdock codes. *Proceedings of the IEEE International Symposium on Information Theory*, 2016.

**[BV16b]** R. Barrolleta and M. Villanueva. Partial permutation decoding for binary linear and $\z _4$-linear hadamard codes. Submitted to \em Designs, Codes and Cryptography, arXiv:1512.01839, 2016.

**[Bar08]** F. Bars. The group structure of the normaliser of $\Gamma _0(N)$ after Atkin-Lehner. *Communications in Algebra*, 36:2160–2170, 2008.

**[BHPdV04]** Barth, Hulek, Peters, and Van de Ven. *Compact Complex Surfaces*. Ergebnisse der Mathematik und ihrer Grenzgebiete 4. Springer, second edition, 2004. ISBN 3-540-00832-2.

**[BP99]** Alexander Barvinok and James E. Pommersheim. An algorithmic theory of lattice points in polyhedra. In *New perspectives in algebraic combinatorics (Berkeley, CA, 1996–97)*, volume 38 of Math. Sci. Res. Inst. Publ., pages 91–147. Cambridge Univ. Press, Cambridge, 1999.

**[Bas15]** Romain Basson. *Arithmétique des espaces de modules des courbes hyperelliptiques de genre $3$ en caractéristique positive*. PhD thesis, Université de Rennes 1, Rennes, 2015.

**[Bau14]** Jens–Dietrich Bauch. *Lattices over Polynomial Rings and Applications to Function Fields*. PhD thesis, Universitat Autònoma de Barcelona, 2014.

**[Bau15]** Jens-Dietrich Bauch. Genus computation of global function fields. *Journal of Symbolic Computation*, 66:8–20, 2015. URL: [https://www.sciencedirect.com/science/article/pii/S0747717114000327](https://www.sciencedirect.com/science/article/pii/S0747717114000327), [doi:https://doi.org/10.1016/j.jsc.2014.03.001](https://doi.org/https://doi.org/10.1016/j.jsc.2014.03.001).

**[Bau16a]** Jens-Dietrich Bauch. Computation of integral bases. *Journal of Number Theory*, 165:382–407, 2016. URL: [https://www.sciencedirect.com/science/article/pii/S0022314X16000743](https://www.sciencedirect.com/science/article/pii/S0022314X16000743), [doi:https://doi.org/10.1016/j.jnt.2016.01.011](https://doi.org/https://doi.org/10.1016/j.jnt.2016.01.011).

**[Bau16b]** Jens-Dietrich Bauch. Lattices over polynomial rings and applications to function fields. https://arxiv.org/abs/1601.01361, 2016. [arXiv:1601.01361](https://arxiv.org/abs/1601.01361).

**[BNS13]** Jens-Dietrich Bauch, Enric Nart, and Hayden D. Stainsby. Complexity of om factorizations of polynomials over local fields. *LMS Journal of Computation and Mathematics*, 16:139–171, 2013. [doi:10.1112/S1461157013000089](https://doi.org/10.1112/S1461157013000089).

**[BS92]** David Bayer and Michael Stillman. Computation of hilbert functions. *J. Symbolic Comp.*, 14(1):31–50, 1992.

**[Bea93]** G. Beals. *Algorithms for finite groups*. PhD thesis, University of Chicago, 1993.

**[BLGN+03a]** R. Beals, C. R. Leedham-Green, A. C. Niemeyer, C. E. Praeger, and A. Seress. A black-box algorithm for recognising finite symmetric and alternating groups, II. Preprint, 2003.

**[BLGN+03b]** R. Beals, C. R. Leedham-Green, A. C. Niemeyer, C. E. Praeger, and A. Seress. A black-box algorithm for recognising finite symmetric and alternating groups, I. *Trans. Amer. Math. Soc.*, pages 2097–2113, 2003.

**[Bea77]** A. F. Beardon. The geometry of discrete groups. In *Discrete groups and automorphic functions (Proc. Conf., Cambridge, 1975)*, pages 47–72. Academic Press, London, 1977.

**[Bec07]** Tobias Beck. Formal desingularization of surfaces – the jung method revisited –. Technical Report 2007-31, RICAM, December 2007. \biburl http://www.ricam.oeaw.ac.at/publications/reports/.

**[Bec08]** Tobias Beck. Software documentation. Technical Report 2008-8, RICAM, May 2008. \biburl http://www.ricam.oeaw.ac.at/publications/reports/.

**[BS08]** Tobias Beck and Josef Schicho. Adjoint Computation for Hypersurfaces Using Formal Desingularizations. Technical Report 2008-2, RICAM, January 2008. \biburl http://www.ricam.oeaw.ac.at/publications/reports/.

**[BW93]** Thomas Becker and Volker Weispfenning. *Gröbner Bases*. Graduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 1993.

**[BL94a]** Bernhard Beckermann and George Labahn. A uniform approach for the fast computation of matrix-type Padé approximants. *SIAM J. Matrix Anal. Appl.*, 15(3):804–823, 1994.

**[BL94b]** Bernhard Beckermann and George Labahn. A uniform approach for the fast computation of matrix-type Padé approximants. *SIAM J. Matrix Anal. Appl.*, 15(3):804–823, 1994. URL: [http://dx.doi.org/10.1137/S0895479892230031](http://dx.doi.org/10.1137/S0895479892230031), [doi:10.1137/S0895479892230031](https://doi.org/10.1137/S0895479892230031).

**[Bee93]** L. Beeckmans. The splitting algorithm for egyptian fractions. *J. Number Th.*, 43:173–185, 1993.

**[BF15]** Karim Belabas and Eduardo Friedman. Computing the residue of the Dedekind zeta function. *Math. Comp.*, 84(291):357–369, 2015. URL: [https://doi.org/10.1090/S0025-5718-2014-02843-3](https://doi.org/10.1090/S0025-5718-2014-02843-3), [doi:10.1090/S0025-5718-2014-02843-3](https://doi.org/10.1090/S0025-5718-2014-02843-3).

**[Bel03]** C. N. Beli. Integral spinor norm groups over dyadic local fields. *J. Number Theory*, 102(1):125–182, 2003. URL: [http://dx.doi.org/10.1016/S0022-314X(03)00057-X](http://dx.doi.org/10.1016/S0022-314X(03)00057-X), [doi:10.1016/S0022-314X(03)00057-X](https://doi.org/10.1016/S0022-314X(03)00057-X).

**[BBFernandezCorbodaV15]** J. J. Bernal, J. Borges, C. Fernández-Córboda, and M. Villanueva. Permutation decoding of $\z _2\z _4$-linear codes. *Des. Codes and Cryptogr.*, 76(2):269–277, 2015.

**[BM97]** Laurent Bernardin and Michael B. Monagan. Efficient multivariate factorization over finite fields. In *Proceedings of AAECC*, volume 1255 of LNCS, 15–28. Springer-Verlag, 1997.

**[Ber05]** Daniel J. Bernstein. Factoring into coprimes in essentially linear time. *J. of Algorithms*, 54(1):1–30, 2005.

**[BDE+]** **missing year in poonen2004**

**[BE99a]** Hans Ulrich Besche and Bettina Eick. Construction of finite groups. *J. Symbolic Comput.*, 27(4):387–404, 1999.

**[BE99b]** Hans Ulrich Besche and Bettina Eick. The groups of order at most 1000 except 512 and 768. *J. Symbolic Comput.*, 27(4):405–413, 1999.

**[BE01]** Hans Ulrich Besche and Bettina Eick. The groups of order $q\sp n\cdot p$. *Comm. Algebra*, 29(4):1759–1772, 2001.

**[BEOBrien01]** Hans Ulrich Besche, Bettina Eick, and E. A. O'Brien. The groups of order at most 2000. *Electron. Res. Announc. Amer. Math. Soc.*, 7:1–4 (electronic), 2001.

**[BFHN]** M. Besier, D. Festi, M.C. Harrison, and B. Naskrecki. Arithmetic and geometry of a k3 surface emerging from virtual corrections to drell-yan scattering. preprint arXiv:1908.01079 [math.AG].

**[BFK+98]** A. Betten, H. Fripertinger, A. Kerber, A. Wassermann, and K.-H. Zimmer-mann. *Codierungstheorie – Konstruktion und Anwendung linearer Codes*. Springer-Verlag, Berlin–Heidelberg–New York, 1998. ISBN 3-540-64502-0.

**[Bia]** **missing note in biasse**

**[BF12]** J.-F. Biasse and C. Fieker. Improved techniques for computing the ideal class group and a system of fundamental units in number fields. In *Proceedings of the Tenth Algorithmic Number Theory Symposium, University of California, San Diego*, volume. 2012.

**[BH96]** Yuri Bilu and Guillaume Hanrot. Solving Thue equations of high degree. *J. Number Th.*, 60:373–392, 1996.

**[BKL98]** Joan Birman, Ki Hyoung Ko, and Sang Jin Lee. A new approach to the word and conjugacy problems in the braid groups. *Adv. Math.*, 139(2):322–353, 1998.

**[BKL01]** Joan S. Birman, Ki Hyoung Ko, and Sang Jin Lee. The infimum, supremum, and geodesic length of a braid conjugacy class. *Adv. Math.*, 164(1):41–56, 2001.

**[BlakeGSaNSmart05]** I. Blake, G. Serrousi and N. Smart, editor. *Advances in Elliptic Curve Cryptography*. Volume 317 of LMS LNS. Cambridge University Press, Cambridge, 2005.

**[Bli14]** H. F. Blichfeldt. A new principle in the geometry of numbers, with some applicati ons. *Trans. Amer. Math. Soc.*, 15:227–235, 1914.

**[Boe67]** H. Boerner. *Darstellungen von Gruppen. 2. Aufl.* Berlin-Heidelberg-New York: Springer-Verlag. XIV, 317 S. , 1967.

**[BS73]** A. Borel and J.-P. Serre. Corners and arithmetic groups. *Comment. Math. Helv.*, 48:436–491, 1973. Avec un appendice: Arrondissement des variétés à coins, par A. Douady et L. Hérault.

**[BFernandezP+06]** J. Borges, C. Fernández, J. Pujol, J. Rifà, and M. Villanueva. On $\z _2\z _4$-linear codes and duality. In *V Jornadas de Matemática Discreta y Algorítmica, Soria (Spain), July 11-14*, 171–177. 2006.

**[BFernandezCordobaP+10]** J. Borges, C. Fernández-Córdoba, J. Pujol, J. Rifà, and M. Villanueva. $\z _2\z _4$-linear codes: generator matrices and duality. *Designs, Codes and Cryptography*, 54(2):167–179, 2010.

**[Bos90]** W. Bosma. Canonical bases for cyclotomic fields. *Applicable Algebra in Engineering, Communication and Computing*, 1:125–134, 1990.

**[BC04]** W. Bosma and J. Cannon, editors. *Discovering Mathematics with Magma*. Springer-Verlag, Heidelberg, 2004.

**[BS96]** W. Bosma and P. Stevenhagen. On the computation of quadratic $2$-class groups. *Journal de théorie des nombres de Bordeaux*, 8(2):283–313, 1996.

**[BCP97]** Wieb Bosma, John Cannon, and Catherine Playoust. The magma algebra system i: the user language. *J. Symbolic Comp.*, 24(3):235–265, 1997.

**[BCS97]** Wieb Bosma, John Cannon, and Allan Steel. Lattices of compatibly embedded finite fields. *J. Symbolic Comp.*, 24(3):351–369, 1997.

**[BP91]** Wieb Bosma and Michael E. Pohst. Computations with finitely generated modules over Dedekind domains. In Stephen M. Watt, editor, *Proceedings ISSAC'91*, 151–156. Bonn, 1991.

**[Bou68]** N. Bourbaki. *Éléments de mathématique. Fasc. XXXIV. Groupes et algèbres de Lie. Chapitre IV: Groupes de Coxeter et systèmes de Tits. Chapitre V: Groupes engendrés par des réflexions. Chapitre VI: Systèmes de racines*. Hermann, Paris, 1968.

**[Bou07]** N. Bourbaki. *Éléments de mathématique. Algèbre. Chapitre 9*. Springer-Verlag, Berlin, 2007. ISBN 978-3-540-35338-6; 3-540-35338-0. Reprint of the 1959 original.

**[Bou03]** Nicolas Bourbaki. *Algebra II. Chapters 4–7*. Elements of Mathematics (Berlin). Springer-Verlag, Berlin, 2003. ISBN 3-540-00706-7. Translated from the 1981 French edition by P. M. Cohn and J. Howie, Reprint of the 1990 English edition [Springer, Berlin; MR1080964 (91h:00003)].

**[BM01]** J. Boyer and W. Myrvold. Simplified o($n$) planarity algorithms. submitted, 2001.

**[BP00]** Sergey Bratus and Igor Pak. Fast constructive recognition of a black box group isomorphic to $s_n$ or $a_n$ using goldbach's conjecture. *J. Symbolic Comp.*, 29:33–57, 2000.

**[Bra36]** Richard Brauer. A characterization of null systems in projective space. *Bull. Amer. Math. Soc.*, 42(4):247–254, 1936.

**[Bra00]** J.N. Bray. An improved method of finding the centralizer of an involution. *Arch. Math. (Basel)*, 74(1):241–245, 2000.

**[Bre79]** D. Brelaz. New methods to color the vertices of a graph. *Communications of the ACM*, 22(9):251–256, 1979.

**[BC84]** A. Bremner and J. W. S. Cassels. On the equation $Y^2=X(X^2+p)$. *Math. Comp.*, 42(165):257–264, 1984.

**[Bre80]** R. P. Brent. An improved monte carlo factorization algorithm. *BIT*, 20:176–184, 1980.

**[BtR92]** R. P. Brent and H. J. J te Riele. Factorizations of $a^n \pm 1$, $13 \le a < 100$. Technical Report, Centrum voor Wiskunde en Informatica, Amsterdam, 1992. URL:ftp://nimbus.anu.edu.au/pub/Brent.

**[Bri98]** Brigitte Brink. The set of dominance-minimal roots. *J. Algebra*, 206(2):371–412, 1998.

**[BH93]** Brigitte Brink and Robert B. Howlett. A finiteness property and an automatic structure for Coxeter groups. *Math. Ann.*, 296(1):179–190, 1993.

**[Bri03]** John R. Britnell. *Cycle index methods for matrix groups over finite fields*. DPhil Thesis, University of Oxford, 2003.

**[BK73]** C. Bron and J. Kerbosch. Finding All Cliques of an Undirected Graph. *Communications of the ACM 9*, 16(9):575–577, 1973.

**[BMW97]** Manuel Bronstein, Thom Mulders, and Jacques-Arthur Weil. On symmetric powers of differential operators. In *Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI)*, 156–163 (electronic). New York, 1997. ACM.

**[BMW17]** Peter A. Brooksbank, Joshua Maglione, and James B. Wilson. A fast isomorphism test for groups whose Lie algebra has genus 2. *J. Algebra*, 473:545–590, 2017. URL: [https://doi.org/10.1016/j.jalgebra.2016.12.007](https://doi.org/10.1016/j.jalgebra.2016.12.007), [doi:10.1016/j.jalgebra.2016.12.007](https://doi.org/10.1016/j.jalgebra.2016.12.007).

**[BOBrien08]** Peter A. Brooksbank and E.A. O'Brien. Constructing the group preserving a system of forms. *Internat. J. Algebra Comput.*, 18:227–241, 2008.

**[BW]** Peter A. Brooksbank and James B. Wilson. \sc StarAlge. https://github.com/thetensor-space/StarAlge.

**[BW12a]** Peter A. Brooksbank and James B. Wilson. Computing isometry groups of hermitian maps. *Trans. Amer. Math. Soc.*, 374(4):1975–1996, 2012.

**[BW12b]** Peter A. Brooksbank and James B. Wilson. Computing isometry groups of Hermitian maps. *Trans. Amer. Math. Soc.*, 364(4):1975–1996, 2012. URL: [https://doi.org/10.1090/S0002-9947-2011-05388-2](https://doi.org/10.1090/S0002-9947-2011-05388-2), [doi:10.1090/S0002-9947-2011-05388-2](https://doi.org/10.1090/S0002-9947-2011-05388-2).

**[BW12c]** **missing note in BrooksbankWilson2**

**[BW14]** Peter A. Brooksbank and James B. Wilson. Groups acting on tensor products. *J. Pure Appl. Algebra*, 218(3):405–416, 2014. URL: [https://doi.org/10.1016/j.jpaa.2013.06.011](https://doi.org/10.1016/j.jpaa.2013.06.011), [doi:10.1016/j.jpaa.2013.06.011](https://doi.org/10.1016/j.jpaa.2013.06.011).

**[BW15]** Peter A. Brooksbank and James B. Wilson. The module isomorphism problem reconsidered. *J. Algebra*, 421:541–559, 2015. URL: [https://doi.org/10.1016/j.jalgebra.2014.09.004](https://doi.org/10.1016/j.jalgebra.2014.09.004), [doi:10.1016/j.jalgebra.2014.09.004](https://doi.org/10.1016/j.jalgebra.2014.09.004).

**[Bro]** A. E. Brouwer. Bounds on the minimum distance of linear codes. \biburl http://www.win.tue.nl/˜aeb/voorlincod.html.

**[Bro98]** A. E. Brouwer. Bounds on the size of linear codes. In *Handbook of coding theory, Vol. I, II*, pages 295–461. North-Holland, Amsterdam, 1998.

**[Broue10]** M. Broué. *Introduction to Complex Reflection Groups and their Braid Groups*. Volume 1988 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 2010.

**[Bro03]** 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.).

**[Bru02]** N. R. Bruin. *Chabauty methods and covering techniques applied to generalized Fermat equations*. Volume 133 of CWI Tract. Stichting Mathematisch Centrum Centrum voor Wiskunde en Informatica, Amsterdam, 2002. ISBN 90-6196-508-X. Dissertation, University of Leiden, Leiden, 1999.

**[Bru]** **missing booktitle in bruin-magmabook**

**[Bru03]** Nils Bruin. Chabauty methods using elliptic curves. *J. reine angew. Math.*, 562:27–49, 2003.

**[BD09]** Nils Bruin and Kevin Doerksen. The arithmetic of genus two curves with (4,4)-split jacobians. ArXiv preprint. \biburl http://arxiv.org/abs/0902.3480, 2009.

**[BS09]** Nils Bruin and Michael Stoll. Two-cover descent on hyperelliptic curves. *Math. Comp.*, 78:2347–2370, 2009.

**[BS10]** Nils Bruin and Michael Stoll. The mordell-weil sieve: proving non-existence of rational points on curves. *LMS J. Comput. Math.*, 13:272–306, 2010.

**[Buc65]** Bruno Buchburger. *Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal*. PhD thesis, University of Innsbruck, Austria, 1965.

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

**[BLenstrajr94]** Johannes A. Buchmann and Hendrik W. Lenstra jr. Approximating rings of integers in number fields. *J. Théor. Nombres Bordx.*, 6(2):221–260, 1994.

**[Buc03]** Anita Buckley. *Orbifold Riemann-Roch for 3-folds and applications to Calabi-Yaus*. PhD Thesis, Warwick University, 2003.

**[Bue79]** Francis Buekenhout. Diagrams for geometries and groups. *J. Combin. Theory Ser. A*, 27(2):121–151, 1979.

**[Bue95]** Francis Buekenhout. *Handbook of incidence geometry*. North-Holland, Amsterdam, 1995.

**[BCon]** **missing publisher in buekcohen**

**[BST97]** J. Buhler, C. Schoen, and J. Top. Cycles, $l$-functions and triple products of elliptic curves. *J. Reine. Angew. Math.*, 492:93–133, 1997.

**[BuseJ14]** Laurent Busé and Jean-Pierre Jouanolou. On the discriminant scheme of homogeneous polynomials. *Math. Comput. Sci.*, 8(2):175–234, 2014.

**[BH06]** Colin J. Bushnell and Guy Henniart. *The local Langlands conjecture for $\rm GL(2)$*. Volume 335 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 2006.

**[BC82]** G. Butler and J.J. Cannon. Computing with permutation and matrix groups I: Normal closure, commutator subgroups, series. *Math. Comp.*, 39:671–680, 1982.

**[BC89]** G. Butler and J.J. Cannon. Computing with permutation and matrix groups III: Sylow subgroups. *J. Symb. Comp.*, 8:241–252, 1989.

**[BC91]** G. Butler and J.J. Cannon. Computing Sylow subgroups of permutation groups using homomorphic images of centralizers. *J. Symb. Comp.*, 12(4/5):443–458, 1991.

**[BC93]** G. Butler and J.J. Cannon. On holt's algorithm. *J. Symb. Comp.*, 15:229–233, 1993.

**[But94]** Greg Butler. An inductive schema for computing conjugacy classes in permutation groups. *Mathematics of Computation*, 62(205):363–383, 1994.

**[But76]** Gregory Butler. The Schreier algorithm for matrix groups. In *Proceedings of SYMSAC '76*, 167–170. 1976.

**[But85]** Gregory Butler. Effective computation with group homomorphisms. *J. Symbolic Comp.*, 1:143–157, 1985.

**[But91]** Gregory Butler. *Fundamental Algorithms for Permutation Groups*. Volume 559 of LNCS. Springer-Verlag, 1991.

**[BS02]** Kevin Buzzard and William A. Stein. A mod five approach to modularity of icosahedral Galois representations. *Pacific J. Math.*, 203(2):265–282, 2002.

**[Byg99]** Jeremy Bygott. *Modular forms and modular symbols over imaginary quadratic fields*. PhD thesis, University of Exeter, 1999.

**[Baccent127aaccent127arnhielm05]** H. B\accent 127a\accent 127arnhielm. Tensor decomposition of the Suzuki groups. submitted, 2005.

**[Baccent127aaccent127arnhielm06a]** H. B\accent 127a\accent 127arnhielm. Recognising the Suzuki groups in their natural rep­re­sen­ta­tions. *J. Algebra*, 300(1):171–198, 2006.

**[Baccent127aaccent127arnhielm14]** H. B\accent 127a\accent 127arnhielm. Recognising the Ree groups in their natural rep­re­sen­ta­tions. *J. Algebra*, 416:139–166, 2014.

**[Baccent127aaccent127arnhielmHLGOBrien15]** H. B\accent 127a\accent 127arnhielm, Derek Holt, C.R. Leedham-Green, and E.A. O'Brien. A practical model for computation with matrix groups. *J. Symbolic Comput.*, 68(68):27–60, 2015.

**[Baccent127aaccent127arnhielm06b]** Henrik B\accent 127a\accent 127arnhielm. Constructive recognition of the Ree groups. preprint, 2006.

**[CS96]** A. R. Calderbank and P. W. Shor. Good quantum error-correcting codes exist. *Phys. Rev. A*, 54:2551–2577, 1996.

**[CRSS98]** A. Robert Calderbank, Eric M. Rains, P. W. Shor, and Neil J. A. Sloane. Quantum error correction via codes over $\rm GF(4)$. *IEEE Trans. Inform. Theory*, 44(4):1369–1387, 1998.

**[CC91]** P.J. Cameron and J.J. Cannon. Recognizing doubly transitive groups. *J. Symb. Comp.*, 12(4/5):459–474, 1991.

**[Cam81]** Peter J. Cameron. Finite permutation groups and finite simple groups. *Bull. London Math. Soc.*, 13(1):1–22, 1981.

**[CB92]** J.J. Cannon and W. Bosma. Structural computation in finite permutation groups. *CWI Quarterly*, 5(2):127–160, 1992.

**[CCH97]** J.J. Cannon, B. Cox, and D.F. Holt. Computing Sylow subgroups in permutation groups. *J. Symb. Comp.*, 24(3/4):303–316, 1997.

**[CCH01a]** J.J. Cannon, B. Cox, and D.F. Holt. Computing the subgroup lattice of a permutation group. *J. Symbolic Comp.*, 31:149–161, 2001.

**[CCH01b]** J.J. Cannon, B. Cox, and D.F. Holt. Computing the subgroups of a permutation group. *J. Symb. Comp.*, 31:149–161, 2001.

**[CH92]** J.J. Cannon and G. Havas. Algorithms for groups. *Australian Computer J.*, 24(2):51–60, May, 1992.

**[CH97]** J.J. Cannon and D.F. Holt. Computing chief series, composition series and socles in large permutation groups. *J. Symb. Comp.*, 24(3/4):285–301, 1997.

**[CH03]** J.J. Cannon and D.F. Holt. Automorphism group computation and isomorphism testing in finite groups. *J. Symbolic Comp.*, 35(3):241–267, 2003.

**[CH04]** J.J. Cannon and D.F. Holt. Computing maximal subgroups of finite groups. *J. Symbolic Comp.*, 37(5):589–609, 2004.

**[CH08]** J.J. Cannon and D.F. Holt. The transitive permutation groups of degree 32. *Experiment. Math.*, 17:307–314, 2008.

**[CHSS03]** **missing note in CHSS-lix**

**[CS]** J.J. Cannon and B. Souvignier. On the computation of normal subgroups in permutation groups. to appear, International Journal of Algebra and Computation.

**[CS97]** J.J. Cannon and B. Souvignier. On the computation of conjugacy classes in permutation groups. In *Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation*, 392–399. Association for Computing Machinery, 1997. Maui, July 21–23, 1997.

**[CDHW73]** John J. Cannon, Lucien A. Dimino, George Havas, and Jane M. Watson. Implementation and analysis of the Todd-Coxeter algorithm. *Math. Comp.*, 27:463–490, 1973.

**[Car83]** Henri Carayol. Sur les représentations ℓ-adiques attach«ees aux formes modulaires de Hilbert. *C. R. Acad. Sci. Paris.*, 296(15):629–632, 1983.

**[Car03a]** G. Cardona. On the number of curves of genus 2 over a finite field. *Finite Fields and Their Applications*, 9(4):505–526, 2003.

**[CN07]** G. Cardona and E. Nart. Zeta function and cryptographic exponent of supersingular curves of genus 2. In *Pairing-based cryptography—Pairing 2007*, volume 4575 of Lecture Notes in Comput. Sci., pages 132–151. Springer, Berlin, 2007.

**[CNP05]** G. Cardona, E. Nart, and J. Pujolas. Curves of genus two over fields of even characteristic. *Mathematische Zeitschrift*, 250:177–201, 2005.

**[CNPujolas05]** G. Cardona, E. Nart, and J. Pujolàs. Curves of genus two over fields of even characteristic. *Math. Zeitschrift*, 250:177–201, 2005.

**[CQ05a]** G. Cardona and J. Quer. Field of moduli and field of definition for curves of genus $2$. In *Computational aspects of algebraic curves*, volume 13 of Lecture Notes Ser. Comput., 71–83. Hackensack, NJ,, 2005. World Sci. Publ.

**[Car03b]** Gabriel Cardona. On the number of curves of genus 2 over a finite field. *Finite Fields Appl.*, 9(4):505–526, 2003.

**[CQ05b]** Gabriel Cardona and Jordi Quer. Field of moduli and field of definition for curves of genus 2. *Lecture Notes Ser. Comput.*, 13:71–83, 2005.

**[Car52]** Elie Cartan. *Œuvres complètes. Partie I. Groupes de Lie*. Gauthier-Villars, Paris, 1952.

**[Car72a]** R. Carter. *Simple Groups of Lie Type*. John Wiley & Sons, London, New York, Sydney, Toronto, 1972.

**[CF64]** R. Carter and P. Fong. The sylow 2-subgroups of the finite classical groups. *Journal of Algebra*, 1:139–151, 1964.

**[Car72b]** Roger W. Carter. *Simple groups of Lie type*. John Wiley & Sons, London-New York-Sydney, 1972. Pure and Applied Mathematics, Vol. 28.

**[Car93]** Roger W. Carter. *Finite groups of Lie type*. John Wiley & Sons, Chichester, 1993. ISBN 0-471-94109-3. Conjugacy classes and complex characters, Reprint of the 1985 original, A Wiley-Interscience Publication.

**[Cas73]** W. Casselman. The restriction of a representation of $\rm GL_2(k)$ to $\rm GL_2(\tenfrak O)$. *Mathematischen Annalen*, 1973.

**[Cas66]** J. W. S. Cassels. Diophantine equations with special reference to elliptic curves. *J. London Math. Soc.*, 41:150–158, 1966.

**[Cas78]** J. W. S. Cassels. *Rational Quadratic Forms*. Academic Press, London–New York–San Francisco, 1978.

**[Cas91]** J. W. S. Cassels. *Lectures on elliptic curves*. Volume 24 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 1991. ISBN 0-521-41517-9; 0-521-42530-1.

**[Cas98]** J. W. S. Cassels. Second descents for elliptic curves. *J. reine angew. Math.*, pages 101–127, 1998.

**[CF96]** J.W.S. Cassels and E.V. Flynn. *Prolegomena to a Middlebrow Arithmetic of Curves of Genus \protect $2$*. Cambridge University Press, Cambridge, 1996.

**[CT17]** Wouter Castryck and Jan Tuitman. Point counting on curves using a gonality preserving lift. *The Quarterly Journal of Mathematics*, 2017.

**[CL12]** X. Caurso and D. Lubicz. Linear algebra over $Z_p[[u]]$ and related rings. *LMS Journal of Computation and Mathematics*, 2012.

**[COBrienS08]** A. Cavicchioli, E. O'Brien, and F. Spaggiari. On some questions about a family of cyclically presented groups. *J. Algebra*, 320(11):4063–4072, 2008.

**[CNeubuserW90]** F. Celler, J. Neubüser, and C.R.B. Wright. Some remarks on the computation of complements and normalizers in soluble groups. *Acta Appl. Math.*, 21:57–76, 1990.

**[CLG97a]** Frank Celler and C.R. Leedham-Green. A non-constructive recognition algorithm for the special linear and other classical groups. In *Groups and computation II (New Brunswick, NJ, 1995)*, volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 61–67. Amer. Math. Soc., 1997.

**[CLG97b]** Frank Celler and Charles R. Leedham-Green. Calculating the order of an invertible matrix. In Larry Finkelstein and William M. Kantor, editors, *Groups and Computation II*, volume 28 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 55–60. AMS, 1997.

**[CLGM+95]** Frank Celler, Charles R. Leedham-Green, Scott H. Murray, Alice C. Niemeyer, and E. A. O'Brien. Generating random elements of a finite group. *Comm. Algebra*, 23(13):4931–4948, 1995.

**[Cha85]** K. Chandrasekharan. *Elliptic Functions*. Volume 281 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin, 1985.

**[CGG89]** Bruce W. Char, Keith O. Geddes, and Gaston H. Gonnet. Gcdheu: heuristic polynomial gcd algorithm based on integer gcd computation. *J. Symbolic Comp.*, 7(1):31–48, 1989.

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

**[CGM+98]** 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.

**[Che97]** Claude Chevalley. *The algebraic theory of spinors and Clifford algebras*. Springer-Verlag, Berlin, 1997. Collected works. Vol. 2, Edited and with a foreword by Pierre Cartier and Catherine Chevalley, With a postface by J.-P. Bourguignon.

**[Cho15]** S. Cho. Group schemes and local densities of quadratic lattices in residue characteristic 2. *Compos. Math.*, 151(5):793–827, 2015. URL: [http://dx.doi.org/10.1112/S0010437X14007829](http://dx.doi.org/10.1112/S0010437X14007829), [doi:10.1112/S0010437X14007829](https://doi.org/10.1112/S0010437X14007829).

**[CC82]** T.W.J. Chou and G.E. Collins. Algorithms for the solution of systems of linear diophantine equations. *SIAM J. Computing*, 11(4):687–708, 1982.

**[Chr75]** N. Christofides. *Graph Theory, An Algorithm Approach*. Academic Press, 1975.

**[Chv83]** V. Chvatal. *Linear Programming*. W.H. Freeman and Company, 1983.

**[Coh76]** Arjeh M. Cohen. Finite complex reflection groups. *Ann. Sci. École Norm. Sup. (4)*, 9(3):379–436, 1976.

**[CHM08]** Arjeh M. Cohen, Sergei Haller, and Scott H. Murray. Computing in unipotent and reductive algebraic groups. *LMS J. Comput. Math.*, 11:343–366, 2008.

**[CIW97]** Arjeh M. Cohen, Gábor Ivanyos, and David B. Wales. Finding the radical of an algebra of linear transformations. *J. Pure Appl. Algebra*, 117/118:177–193, 1997. Algorithms for algebra (Eindhoven, 1996).

**[CM09]** Arjeh M. Cohen and Scott H. Murray. An algorithm for Lang's theorem. *Journal of Algebra*, 322:675–702, 2009.

**[CMT04]** Arjeh M. Cohen, Scott H. Murray, and D. E. Taylor. Computing in groups of Lie type. *Math. Comp.*, 73(247):1477–1498, 2004.

**[CR09]** Arjeh M. Cohen and Dan Roozemond. Computing Chevalley bases in small characteristics. *J. Algebra*, 322(3):703–721, August 2009.

**[CSUW01]** Arjeh M. Cohen, Anja Steinbach, Rosane Ushirobira, and David Wales. Lie algebras generated by extremal elements. *J. Algebra*, 236(1):122–154, 2001.

**[CT]** Arjeh M. Cohen and D. E. Taylor. Row reduction for twisted groups of Lie type. preprint.

**[CT19]** Arjeh M. Cohen and D.E. Taylor. Row reduction for twisted groups of lie type. *Preprint*, :, 2019.

**[C+05]** H. Cohen and others. *Handbook of Elliptic and Hyperelliptic Curve Cryptography*. Discrete Mathematics and Its Applications. CRC Pr Llc, 2005.

**[CDiazyDiazO93]** H. Cohen, F. Diaz y Diaz, and M. Olivier. Calculs de nombres de classes et de régulateurs de corps quadratiques en temps sous-exponentiel. In *Séeminaire de Théorie des Nombres, Paris, 1990–91*, volume 108 of Progr. Math., pages 35–46. Birkhäuser Boston, Boston, MA, 1993.

**[Coh93]** Henri Cohen. *A Course in Computational Algebraic Number Theory*. Volume 138 of Graduate Texts in Mathematics. Springer, Berlin–Heidelberg–New York, 1993.

**[Coh96b]** Henri Cohen. Hermite and Smith normal form algorithms over Dedekind domains. *Math. Comp.*, 65:1681–1699, 1996.

**[Coh00]** Henri Cohen. *Advanced Topics in Computational Number Theory*. Springer, Berlin–Heidelberg–New York, 2000.

**[COesterle77]** Henri Cohen and J. Oesterlé. *Dimensions des espaces de formes modulaires*, pages 69–78. Volume 627 of Lecture Notes in Math. Springer, Berlin, 1977.

**[CDiazyDiazO]** **missing booktitle in CDOants**

**[CDiazyDiazO98]** Henri Cohen, Francisco Diaz y Diaz, and Michel Olivier. Computing ray class groups, conductors and discriminants. *Math. Comp.*, 67(222):773–795, 1998.

**[CKM97]** Stephane Collart, Michael Kalkbrener, and Daniel Mall. Converting bases with the gröbner walk. *J. Symbolic Comp.*, 24(3):465–469, 1997.

**[CM93]** David H. Collingwood and William M. McGovern. *Nilpotent orbits in semisimple Lie algebras*. Van Nostrand Reinhold Mathematics Series. Van Nostrand Reinhold Co., New York, 1993.

**[CHN11]** M. Conder, G. Havas, and M. Newman. On one-relator quotients of the modular group. In *Proc. Groups St Andrews 2009 in Bath*, number 387 in London Mathematical Society Lecture Note Series, 183–197. Cambridge University Press, 2011.

**[CLGOBrien06]** M.D.E. Conder, C.R. Leedham-Green, and E.A. O'Brien. Constructive recognition for $psl(2, q)$. *Trans. Amer. Math. Soc.*, 358():1203–1221, 2006.

**[Con90a]** S. B. Conlon. Calculating characters of $p$-groups. *J. Symbolic Comp.*, 9:535–550, 1990.

**[Con90b]** S. B. Conlon. Computing modular and projective character degrees of soluble groups. *J. Symbolic Comp.*, 9:551–570, 1990.

**[Con99]** I. Connell. *Elliptic Curve Handbook*. McGill University, 1999.

**[CS01a]** Brian Conrad and William A. Stein. Component groups of purely toric quotients. *Math. Res. Lett.*, 8(5-6):745–766, 2001.

**[CS01b]** C. Consani and J. Scholten. Arithmetic on a quintic threefold. *Internat. J. Math*, 12/8:943–972, 2001.

**[CHulpkeM98]** John H. Conway, Alexander Hulpke, and John McKay. On transitive permutation groups. *LMS Journal of Computation and Mathematics*, 1:1–8, 1998.

**[CFL89]** G. Cooperman, L. Finkelstein, and E.M. Luks. Reduction of group constructions to point stabilizers. In *Proc. of International Symposium on Symbolic and Algebraic Computation ISSAC '89*, 351–356. ACM, 1989.

**[Cop84]** D. Coppersmith. Fast evaluation of logarithms in fields of characteristic two. *IEEE Trans. Inform. Theory*, IT–30(4):587–594, July 1984.

**[COS86]** D. Coppersmith, A. M. Odlyzko, and R. Schroeppel. Discrete logarithms in gf($p$). *Algorithmica*, 1:1–15, 1986.

**[Cop96]** Don Coppersmith. Finding a small root of a univariate modular equation. In *Advances in Cryptology—EuroCrypt 1996*, volume 1070 of LNCS, pages 155–165. Springer, 1996.

**[Cor13]** Brian Corr. *Estimation and Computation with Matrices Over Finite Fields*. PhD thesis, University of Western Australia, 2013.

**[CPR00]** Alessio Corti, Aleksandr Pukhlikov, and Miles Reid. Fano $3$-fold hypersurfaces. In A. Corti and M. Reid, editors, *Explicit birational geometry of $3$-folds*, pages 175 – 258. CUP, Cambridge, 2000.

**[CR00]** Alessio Corti and Miles Reid. *Explicit birational geometry of $3$-folds*. London Math Society Lecture Note Series 281. CUP, Cambridge, 2000.

**[CH00]** John Cossey and Trevor Hawkes. On the largest conjugacy class size in a finite group. *Rend. Sem. Mat. Univ. Padova*, 103:171–179, 2000.

**[CH87]** P. J. Costello and J. S. Hsia. Even unimodular 12-dimensional quadratic forms over $\bf Q(\sqrt 5)$. *Adv. Math.*, 64:241–278, 1987.

**[Cos09]** E. Costi. *Constructive membership testing in classical groups*. PhD thesis, Queen Mary, University of London, 2009.

**[Cou11]** Hannah J. Coutts. *Topics in computational group theory: primitive permutation groups and matrix group normalisers*. PhD thesis, University of St Andrews, 2011.

**[CQRD11]** Hannah J. Coutts, Martyn Quick, and Colva M. Roney-Dougal. The primitive permutation groups of degree less than 4096. *Communications in Algebra*, 39:10:3526–3546, 2011.

**[CLOShea96]** David Cox, John Little, and Donal O'Shea. *Ideals, Varieties and Algorithms*. Undergraduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 2nd edition, 1996.

**[CLOShea98]** David Cox, John Little, and Donal O'Shea. *Using Algebraic Geometry*. Graduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 1998.

**[Cox95]** David A. Cox. The homogeneous coordinate ring of a toric variety. *J. Algebraic Geom.*, 4(1):17–50, 1995.

**[Cox34]** H. S. M. Coxeter. Discrete groups generated by reflections. *Ann. of Math.*, 35:588–621, 1934.

**[Cre84]** J. E. Cremona. Hyperbolic tessellations, modular symbols, and elliptic curves over complex quadratic fields. *Compositio Math.*, 51(3):275–324, 1984.

**[Cre92]** J. E. Cremona. Modular symbols for $\Gamma _1(N)$ and elliptic curves with everywhere good reduction. *Math. Proc. Cambridge Philos. Soc.*, 111(2):199–218, 1992.

**[Cre97]** J. E. Cremona. *Algorithms for modular elliptic curves*. Cambridge University Press, Cambridge, second edition, 1997. ISBN 0-521-59820-6.

**[CFONeil+08]** 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:121–155, 2008.

**[CM00a]** J. E. Cremona and Barry Mazur. Visualizing elements in the Shafarevich-Tate group. *Experiment. Math.*, 9(1):13–28, 2000.

**[CR03]** J. E. Cremona and D. Rusin. Efficient solution of rational conics. *Mathematics of Computation*, 72(243):1417–1441, 2003.

**[CR06]** J. E. Cremona and D. Rusin. Solving conics over function fields. *Journal de Theorie des Nombres de Bordeaux*, 18:595–606, 2006.

**[CFONeil+]** J.E. Cremona, T.A Fisher, C. O'Neil, D. Simon, and M Stoll. Explicit $n$-descent on elliptic curves, iii. algorithms. ArXiv preprint. \biburl http://arxiv.org/abs/1107.3516.

**[CFONeil+09]** 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.*, 632:63–84, 2009.

**[CFS10]** J.E. Cremona, T.A Fisher, and M Stoll. Minimisation and reduction of 2-, 3- and 4-coverings of elliptic curves. *Algebra & Number Theory*, 4(6):763–820, 2010.

**[Cre99]** John Cremona. Reduction of binary cubic and quartic forms. *LMS JCM*, 2:62–92, 1999.

**[Cre01]** John Cremona. Classical invariants and 2-descent on elliptic curves. *J. Symbolic Comp.*, 31:71–87, 2001.

**[CM00b]** John E. Cremona and Barry Mazur. Visualizing elements in the Shafarevich-Tate group. *Experiment. Math.*, 9(1):13–28, 2000.

**[CM12]** B. Creutz and R.L. Miller. Second isogeny descents and the Birch and Swinnerton-Dyer conjectural formula. *J.Algebra*, 372:673–701, 2012.

**[Cre10]** Brendan Creutz. *Explicit second $p$-descents on elliptic curves*. PhD Thesis, Jacobs University Bremen, 2010.

**[Cre12]** Brendan Creutz. Explicit descent in the Picard group of a cyclic cover of the projective line. In Everett Howe and Kiran Kedlaya, editors, *ANTS X: Proceedings of the Tenth Algorithmic Number Theory Symposium*, volume 1 of OBS. Mathematics Sciences Publishers, 2012.

**[Dab95]** Mario Daberkow. *Über die Bestimmung der ganzen Elemente in Ra-dikalerweiterungen algebraischer Zahlkörper*. Dissertation, Technische Universität Berlin, 1995. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/diss_MD.ps.gz.

**[Dab01]** Mario Daberkow. On computations in Kummer extensions. *J. Symbolic Comp.*, 31:113–131, 2001. Computational algebra and number theory (Milwaukee, WI, 1996).

**[Dan05]** D. E. Danielsen. On-self dual quantum codes, graphs, and boolean functions. Master's thesis, University of Bergen, 2005.

**[Dan78]** V. I. Danilov. The geometry of toric varieties. *Uspekhi Mat. Nauk*, 33(2(200)):85–134, 247, 1978.

**[DKulshammer09]** Susanne Danz and Burkhard Külshammer. Vertices, sources and Green correspondents of the simple modules for the large Mathieu groups. *J. Algebra*, 322(11):3919–3949, 2009.

**[DKulshammerZ08]** Susanne Danz, Burkhard Külshammer, and René Zimmermann. On vertices of simple modules for symmetric groups of small degrees. *J. Algebra*, 320(2):680–707, 2008.

**[dG01]** W. A. de Graaf. Constructing representations of split semisimple Lie algebras. *J. Pure Appl. Algebra*, 164(1-2):87–107, 2001. Effective methods in algebraic geometry (Bath, 2000).

**[dG05]** W. A. de Graaf. Classification of solvable Lie algebras. *Experimental Mathematics*, 14(1):15–25, 2005.

**[dG07]** W. A. de Graaf. Classification of 6-dimensional nilpotent lie algebras over fields of characteristic not 2. *Journal of Algebra*, 309(2):640–653, 2007.

**[dG00]** W.A. de Graaf. *Lie Algebras: Theory and Algorithms*. Number 56 in North-Holland Mathematical Library. Elsevier, 2000.

**[dGP]** W.A. de Graaf and J. Pilnikova. Parametrizing del pezzo surfaces of degree 8 using lie algebras. \biburl http://arxiv.org/abs/math.NT/0512477.

**[dGF07]** Willem de Graaf and Claus Fieker. Finding integral linear dependencies of algebraic numbers and algebraic lie algebras. *LMS Journal of Computation and Mathematics*, 11:, 2007.

**[dG11]** Willem A. de Graaf. Constructing semisimple subalgebras of semisimple Lie algebras. *J. Algebra*, 325:416–430, 2011.

**[dGraafMHarrisonJPaJSchicho06]** W. de Graaf, M. Harrison, J. Pilnikova and J. Schicho. A lie algebra method for rational parametrization of severi-brauer surfaces. *J. Alg.*, 303(2):514–529, 2006.

**[DLHTY04]** Jesús A. De Loera, Raymond Hemmecke, Jeremiah Tauzer, and Ruriko Yoshida. Effective lattice point counting in rational convex polytopes. *J. Symbolic Comput.*, 38(4):1273–1302, 2004. URL: [http://dx.doi.org/10.1016/j.jsc.2003.04.003](http://dx.doi.org/10.1016/j.jsc.2003.04.003), [doi:10.1016/j.jsc.2003.04.003](https://doi.org/10.1016/j.jsc.2003.04.003).

**[dW87]** Benne M.M. de Weger. Solving exponential diophantine equations using lattice basis reduction algorithms. *J. Number Th.*, 26:325–367, 1987.

**[DES93]** Decker, Ein, and Schreyer. Construction of surfaces in p4. *J. Algebraic Geometry*, 2:185–237, 1993.

**[DE02]** Wolfram Decker and David Eisenbud. Sheaf algorithms using the exterior algebra. In Eisenbud and others, editors, *Computations in Algebraic Geometry with Macaulay2*, volume 8 of Springer Algorithms and Computation in Mathematics Series, 215–247. Springer-Verlag, 2002.

**[DL06]** Wolfram Decker and Christoph Lossen. *Computing in Algebraic Geometry*. Volume 16 of Algorithms and Computation in Mathematics. Springer, New York–Berlin–Heidelberg, 2006.

**[Deh02]** Patrick Dehornoy. Groupes de Garside. *Ann. Sci. École Norm. Sup. (4)*, 35(2):267–306, 2002.

**[Del79]** P. Deligne. Valeurs de fonctions $l$ et périodes d'intégrales. *Proc. Symposia Pure Math.*, 33/2:313–346, 1979.

**[DR73]** P. Deligne and M. Rapoport. Les schémas de modules de courbes elliptiques. In *Lecture Notes in Mathematics*, volume 349, pages 143–316. Springer-Verlag, 1973.

**[Del73]** P. Delsarte. An algebraic approach to the association schemes of coding theory. Technical Report, Philips Research Rep. Suppl., 1973.

**[Dem65]** M. Demazure. Groupes réductifs de rang semi-simple $1$, données radicielles. In *Schémas en Groupes (Sém. Géométrie Algébrique, Inst. Hautes études Sci., 1964), Fasc. 6, Exposé 20*, pages 85. Inst. Hautes Études Sci., Paris, 1965.

**[Dem70]** M. Demazure. Données radicielles. In *Schémas en Groupes III, Exposeé XXI*, volume 153 of Lecture Notes in Mathematics, pages 85–155. Springer-Verlag, Berlin, 1970.

**[DD08]** L. Dembele and S. Donnelly. Computing hilbert modular forms over fields with nontrivial class group. In S. Pauli F. Hess and M.Pohst, editors, *ANTS VIII*, volume 5011 of LNCS. Springer-Verlag, 2008.

**[Dem68]** Peter Dembowski. *Finite geometries*. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 44. Springer-Verlag, Berlin, 1968.

**[Dem71]** Peter Dembowski. Generalized Hughes planes. *Canad. J. Math.*, 23:481–494, 1971.

**[Dembele07]** L. Dembélé. Quaternionic Manin symbols, Brandt matrices, and Hilbert modular forms. *Math. Comp.*, 76(258):1039–1057 (electronic), 2007.

**[DembeleV12]** L. Dembélé and J. Voight. Explicit methods for hilbert modular forms. *to appear, Elliptic curves, Hilbert modular forms and Galois deformations*, 2012.

**[DG88]** M. Denert and J. Van Geel. The Class Number of Hereditary Orders in Non-Eichler Algebras over Global Fields. *Math. Ann.*, 282:379–393, 1988.

**[Deo77]** V.V. Deodhar. Some characteristics of Bruhat ordering on a Coxeter group and determination of the relative möbius function. *Inventiones Math.*, 39:179–198, 1977.

**[Der94]** Harm Derksen. An algorithm to compute generalized Padé-Hermite Forms. Technical Report 9403, Department of Mathemtaics, Catholic University Nijmegen, jan 1994.

**[Der99]** Harm Derksen. Computation of invariants for reductive groups. *Adv. Math.*, 141:366–384, 1999.

**[DEF11]** A. S. Detinko, B. Eick, and D. L. Flannery. Computing with matrix groups over infinite fields. In *LMS Lecture Note Series*, volume 387, 256–270. 2011.

**[DF06]** A. S. Detinko and D. L. Flannery. Computing in nilpotent matrix groups. *LMS J. Comput. Math.*, 9:104–134 (electronic), 2006.

**[DF08]** A. S. Detinko and D. L. Flannery. Algorithms for computing with nilpotent matrix groups over infinite domains. *J. Symbolic Comput.*, 43:8–26, 2008.

**[DF09]** A. S. Detinko and D. L. Flannery. On deciding finiteness of matrix groups. *J. Symbolic Comput.*, 44:1037–1043, 2009.

**[DFOBrien09]** A. S. Detinko, D. L. Flannery, and E. A. O'Brien. Deciding finiteness of matrix groups in positive characteristic. *J. Algebra*, 322:4151–4160, 2009.

**[DFOBrien11]** A. S. Detinko, D. L. Flannery, and E. A. O'Brien. Algorithms for the tits alternative and related problems. *J. Algebra*, 344:397–406, 2011.

**[DFOBrien13a]** A. S. Detinko, D. L. Flannery, and E. A. O'Brien. Algorithms for linear groups of finite rank. *J. Algebra*, 393:187–196, 2013.

**[DFOBrien13b]** A. S. Detinko, D. L. Flannery, and E. A. O'Brien. Recognizing finite matrix groups over infinite fields. *J. Symbolic Comput.*, 50:100–109, 2013.

**[DI95]** Fred Diamond and Ju Im. Modular forms and modular curves. In *Seminar on Fermat's Last Theorem*, pages 39–133. Amer. Math. Soc., Providence, RI, 1995.

**[Dic05a]** Leonard Eugene Dickson. Definitions of a group and a field by independent postulates. *Trans. Amer. Math. Soc.*, 6(2):198–204, 1905.

**[Dic05b]** Leonard Eugene Dickson. On finite algebras. *Nachr. Kgl. Ges. Wiss. Göttingen, Math.-phy. Klasse*, pages 358–393, 1905.

**[Die]** **missing booktitle in diem06**

**[Die00]** Reinhard Diestel. *Graph Theory, Second Edition*. Springer, 2000.

**[DE05]** Heiko Dietrich and Bettina Eick. On the groups of cubefree order. *J. Algebra*, 292:122–137, 2005.

**[DEP22]** Heiko Dietrich, Bettina Eick, and Xueyu Pan. Groups whose orders factorise into at most four primes. *J. Symbolic Comput.*, 108:23–40, 2022. URL: [https://doi.org/10.1016/j.jsc.2021.04.005](https://doi.org/10.1016/j.jsc.2021.04.005), [doi:10.1016/j.jsc.2021.04.005](https://doi.org/10.1016/j.jsc.2021.04.005).

**[DLGOBrien15]** Heiko Dietrich, C.R. Leedham-Green, and E.A. O'Brien. Effective black-box constructive recognition of classical groups. *J. Algebra*, 460–492:421, 2015.

**[DLubeckLGOBrien13]** Heiko Dietrich, Frank Lübeck, C.R. Leedham-Green, and E.A. O'Brien. Constructive recognition of classical groups in even characteristic. *J. Algebra*, 227–255:391, 2013.

**[DPSchutt12]** L. Dieulefait, A. Pacetti, and M. Schütt. Modularity of the consani-scholten quintic. *Documenta Mathematica*, 17:953–987, 2012.

**[Dix87]** J. Dixmier. On the projective invariants of quartic plane curves. *Adv. in Math.*, 64:279–304, 1987.

**[Dix67]** J. D. Dixon. High–speed computation of group characters. *Numerische Mathematik*, 10:446–450, 1967.

**[DD13]** T. Dokchitser and V. Dokchitser. Identifying Frobenius elements in Galois groups. *Algebra Number Theory*, 7(6):1325–1352, 2013.

**[DD15]** T. Dokchitser and V. Dokchitser. Euler factors determine local weil representations. *J. reine angew. Math.*, 2015. [doi:http://dx.doi.org/10.1515/crelle-2014-0013](https://doi.org/http://dx.doi.org/10.1515/crelle-2014-0013).

**[Dok02]** Tim Dokchitser. Computel, pari package to compute motivic $L$-functions. \biburl http://www.maths.bris.ac.uk/∼matyd/computel/, 2002.

**[Dok04]** Tim Dokchitser. Computing special values of motivic $L$-functions. *Experimental Mathematics*, 13(2):137–149, 2004.

**[DDD85]** J. Della Dora, C. Dicrescenzo, and D. Duval. About a new method for computing in algebraic number fields. In B.F. Caviness, editor, *Proc. EUROCAL '85*, volume 204 of LNCS, 289–290. Linz, 1985. Springer.

**[Dor21]** Christopher Doris. Exact $p$-adic computation in magma. *Journal of Symbolic Computation*, 104:476493, May 2021. URL: [http://dx.doi.org/10.1016/j.jsc.2020.08.005](http://dx.doi.org/10.1016/j.jsc.2020.08.005), [doi:10.1016/j.jsc.2020.08.005](https://doi.org/10.1016/j.jsc.2020.08.005).

**[DEJKReid84]** I.S. Duff, A.M. Erisman, and J.K.Reid. *Direct methods for sparse matrices*. Monographs on Numerical Analysis. Oxford University Press, 1984.

**[DMW09]** N. Dummigan, P. Martin, and M. Watkins. Euler factors and local root numbers for symmetric powers of elliptic curves. *Pure and Appl. Math. Qu.*, 5(4):1311–1341, 2009.

**[DPRTornaria24]** N. Dummigan, A. Pacetti, G. Rama, and G. Tornaría. Quinary forms and paramodular forms. *Math. Comp.*, 93(348):1805–1858, 2024. URL: [https://doi.org/10.1090/mcom/3815](https://doi.org/10.1090/mcom/3815), [doi:10.1090/mcom/3815](https://doi.org/10.1090/mcom/3815).

**[DT03]** Nathan M. Dunfield and William P. Thurston. The virtual Haken conjecture; experiments and examples. *Geometry & Topology*, 7:399–441, 2003.

**[Duv89]** Dominique Duval. Rational puiseux expansions. *Compositio Mathematica*, 70:119 – 154, 1989.

**[Dyn57]** E. B. Dynkin. Maximal Subgroups of the Classical Groups. *Amer. Math. Soc. Transl. Ser. 2*, 6:245–378, 1957.

**[EG96]** W. Eberly and M. Giesbrecht. Efficient decomposition of associative algebras. In Y. N. Lakshman, editor, *Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation: ISSAC'96*, 170–178. New York, 1996. ACM.

**[Eic01]** Bettina Eick. On the Fitting subgroup of a polycyclic-by-finite group and its applications. *J. Algebra*, 242(1):176–187, 2001.

**[EHOBrien19]** Bettina Eick, Tommy Hofmann, and E.A. O'Brien. The conjugacy problem in $\rm GL(n, z)$. *J. London Math. Soc.*, :, 2019.

**[ELGOBrien02]** Bettina Eick, C.R. Leedham-Green, and E.A. O'Brien. Constructing automorphism groups of a $p$-groups. *Comm. Algebra*, 30:2271–2295, 2002.

**[EOBrien99]** Bettina Eick and E.A. O'Brien. Enumerating $p$-groups. *J. Austral. Math. Soc.*, 67:191–205, 1999.

**[EFS03]** Eisenbud, Floystad, and Schreyer. Sheaf cohomology and free resolutions over exterior algebras. *Trans. Am. Maths. Soc.*, 355:4397–4426, 2003.

**[ES94]** Eisenbud and Sturmfels. Finding sparse systems of parameters. *Journal of Pure and Applied Algebra*, 94:143–157, 1994.

**[EHV92]** D. Eisenbud, C. Huneke, and W. Vasconcelas. Direct methods for primary decomposition. *Inv. math.*, 110:207–235, 1992.

**[EN85]** D. Eisenbud and W.D. Neumann. *Three-dimensional link theory and invariants of plane curve singularities*. Volume 110 of Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, 1985. ISBN 0-691-08380-0.

**[Eis95]** David Eisenbud. *Commutative Algebra with a View Toward Algebraic Geometry*. Volume 150 of Graduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 1995.

**[Eis05]** David Eisenbud. *The geometry of syzygies: a second course in commutative algebra and algebraic geometry*. Volume 225 of Graduate Texts in Mathematics. Springer, New York–Berlin–Heidelberg, 2005.

**[ERM94]** Elsayed A. El-Rifai and H. R. Morton. Algorithms for positive braids. *Quart. J. Math. Oxford Ser. (2)*, 45(180):479–497, 1994.

**[Elk]** **missing booktitle in Elk2000**

**[Elk90]** N. Elkies. The automorphism group of the modular curve $X_0(63)$. *Compositio Mathematica*, 74:203–208, 1990.

**[Elk98a]** N. Elkies. Elliptic and modular curves over finite fields and related computational issues. In *Computational Perspectives on Number Theory \it A conference in honor of A.O.L. Atkin*. 1998.

**[Elk98b]** Noam D. Elkies. Shimura curve computations. In *Algorithmic number theory (Portland, OR, 1998)*, volume 1423 of LNCS, pages 1–47. Springer, Berlin, 1998.

**[EK63]** Erich Ellers and Helmut Karzel. Kennzeichnung elliptischer Gruppenräume. *Abh. Math. Sem. Univ. Hamburg*, 26:55–77, 1963.

**[EK64]** Erich Ellers and Helmut Karzel. Endliche Inzidenzgruppen. *Abh. Math. Sem. Univ. Hamburg*, 27:250–264, 1964.

**[Els12]** A.-S. Elsenhans. Invariants for the computation of intransitive and transitive Galois groups. *Journal of Symbolic Computation*, 47:315–326, 2012.

**[Els14]** A.-S. Elsenhans. A note on short cosets. *Experimental Mathematics*, 23:411–413, 2014. [doi:10.1080/10586458.2014.922908](https://doi.org/10.1080/10586458.2014.922908).

**[Els]** Andreas-Stephan Elsenhans. Good models for cubic surfaces. (To appear). URL: [\biburl{http://www.staff.uni-bayreuth.de/\~{}btm216/}](\biburl{http://www.staff.uni-bayreuth.de/\~{}btm216/}).

**[Els15]** Andreas-Stephan Elsenhans. Explicit computations of invariants of plane quartic curves. *J. Symbolic Comput.*, 68(part 2):109–115, 2015.

**[Els16]** Andreas-Stephan Elsenhans. Improved methods for the construction of relative invariants for permutation groups. To appear in Journal of Symbolic Computation, Available online since 5 February 2016, 2016. [doi:10.1016/j.jsc.2016.02.005](https://doi.org/10.1016/j.jsc.2016.02.005).

**[EJ10a]** Andreas-Stephan Elsenhans and Jörg Jahnel. Cubic surfaces with a Galois invariant double-six. *Cent. Eur. J. Math.*, 8(4):646–661, 2010.

**[EJ10b]** Andreas-Stephan Elsenhans and Jörg Jahnel. Weil polynomials of k3 surfaces. In *Algorithmic number theory*, volume 6197 of Lecture Notes in Computer Science, 126–141. Berlin, 2010. Springer.

**[EGM98]** J. Elstrodt, F. Grunewald, and J. Mennicke. *Groups acting on hyperbolic space*. Springer Monographs in Mathematics. Springer-Verlag, Berlin, 1998. Harmonic analysis and number theory.

**[ECH+92]** David B. A. Epstein, James W. Cannon, Derek F. Holt, Silvio V. F. Levy, Michael S. Paterson, and William P. Thurston. *Word processing in groups*. Jones and Bartlett Publishers, Boston, MA, 1992. ISBN 0-86720-244-0.

**[Eve79]** Shimon Even. *Graph Algorithms*. Computer Science Press, 1979.

**[Fab09]** Anna Fabianska. *Algorithmic analysis of presentations of groups and modules*. Dissertation, RWTH Aachen University, 2009.

**[Faugere99]** Jean-Charles Faugère. A new efficient algorithm for computing gröbner bases ($f_4$). *Journal of Pure and Applied Algebra*, 139 (1-3):61–88, 1999.

**[FaugereGLM93]** Jean-Charles Faugère, Patrizia Gianni, Daniel Lazard, and Teo Mora. Efficient computations of zero-dimensional Gröbner bases by change of ordering. *J. Symbolic Comp.*, 16:329–344, 1993.

**[Fei83]** Walter Feit. The computations of some Schur indices. *Israel J. Math.*, 46(4):274–300, 1983.

**[FernandezCordobaPV08]** **missing publisher in FePuVi08**

**[FernandezCordobaPV10]** C. Fernández-Córdoba, J. Pujol, and M. Villanueva. $\z _2\z _4$-linear codes: rank and kernel. *Designs, Codes and Cryptography*, 56(1):43–59, 2010.

**[Fes]** Dino Festi. A practical algorithm to compute the geometric picard lattices of k3 surfaces of degree 2. preprint arXiv:1808.00351 [math.AG].

**[FJP97]** C. Fieker, A. Jurk, and M. Pohst. On solving relative norm equations in algebraic number fields. *Math. Comput.*, 66(217):399–410, 1997.

**[FKluners14]** C. Fieker and J. Klüners. Computation of Galois groups of rational polynomials. *London Mathematical Society Journal of Computation and Mathematics*, 17(1):141 – 158, 2014. http://arxiv.org/abs/1211.3588.

**[Fie97]** Claus Fieker. *Über relative Normgleichungen in algebraischen Zahlkörpern*. Dissertation, Technische Universität Berlin, 1997. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/diss_CF.ps.gz.

**[Fie00]** Claus Fieker. Computing class fields via the artin map. *Math. Comput.*, 70(235):1293–1303, 2000.

**[FF]** **missing booktitle in FiFi2000**

**[FS20]** **missing note in fieker_sutherland**

**[FP83]** U. Fincke and M. Pohst. A procedure for determining algebraic integers of given norm. In *EUROCAL*, volume 162 of LNCS, 194–202. Springer, 1983.

**[Fin84]** Ulrich Fincke. *Ein Ellipsoidverfahren zur Lösung von Normgleichungen in algebraischen Zahlkörpern*. Dissertation, Heinrich-Heine-Universität Düsseldorf, 1984.

**[FMW]** Uriya First, Joshua Maglione, and James B. Wilson. Polynomial identity tensors and their invariants. in preparation.

**[FMW19]** Uriya First, Joshua Maglione, and James B. Wilson. A spectral theory for transverse tensor operators. 2019. [arXiv:1911.02518](https://arxiv.org/abs/1911.02518).

**[FKM12]** W. Fish, J. Key, and E. Mwambene. Partial permutation decoding for simplex codes. *Advances in Mathematics of Communications*, 6(4):505–516, 2012.

**[FS12]** T. A. Fisher and G. F. Sills. Local solubility and height bounds for coverings of elliptic curves. *Math. Comp.*, 81(279):1635–1662, 2012.

**[Fis08a]** T.A Fisher. The invariants of a genus one curve. *Proc. Lond. Math. Soc.*, 97(3):753–782, 2008.

**[Fis06a]** T.A. Fisher. Testing equivalence of ternary cubics. In S. Pauli F. Hess and M.Pohst, editors, *ANTS VII*, volume 4076 of LNCS, 333–345. Springer-Verlag, 2006.

**[Fisa]** **missing journal in Fisher5descent**

**[Fisb]** **missing journal in FisherHigherDescent**

**[Fis00]** Tom Fisher. *On 5 and 7 descents for elliptic curves*. PhD thesis, University of Cambridge, 2000.

**[Fis01]** Tom Fisher. Some examples of $5$ and $7$ descent for elliptic curves over q. *J. Eur. Math. Soc.*, 3(Issue 2):169–201, 2001.

**[Fis06b]** Tom Fisher. The hessian of a genus one curve. preprint arXiv:math/0610403v2 [math.NT], 2006.

**[Fis08b]** Tom Fisher. Finding rational points on elliptic curves using 6-descent and 12-descent. *J. Algebra*, 320(2):853–884, 2008.

**[Fis13a]** Tom Fisher. Invariant theory for the elliptic normal quintic, I. Twists of X(5). *Math. Ann.*, 356(2):589–616, 2013.

**[Fis13b]** Tom Fisher. Minimisation and reduction of 5-coverings of elliptic curves. *Algebra Number Theory*, 7(5):1179–1205, 2013.

**[Fis14]** Tom Fisher. Minimal models for $6$-coverings of elliptic curves. *LMS J. Comput. Math.*, 17(A):112–127, 2014.

**[FOBrien00]** D.L. Flannery and E.A. O'Brien. Computing 2-cocycles for central extensions and relative difference sets. *Comm. Algebra*, 28:1935–1955, 2000.

**[FOBrien05]** D.L. Flannery and E.A. O'Brien. Linear groups of small degree over finite fields. *Internat. J. Algebra and Comput.*, 15:467–502, 2005.

**[FLeprevostS+01]** E.\thinspace V. Flynn, F. Leprévost, E.\thinspace F. Schaefer, W.\thinspace A. Stein, M. Stoll, and J.\thinspace L. Wetherell. Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves. *Math. of Comp.*, 70(236):1675–1697, 2001.

**[FS97]** E.V. Flynn and N.P. Smart. Canonical heights on the jacobians of curves of genus 2 and the infinite descent. *Acta Arith.*, 79:333 – 352, 1997.

**[Fra82]** J. S. Frame. Recursive computation of tensor power components. *Bayreuth. Math. Schr.*, pages 153–159, 1982.

**[Fra18]** Giovanni De Franceschi. *Centralizers and conjugacy classes in finite classical groups*. PhD Thesis, University of Auckland, 2018.

**[Fra20]** Giovanni De Franceschi. Centralizers and conjugacy classes in finite classical groups. *arXiv:2008.12651v1*, math.GR:69, 2020.

**[FLOBrien25]** Giovanni De Franceschi, Martin Liebeck, and E.A. O'Brien. *Conjugacy in finite classical groups*. Springer Mathematical Monographs. Springer, 2025.

**[FMSenechal97]** Philippe Di Francesco, P. Mathieu, and D. Sénéchal. *Conformal Field Theory*. Graduate texts in contemporary physics. Springer, 1997. ISBN 9780387947853. URL: [http://books.google.com/books?id=keUrdME5rhIC](http://books.google.com/books?id=keUrdME5rhIC).

**[FGonzalezM03]** Nuno Franco and Juan González-Meneses. Conjugacy problem for braid groups and Garside groups. *J. Algebra*, 266(1):112–132, 2003.

**[FKMW04]** J. Franke, T. Kleinjung, F. Morain, and T. Wirth. Proving the primality of very large numbers with fastECPP. In *Algorithmic number theory*, volume 3076 of Lecture Notes in Comput. Sci., pages 194–207. Springer, Berlin, 2004.

**[Fre90]** E. Freitag. *Hilbert modular forms*. Springer-Verlag, Berlin, 1990.

**[Fre94]** Gerhard Frey, editor. *On Artin's conjecture for odd 2-dimensional representations*. Springer-Verlag, Berlin, 1994. ISBN 3-540-58387-4. 1585.

**[FM99]** Gerhard Frey and Michael Muller. Arithmetic of modular curves and applications. In *Algorithmic algebra and number theory (Heidelberg, 1997)*, pages 11–48. Springer, Berlin, 1999.

**[Fri76]** J. B. Friedlander. On the class numbers of certain quadratic extensions. *Acta Arith.*, 28(4):391–393, 1975/76.

**[Fri97]** Carsten Friedrichs. Berechnung relativer Ganzheitsbasen mit dem Round-2-Algorithmus. Master's thesis, Technische Universität Berlin, 1997. \biburl http://www.math.tu-berlin.de/∼kant/publications/diplom/friedrichs.ps.gz.

**[Fri00]** Carsten Friedrichs. *Berechnung von Maximalordnungen über Dedekindringen*. Dissertation, Technische Universität Berlin, 2000. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/diss_fried.pdf.gz.

**[Ful97a]** Jason Fulman. *Probability in the Classical Groups over Finite Fields: Symmetric Functions, Stochastic Algorithms, and Cycle Indices*. PhD Thesis, Harvard University, 1997.

**[Ful69]** William Fulton. *Algebraic Curves*. Volume of Mathematics Lecture Note Series. W. A. Benjamin, New York-Amsterdam, 1969.

**[Ful93]** William Fulton. *Introduction to toric varieties*. Volume 131 of Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, 1993. ISBN 0-691-00049-2. The William H. Roever Lectures in Geometry.

**[Ful97b]** William Fulton. *Young Tableaux*. Cambridge University Press, Cambridge, 1997. ISBN 0-521-56144-2; 0-521-56724-6.

**[GaalPethHoP93]** Istvan Gaál, Attila Pethő, and Michael E. Pohst. On the resolution of index form equations in quartic number fields. *J. Symbolic Comp.*, 16:563–584, 1993.

**[GaalPethHoP96]** Istvan Gaál, Attila Pethő, and Michael E. Pohst. Simultaneous representation of integers by a pair of ternary quadratic forms – with an application to index form equations in quartic number fields. *J. Number Th.*, 57:90–104, 1996.

**[GaalS89]** Istvan Gaál and Nicole Schulte. Computing all power integral bases of cubic fields. *Math. Comp.*, 53:689–696, 1989.

**[Gab02]** Philippe Gaborit. Quadratic double circulant codes over fields. *Journal of Combinatorial Theory*, 97:85–107, 2002.

**[GY00]** W. T. Gan and J.-K. Yu. Group schemes and local densities. *Duke Math. J.*, 105(3):497–524, 2000. URL: [http://dx.doi.org/10.1215/S0012-7094-00-10535-2](http://dx.doi.org/10.1215/S0012-7094-00-10535-2), [doi:10.1215/S0012-7094-00-10535-2](https://doi.org/10.1215/S0012-7094-00-10535-2).

**[GHY01]** Wee Teck Gan, Jonathan P. Hanke, and Jiu-Kang Yu. On an exact mass formula of Shimura. *Duke Math. J.*, 107(1):103–133, 2001. URL: [http://dx.doi.org/10.1215/S0012-7094-01-10716-3](http://dx.doi.org/10.1215/S0012-7094-01-10716-3), [doi:10.1215/S0012-7094-01-10716-3](https://doi.org/10.1215/S0012-7094-01-10716-3).

**[Gar80]** Dennis A. Garbanati. An algorithm for finding an algebraic number whose norm is a given rational number. *J. reine angew. Math.*, 316:1–13, 1980.

**[GKT+02]** D. Garber, S. Kaplan, M. Teicher, B. Tsaban, and U. Vishne. Length-based conjugacy search in the braid group. Preprint; available at \biburl http://www.arxiv.org/math.GR/0209267, 2002.

**[Gar90]** Paul B. Garrett. *Holomorphic Hilbert modular forms*. The Wadsworth & Brooks/Cole Mathematics Series. Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove, CA, 1990. ISBN 0-534-10344-8.

**[Gar69]** F. A. Garside. The braid group and other groups. *Quart. J. Math. Oxford Ser. (2)*, 20:235–254, 1969.

**[Gau02]** P. Gaudry. A comparison and a combination of sst and agm algorithms for counting points on elliptic curves in characteristic 2. In Y. Zheng, editor, *Advances in Cryptology—AsiaCrypt 2002*, volume 2501 of LNCS, 311–327. Springer-Verlag, 2002. Proc. 8th International Conference on the Theory and Applications of Cryptology and Information Security, Dec. 1–5 2002, Queenstown, New Zealand.

**[GH]** **missing booktitle in gaudry_har**

**[Gau00]** Pierrick Gaudry. *Algorithmique des Courbes Hyperelliptiques et Applications à la Cryptographie*. PhD Thesis, Ecole Polytechnique, 2000. available at \biburl http://www.loria.fr/˜gaudry/papers.html.

**[Geb00]** Volker Gebhardt. Constructing a short defining set of relations for a finite group. *J. Algebra*, 233:526–542, 2000.

**[Geb02]** Volker Gebhardt. Efficient collection in infinite polycyclic groups. *J. Symbolic Comput.*, 34(3):213–228, 2002.

**[Geb03]** Volker Gebhardt. A new approach to the conjugacy problem in Garside groups. Preprint; available at \biburl http://www.arxiv.org/math.GT/0306199, 2003.

**[GHLubeck+96]** Meinolf Geck, Gerhard Hiss, Frank Lübeck, Gunter Malle, and Götz Pfeiffer. CHEVIE—a system for computing and processing generic character tables. *Appl. Algebra Engrg. Comm. Comput.*, 7(3):175–210, 1996. Computational methods in Lie theory (Essen, 1994).

**[GP00]** Meinolf Geck and Götz Pfeiffer. *Characters of finite Coxeter groups and Iwahori-Hecke algebras*. Volume 21 of London Mathematical Society Monographs. New Series. The Clarendon Press Oxford University Press, New York, 2000. ISBN 0-19-850250-8.

**[GCL92]** Keith O. Geddes, Stephen R. Czapor, and George Labahn. *Algorithms for Computer Algebra*. Kluwer, Boston/Dordrecht/London, 1992.

**[Geissler03]** Katharina Geißler. *Berechnung von Galoisgruppen über Zahl- und Funktionenkörpern*. PhD Thesis, TU-Berlin, 2003. available at \biburl http://www.math.tu-berlin.de/˜kant/publications/diss/geissler.pdf.

**[GeisslerKluners00]** Katharina Geißler and Jürgen Klüners. Galois group computation for rational polynomials. *J. Symbolic Comp.*, 30(6):653–674, 2000.

**[Gel75]** S. Gelbart. *Automorphic forms on adele groups*. Princeton University Press, 1975.

**[Ger03]** Larry J. Gerstein. Definite quadratic forms over $\F _q[X]$. *J. Algebra*, 268(1):252–263, 2003.

**[GS88]** Peter B. Gilkey and Gary M. Seitz. Some representations of exceptional Lie algebras. *Geom. Dedicata*, 25:407–416, 1988. URL: [https://doi.org/10.1007/BF00191935](https://doi.org/10.1007/BF00191935), [doi:10.1007/BF00191935](https://doi.org/10.1007/BF00191935).

**[GK06]** M. Girard and D. R. Kohel. Classification of genus 3 curves in special strata of the moduli space. In Hess, F. (ed.) et al., Algorithmic number theory. 7th international symposium, ANTS-VII, Berlin, Germany, July 23–28, 2006. Proceedings. Berlin: Springer. Lecture Notes in Computer Science 4076, 346-360 (2006)., 2006.

**[GH97]** S.P. Glasby and R.B. Howlett. Writing representations over minimal fields. *Comm. Algebra*, 25(6):1703–1711, 1997.

**[GLGOBrien05]** S.P. Glasby, C.R. Leedham-Green, and E.A. O'Brien. Writing projective representations over subfields. *J. Algebra*, 295():51–61, 2005.

**[GS90]** S.P. Glasby and Michael C. Slattery. Computing intersections and normalizers in soluble groups. *J. Symbolic Comp.*, 9:637–651, 1990. Computational group theory, Part 1.

**[GLOBrien17]** Samuel Gonshaw, Martin W. Liebeck, and E. A. O'Brien. Unipotent class representatives for finite classical groups. *J. Group Theory*, 20(3):505–525, 2017. URL: [https://doi.org/10.1515/jgth-2016-0047](https://doi.org/10.1515/jgth-2016-0047), [doi:10.1515/jgth-2016-0047](https://doi.org/10.1515/jgth-2016-0047).

**[GJG03]** E. Gonzalez-Jimenez and J. Gonzalez. Modular curves of genus 2. *Math. Comp.*, 72:397–418, 2003.

**[GJO10]** E. Gonzalez-Jimenez and Roger Oyono. Non-hyperelliptic modular curves of genus 3. *J. Number Th.*, 130:862–878, 2010.

**[GSHPBS12]** **missing note in dp_deg5**

**[GonzalezM02]** Juan González-Meneses. Improving an algorithm to solve multiple simultaneous conjugacy problems in braid groups. Preprint; available at \biburl http://www.arxiv.org/math.GT/0212150, 2002.

**[Gop81a]** V. D. Goppa. Codes on algebraic curves. *Dokl. Akad. Nauk SSSR*, 259(6):1289–1290, 1981.

**[Gop81b]** V. D. Goppa. Codes on algebraic curves. *Soviet Math. Dokl.*, 24(1):170–172, 1981.

**[GM93]** D. M. Gordon and K. S. McCurley. Massively parallel computation of discrete logarithms. In Ernest F. Brickell, editor, *Advances in Cryptology—CRYPTO 1992*, volume 740 of LNCS, 312–323. Springer-Verlag, 1993. Proc. 12th Annual International Cryptology Conference, Santa Barbara, Ca, USA, August 16–20, 1992.

**[Got59]** E. Gottschling. Explizite bestimmung der randflächen des fundamentalbereiches der modulgruppe zweiten grades. *Math. Annalen*, 138:103–124, 1959.

**[Gra01]** W. A. de Graaf. Computing with quantized enveloping algebras: PBW-type bases, highest-weight modules, $R$-matrices. *J. Symbolic Comput.*, 32(5):475–490, 2001.

**[Gra02]** W. A. de Graaf. Constructing canonical bases of quantized enveloping algebras. *Experimental Mathematics*, 11(2):161–170, 2002.

**[Gra04]** W. A. de Graaf. Five constructions of representations of quantum groups. *Note di Matematica*, 22(1):27–48, 2003/04.

**[Graa]** Markus Grassl. Bounds on the minimum distance of linear codes. \biburl http://www.codetables.de/.

**[Grab]** Markus Grassl. Bounds on the minimum distance of quantum codes. \biburl http://iaks-www.ira.uka.de/home/grassl/QECC/.

**[Gre59]** J.A. Green. On the indecomposable representations of a finite group. *Math. Z.*, 70:430–445, 1958/59.

**[GV11]** M. Greenberg and J. Voight. Computing systems of eigenvalues associated to hilbert modular forms. *Math. Comp.*, 80:1071–1092, 2011.

**[GV14]** Matthew Greenberg and John Voight. Lattice methods for algebraic modular forms on classical groups. In *Computations with modular forms*, volume 6 of Contrib. Math. Comput. Sci., pages 147–179. Springer, Cham, 2014. URL: [https://doi.org/10.1007/978-3-319-03847-6_6](https://doi.org/10.1007/978-3-319-03847-6_6), [doi:10.1007/978-3-319-03847-6\_6](https://doi.org/10.1007/978-3-319-03847-6\_6).

**[GNW84]** Curtis Greene, Albert Nijenhuis, and Herbert S. Wilf. Another probabilistic method in the theory of Young tableaux. *J. Combin. Theory Ser. A*, 37(2):127–135, 1984.

**[GV98]** M. Greferath and U. Velbinger. Efficient decoding of $\z _p^k$-linear codes. *IEEE Trans. on Information Theory*, 44:1288–1291, 1998.

**[GP02]** G.-M. Greuel and G. Pfister. *A Singular Introduction to Commutative Algebra*. Springer-Verlag, Berlin–Heidelberg–New York, 2002. ISBN 3-540-42897-6.

**[Gri95]** Deryn Griffiths. Series expansions of algebraic functions. In W. Bosma and A. van der Poorten, editors, *Computational Algebra and Number Theory*, pages 267 – 277. Kluwer Academic Publishers, Netherlands, 1995.

**[GK13]** Roland Grinis and Alexander M. Kasprzyk. Normal forms of convex lattice polytopes. Preprint; available at \biburl http://arxiv.org/abs/1301.6641, January 2013.

**[GZ86]** Gross and Zagier. Heegner points and derivatives of $l$-series. *Invent. Math.*, 84:225–320, 1986.

**[Gro99]** Benedict H. Gross. Algebraic modular forms. *Israel J. Math.*, 113:61–93, 1999. URL: [https://doi.org/10.1007/BF02780173](https://doi.org/10.1007/BF02780173), [doi:10.1007/BF02780173](https://doi.org/10.1007/BF02780173).

**[Gro72]** A. Grothendieck. *Groupes de monodromie en géométrie algébrique. I*. Springer-Verlag, Berlin, 1972. Séminaire de Géométrie Algébrique du Bois-Marie 1967–1969 (SGA 7 I), Dirigé par A. Grothendieck. Avec la collaboration de M. Raynaud et D. S. Rim, Lecture Notes in Mathematics, Vol. 288.

**[Gro74]** Susan Dancs Groves. *Locally finite near-fields*. PhD thesis, Australian National University, 1974.

**[GuardiaMN11]** J. Guàrdia, J. Montes, and E. Nart. Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields. *Journal de Théorie des Nombres de Bordeaux*, 23(3):667–696, 2011.

**[GuardiaMN12]** J. Guàrdia, J. Montes, and E. Nart. Newton polygons of higher order in algebraic number theory. *Transactions of the American Mathematical Society*, 364(1):361–416, 2012.

**[Gui12]** **missing note in guillera**

**[Gun99]** Paul E. Gunnells. Modular symbols for $\bf Q$-rank one groups and Voronoi reduction. *J. Number Theory*, 75(2):198–219, 1999.

**[Gun00]** Paul E. Gunnells. Computing Hecke eigenvalues below the cohomological dimension. *Experiment. Math.*, 9(3):351–367, 2000.

**[GM01]** C. Gutwenger and P. Mutzel. A linear time implementation of spqr-trees. In J. Marks, editor, *Graph Drawing 2000*, volume 1984 of LNCS, pages 70–90. Springer-Verlag, 2001.

**[GuardiaMN13]** Jordi Guàrdia, Jesús Montes, and Enric Nart. A new computational approach to ideal theory in number fields. *Foundations of Computational Mathematics*, 13(5):729–762, Oct 2013. URL: [https://doi.org/10.1007/s10208-012-9137-5](https://doi.org/10.1007/s10208-012-9137-5), [doi:10.1007/s10208-012-9137-5](https://doi.org/10.1007/s10208-012-9137-5).

**[GNP12]** Jordi Guàrdia, Enric Nart, and Sebastian Pauli. Single-factor lifting and factorization of polynomials over local fields. *Journal of Symbolic Computation*, 47(11):1318 – 1346, 2012. URL: [http://www.sciencedirect.com/science/article/pii/S0747717112000363](http://www.sciencedirect.com/science/article/pii/S0747717112000363), [doi:https://doi.org/10.1016/j.jsc.2012.03.001](https://doi.org/https://doi.org/10.1016/j.jsc.2012.03.001).

**[HYK+]** **missing booktitle in KPCKPH**

**[Hache96]** Gaétan Haché. *Construction effective des codes géométriques*. PhD thesis, l'Université Paris 6, 1996.

**[HacheLB95]** Gaétan Haché and Dominique Le Brigand. Effective construction of algebraic geometry codes. *IEEE Trans. Inform. Theory*, 41(6, part 1):1615–1628, 1995. Special issue on algebraic geometry codes.

**[HM89]** J. Hafner and K. McCurley. A rigorous subexponential algorithm for computation of class groups. *Jornal American Math. Soc.*, 2:837 – 850, 1989.

**[Hal86]** Marshall Hall. *Combinatorial Theory*. New York: Wiley, 2nd edition, 1986.

**[Hal59]** Marshall Hall, Jr. *The theory of groups*. The Macmillan Co., New York, N.Y., 1959.

**[Hal05]** Sergei Haller. *Computing Galois Cohomology and Forms of Linear Algebraic Groups*. PhD Thesis, Technical University of Eindhoven, 2005.

**[HKC+94]** A.R. Hammons, P.V. Kumar, A.R. Calderbank, N.J.A. Sloane, and P. Solé. The $\z _4$-linearity of kerdock, preparata, goethals and related codes. *IEEE Trans. on Information Theory*, 40:301–319, 1994.

**[HStehle07]** Guillaume Hanrot and Damien Stehlé. Improved analysis of kannan's shortest lattice vector algorithm (extended abstract). In *Advances in cryptology—CRYPTO 2007*, volume 4622 of LNCS, 170–186. Springer, 2007.

**[Hara]** R. Harley. Web posting. Under November 2002 entry at \biburl http://listserv.nodak.edu/archives/nmbrthry.html.

**[Harb]** M. C. Harrison. A new automorphism of $X_0(108)$. Preprint: online at arXiv as arXiv:1108.5595v3[math.NT].

**[Har13]** M. C. Harrison. Explicit solution by radicals, gonal maps and plane models of algebraic curves of genus 5 or 6. *J. Symb. Comp.*, 51:3–21, 2013.

**[HS06]** M.C. Harrison and J. Schicho. Rational parametrisation for degree 6 del pezzo surfaces using lie algebras. In *Proceedings ISSAC'06*. 2006.

**[Har12]** Michael C. Harrison. An extension of Kedlaya's algorithm for hyperelliptic curves. *J. Symbolic Comput.*, 47(1):89–101, 2012.

**[Har77]** Robin Hartshorne. *Algebraic Geometry, GTM 52*. Springer, ASpringer, 1977.

**[Har08]** D. Harvey. Efficient computation of p-adic heights. *LMS J. Comput. Math.*, 11:40–59, 2008.

**[Har15]** David Harvey. Computing zeta functions of arithmetic schemes. *Proceedings of the London Mathematical Society*, 111(6):1379–1401, 2015. URL: [https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/plms/pdv056](https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/plms/pdv056), [arXiv:https://londmathsoc.onlinelibrary.wiley.com/doi/pdf/10.1112/plms/pdv056](https://arxiv.org/abs/https://londmathsoc.onlinelibrary.wiley.com/doi/pdf/10.1112/plms/pdv056), [doi:https://doi.org/10.1112/plms/pdv056](https://doi.org/https://doi.org/10.1112/plms/pdv056).

**[Hat02]** Allen Hatcher. *Algebraic topology*. Cambridge University Press, Cambridge, 2002. ISBN 0-521-79160-X; 0-521-79540-0.

**[Hav91]** G. Havas. Coset enumeration strategies. In *ISSAC'91*, 191–199. ACM Press, 1991.

**[HH10]** G. Havas and D.F. Holt. On coxeter's families of group presentations. *J. Algebra*, 324(5):1076–1082, 2010.

**[HHR93]** George Havas, Derek F. Holt, and Sarah Rees. Recognizing badly presented z-modules. *Linear Algebra and its Applications*, 192:137–164, 1993.

**[HKRR84]** George Havas, P. E. Kenne, J. S. Richardson, and E. F. Robertson. A Tietze transformation program. In *Computational group theory (Durham, 1982)*, pages 69–73. Academic Press, London, 1984.

**[Hess]** **missing booktitle in antshessautiso**

**[Hess96]** Florian Heß. Zur Klassengruppenberechnung in algebraischen Zahlkörpern. Master's thesis, Technische Universität Berlin, 1996. \biburl http://www.math.tu-berlin.de/∼kant/publications/diplom/hess.ps.gz.

**[Hess99]** Florian Heß. *Zur Divisorenklassengruppenberechnung in globalen Funktionenkörpern*. Dissertation, Technische Universität Berlin, 1999. \biburl http://www.staff.uni-oldenburg.de/florian.hess/publications/diss_FH.pdf.

**[HessPP97]** Florian Heß, Sebastian Pauli, and Michael E. Pohst. On the computation of the multiplicative group of residue class rings. *Math. Comp.*, 1997.

**[Hid06]** Haruzo Hida. *Hilbert modular forms and Iwasawa theory*. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, Oxford, 2006. ISBN 978-0-19-857102-5; 0-19-857102-X.

**[HS10]** J. Hilmar and C. Smyth. Euclid Meets Bézout: Intersecting Algebraic Plane Curves with the Euclidean Algorithm. *The American Mathematical Monthly*, 117:250–260, (March) 2010.

**[HissM01]** G. Hiß and G. Malle. Low-dimensional representations of quasi-simple groups. *LMS J. Comput. Math.*, 4:22–63, 2001.

**[HissM02]** G. Hiß and G. Malle. Corrigenda: low-dimensional representations of quasi-simple groups. *LMS J. Comput. Math.*, 5:95–126, 2002.

**[HS03]** D. Hofheinz and R. Steinwandt. A practical attack on some braid group based cryptographic primitives. In *Public Key Cryptography, 6th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2003*, volume 2567 of LNCS, pages 187–198. Springer, 2003.

**[HS20]** Tommy Hofmann and Carlo Sircana. On the computation of overorders. *International Journal of Number Theory*, 16(04):857–879, 2020. URL: [https://doi.org/10.1142/S179304212050044X](https://doi.org/10.1142/S179304212050044X), [arXiv:https://doi.org/10.1142/S179304212050044X](https://arxiv.org/abs/https://doi.org/10.1142/S179304212050044X), [doi:10.1142/S179304212050044X](https://doi.org/10.1142/S179304212050044X).

**[Hog82]** G. M. D. Hogeweij. Almost-classical Lie algebras. I, II. *Nederl. Akad. Wetensch. Indag. Math.*, 44(4):441–452, 453–460, 1982.

**[Hol06]** David Holmes. Canonical heights on hyperelliptic curves. Preprint \biburl http://arxiv.org/abs/1004.4503, 2006.

**[HR19]** D. Holt and G. Royle. A census of small transitive groups and vertex-transitive graphs. *J. Symb. Comput.*, 2019. \biburl https://doi.org/10.1016/j.jsc.2019.06.006. [doi:10.1016/j.jsc.2019.06.006](https://doi.org/10.1016/j.jsc.2019.06.006).

**[HEOBrien05]** D. F. Holt, B. Eick, and E. O`Brien. *Handbook of Computational Group Theory*. Chapman and Hall/CRC, 2005.

**[Hol84]** D.F. Holt. The calculation of the schur multiplier of a permutation group. In *Computational group theory (Durham, 1982)*, 307–319. Academic Press, London, 1984.

**[Hol85a]** D.F. Holt. A computer program for the calculation of a covering group of a finite group. *J. Pure Appl. Algebra*, 35(3):287–295, 1985.

**[Hol85b]** D.F. Holt. The mechanical computation of first and second cohomology groups. *J. Symbolic Comp.*, 1(4):351–361, 1985.

**[Hol91]** D.F. Holt. The computation of normalizers in permutation groups. *J. Symbolic Comp.*, 12(4/5):499–516, 1991.

**[HP89]** D.F. Holt and W. Plesken. *Perfect Groups*. Oxford University Press, 1989.

**[Hol97]** Derek Holt. *KBMAG – Knuth-Bendix in Monoids and Automatic Groups*. University of Warwick, 1997.

**[HLNeunhoffer+17]** **missing note in RSym**

**[HLGOBrienR96a]** Derek F. Holt, C.R. Leedham-Green, E.A. O'Brien, and Sarah Rees. Computing decompositions for modules with respect to a normal subgroup. *J. Algebra*, 184:818–838, 1996.

**[HLGOBrienR96b]** Derek F. Holt, C.R. Leedham-Green, E.A. O'Brien, and Sarah Rees. Testing matrix groups for primitivity. *J. Algebra*, 184:795–817, 1996.

**[HRRover17]** Derek F. Holt, Sarah Rees, and Claas E. Röver. *Groups, languages and automata*. Volume 88 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 2017.

**[HT73]** J.E. Hopcroft and R.E. Tarjan. Dividing a graph into triconnected components. *SIAM J. Comput.*, 2(3):135–158, 1973.

**[Hop98]** Andreas Hoppe. *Normal forms over Dedekind domains, efficient implementation in the computer algebra system KANT*. Dissertation, Technische Universität Berlin, 1998. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/diss_AH.ps.gz.

**[Hor76]** E. Horikawa. Algebraic Surfaces of General Type with Small $c_1^2$. II. *Invent. Math.*, 37:121–155, 1976.

**[HM73]** G. Horrocks and D. Mumford. A rank 2 vector bundle on $\bf P_4$ with 15,000 symmetries. *Topology*, 12:63–81, 1973.

**[How12]** David J. A. Howden. *Computing automorphism groups and isomorphism testing in finite groups*. PhD thesis, University of Warwick, 2012.

**[How86]** J. A. Howell. Spans in the module $\z _m^s$. *Linear and Multilinear Algebra*, 19:67–77, 1986.

**[HRT01]** R. B. Howlett, L. J. Rylands, and D. E. Taylor. Matrix generators for exceptional groups of Lie type. *J. Symbolic Comput.*, 31(4):429–445, 2001.

**[Hub06]** Hendrik Hubrechts. Point counting in families of hyperelliptic curves. Preprint \biburl http://arxiv.org/abs/math.NT/0601438, 2006.

**[Hub07]** Hendrik Hubrechts. Quasi-quadratic elliptic curve point counting using rigid cohomology. *to appear in the Journal of Symbolic Computation*, 2007. \biburl http://wis.kuleuven.be/algebra/hubrechts/.

**[Hug57]** D. R. Hughes. A class of non-Desarguesian projective planes. *Canad. J. Math.*, 9:378–388, 1957.

**[Hug02]** J. Hughes. A linear algebraic attack on the aafg1 braid group cryptosystem. In *The 7th Australasian Conference on Information Security and Privacy, ACISP 2002*, volume 2384 of LNCS, pages 176–189. Springer, 2002.

**[Hul99]** Alexander Hulpke. Computing subgroups invariant under a set of au­to­mor­ph­isms. *J. Symbolic Comp.*, 27:415–427, 1999.

**[Hul05]** Alexander Hulpke. Constructing transitive permutation groups. *J. Symbolic Comput.*, 39(1):1–30, 2005.

**[HL03]** Alexander Hulpke and Steve Linton. Total ordering on subgroups and cosets. In *Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation*, 156–160. ACM, New York, 2003. URL: [https://doi.org/10.1145/860854.860892](https://doi.org/10.1145/860854.860892), [doi:10.1145/860854.860892](https://doi.org/10.1145/860854.860892).

**[Hum90]** James E. Humphreys. *Reflection groups and Coxeter groups*. Volume 29 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1990. ISBN 0-521-37510-X.

**[Hun96]** Bruce Hunt. *The geometry of some special arithmetic quotients*. Volume 1637 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1996.

**[Hur13]** Barry Hurley. *Classification Problems for Finite Linear Groups*. PhD Thesis, National University of Ireland, 2013.

**[Husemoller87]** Dale Husemöller. *Elliptic Curves*. Volume 111 of Graduate Texts in Mathematics. Springer, New York, 1987.

**[Hus16]** David Husert. *Similarity of integer matrices*. PhD Thesis, Universität Paderborn, 2016.

**[IF00]** Anthony Iano-Fletcher. Working with weighted complete intersections. In A. Corti and M. Reid, editors, *Explicit birational geometry of $3$-folds*, pages 101 – 173. CUP, Cambridge, 2000.

**[Igu60a]** **missing journal in igusag2**

**[Igu60b]** Jun-Ichi Igusa. Arithmetic variety of moduli for genus two. *Ann. Math*, 72:612–649, 1960.

**[IRonyai93]** Gábor Ivanyos and Lajos Rónyai. Finding maximal orders in semisimple algebras over $\bf Q$. *Comput. Complexity*, 3(3):245–261, 1993.

**[JHC98]** N.J.A. Sloane J.H. Conway. *Sphere Packings, Lattices and Groups*. Volume 290 of Grundlehren der Mathematischen Wissenschaften. Springer, New York–Berlin–Heidelberg, 3rd edition, 1998.

**[Jac62a]** Ronald Jacobowitz. Hermitian forms over local fields. *Amer. J. Math.*, 84:441–465, 1962. URL: [https://doi.org/10.2307/2372982](https://doi.org/10.2307/2372982), [doi:10.2307/2372982](https://doi.org/10.2307/2372982).

**[JL04]** Pascale Jacobs and Dimitri Leemans. An algorithmic analysis of the intersection property. *LMS J. Comput. Math.*, 7:284–299 (electronic), 2004.

**[Jac62b]** N. Jacobson. *Lie algebras*. Interscience Tracts in Pure and Applied Mathematics, No. 10. Interscience Publishers New York-London, 1962.

**[JL70]** H. Jacquet and R. P. Langlands. *Automorphic forms on $\rm GL(2)$*. Lecture Notes in Mathematics, Vol. 114. Springer-Verlag, Berlin, 1970.

**[Jae93]** G. Jaeschke. On strong pseudoprimes to several bases. *Math. Comp.*, 61:915 – 926, 1993.

**[JLNP13]** S Jambor, M Leuner, A. C. Niemeyer, and W Plesken. Fast recognition of alternating groups of unknown degree. *J. Algebra*, 392:315–335, 2013.

**[Jam12]** Sebastian Jambor. *An L3-U3-quotient algorithm for finitely presented groups*. PhD Thesis, RWTH Aachen University, 2012.

**[Jam15]** Sebastian Jambor. An $\rm L_2$-quotient algorithm for finitely presented groups on arbitrarily many generators. *J. Algebra*, 423:1109–1142, 2015. URL: [https://doi.org/10.1016/j.jalgebra.2014.08.058](https://doi.org/10.1016/j.jalgebra.2014.08.058), [doi:10.1016/j.jalgebra.2014.08.058](https://doi.org/10.1016/j.jalgebra.2014.08.058).

**[JK81a]** G. James and A. Kerber. *The Representation Theory of the Symmetric Group*. Addison-Weasly, Reading MA, 1981.

**[JK81b]** Gordon James and Adalbert Kerber. *The representation theory of the symmetric group*. Addison-Wesley Publishing Co., Reading, Mass., 1981. ISBN 0-201-13515-9. With a foreword by P. M. Cohn, With an introduction by Gilbert de B. Robinson.

**[Jan96]** J. C. Jantzen. *Lectures on Quantum Groups*. Volume 6 of Graduate Studies in Mathematics. American Mathematical Society, 1996.

**[JK07]** D. Jeon and C. H. Kim. On the arithmetic of certain modular curves. *Acta Arith.*, 130:181–193, 2007.

**[JM00]** D. Johnson and A. Menezes. The elliptic curve digital signature algorithm (ecdsa). Technical Report, Univ. Waterloo, 2000. Available at \biburl http://www.cacr.math.uwaterloo.ca/.

**[JR06]** J. W. Jones and D. P. Roberts. A database of local fields. *J. Symb. Comput.*, 41(1):80–97, 2006.

**[Jur93]** Andreas Jurk. *Über die Berechnung von Lösungen relativer Normgleichungen in algebraischen Zahlkörpern*. Dissertation, Heinrich-Heine-Universität Düsseldorf, 1993.

**[Kac90]** Victor G. Kac. *Infinite Dimensional Lie Algebras*. Cambridge University Press, 1990.

**[Kad80]** Tornike V. Kadeishvili. On the homology theory of fiber spaces. *Russian Math. Surveys*, pages 231–238, 1980. arXiv:math/0504437v1.

**[KS95]** Erich Kaltofen and Victor Shoup. Subquadratic-time factoring of polynomials over finite fields. In *Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing*, 398–406. ACM, 1995.

**[Kan01]** Richard Kane. *Reflection Groups and Invariant Theory*. Volume 5 of CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. Springer-Verlag, New York, 2001. ISBN 0-387-98979-X.

**[Kan83]** R. Kannan. Improved algorithms for integer programming and related lattice problems. In *Proceedings of the 15th Symposium on the Theory of Computing (STOC 1983)*, 99–108. ACM, 1983.

**[KB79]** R. Kannan and A. Bachem. Polynomial algorithms for computing the smith and hermite normal forms of an integer matrix. *SIAM J. Computing*, 9:499–507, 1979.

**[KLLovasz84]** Ravi Kannan, Arjen K. Lenstra, and László Lovász. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. In *Proceedings of the 16th Symposium on the Theory of Computing (STOC 1984)*, 191–200. ACM, 1984.

**[Kan91]** William M. Kantor. Finding composition factors of permutation groups of degree $n\leq 10\sp 6$. *J. Symbolic Comp.*, 12(4/5):517–526, 1991.

**[Kas96]** M. Kashiwara. Similarity of crystal bases. In *Lie algebras and their representations (Seoul, 1995)*, pages 177–186. Amer. Math. Soc., Providence, RI, 1996.

**[Kat92]** Svetlana Katok. *Fuchsian groups*. Chicago Lectures in Mathematics. University of Chicago Press, Chicago, IL, 1992. ISBN 0-226-42582-7; 0-226-42583-5.

**[Kat90]** N. M. Katz. *Exponential Sums and Differential Equations*. Volume 124. Annals of Math. Studies., 1990.

**[Kat96]** N. M. Katz. *Rigid Local Systems*. Volume 139. Annals of Math. Studies., 1996.

**[KL79]** D. Kazhdan and G. Lusztig. Representations of Coxeter groups and Hecke algebras. *Inventiones Math.*, 53:165–184, 1979.

**[Ked01]** Kiran S. Kedlaya. Counting points on hyperelliptic curves using monsky-washnitzer cohomology. *J. Ramanujan Math. Soc.*, 16:323 – 338, 2001.

**[Kel01]** Bernhard Keller. Introduction to $A$-infinity algebras and modules. *Homology, Homotopy and Applications*, 3(1):1–35 (electronic), 2001.

**[Kel02]** Bernhard Keller. $A$-infinity algebras in representation theory. In *Representations of algebra. Vol. I, II*, pages 74–86. Beijing Norm. Univ. Press, Beijing, 2002.

**[Kem96]** Gregor Kemper. Calculating invariant rings of finite groups over arbitrary fields. *J. Symbolic Comp.*, 21(3):351–366, 1996.

**[Kem99]** Gregor Kemper. An algorithm to calculate optimal homogeneous systems of parameters. *J. Symbolic Comp.*, 27(2):171–184, 1999.

**[KS97]** Gregor Kemper and Allan Steel. Some algorithms in invariant theory of finite groups. In P. Dräxler, G.O. Michler, and C.M. Ringel, editors, *Computational Methods for Representations of Groups and Algebras, Euroconference in Essen, April 1-5 1997*, number 173 in Progress in Mathematics. Basel, 1997. Birkhäuser.

**[KM88]** M.A. Kenku and F. Momose. Automorphism groups of the modular curves $X_0(N)$. *Compositio Mathematica*, 65:51–80, 1988.

**[KKL92]** Adalbert Kerber, Axel Kohnert, and Alain Lascoux. SYMMETRICA, an object oriented computer-algebra system for the symmetric group. *J. Symbolic Comp.*, 14(2-3):195–203, 1992. \biburl http://www.mathe2.uni-bayreuth.de/axel/symneu_engl.html.

**[Kil02]** L. J. P. Kilford. Some non-Gorenstein Hecke algebras attached to spaces of modular forms. *J. Number Theory*, 97(1):157–164, 2002.

**[Kin07]** Simon King. Minimal generating sets of non-modular invariant rings of finite groups. \biburl http://arxiv.org/abs/math/0703035, 2007.

**[Kir09]** M. Kirschmer. *Finite symplectic matrix groups*. Dissertation, RWTH Aachen, 2009. available at \biburl http://www.math.rwth-aachen.de/ Markus.Kirschmer/symplectic/thesis.pdf.

**[Kir12]** M. Kirschmer. A normal form for definite quadratic forms over $\F _q[t]$. *Math. Comp.*, 81:1619–1634, 2012.

**[Kir16]** M. Kirschmer. *Definite quadratic and hermitian form with small class number*. Habilitation, RWTH Aachen University, 2016.

**[KV10]** M. Kirschmer and J. Voight. Algorithmic enumeration of ideal classes for quaternion orders. *SIAM J. Comput. (SICOMP)*, 39(5):1714–1747, 2010.

**[KL90]** Peter Kleidman and Martin Liebeck. *The Subgroup Structure of the Finite Classical Groups*. Volume 129 of London Math. Soc. Lecture Note Ser. CUP, Cambridge, 1990. ISBN 0-521-35949-X.

**[Klo07]** Remke Kloosterman. Elliptic k3 surfaces with geometric mordell-weil rank 15. *Canadian Mathematical Bulletin*, 50(2):215–226, 2007.

**[Kluners95]** Jürgen Klüners. Über die Berechnung von Teilkörpern algebraischer Zahlkörper. Master's thesis, Technische Universität Berlin, 1995. \biburl http://www.math.tu-berlin.de/∼kant/publications/diplom/klueners.ps.gz.

**[Kluners97]** Jürgen Klüners. *Über die Berechnung von Automorphismen und Teilkörpern algebraischer Zahlkörper*. Dissertation, Technische Universität Berlin, 1997. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/diss_jk.ps.gz.

**[Kluners98]** Jürgen Klüners. On computing subfields. a detailed description of the algorithm. *J. Theor. Nombres Bordx.*, 2(10):243–271, 1998.

**[Kluners02]** Jürgen Klüners. Algorithms for function fields. *Exp. Math.*, pages 171–181, 2002.

**[KlunersP97]** Jürgen Klüners and Michael E. Pohst. On computing subfields. *J. Symbolic Comp.*, 24(3):385–397, 1997.

**[Kne57]** M. Kneser. Klassenzahlen indefiniter quadratischer Formen in drei oder mehr Veränderlichen. *Archiv Math.*, 8:241–250, 1957.

**[KMRT98]** Max-Albert Knus, Alexander Merkurjev, Markus Rost, and Jean-Pierre Tignol. *The Book of Involutions*. American Mathematical Society, Providence, RI, 1998. Preface by Jacques Tits.

**[Knu97]** Donald E. Knuth. *The Art of Computer Programming*. Volume 2. Addison Wesley, Reading, Massachusetts, 3rd edition, 1997.

**[KLC+00]** Ki Hyoung Ko, Sang Jin Lee, Jung Hee Cheon, Jae Woo Han, Ju-sung Kang, and Choonsik Park. New public-key cryptosystem using braid groups. In *Advances in cryptology—CRYPTO 2000*, pages 166–183. Springer, Berlin, 2000.

**[Kob84]** Neal Koblitz. *Introduction to Elliptic Curves and Modular Forms*. Volume 97 of Graduate Texts in Mathematics. Springer, New York, 1984.

**[Koe60]** Max Koecher. Beiträge zu einer Reduktionstheorie in Positivitätsbereichen. I. *Math. Ann.*, 141:384–432, 1960.

**[Koh96]** D. Kohel. *Endomorphism rings of elliptic curves over finite fields*. PhD thesis, University of California, Berkeley, 1996.

**[Koh01]** D. Kohel. Hecke module structure of quaternions. In K. Miyake, editor, *Class Field Theory – its Centenary and Prospect*. 2001.

**[KS]** **missing booktitle in KohSte00**

**[Koh03]** David R. Kohel. The agm-$X_0(N)$ heegner point lifting algorithm and elliptic curve point counting. In *Advances in Cryptology—AsiaCrypt 2003*, number 2894 in LNCS. Berlin, 2003. Springer.

**[KS00a]** David R. Kohel and William A. Stein. Component Groups of Quotients of $J_0(N)$. In *Proceedings of the 4th International Symposium (ANTS-IV), Leiden, Netherlands, July 2–7, 2000*. Berlin, 2000. Springer.

**[Kos66]** B. Kostant. Groups over $Z$. In *Algebraic Groups and Discontinuous Subgroups (Proc. Sympos. Pure Math., Boulder, Colo., 1965)*, pages 90–98. Amer. Math. Soc., Providence, R.I., 1966.

**[Kra77]** K. Kramer. Two-descent for elliptic curves in characteristic two. *Trans. Amer. Math. Soc.*, 232:279–295, 1977.

**[Kra81]** K. Kramer. Arithmetic of elliptic curves upon quadratic extension. *Trans. Amer. Math. Soc.*, 264(1):121–135, 1981.

**[KS00b]** Maximilian Kreuzer and Harald Skarke. Complete classification of reflexive polyhedra in four dimensions. *Adv. Theor. Math. Phys.*, 4(6):1209–1230, 2000.

**[KS04]** Maximilian Kreuzer and Harald Skarke. PALP, a package for analyzing lattice polytopes with applications to toric geometry. *Computer Phys. Comm.*, 157:87–106, 2004.

**[Kro01]** D. S. Krotov. $\z _4$-linear hadamard and extended perfect codes. In *Proceedings of the International Workshop on Coding and Cryptography, Paris (France), January 8-12*, 329–334. 2001.

**[KS21]** David Krumm and Nicole Sutherland. Galois groups over rational function fields and explicit Hilbert irreducibility. *Journal of Symbolic Computation*, 103:108 – 126, 2021. URL: [http://www.sciencedirect.com/science/article/pii/S0747717119301476](http://www.sciencedirect.com/science/article/pii/S0747717119301476), [doi:https://doi.org/10.1016/j.jsc.2019.11.003](https://doi.org/https://doi.org/10.1016/j.jsc.2019.11.003).

**[Kul91]** Ravi S. Kulkarni. An arithmetic-geometric method in the study of the subgroups of the modular group. *Amer. J. Math.*, 113(6):1053–1133, 1991.

**[Kut84]** P. C. Kutzko. The exceptional representations of $\rm Gl\sb 2$. *Compositio Math.*, 51(1):3–14, 1984.

**[Kut80]** Philip Kutzko. The Langlands conjecture for $\rm Gl\sb 2$ of a local field. *Ann. of Math. (2)*, 112(2):381–412, 1980.

**[KP02]** J. Kuzmanovich and A. Pavlichenkov. Finite groups of matrices whose entries are integers. *Amer. Math. Monthly*, 109(2):173–186, 2002.

**[Kyn22]** Madeleine Kyng. Computing zeta functions of algebraic curves using Harvey's trace formula. *Res. Number Theory*, 8(4):Paper No. 100, 17, 2022. URL: [https://doi.org/10.1007/s40993-022-00398-7](https://doi.org/10.1007/s40993-022-00398-7), [doi:10.1007/s40993-022-00398-7](https://doi.org/10.1007/s40993-022-00398-7).

**[Kyn25]** Madeleine Kyng. *Computing zeta functions of algebraic curves using Harvey's trace formula*. Dissertation, The University of New South Wales, May 2025. available at \biburl https://web.maths.unsw.edu.au/ davidharvey/research/kyng-thesis.pdf.

**[KiliccerLL+18]** Pınar Kılıçer, Hugo Labrande, Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling, and Marco Streng. Plane quartics over $\Q $ with complex multiplication. *Acta Arith.*, 185(2):127–156, 2018.

**[Lubeck01]** F. Lübeck. Small degree representations of finite chevalley groups in defining ch aracteristic. *LMS J. Comput. Math.*, 4:135–169, 2001.

**[Luneburg69]** Heinz Lüneburg. *Lectures on projective planes*. University of Illinois, Chicago, 1969.

**[Luneburg71]** Heinz Lüneburg. Über die Anzahl der Dickson'schen Fastkörper gegebener Ordnung. In *Atti del Convegno di Geometria Combinatoria e sue Applicazioni (Univ. Perugia, Perugia, 1970)*, pages 319–322. Ist. Mat., Univ. Perugia, Perugia, 1971.

**[Lam73]** T. Y. Lam. *The Algebraic Theory of Quadratic Forms*. W. A. Benjamin, Inc., Reading, MA, 1973.

**[Lam05]** T. Y. Lam. *Introduction to quadratic forms over fields*. Volume 67 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2005. ISBN 0-8218-1095-2. URL: [https://doi.org/10.1090/gsm/067](https://doi.org/10.1090/gsm/067), [doi:10.1090/gsm/067](https://doi.org/10.1090/gsm/067).

**[LO91a]** B. A. LaMacchia and A. M. Odlyzko. Computation of discrete logarithms in prime fields. In A.J. Menezes and S. Vanstone, editors, *Advances in Cryptology—CRYPTO 1990*, volume 537 of INCS, 616–618. Springer-Verlag, 1991.

**[LO91b]** B. A. LaMacchia and A. M. Odlyzko. Solving large sparse linear systems over finite fields. In A.J. Menezes and S. Vanstone, editors, *Advances in Cryptology—CRYPTO 1990*, volume 537 of LNCS, 109–133. Springer-Verlag, 1991.

**[Lan12]** J. M. Landsberg. *Tensors: geometry and applications*. Volume 128 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2012. ISBN 978-0-8218-6907-9.

**[Lan87]** Serge Lang. *Elliptic Functions*. Volume 112 of Graduate Texts in Mathematics. Springer, New York, 1987.

**[LSchutzenberger85]** Alain Lascoux and Marcel-Paul Schützenberger. Schubert polynomials and the Littlewood-Richardson rule. *Lett. Math. Phys.*, 10(2-3):111–124, 1985.

**[Lau11]** A. Lauder. Computations with classical and p-adic modular forms. *LMS J. Comput. Math.*, 14:214–231, 2011.

**[Lav67]** A. F. Lavrik. An approximate functional equation for the Hecke zeta-function of an imaginary quadratic field. *Mat. Zametki*, 2:475–482, 1967.

**[LNPS06]** M. Law, A.C. Niemeyer, C.E. Praeger, and A. Seress. A reduction algorithm for for large-base primitive permutation groups. *LMS J. Comput. Math.*, 9:159–173, 2006.

**[Laz92]** Daniel Lazard. Solving zero-dimensional algebraic systems. *J. Symbolic Comp.*, 13(2):117–131, 1992.

**[LP03]** E. Lee and J. H. Park. Cryptanalysis of the public key encryption based on braid groups. In *Advances in Cryptology—EuroCrypt 2003*, volume 2656 of LNCS, pages 477–490. Springer, 2003.

**[Lee13]** John M. Lee. *Introduction to smooth manifolds*. Volume 218 of Graduate Texts in Mathematics. Springer, New York, second edition, 2013. ISBN 978-1-4419-9981-8.

**[LS78]** Ronnie Lee and R. H. Szczarba. On the torsion in $K\sb 4(\bf Z)$ and $K\sb 5(\bf Z)$. *Duke Math. J.*, 45(1):101–129, 1978.

**[LL02]** Sang Jin Lee and Eonkyung Lee. Potential weakness of the commutator key agreement protocol based on braid groups. In *Advances in Cryptology—EuroCrypt 2002*, volume 2332 of LNCS, pages 14–28. Springer, 2002.

**[LGM02a]** C. R. Leedham-Green and S. McKay. *The structure of groups of prime power order*. Volume 27 of London Mathematical Society Monographs. New Series. Oxford University Press, Oxford, 2002. ISBN 0-19-853548-1. Oxford Science Publications.

**[LGM02b]** C. R. Leedham-Green and Scott H. Murray. Variants of product replacement. *Contemp. Math.*, 298:97–104, 2002.

**[LGOBrien97a]** C.R. Leedham-Green and E.A. O'Brien. Recognising tensor products of matrix groups. *Internat. J. Algebra Comput.*, 7:541–559, 1997.

**[LGOBrien97b]** C.R. Leedham-Green and E.A. O'Brien. Tensor products are projective geometries. *J. Algebra*, 189:514–528, 1997.

**[LGOBrien02]** C.R. Leedham-Green and E.A. O'Brien. Recognising tensor-induced matrix groups. *J. Algebra*, 253:14–30, 2002.

**[LGOBrien09]** C.R. Leedham-Green and E.A. O'Brien. Constructive recognition of classical groups in odd characteristic. *J. Algebra*, 322:833–881, 2009.

**[LGOBrien20]** C.R. Leedham-Green and E.A. O'Brien. Presentations on standard generators for classical groups. *J. Algebra*, 545:324–389, 2020.

**[LGPS91]** C.R. Leedham-Green, C.E. Praeger, and L.H. Soicher. Computing with group homomorphisms. *J. Symbolic Comp.*, 12(4/5):527–532, 1991.

**[LG01]** Charles R. Leedham-Green. The computational matrix group project. In *Groups and computation, III (Columbus, OH, 1999)*, volume 8 of Ohio State Univ. Math. Res. Inst. Publ., pages 229–247. de Gruyter, Berlin, 2001.

**[LT09]** G. I. Lehrer and D. E. Taylor. *Unitary Reflection Groups*. Volume 20 of Australian Mathematical Society Lecture Series. Cambridge University Press, Cambridge, 2009.

**[LD95]** Arjen K. Lenstra and Bruce Dodson. NFS with four large primes: an explosive experiment. In Don Coppersmith, editor, *Advances in cryptology—CRYPTO 1995*, volume 963 of LNCS, 372–385. Berlin, 1995. Springer.

**[LLLovasz82]** Arjen K. Lenstra, Hendrik W. Lenstra, and László Lovász. Factoring polynomials with rational coefficients. *Mathematische Annalen*, 261:515–534, 1982.

**[LO85]** H. W. Lenstra, Jr. and F. Oort. Abelian varieties having purely additive reduction. *J. Pure Appl. Algebra*, 36(3):281–298, 1985.

**[Leo80]** Jeffrey S. Leon. On an algorithm for finding a base and a strong generating set for a group given by generating permutations. *Math. Comp.*, 35(151):941–974, 1980.

**[Leo82]** Jeffrey S. Leon. Computing automorphism groups of error-correcting codes. *IEEE Trans. Inform. Theory*, IT-28:496–511, 1982.

**[Leo91]** Jeffrey S. Leon. Permutation group algorithms based on partitions, I: Theory and algorithms. *J. Symbolic Computation*, 12:533–583, 1991.

**[Leo97]** Jeffrey S. Leon. Partitions, refinements, and permutation group com­pu­ta­tion. In Larry Finkelstein and William M. Kantor, editors, *Groups and Computation II*, volume 28 of Dimacs series in Discrete Mathematics and Computer Science, 123–158. Providence R.I., 1997. Amer. Math. Soc.

**[Ler97]** R. Lercier. *Algorithmique des courbes elliptique dan les corps finis*. PhD thesis, École polytechnique, 1997.

**[LL03]** R. Lercier and D. Lubicz. Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time. In *Advances in Cryptology—EuroCrypt 2003*, volume 2656 of LNCS, pages 360–373. Springer, 2003.

**[LL06]** R. Lercier and D. Lubicz. A quasi-quadratic time algorithm for hyperelliptic curve point counting. *to appear*, 2006.

**[LRS12]** R. Lercier, C. Ritzenthaler, and J. Sijsling. Fast computation of isomorphisms of hyperelliptic curves and explicit descent. In E. W. Howe and K. S. Kedlaya, editors, *Proceedings of the Tenth Algorithmic Number Theory Symposium*, 463–486. Mathematical Sciences Publishers, 2012.

**[LLGR20]** Reynald Lercier, Qing Liu, Elisa Lorenzo García, and Christophe Ritzenthaler. Reduction type of smooth quartics. 2020. [arXiv:1803.05816](https://arxiv.org/abs/1803.05816).

**[LR12]** Reynald Lercier and Christophe Ritzenthaler. Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects. *J. Algebra*, 372:595–636, 2012. \biburl http://dx.doi.org/10.1016/j.jalgebra.2012.07.054.

**[LRRS14]** Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, and Jeroen Sijsling. Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields. *LMS J. Comput. Math.*, 17(suppl. A):128–147, 2014.

**[LRS16]** Reynald Lercier, Christophe Ritzenthaler, and Jeroen Sijsling. Explicit Galois obstruction and descent for hyperelliptic curves with tamely cyclic reduced automorphism group. *Math. Comp.*, 85(300):2011–2045, 2016.

**[LRS21]** Reynald Lercier, Christophe Ritzenthaler, and Jeroen Sijsling. Functionalities for genus $2$ and $3$ curves. https://arxiv.org/abs/2102.04372, 2021. [arXiv:2102.04372](https://arxiv.org/abs/2102.04372).

**[LSR21]** Reynald Lercier, Jeroen Sijsling, and Christophe Ritzenthaler. Functionalities for genus $2$ and $3$ curves. 2021. [arXiv:2102.04372](https://arxiv.org/abs/2102.04372).

**[Lew81]** Leonard Lewin. *Polylogarithms and associated functions*. North Holland, New York, 1981.

**[LM18]** Mark L. Lewis and Joshua Maglione. Enumerating isoclinism classes of semi-extraspecial groups. 2018. [arXiv:1806.10511](https://arxiv.org/abs/1806.10511).

**[Li02]** Huishi Li. *Noncommutative Gröbner Bases and Filtered-Graded Transfer*. Volume 1795 of Lecture Notes in Math. Springer-Verlag, Berlin–Heidelberg–New York, 2002. ISBN 3-540-44196-4.

**[LOBrien07]** Martin Liebeck and E.A. O'Brien. Finding the characteristic of a group of lie type. *J. London Math. Soc.*, 75():741–754, 2007.

**[LOBrien16]** Martin Liebeck and E.A. O'Brien. Recognition of finite exceptional groups of lie type. *Trans. Amer. Math. Soc.*, 368:6189–6226, 2016.

**[Lig75]** G. Ligozat. Courbes modulaires de genre 1. *Bull. Soc. Math. France (Suppl.), Memoire 43*, 1975.

**[Lin05]** Mark Lingham. *Modular forms and elliptic curves over imaginary quadratic fields*. PhD thesis, University of Nottingham, 2005. \biburl http://etheses.nottingham.ac.uk/138/.

**[Lit94a]** P. Littelmann. A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras. *Invent. Math.*, 116(1-3):329–346, 1994.

**[Lit94b]** P. Littelmann. A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras. *Invent. Math.*, 116(1-3):329–346, 1994.

**[Lit95]** P. Littelmann. Paths and root operators in representation theory. *Ann. of Math. (2)*, 142(3):499–525, 1995.

**[Lit98]** P. Littelmann. Cones, crystals, and patterns. *Transform. Groups*, 3(2):145–179, 1998.

**[Lit40]** D. E. Littlewood. *The Theory of Group Characters and Matrix Representations of Groups*. Clarendon Press (Oxford), 1940.

**[Lit58]** D. E. Littlewood. Products and plethysms of characters with orthogonal, symplectic and symmetric groups. *Canad. J. Math*, 10:17–32, 1958.

**[Lo98]** Eddie H. Lo. Finding intersections and normalizers in finitely generated nilpotent groups. *J. Symbolic Comput.*, 25(1):45–59, 1998.

**[Loe08]** David Loeffler. Explicit calculations of automorphic forms for definite unitary groups. *LMS J. Comput. Math.*, 11:326–342, 2008. URL: [https://doi.org/10.1112/S1461157000000620](https://doi.org/10.1112/S1461157000000620), [doi:10.1112/S1461157000000620](https://doi.org/10.1112/S1461157000000620).

**[LW]** David Loeffler and Jared Weinstein. On the computation of local components of a newform. preprint.

**[Lor16]** D. Lorch. *Einklassige Geschlechter orthogonaler Gruppen*. PhD thesis, RWTH Aachen University, 2016.

**[Lor89]** P. Lorimer. The construction of tutte's $8$-cage and the conder graph. *J. of Graph Theory*, 13(5):553–557, 1989.

**[Lou01]** Pertti Lounesto. *Clifford algebras and spinors*. Volume 286 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, second edition, 2001. ISBN 0-521-00551-5. URL: [http://dx.doi.org/10.1017/CBO9780511526022](http://dx.doi.org/10.1017/CBO9780511526022), [doi:10.1017/CBO9780511526022](https://doi.org/10.1017/CBO9780511526022).

**[LT24]** Andrea Lucchini and Dhara Thakkar. The minimum generating set problem. *J. Algebra*, 640:117–128, 2024. URL: [https://doi.org/10.1016/j.jalgebra.2023.11.012](https://doi.org/10.1016/j.jalgebra.2023.11.012), [doi:10.1016/j.jalgebra.2023.11.012](https://doi.org/10.1016/j.jalgebra.2023.11.012).

**[Luk93]** E.M. Luks. Permutation groups and polynomial-time computation. In *Groups and computation (New Brunswick, NJ, 1991)*, volume 11 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 139–175. Amer. Math. Soc., 1993.

**[LS97]** Eugene M. Luks and Akos Seress. Computing the fitting subgroup and solvable radical of small-base permutation groups in nearly linear time. In *Groups and computation II(New Brunswick, NJ, 1995)*, volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 169–181. Amer. Math. Soc., 1997.

**[Lus90]** G. Lusztig. Quantum groups at roots of $1$. *Geom. Dedicata*, 35(1-3):89–113, 1990.

**[Lus92]** G. Lusztig. Introduction to quantized enveloping algebras. In *New developments in Lie theory and their applications (Córdoba, 1989)*, pages 49–65. Birkhäuser Boston, Boston, MA, 1992.

**[Lus93]** G. Lusztig. *Introduction to quantum groups*. Birkhäuser Boston Inc., Boston, MA, 1993.

**[Lus96]** G. Lusztig. Braid group action and canonical bases. *Adv. Math.*, 122(2):237–261, 1996.

**[LubeckMOBrien07]** F Lübeck, K Magaard, and E.A. O'Brien. Constructive recognition of $\sl _3(q)$. *J. Algebra*, 2007:617–633, 2007.

**[Lubeck02]** F. Lübeck. On the computation of elementary divisors of integer matrices. *J. Symbolic Comp.*, 33:57–65, 2002.

**[MEFW]** D. Leemans M. E. Fernandes and A. I. Weiss. Highly symmetric hypertopes. Preprint, arXiv:1604.03162.

**[MFNVL04]** E.A. O'Brien M.F. Newman and M.R. Vaughan-Lee. Groups and nilpotent lie rings whose order is the sixth power of a prime. *J. Algebra*, 278:383–401, 2004.

**[MullerS16]** J.S. Müller and M. Stoll. Canonical heights on genus two Jacobians. *Algebra & Number Theory*, 10:2153–2234, 2016. \biburl https://doi.org/10.2140/ant.2016.10.2153. [doi:10.2140/ant.2016.10.2153](https://doi.org/10.2140/ant.2016.10.2153).

**[MullerQS99]** Jörg Müller-Quade and Rainer Steinwandt. Basic algorithms for rational function fields. *J. Symbolic Comp.*, 27(2):143–170, 1999. [doi:http://dx.doi.org/10.1006/jsco.1998.0246](https://doi.org/http://dx.doi.org/10.1006/jsco.1998.0246).

**[Maa09]** Lukas Maas. On a construction of the basic spin representations of symmetric groups. https://arxiv.org/abs/0911.3794, 2009.

**[Maa41]** H. Maass. Modulformen und quadratische formen über dem quadratischen zahlkörper $r(\sqrt 5)$. *Math. Ann.*, 118:65–84, 1941.

**[Mac95]** I. G. Macdonald. *Symmetric functions and Hall polynomials*. The Clarendon Press Oxford University Press, New York, second edition, 1995. ISBN 0-19-853489-2. With contributions by A. Zelevinsky, Oxford Science Publications.

**[MS78]** F.J. MacWilliams and N.J.A. Sloane. *The Theory of Error-Correcting Codes*. North Holland, New York, 1978. ISBN 0-444-850090.

**[Mae90a]** T. Maeda. On the invariant fields of binary octavics. *Hiroshima Math. J.*, 20:619–632, 1990.

**[Mae90b]** Takashi Maeda. On the invariant field of binary octavics. *Hiroshima Mathematical Journal*, 20(3):619–632, 1990.

**[MSSVolklein02]** K. Magaard, T. Shaska, S. Shpectorov, and H. Völklein. The locus of curves with prescribed automorphism group. *Sūrikaisekikenkyūsho Kōkyūroku*, pages 112–141, 2002. Communications in arithmetic fundamental groups (Kyoto, 1999/2001).

**[MOBrienAkosS08]** Kay Magaard, E. A. O'Brien, and Ákos Seress. Recognition of small dimensional representations of general linear groups. *J. Austral. Math. Soc.*, 85:229–250, 2008.

**[MKS76]** Wilhelm Magnus, Abraham Karrass, and Donald Solitar. *Combinatorial group theory*. Dover Publications Inc., New York, revised edition, 1976. Presentations of groups in terms of generators and relations.

**[MS17]** Rusydi H. Makarim and Marc Stevens. M4GB: an efficient gröbner-basis algorithm. In Michael A. Burr, Chee K. Yap, and Mohab Safey El Din, editors, *Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017*, 293–300. ACM, 2017. URL: [https://doi.org/10.1145/3087604.3087638](https://doi.org/10.1145/3087604.3087638), [doi:10.1145/3087604.3087638](https://doi.org/10.1145/3087604.3087638).

**[Malcprimecev63]** A. I. Mal\cprime cev. *Foundations of linear algebra*. Translated from the Russian by Thomas Craig Brown; edited by J. B. Roberts. W. H. Freeman & Co., San Francisco, Calif.-London, 1963.

**[Man86]** Yu. I. Manin. *Cubic Forms (2nd ed.)*. North-Holland Publishing Co., Amsterdam, 1986. Vol. 4 of North-Holland Mathematical Library.

**[Mar95]** G. Marsaglia. Diehard: a battery of tests of randomness. \biburl http://stat.fsu.edu/pub/diehard/, 1995.

**[Mar00]** G. Marsaglia. The monster, a random number generator with period over $10^2857$ times as long as the previously touted longest-period one. Preprint, 2000.

**[Mar92]** George Marsaglia. The mathematics of random number generators. In *The unreasonable effectiveness of number theory (Orono, ME, 1991)*, volume 46 of Proc. Sympos. Appl. Math., pages 73–90. Amer. Math. Soc., Providence, RI, 1992. URL: [http://dx.doi.org/10.1090/psapm/046/1195842](http://dx.doi.org/10.1090/psapm/046/1195842).

**[MZ91]** George Marsaglia and Arif Zaman. A new class of random number generators. *Ann. Appl. Probab.*, 1(3):462–480, 1991.

**[Mar20]** Stefano Marseglia. Computing the ideal class monoid of an order. *J. Lond. Math. Soc. (2)*, 101(3):984–1007, 2020. URL: [https://doi.org/10.1112/jlms.12294](https://doi.org/10.1112/jlms.12294), [doi:10.1112/jlms.12294](https://doi.org/10.1112/jlms.12294).

**[Mar24]** Stefano Marseglia. Cohen-Macaulay type of orders, generators and ideal classes. *J. Algebra*, 658:247–276, 2024. URL: [https://doi.org/10.1016/j.jalgebra.2024.05.051](https://doi.org/10.1016/j.jalgebra.2024.05.051), [doi:10.1016/j.jalgebra.2024.05.051](https://doi.org/10.1016/j.jalgebra.2024.05.051).

**[Mar25]** Stefano Marseglia. Local isomorphism classes of fractional ideals of orders in étale algebras. *J. Algebra*, 673:77–102, 2025. URL: [https://doi.org/10.1016/j.jalgebra.2025.02.030](https://doi.org/10.1016/j.jalgebra.2025.02.030), [doi:10.1016/j.jalgebra.2025.02.030](https://doi.org/10.1016/j.jalgebra.2025.02.030).

**[MW06]** P. Martin and M. Watkins. Symmetric powers of elliptic curve $l$-functions. In F. Hess, S. Pauli, and M. Pohst, editors, *Algorithmic Number Theory*, volume 4076 of Lecture Notes in Computer Science, 377–392. Springer, 2006.

**[Mat89]** H. Matsumura. *Commutative ring theory*. CUP, ACUP, 1989.

**[May03]** Alexander May. *New RSA Vulnerabilities Using Lattice Reduction Methods*. Dissertation, University of Paderborn, 2003.

**[MST06]** B. Mazur, W. Stein, and J. Tate. Computation of $p$-adic heights and log convergence. *Documenta Mathematica*, Extra:577–614, 2006.

**[MT91]** B. Mazur and J. Tate. The p-adic sigma function. *Duke Math Journal*, 62(3):663–688, 1991.

**[Maz77]** Barry Mazur. Modular curves and the Eisenstein ideal. *Inst. Hautes Études Sci. Publ. Math.*, 47:33–186 (1978), 1977.

**[McKa]** **missing title in bdm_nauty_page**

**[McKb]** B. D. McKay. \tt nauty User's Guide (Version 2.2). \biburl http://cs.anu.edu.au/˜bdm/nauty/nug.pdf.

**[McK81]** B. D. McKay. Practical Graph Isomorphism. *Congressus Numerantium*, 30:45–87, 1981.

**[McK98]** B. D. McKay. Isomorph-free exhaustive generation. *J. Algorithms*, 26:306–324, 1998.

**[MP]** B. D. McKay and A. Piperno. \tt nauty and \tt Traces User's Guide (Version 2.6). \biburl http://pallini.di.uniroma1.it/nug26.pdf.

**[MT10]** Stephen Meagher and Jaap Top. Twists of genus three curves over finite fields. *Finite Fields Appl.*, 16(5):347–368, 2010.

**[MNeubuser89]** M. Mecky and J. Neubüser. Some remarks on the computation of conjugacy classes of soluble groups. *Bull. Austral, Math. Soc.*, 40(2):281–292, 1989.

**[Men93]** A. Menezes. *Elliptic curve public key cryptosystems*. Kluwer, Boston, 1993.

**[MOV97]** A. Menezes, Van Oorschot, and P. Vanstone. *Handbook of Applied Cryptography*. CRC Press, Boca Raton, 1997.

**[Mer93]** Loic Merel. Intersections sur des courbes modulaires. *Manuscripta Math.*, 80(3):283–289, 1993.

**[Mer94]** Loic Merel. Universal Fourier expansions of modular forms. In *On Artin's conjecture for odd 2-dimensional representations*, 59–94. Springer, 1994.

**[MSS96]** J. R. Merriman, S. Siksek, and N. P. Smart. Explicit $4$-descents on an elliptic curve. *Acta Arith.*, 77(4):385–404, 1996.

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

**[Mes91]** J.-F. Mestre. Construction de courbes de genre $2$ à partir de leurs modules. In T. Mora and C. Traverso, editors, *Effective methods in algebraic geometry*, volume 94 of Progr. Math., 313–334. Birkhäuser, 1991. Proc. Congress in Livorno, Italy, April 17–21, 1990.

**[Mes86b]** Jean-Francois Mestre. La méthode des graphes. Exemples et applications. *Proceedings of the international conference on class numbers and fundamental units of algebraic number fields (Katata)*, pages 217–242, 1986.

**[MG02]** Daniele Micciancio and Shafi Goldwasser. *Complexity of lattice problems: a cryptographic perspective*. Volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, 2002. ISBN 0-7923-7688-9.

**[Mil69]** John Milnor. On isometries of inner product spaces. *Invent. Math.*, 8:83–97, 1969.

**[Min13]** Moritz Minzlaff. *Frobenius-stable lattices in rigid cohomology of curves*. Dissertation, Technische Universität Berlin, 2013. URL: [http://dx.doi.org/10.14279/depositonce-3566](http://dx.doi.org/10.14279/depositonce-3566).

**[MN17]** Pascal Molin and Christian Neurohr. Computing period matrices and the abel-jacobi map of superelliptic curves. *Mathematics of Computation*, Dec 2017. URL: [http://dx.doi.org/10.1090/mcom/3351](http://dx.doi.org/10.1090/mcom/3351), [doi:10.1090/mcom/3351](https://doi.org/10.1090/mcom/3351).

**[Mon92]** Peter Lawrence Montgomery. *An FFT Extension of the Elliptic Curve Method of Factorization*. PhD thesis, University of California, Los Angeles, 1992.

**[MP82]** R. V. Moody and J. Patera. Fast recursion formula for weight multiplicities. *Bull. Amer. Math. Soc. (N.S.)*, 7(1):237–242, 1982. URL: [https://doi.org/10.1090/S0273-0979-1982-15021-2](https://doi.org/10.1090/S0273-0979-1982-15021-2), [doi:10.1090/S0273-0979-1982-15021-2](https://doi.org/10.1090/S0273-0979-1982-15021-2).

**[Mor94]** Teo Mora. An introduction to commutative and noncommutative gröbner bases. *Theoretical Computer Science*, 134:134–173, 1994.

**[Mor95]** F. Morain. Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmiques. *J. Théorie des Nombres de Bordeaux*, 7:255–282, 1995.

**[MY73]** J. Moses and D.Y.Y. Yun. The ez gcd algorithm. *Proc. ACM Annual Conference*, 73(2):159–166, 1973.

**[Mui60]** Thomas Muir. *A treatise on the theory of determinants*. Dover Publications Inc., New York, 1960.

**[Mum84]** David Mumford. *Tata Lectures on Theta II*. Volume 43 of Progress in Mathematics. Birkhäuser, 1984.

**[Mur58]** F. D. Murnaghan. The orthogonal and symplectic groups. *Comm. Dublin Inst. Adv. Studies. Ser. A, no.*, 13:146, 1958.

**[Mur99]** Brian Murphy. *Polynomial selection for the number field sieve integer factorisation algorithm*. PhD thesis, Oxford University, 1999. \biburl http://web.comlab.ox.ac.uk/oucl/work/richard.brent/ftp/Murphy-thesis.ps.gz.

**[MOBrien95]** Scott H. Murray and E. A. O'Brien. Selecting base points for the Schreier-Sims algorithm for matrix groups. *J. Symbolic Comp.*, 6:577–584, 1995.

**[MPW]** W. Myrvold, T. Prsa, and N. Walker. A dynamic programming approach for timing and designing clique algorithms. available at \biburl http://www.csr.uvic.ca/˜wendym/.

**[Moller88]** H.M. Möller. On the construction of gröbner bases using syzygies. *J. Symbolic Comp.*, 6:345–359, 1988.

**[Muller10a]** Jan Steffen Müller. *Computing canonical heights on Jacobians*. PhD Thesis, Universität Bayreuth, 2010. available at \biburl http://www.math.uni-hamburg.de/home/js.mueller/.

**[Muller10b]** Jan Steffen Müller. Explicit kummer surface formulas for arbitrary characteristic. *LMS J. Comput. Math.*, 4:47–64, 2010.

**[MullerQB99]** Jörg Müller-Quade and Thomas Beth. Calculating generators for invariant fields of linear algebraic groups. In *Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Honolulu, HI, 1999)*, number 1719 in LNCS, 392–403. Berlin, 1999. Springer.

**[Nag28]** Trygve Nagell. Sur les propriétés arithmétiques des cubiques planes du premier genre. *Acta Math.*, 52:93–126, 1928.

**[Nag69]** Trygve Nagell. Sur un type particuliar d'unités algebriqués. *Ark. Mat.*, 8:163–184, 1969.

**[Nar14]** Enric Nart. Local computation of differents and discriminants. *Math. Comp.*, 83:1513–1534, 2014. [doi:10.1090/S0025-5718-2013-02754-8](https://doi.org/10.1090/S0025-5718-2013-02754-8).

**[Naz87]** John Lawrence Nazareth. *Computer Solution of Linear Programs*. Oxford University Press, 1987.

**[Neb96]** G. Nebe. Finite subgroups of $\rm GL_n(\bf Q)$ for $25\leq n\leq 31$. *Comm. Algebra*, 24(7):2341–2397, 1996.

**[Neb98]** G. Nebe. Finite quaternionic matrix groups. *Represent. Theory*, 2:106–223, 1998.

**[NP95]** G. Nebe and W. Plesken. Finite rational matrix groups. *Mem. Amer. Math. Soc.*, 1995.

**[NS01a]** G. Nebe and N.J.A. Sloane. The catalogue of lattices. \biburl http://www.research.att.com/∼njas/lattices/, 2001.

**[NS01b]** Gabriele Nebe and Neil J.A. Sloane. A Catalogue of Lattices. \biburl http://akpublic.research.att.com/∼njas/lattices/index.html, 2001.

**[NW88]** G.L. Nemhauser and Laurence A. Wolsey. *Integer and Combinatorial Optimization*. John Wiley & Sons, Inc., 1988.

**[Neu86]** P.M. Neumann. Some algorithms for computing with finite permutation groups. In C.M. Campbell E.F. Robertson, editor, *Groups - St. Andrews 1985*, number 121 in London Math. Soc. Lecture Notes Series. 1986.

**[Neu75]** Peter M. Neumann. Primitive permutation groups containing a cycle of prime-power length. *Bull. London Math. Soc.*, 7(3):298–299, 1975.

**[NP92]** Peter M. Neumann and Cheryl E. Praeger. A recognition algorithm for classical groups. *Proc. London Math. Soc.*, 65(3):555–603, 1992.

**[Neu99]** W.D. Neumann. Irregular links at infinity of complex affine plane curves. *Quart. J. Math. Ox. Ser. (2)*, 50:301–320, 1999.

**[NeunhofferS06]** Max Neunhöffer and Ákos Seress. A data structure for a uniform approach to computations with finite groups. In *ISSAC 2006*, pages 254–261. ACM, New York, 2006.

**[Neu18]** Christian Neurohr. *Efficient integration on Riemann surfaces & applications*. Dissertation, Carl von Ossietzky Universität Oldenburg, 2018. URL: [http://oops.uni-oldenburg.de/3607](http://oops.uni-oldenburg.de/3607).

**[New51]** M. J. Newell. Modification rules for the orthogonal and symplectic groups. *Proc. Royal Irish Acad. Section A*, 54:153–163, 1951.

**[NOBrien96]** M. F. Newman and E. A. O'Brien. Application of computers to questions like those of Burnside. II. *Internat. J. Algebra Comput.*, 6(5):593–605, 1996.

**[New77]** M.F. Newman. Determination of groups of prime-power order. In *Group Theory (Canberra, 1975)*, volume 573 of Lecture Notes in Mathematics, pages 73–84. Springer-Verlag, Berlin-Heidelberg-New York, 1977.

**[New12]** Rachel Newton. Explicit local reciprocity for tame extensions. *Math. Proc. Cambridge Philos. Soc.*, 152(3):425–454, 2012.

**[NStehle]** **missing booktitle in NguyenStehle06**

**[NStehle05]** Phong Nguyen and Damien Stehlé. Floating-point LLL revisited. In *Advances in Cryptology—EuroCrypt 2005*, volume 3494 of LNCS, 215–233. Springer-Verlag, 2005.

**[NStehle09a]** Phong Nguyen and Damien Stehlé. An LLL algorithm with quadratic complexity. *SIAM Journal on Computing*, 39(3):874–903, 2009.

**[NStehle09b]** Phong Q. Nguyen and Damien Stehlé. Low-dimensional lattice basis reduction revisited. *ACM Trans. Algorithms*, 5(4):Art. 46, 48, 2009. URL: [https://doi.org/10.1145/1597036.1597050](https://doi.org/10.1145/1597036.1597050), [doi:10.1145/1597036.1597050](https://doi.org/10.1145/1597036.1597050).

**[NStehle09c]** Phong Q. Nguyen and Damien Stehlé. Low-dimensional lattice basis reduction revisited. *ACM Trans. Algorithms*, 5(4):Art. 46, 48, 2009. URL: [https://doi.org/10.1145/1597036.1597050](https://doi.org/10.1145/1597036.1597050), [doi:10.1145/1597036.1597050](https://doi.org/10.1145/1597036.1597050).

**[Nic96]** Werner Nickel. Computing nilpotent quotients of finitely presented groups. In *Geometric and computational perspectives on infinite groups (Minneapolis, MN and New Brunswick, NJ, 1994)*, pages 175–191. Amer. Math. Soc., Providence, RI, 1996.

**[Nie05]** Alice C. Niemeyer. Constructive recognition of normalisers of small extra-special matrix groups. *Internat. J. Algebra Comput.*, 15:367–394, 2005.

**[NP97]** Alice C. Niemeyer and Cheryl E. Praeger. Implementing a recognition algorithm for classical groups. In *Groups and computation II (New Brunswick, NJ, 1995)*, volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 273–296. Amer. Math. Soc., 1997.

**[NP98]** Alice C. Niemeyer and Cheryl E. Praeger. A recognition algorithm for classical groups over finite fields. *Proc. London Math. Soc.*, 77(3):117–169, 1998.

**[NP99]** Alice C. Niemeyer and Cheryl E. Praeger. A recognition algorithm for non-generic classical groups over finite fields. *J. Austral. Math. Soc. Ser. A*, 67:223–253, 1999.

**[OBrien90]** E.A. O'Brien. The $p$-group generation algorithm. *J. Symbolic Comput.*, 9:677–698, 1990.

**[OBrien91]** E.A. O'Brien. The groups of order 256. *J. Algebra*, 143:219–235, 1991.

**[OBrien94]** E.A. O'Brien. Isomorphism testing for $p$-groups. *J. Symbolic Comp.*, 17:133–147, 1994.

**[OBrien06]** E.A. O'Brien. Towards effective algorithms for linear groups. In *Finite Geometries, Groups and Computation*, volume of, 163–190. De Gruyer, 2006.

**[OBrien11]** E.A. O'Brien. Algorithms for matrix groups. In *Groups St Andrews (Bath)*, volume 388 of LMS Lecture Notes, 297–323. Cambridge University Press, 2011.

**[OBrienVL05]** E.A. O'Brien and M.R. Vaughan-Lee. The groups with order $p^7$ for odd prime $p$. *J. Algebra*, 2005.

**[OBrienW05]** E.A. O'Brien and R.A. Wilson. Subgroup chains in matrix groups. *preprint*, ():, 2005.

**[OMeara73]** O. T. O'Meara. *Introduction to Quadratic Forms*. Springer, 1973.

**[Oda88]** Tadao Oda. *Convex bodies and algebraic geometry*. Volume 15 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]. Springer-Verlag, Berlin, 1988. ISBN 3-540-17600-4. An introduction to the theory of toric varieties, Translated from the Japanese.

**[Ogg74]** A. Ogg. Hyperelliptic modular curves. *Bull. Soc. Math. France*, 228:449–462, 1974.

**[Ohn07]** T. Ohno. The graded ring of invariants of ternary quartics I. 2007. Unpublished.

**[Opg01]** J. Opgenorth. Dual cones and the voronoi algorithm. *Exp. Math.*, 10(4):599–608, 2001.

**[OPS98]** J. Opgenorth, W. Plesken, and T. Schulz. Crystallographic algorithms and tables. *Acta Crystallographica*, A54:517–531, 1998.

**[OH68]** W. Orchard–Hays. *Advanced linear–programming computing techniques*. McGraw–Hill, 1968.

**[PGS00]** F. Heß P. Gaudry and N. P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. *J. Cryptology*, 15(1):19–46, 2000.

**[PetermannRemy06]** Y.-F. S. Pétermann and Jean-Luc Rémy. Arbitrary precision error analysis for computing $\zeta (s)$ with the Cohen-Olivier algorithm: complete description of the real case and preliminary report on the general case. Research Report 5852, INRIA, 2006. \biburl http://www.inria.fr/rrrt/rr-5852.html.

**[Pap03]** S. Papadakis. Kustin–Miller unprojection with complexes. *J. Algebraic Geometry*, 2003.

**[Pap94]** Paolo Papi. A characterization of a special ordering in a root system. *Proc. Amer. Math. Soc.*, 120(3):661–665, 1994.

**[Pas94]** Antonio Pasini. *Diagram geometries*. Oxford Science Publications. The Clarendon Press Oxford University Press, New York, 1994. ISBN 0-19-853497-3.

**[PR01]** S. Pauli and X.-F. Roblot. On the computation of all extensions of a $p$-adic field of a given degree. *Math. Comp.*, 70(236):1641–1659, 2001.

**[Pau96]** Sebastian Pauli. Zur Berechnung von Strahlklassengruppen. Master's thesis, Technische Universität Berlin, 1996. \biburl http://www.math.tu-berlin.de/˜kant/publications/diplom/pauli.ps.gz.

**[Pau01a]** Sebastian Pauli. *Efficient Enumeration of Extensions of Local Fields with Bounded Discriminant*. PhD thesis, Concordia University, 2001.

**[Pau01b]** Sebastian Pauli. Factoring polynomials over local fields. *Journal of Symbolic Computation*, 32(5):533–547, 2001.

**[Pau06]** Sebastian Pauli. Constructing class fields over local fields. *J. Théorie des Nombres de Bordeaux*, 18(3):627–652, 2006.

**[PKluners05]** Sebastian Pauli and Jüren Klüners. Computing residue class rings and Picard groups of orders. *J. of Algebra*, 292:47–64, 2005.

**[Pau98]** Sachar Paulus. Lattice basis reduction in function fields. In *In ANTS-3 : Algorithmic*, 567–575. Springer-Verlag, 1998.

**[Pay06]** Stanley E. Payne. Finite groups that admit Kantor families. In *Finite geometries, groups, and computation*, pages 191–202. Walter de Gruyter, Berlin, 2006.

**[PJPV11]** J. Pernas, J. Pujol, and M. Villanueva. On the permutation automorphism group of quaternary linear hadamard codes. In *Proceedings of 3rd International Castle Meeting on Coding Theory and Applications, Cardona (Spain), September 11-15*, 213–218. 2011.

**[PJPV14]** J. Pernas, J. Pujol, and M. Villanueva. Characterization of the automorphism group of quaternary linear hadamard codes. *Designs, Codes and Cryptography*, 70(1-2):105–115, 2014.

**[Piz80]** A. Pizer. An algorithm for computing modular forms on $\Gamma _0(N)$. *Journal of Algebra*, 64:340–390, 1980.

**[PF09]** W. Plesken and A. Fabianska. An l2-quotient algorithm for finitely presented groups. *J. Algebra*, 322(3):914–935, 2009.

**[Ple74]** Wilhelm Plesken. *Beiträge zur Bestimmung der endlichen irreduziblen Untergruppen von GL(n,Z) und ihrer ganzzahligen Darstellungen*. PhD thesis, RWTH Aachen, 1974.

**[Ple85]** Wilhelm Plesken. Finite unimodular groups of prime degree and circulants. *J. Algebra*, 97:286–312, 1985.

**[PP77]** Wilhelm Plesken and Michael Pohst. On maximal finite irreducible subgroups of gl(n,z). parts i and ii. *Math. Comp.*, 31:536–576, 1977.

**[PP80]** Wilhelm Plesken and Michael Pohst. On maximal finite irreducible subgroups of gl(n,z). parts iii-v. *Math. Comp.*, 34(149):245–301, 1980.

**[PS97a]** Wilhelm Plesken and Bernd Souvignier. Computing isometries of lattices. *J. Symbolic Comp.*, 24(3):327–334, 1997.

**[PH78]** S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over gf($p$) and its cryptographic significance. *IEEE Trans. Inform. Theory*, 24:106–110, 1978.

**[Poh93]** M. Pohst. *Computational Algebraic Number Theory*. DMV Seminar Band 21. Birkhäuser Verlag, Basel - Boston - Berlin, 1993.

**[Poh87]** Michael Pohst. A modification of the LLL reduction algorithm. *J. Symbolic Comp.*, 4(1):123–127, 1987.

**[Poh]** **missing booktitle in Po64**

**[PZ89]** Michael E. Pohst and Hans Zassenhaus. *Algorithmic Algebraic Number Theory*. Encyclopaedia of mathematics and its applications. Cambridge University Press, Cambridge, 1989.

**[PS97b]** Bjorn Poonen and Ed Schaefer. Explicit descent for jacobians of cyclic covers of the projective line. *J. Reine Angew. Math.*, 488:141–188, 1997.

**[PS99]** Bjorn Poonen and Michael Stoll. The Cassels-Tate pairing on polarized abelian varieties. *Ann. of Math. (2)*, 150(3):1109–1149, 1999.

**[PP05]** **missing journal in HJContinuedFraction1**

**[Pra99]** Cheryl E. Praeger. Primitive prime divisor elements in finite classical groups. In *Proc. of Groups St. Andrews 1997 in Bath II*, number 261 in London Math. Soc. Lecture Notes Series, 605–623. Cambridge Univ. Press, 1999.

**[Pro]** The SPACES Project. MPFR, a LGPL-library for multiple-precision floating-point computations with exact rounding. \biburl http://www.mpfr.org/.

**[PRifaSoloveva07]** **missing publisher in PRS07**

**[PRifaSoloveva09]** J. Pujol, J. Rifà, and F. I. Solov'eva. Construction of $\z _4$-linear reed-muller codes. *IEEE Trans. on Information Theory*, 55(1):99–104, 2009.

**[PStehle08]** Xavier Pujol and Damien Stehlé. Rigorous and efficient short lattice vectors enumeration. In *Advances in Cryptology—AsiaCrypt 2008*, LNCS. Springer, 2008.

**[Que09]** Jordi Quer. Fields of definition of building blocks. *Math. Comp.*, 78(265):537–554, 2009.

**[RRee57]** R.Ree. On some simple groups defined by chevalley. *Trans. Am. Math. Soc.*, 84:392–400, 1957.

**[RTornaria20]** Gustavo Rama and Gonzalo Tornaría. Computation of paramodular forms. In *ANTS XIV—Proceedings of the Fourteenth Algorithmic Number Theory Symposium*, volume 4 of Open Book Ser., 353–370. Math. Sci. Publ., Berkeley, CA, 2020. URL: [https://doi.org/10.2140/obs.2020.4.353](https://doi.org/10.2140/obs.2020.4.353), [doi:10.2140/obs.2020.4.353](https://doi.org/10.2140/obs.2020.4.353).

**[Ram]** Colin Ramsay. Ace. \biburl https://staff.itee.uq.edu.au/havas/.

**[RS00]** Kristian Ranestad and Frank-Olaf Schreyer. Varieties of sums of powers. *J. Reine Angew. Math.*, 525:147–181, 2000. URL: [http://dx.doi.org/10.1515/crll.2000.064](http://dx.doi.org/10.1515/crll.2000.064), [doi:10.1515/crll.2000.064](https://doi.org/10.1515/crll.2000.064).

**[Rei83]** Miles Reid. Decomposition of toric morphisms. In *Arithmetic and geometry, Vol. II*, volume 36 of Progr. Math., pages 395–418. Birkhäuser Boston, Boston, MA, 1983.

**[Rei88]** Miles Reid. *Undergraduate Algebraic Geometry*. CUP, Cambridge, 1988.

**[Rei97]** Miles Reid. Chapters on algebraic surfaces. In J. Kollár, editor, *Complex algebraic varieties, IAS/Park City Mathematics Series 3*, pages 1 – 154. AMS, Providence R.I., 1997.

**[Rei00]** Miles Reid. Graded rings and birational geometry. In K. Ohno, editor, *Proc. of algebraic geometry symposium (Kinosaki)*, pages 1 – 72. 2000.

**[Rei03]** Irving Reiner. *Maximal Orders*. Volume 28 of LMS Monographs. Oxford University Press, 2003.

**[Ric73]** J.S. Richardson. Group: a computer system for group-theoretic calculations. Master's thesis, Department of Pure Mathematics, University of Sydney, September 1973.

**[Rob07]** David Roberts. *Explicit Descent On Elliptic Curves Over Function Fields*. PhD thesis, University of Nottingham, 2007.

**[Roh]** **missing year in rohrlich-PCMI**

**[Roh11]** D. E. Rohrlich. Root numbers. In K. Rubin C. Popescu and A. Silverberg, editors, *Arithmetic of $L$-functions*, volume 18 of IAS / Park City Math. Ser., pages 353–448. Amer. Math. Soc., 2011.

**[RD04]** Colva M. Roney-Dougal. Conjugacy of subgroups of the general linear group. *Experiment. Math.*, 13:151–163, 2004.

**[RD05]** Colva M. Roney-Dougal. The primitive permutation groups of degree less than 2500. *J. Algebra*, 292(1):154–183, 2005.

**[RDU03]** Colva M. Roney-Dougal and William R. Unger. The affine primitive permutation groups of degree less than 1000. *J. Symbolic Comp.*, 35:421–439, 2003.

**[Roo10]** D.A. Roozemond. *Algorithms for Lie algebras of algebraic groups*. PhD thesis, Technische Universiteit Eindhoven, 2010.

**[Roo11]** Dan Roozemond. On Lie algebras generated by few extremal elements. *J. Algebra*, 348:462–476, 2011.

**[Ros60]** Luigi Antonio Rosati. Su una generalizzazione dei piani di Hughes. *Atti Accad. Naz. Lincei Rend. Cl. Sci. Fis. Mat. Nat. (8)*, 29:303–308 (1961), 1960.

**[Ros10]** T. Rossmann. Irreducibility testing of finite nilpotent linear groups. *J. Algebra*, 324:1114–1124, 2010.

**[Ros11]** T. Rossmann. Primitivity testing of finite nilpotent linear groups. *LMS JCM*, 14:87–98, 2011.

**[Rou98]** Raphaël Rouquier. Weyl groups, affine Weyl groups and reflection groups. In *Representations of reductive groups*, pages 21–39. Cambridge Univ. Press, Cambridge, 1998.

**[RS95]** K. Rubin and A. Silverberg. Families of elliptic curves with constant mod $p$ representations. In *Elliptic curves, modular forms, & Fermat's last theorem (Hong Kong, 1993)*, Ser. Number Theory, I, pages 148–161. Internat. Press, Cambridge, MA, 1995.

**[RT98]** L.J. Rylands and D.E. Taylor. Matrix generators for the orthogonal groups. *J. Symbolic Comp.*, 25:351–360, 1998.

**[SD74]** Bernard Saint-Donat. Projective Models of K-3 Surfaces. *Am. Jour. Math.*, 96(4):602–639, 1974.

**[Sal79]** G. Salmon. *A Treatise on the Higher Plane Curves*. Hodges, Foster and Co, Dublin, 3rd edition, 1879.

**[Sal58]** George Salmon. *A treatise on the analytic geometry of three dimensions*. Revised by R. A. P. Rogers. 7th ed. Vol. 1. Edited by C. H. Rowe. Chelsea Publishing Company, New York, 1958.

**[Sat71]** I. Satake. *Classification theory of semi-simple algebraic groups*. Marcel Dekker Inc., New York, 1971. With an appendix by M. Sugiura, Notes prepared by Doris Schattschneider, Lecture Notes in Pure and Applied Mathematics, 3.

**[SS98]** Roberto La Scala and Michael Stillman. Strategies for computing minimal free resolutions. *J. Symbolic Comp.*, 26(4):409–431, 1998.

**[SS04]** Edward F. Schaefer and Michael Stoll. How to do a $p$-descent on an elliptic curve. *Trans. Amer. Math. Soc.*, 356(3):1209–1231 (electronic), 2004.

**[Sch66]** Richard D. Schafer. *An introduction to nonassociative algebras*. Pure and Applied Mathematics, Vol. 22. Academic Press, New York-London, 1966.

**[Sch69]** Doris J. Schattschneider. On restricted roots of semi-simple algebraic groups. *J. Math. Soc. Japan*, 21:94–115, 1969.

**[Sch76]** R. Schertz. Die singularen werte der weberschen funktionen \bf f,$\bf f_1$,$\bf f_2$,$\gamma _2$,$\gamma _3$. *J. reine angew. Math.*, 286/287:46–74, 1976.

**[SS]** J. Schicho and D. Sevilla. Effective radical parametrization of trigonal curves. Preprint: online at arXiv as arXiv:1104.2470v1[math.AG].

**[Sch98]** Josef Schicho. Rational parametrization of surfaces. *J. Symbolic Comput.*, 26(1):1–29, 1998.

**[Sch00a]** Josef Schicho. Proper parametrization of surfaces with a rational pencil. In *Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (St. Andrews)*, 292–300 (electronic). New York, 2000. ACM.

**[Sch90a]** Bernd Schmalz. Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen. *Bayreuther Mathematische Schriften*, 31:109–143, 1990.

**[Sch90b]** G. J. A. Schneider. Dixon's character table algorithm revisited. *J. Symbolic Computation*, 9:601–606, 1990.

**[Sch95]** Bruce Schneier. *Applied Cryptography: Protocols, Algorithms, and Source Code in C*. John Wiley & Sons, 2nd edition, 1995.

**[SE94]** Claus-Peter Schnorr and Michael Euchner. Lattice basis reduction: improved practical algorithms and solving subset sum problems. *Mathematics of Programming*, 66:181–199, 1994.

**[SHorner95]** Claus-Peter Schnorr and Horst Helmut Hörner. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In *Advances in Cryptology—EuroCrypt 1995*, volume 921 of LNCS, 1–12. Springer-Verlag, 1995.

**[ST02]** Frank-Olaf Schreyer and Fabio Tonoli. Needles in a haystack: special varieties via small fields. In Eisenbud and others, editors, *Computations in Algebraic Geometry with Macaulay2*, volume 8 of Springer Algorithms and Computation in Mathematics Series, 251–277. Springer-Verlag, 2002.

**[SP91]** Rainer Schulze-Pillot. An algorithm for computing genera of ternary and quaternary quadratic forms. In Stephen M. Watt, editor, *Proceedings ISSAC'91*, 134–143. Bonn, 1991.

**[Sch00b]** Ruth Schwingel. *Two matrix group algorithms with applications to computing the automorphism group of a finite $p$-group*. PhD thesis, Queen Mary and Westfield College, University of London, 2000.

**[SchonertS94]** M. Schönert and A. Seress. Finding blocks of imprimitivity in small-base groups in nearly linear time. In *Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp.*, 154–157. 1994.

**[Schonhage82]** A. Schönhage. The fundamental theorem of algebra in terms of computational complexity. Technical Report, Univ. Tübingen, 1982.

**[Schonhage71]** Arnold Schönhage. Schnelle berechnung von kettenbruchentwicklungen. *Acta Informatica*, 1:139–144, 1971.

**[Schornig96]** Martin Schörnig. *Untersuchung konstruktiver Probleme in globalen Funktionenkörpen*. Dissertation, Technische Universität Berlin, 1996. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/MS_diss.ps.gz.

**[Ser03]** Ákos Seress. *Permutation Group Algorithms*. Volume 152 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2003. ISBN 0-521-66103-X. URL: [http://dx.doi.org/10.1017/CBO9780511546549](http://dx.doi.org/10.1017/CBO9780511546549), [doi:10.1017/CBO9780511546549](https://doi.org/10.1017/CBO9780511546549).

**[Ser55]** J-P. Serre. Faisceaux algebriques coherents. *Ann. Maths.*, 61:197–278, 1955.

**[Ser71]** J.-P. Serre. Conducteurs d'artin des caractères réels. *Invent. Math.*, 14(3):173–183, 1971.

**[SS77]** J.-P. Serre and H. M. Stark. Modular forms of weight $1/2$. In *Modular functions of one variable, VI (Proc. Second Internat. Conf., Univ. Bonn, Bonn, 1976)*, pages 27–67. Lecture Notes in Math., Vol. 627. Springer, Berlin, 1977.

**[Ser65]** Jean-Pierre Serre. Zeta and $L$ functions. In *Arithmetical Algebraic Geometry (Proc. Conf. Purdue Univ., 1963)*, pages 82–92. Harper & Row, New York, 1965.

**[Sha95]** I. R. Shafarevich, editor. *Number theory I*. Volume 49 of Encyclopaedia of Mathematical Sciences. Springer-Verlag, Berlin, 1995. Fundamental problems, ideas and theories, A translation of \it Number theory 1 (Russian), Akad. Nauk SSSR, Vsesoyuz. Inst. Nauchn. i Tekhn. Inform., Moscow, 1990, Translation edited by A. N. Parshin and I. R. Shafarevich.

**[SVolklein01]** Tony Shaska and Völklein. *Elliptic subfields and automorphisms of genus $2$ function fields*. Springer, 2001, \biburl http://au.arxiv.org/abs/math.AG/0107142.

**[ST54]** G. C. Shephard and J. A. Todd. Finite unitary reflection groups. *Canadian J. Math.*, 6:274–304, 1954.

**[Shi99]** G. Shimura. An exact mass formula for orthogonal groups. *Duke Math. J.*, 97(1):1–66, 1999. URL: [http://dx.doi.org/10.1215/S0012-7094-99-09701-6](http://dx.doi.org/10.1215/S0012-7094-99-09701-6), [doi:10.1215/S0012-7094-99-09701-6](https://doi.org/10.1215/S0012-7094-99-09701-6).

**[Shi67]** T. Shioda. On the Graded Ring of Invariants of Binary Octavics. *Am. Jour. Math.*, 89(4):1022–1046, 1967.

**[Sho95a]** P. W. Shor. Scheme for reducing decoherence in quantum computer memory. *Phys. Rev. A*, 52:2493–2496, 1995.

**[Sho94]** Peter W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In *35th Annual Symposium on Foundations of Computer Science (Santa Fe, NM, 1994)*, pages 124–134. IEEE Comput. Soc. Press, Los Alamitos, CA, 1994.

**[Sho92]** Mark W. Short. *The Primitive Soluble Permutation Groups of Degree less than 256*. Volume 1519 of Lecture Notes in Math. Springer, Berlin and Heidelberg, 1992.

**[Sho]** Victor Shoup. NTL, Number Theory C++ Library. \biburl http://www.shoup.net/ntl/.

**[Sho95b]** Victor Shoup. A new polynomial factorization algorithm and its im­ple­men­ta­tion. *J. Symbolic Comp.*, 20(4):363–397, 1995.

**[Sie35]** C. L. Siegel. Über die analytische Theorie der quadratischen Formen. *Ann. of Math. (2)*, 36(3):527–606, 1935. URL: [http://dx.doi.org/10.2307/1968644](http://dx.doi.org/10.2307/1968644), [doi:10.2307/1968644](https://doi.org/10.2307/1968644).

**[Sik95]** Samir Siksek. Infinite descent on elliptic curves. *Rocky Mountain J. Math.*, 25(4):1501–1538, 1995.

**[Sil86]** J. Silverman. *The arithmetic of elliptic curves*. Volume 106 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1986.

**[Sim02]** Denis Simon. Solving norm equations in relative number fields using $S$-units. *Math. Comput.*, 71(239):1287–1305, 2002.

**[Sim05a]** Denis Simon. Quadratic equations in dimensions 4, 5 and more. Preprint, \biburl http://www.math.unicaen.fr/˜simon/, 2005.

**[Sim05b]** Denis Simon. Solving quadratic equations using reduced unimodular quadratic forms. *Math. Comp.*, 74(251):1531–1543 (electronic), 2005.

**[Sim70]** C.C. Sims. Computational methods in the study of permutation groups. In J. Leech, editor, *Computational problems in abstract algebra*, 169–183. Oxford - Pergamon, 1970.

**[Sim90]** Charles C. Sims. Computing the order of a solvable permutation group. *J. Symb. Comp.*, 9(5/6):699–705, 1990.

**[Sim94]** Charles C. Sims. *Computation with Finitely Presented Groups*. Cambridge University Press, Cambridge, 1994. ISBN 0-521-43213-8.

**[Sla86]** Michael C. Slattery. Computing character degrees in $p$-groups. *J. Symbolic Comp.*, 2:51–58, 1986.

**[Sla01]** Michael C. Slattery. Computing double cosets in soluble groups. *J. Symbolic Comp.*, 31:179–192, 2001. Computational algebra and number theory (Milwaukee, WI, 1996).

**[Sma97]** N. P. Smart. $S$-unit equations, binary forms and curves of genus $2$. *Proc. London Math. Soc. (3)*, 75(2):271–307, 1997.

**[Smi05]** Benjamin A. Smith. *Explicit endomorphisms and correspondences*. PhD thesis, University of Sydney, 2005. \biburl http://hdl.handle.net/2123/1066.

**[Smi94]** Michael J. Smith. *Computing automorphisms of finite soluble groups*. PhD thesis, Australian National University, 1994.

**[SM85]** Leonhard H. Soicher and John McKay. Computing Galois Groups over the rationals. *J. Number Th.*, 20:273–281, 1985.

**[Solovieva07]** F. I. Soloviéva. On $\z _4$-linear codes with parameters of reed-muller codes. *Problems of Information Transmission*, 43(1):26–32, 2007.

**[SvdV87]** A.J. Sommese and A. van der Ven. On the adjunction mapping. *Math. Ann.*, 278:593–603, 1987.

**[SW17]** Jonathan Sorenson and Jonathan Webster. Strong pseudoprimes to twelve prime bases. *Mathematics of Computation*, 86(304):985–1003, 2017. [doi:10.1090/mcom/3134](https://doi.org/10.1090/mcom/3134).

**[Sou94]** Bernd Souvignier. Irreducible finite integral matrix groups of degree 8 and 10. *Math. Comp.*, 63:335–350, 1994.

**[Spe35]** Wilhelm Specht. Die irreduziblen Darstellungen der symmetrischen Gruppe. *Math. Z.*, 39:696–711, 1935.

**[Sta18]** Hayden D. Stainsby. Triangular bases of integral closures. *J. Symbolic Comput.*, 87:140–175, 2018. URL: [https://doi.org/10.1016/j.jsc.2017.07.012](https://doi.org/10.1016/j.jsc.2017.07.012), [doi:10.1016/j.jsc.2017.07.012](https://doi.org/10.1016/j.jsc.2017.07.012).

**[Sta05]** Sebastian Stamminger. *Explicit $8$-descent On Elliptic Curves*. PhD Thesis, International University Bremen, 2005. available at \biburl http://www.jacobs-university.de/research/dissertations/.

**[Sta]** M. Stather. Constructive sylow theorems for the classical groups. to appear in Journal of Algebra.

**[Sta73]** Richard P. Stauduhar. The determination of Galois Groups. *Math. Comp.*, 27:981–996, 1973.

**[Ste96a]** A. M. Steane. Error correcting codes in quantum theory. *Phys. Rev. Lett.*, 77(5):793–797, 1996.

**[Ste96b]** Andrew Steane. Multiple-particle interference and quantum error correction. *Proc. Roy. Soc. London Ser. A*, 452(1954):2551–2577, 1996.

**[Ste]** **missing booktitle in Steel02**

**[Ste97]** Allan Steel. A new algorithm for the computation of canonical forms of matrices over fields. *J. Symbolic Comp.*, 24(3):409–432, 1997.

**[Ste04]** Allan Steel. Gröbner basis timings page. \biburl http://magma.maths.usyd.edu.au/users/allan/gb/, 2004.

**[Ste05]** Allan Steel. Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic. *J. Symbolic Comp.*, 40(3):1053–1075, 2005.

**[Ste10]** Allan K. Steel. Computing with algebraically closed fields. *J. Symb. Comput.*, 45(3):342–372, March 2010. URL: [http://dx.doi.org/10.1016/j.jsc.2009.09.005](http://dx.doi.org/10.1016/j.jsc.2009.09.005), [doi:10.1016/j.jsc.2009.09.005](https://doi.org/10.1016/j.jsc.2009.09.005).

**[Ste15]** Allan K. Steel. Direct solution of the (11, 9, 8)-minrank problem by the block wiedemann algorithm in \sc Magma with a tesla GPU. In Jean-Guillaume Dumas, Erich L. Kaltofen, and Clément Pernet, editors, *Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015*, 2–6. ACM, 2015. URL: [https://doi.org/10.1145/2790282.2791392](https://doi.org/10.1145/2790282.2791392), [doi:10.1145/2790282.2791392](https://doi.org/10.1145/2790282.2791392).

**[Stehle09]** Damien Stehlé. *Floating-point LLL: theoretical and practical aspects*. Springer-Verlag, 2009, To appear.

**[SW]** **missing booktitle in StWat2002**

**[Ste00]** William A. Stein. Explicit approaches to modular abelian varieties. *Ph.D. thesis, University of California, Berkeley*, 2000.

**[Ste01]** William A. Stein. Component Groups of Purely Toric Quotients of Semistable Jacobians. *submitted*, 2001.

**[Ste07]** William A. Stein. *Modular forms: a computational approach*. Volume 79 of Graduate Studies in Mathematics. Amer. Math. Soc., Providence, Rhode Island, 2007.

**[Ste08]** William A. Stein. An introduction to computing modular forms using modular symbols. In *Algorithmic number theory: lattices, number fields, curves and cryptography*, volume 44 of Math. Sci. Res. Inst. Publ., pages 641–652. Cambridge Univ. Press, Cambridge, 2008.

**[Ste62a]** Robert Steinberg. Générateurs, relations et revêtements de groupes algébriques. In *Colloq. Théorie des Groupes Algébriques (Bruxelles, 1962)*, pages 113–127. Librairie Universitaire, Louvain, 1962.

**[Ste62b]** Robert Steinberg. Generators for simple groups. *Canad. J. Math.*, 14:277–283, 1962.

**[Sti93]** Henning Stichtenoth. *Algebraic function fields and codes*. Springer-Verlag, Berlin, 1993. ISBN 3-540-56489-6.

**[Sto99a]** M. Stoll. On the height constant for curves of genus two. *Acta Arithmetica*, 90:183–201, 1999. \biburl https://doi.org/10.4064/aa-90-2-183-201. [doi:10.4064/aa-90-2-183-201](https://doi.org/10.4064/aa-90-2-183-201).

**[Sto99b]** M. Stoll. On the height constant for curves of genus two. *Acta Arith.*, 90(2):183 – 201, 1999.

**[SC02]** M. Stoll and J. Cremona. Minimal models for 2-coverings of elliptic curves. *LMS JCM*, 5:220–243, 2002.

**[Sto01]** Michael Stoll. Implementing 2-descent for Jacobians of hyperelliptic curves. *Acta Arith.*, 98(3):245–277, 2001.

**[Sto11]** **missing note in stoll_cluster_reduction**

**[SM98]** **missing publisher in How2**

**[Str04]** Helmut Strade. *Simple Lie algebras over fields of positive characteristic. I*. Volume 38 of de Gruyter Expositions in Mathematics. Walter de Gruyter & Co., Berlin, 2004. ISBN 3-11-014211-2. Structure theory.

**[SF88]** Helmut Strade and Rolf Farnsteiner. *Modular Lie algebras and their representations*. Volume 116 of Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker Inc., New York, 1988. ISBN 0-8247-7594-5.

**[ST96]** R. J. Stroeker and Tzanakis T. Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms, the quartic case. *Acta Arith.*, 75:165–190, 1996.

**[ST94]** R. J. Stroeker and N. Tzanakis. Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. *Acta Arith.*, 67:177–196, 1994.

**[Str84]** Roelof J. Stroeker. How to solve a diophantine equation. *Amer. Math. Monthly*, 91:385–392, 1984.

**[Stu87]** Jacob Sturm. On the congruence of modular forms. In *Number theory (New York, 1984–1985)*, pages 275–280. Springer, Berlin, 1987.

**[Sut16]** N. Sutherland. Efficient computation of maximal orders in Artin–Schreier–Witt extensions. *Journal of Symbolic Computation*, 77:189–216, 2016. [doi:10.1016/j.jsc.2016.01.008](https://doi.org/10.1016/j.jsc.2016.01.008).

**[Sut12]** Nicole Sutherland. Efficient computation of maximal orders of radical (including kummer) extensions. *Journal of Symbolic Computation*, 47(5):552–567, 2012. [doi:10.1016/j.jsc.2011.12.053](https://doi.org/10.1016/j.jsc.2011.12.053).

**[Sut13]** Nicole Sutherland. Efficient computation of maximal orders of artin–schreier extensions. *Journal of Symbolic Computation*, 53(1):26–39, 2013. URL: [http://dx.doi.org/10.1016/j.jsc.2012.11.001](http://dx.doi.org/10.1016/j.jsc.2012.11.001), [doi:10.1016/j.jsc.2012.11.001](https://doi.org/10.1016/j.jsc.2012.11.001).

**[Sut15]** Nicole Sutherland. Computing Galois groups of polynomials (especially over function fields of prime characteristic). *Journal of Symbolic Computation*, 71:73–97, 2015. [doi:10.1016/j.jsc.2014.09.043](https://doi.org/10.1016/j.jsc.2014.09.043).

**[Sut18]** Nicole Sutherland. Galois groups in magma. *Computeralgebra Rundbrief*, 62:, 2018.

**[Suz]** K. Suzuki. On Fano indices of Q-Fano 3-folds. Available as math.AG/0210309 on arXiv.

**[SzendrHoiB]** B. Szendrői and A. Buckley. Orbifold Riemann-Roch for threefolds with an application to Calabi-Yau geometry. math.AG/0309033.

**[THCR90]** C.E. Leiserson T.H. Cormen and R.L. Rivest. *Introduction to Algorithms*. MIT Press, 1990.

**[Taf57]** E.J. Taft. Invariant wedderburn factors. *Illinois Journal of Mathematics*, 1:565–573, 1957.

**[Tat79]** J. Tate. Number theoretic background. *Proc. Symp. Pure Math.*, 33, part 2:3–26, 1979.

**[Tay87]** Don Taylor. Pairs of generators for matrix groups. i. *Cayley Bulletin 3*, 1987.

**[Tay92]** Donald E. Taylor. *The geometry of the classical groups*. Volume 9 of Sigma Series in Pure Mathematics. Heldermann Verlag, Berlin, 1992. ISBN 3-88538-009-9.

**[Tes98a]** E. Teske. A Space Efficient Algorithm for Group Structure Computation. *Mathematics of Computation*, 67:1637–1663, 1998.

**[Tes98b]** **missing note in teske_walks**

**[Thome01]** Emmanuel Thomé. Computation of discrete logarithms in $\rm \bf F_2^607$. In Colin Boyd and Ed Dawson, editors, *Advances in Cryptology—AsiaCrypt 2001*, volume 2248 of LNCS, 107–124. Springer-Verlag, 2001. Proc. 7th International Conference on the Theory and Applications of Cryptology and Information Security, Dec. 9–13, 2001, Gold Coast, Queensland, Australia.

**[Tit66]** J Tits. Classification of algebraic simple groups, algebraic groups and discontinuous groups. In *Proc. Symp. Pure Math*, volume 9. 1966.

**[Tit62]** Jacques Tits. Géométries polyédriques et groupes simples. *Atti 2a Riunione Groupem. Math. Express. Lat. Firenze*, pages 66–88, 1962.

**[Tol97]** Emmanuel Tollis. Zeros of Dedekind zeta functions in the critical strip. *Math. Comp.*, 66(219):1295–1321, 1997.

**[Tra76]** Barry M. Trager. Algebraic factoring and rational function integration. In R.D. Jenks, editor, *Proc. SYMSAC '76*, 196–208. ACM press, 1976.

**[Tra96]** Carlo Traverso. Hilbert functions and the buchberger algorithm. *J. Symbolic Comp.*, 22(4):355–376, 1996.

**[TVluaduct91]** M. A. Tsfasman and S. G. Vlăduţ. *Algebraic-geometric codes*. Kluwer Academic Publishers Group, Dordrecht, 1991. ISBN 0-7923-0727-5. Translated from the Russian by the authors.

**[Tui16]** Jan Tuitman. Counting points on curves using a map to $\bf P^1$. *Math. Comp.*, 85(298):961–981, 2016.

**[Tui17]** Jan Tuitman. Counting points on curves using a map to $\bf P^1$, II. *Finite Fields Appl.*, 45:301–322, 2017.

**[Tur01]** A. Turull. Schur indices of perfect groups. *Proc. Amer. Math. Soc.*, 130(2):367–370, 2001.

**[TdW89]** Nikos Tzanakis and Benjamin M. M. de Weger. On the practical solution of the thue equation. *J. Number Th.*, 31:99–132, 1989.

**[Ung]** W.R. Unger. Computing chief series of a large permutation group. In preparation.

**[Ung06a]** W.R. Unger. Computing the character table of a finite group. *J. Symbolic Comp.*, 41(8):847–862, 2006.

**[Ung06b]** W.R. Unger. Computing the solvable radical of a permutation group. *J. Algebra*, 300(1):305–315, 2006.

**[vdE00]** Arno van den Essen. *Polynomial automorphisms and the Jacobian conjecture*. Volume 190 of Progress in Mathematics. Birkhaeuser, ABirkhaeuser, 2000.

**[vdPS03]** Marius van der Put and Michael F. Singer. *Galois theory of linear differential equations*. Volume 328 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 2003. ISBN 3-540-44228-6.

**[vEB81]** Peter van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Technical report 81-04, Mathematisch Instituut, Universiteit van Amsterdam, 1981.

**[vGvS93]** B. van Geemen and D. van Straten. The cusp forms of weight $3$ on $\gamma \sb 2(2,4,8)$. *Math. Comp.*, 61(204):849–872, 1993.

**[vHKlunersN11]** M. van Hoeij, J. Klüners, and A. Novocin. Generating subfields. In Anton Leykin, editor, *Proceedings ISSAC 2011*. 2011.

**[vH97a]** Mark van Hoeij. Factorization of differential operators with rational functions coefficients. *J. Symbolic Comput.*, 24(5):537–561, 1997.

**[vH97b]** Mark van Hoeij. Formal solutions and factorization of differential operators with power series coefficients. *J. Symbolic Comput.*, 24(1):1–30, 1997.

**[vH01]** Mark van Hoeij. Factoring polynomials and 0-1 vectors. In *Proceedings of the Cryptography and Lattices Conference (CaLC 2001), Brown University, Providence, RI, USA, March 29-30, 2001*, 142–146. Springer, 2001.

**[vH02]** Mark van Hoeij. Factoring polynomials and the knapsack problem. *J. Number Th.*, 95(2):167–189, 2002. \biburl http://www.math.fsu.edu/∼hoeij/paper/knapsack.ps.

**[vLCL92]** M.A.A. van Leeuwen, A.M. Cohen, and B. Lisser. *LiE, A package for Lie Group Computations*. CAN, Amsterdam, 1992.

**[vLvdG88]** J. H. van Lint and G. van der Geer. *Introduction to Coding Theory and Algebraic Geometry*. Volume 12 of DMV Seminar. Birkhaeuser, Basel, 1988.

**[vR01]** Sander Matthijs van Rijnswou. *Testing the equivalence of planar curves*. PhD thesis, Technische Universiteit Eindhoven, Eindhoven, 2001.

**[Ver02]** F. Vercauteren. Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2. In *Advances in cryptology—CRYPTO 2002*, volume 2442 of LNCS, pages 369–384. Springer, Berlin, 2002.

**[Ver00]** H. A. Verrill. Fundamental domain drawing program. \biburl http://hverrill.net/fundomain/, 2000.

**[Vigneras76]** M.-F. Vignéras. Simplification pour les ordres des corps de quaternions totalement définits. *J. Reine Angew. Math.*, 286-287:257–277, 1976.

**[Vigneras80]** M.-F. Vignéras. *Arithmétique des Algèbres de Quaternions*. Volume 800 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1980.

**[VZP15]** M. Villanueva, F. Zeng, and J. Pujol. Efficient representation of binary nonlinear codes: constructions and minimum distance computation. *Designs, Codes and Cryptography*, 76(1):3–21, 2015.

**[Voi09]** J. Voight. Computing fundamental domains for cofinite fuchsian groups. *J. Théor. Nombres Bordeaux*, 21(2):469–491, 2009.

**[Voi05]** John Voight. *Quadratic forms and quaternion algebras: Algorithms and arithmetic*. Dissertation, University of California, Berkeley, 2005.

**[Voi06]** John Voight. Computing CM points on Shimura curves arising from cocompact arithmetic triangle groups. In *Algorithmic number theory*, volume 4076 of LNCS, pages 406–420. Springer, Berlin, 2006.

**[Voi11]** **missing note in Voight3**

**[vzGG99]** Joachim von zur Gathen and Jürgen Gerhard. *Modern Computer Algebra*. Cambridge University Press, Cambridge, 1999.

**[vzGS92]** Joachim von zur Gathen and Victor Shoup. Computing frobenius maps and factoring polynomials. *Computational Complexity*, 2:187–224, 1992.

**[Wal78]** Robert J. Walker. *Algebraic Curves*, pages 98 – 99. Springer-Verlag, 1978.

**[Wal63]** G. E. Wall. On the conjugacy classes in the unitary, symplectic and orthogonal groups. *J. Aust. Math. Soc.*, 3:1–62, 1963.

**[Wam99]** P. Van Wamelen. Examples of Genus Two CM Curves Defined over the Rationals. *Mathematics of Computation*, 68:307–320, 1999.

**[Wam01]** P. Van Wamelen. Computing with the Jacobian of a Genus 2 Curve. \biburl http://www.math.lsu.edu/˜wamelen/genus2.html, 2001.

**[Wan22]** Zhe Xian Wan. *Geometry of classical groups over finite fields*. Science Press, Beijing, second edition, 20022. ISBN 7-03-010595-8.

**[Wan97]** Zhe-Xian Wan. *Quaternary Codes*. Volume 8 of Series on Applied Mathematics. World Scientific, Singapore, 1997.

**[Wan78]** Paul S. Wang. An improved multivariate polynomial factoring algorithm. *Math. Comp.*, 32(144):1215–1231, 1978.

**[Wan80]** Paul S. Wang. The eez-gcd algorithm. *SIGSAM Bulletin*, 14(2):50–60, 1980.

**[Wat02]** M. Watkins. Computing the modular degree of an elliptic curve. *Experimental Mathematics*, 11(4):487–502, 2002.

**[Wat11]** M. Watkins. Computing with hecke grössencharacters. *Publications mathématiques de Besançon*, 2011/1:119–135, 2011.

**[Web95]** Kenneth Weber. The accelerated integer gcd algorithm. *ACM Transactions on Mathematical Software*, 21(1):111–122, 1995.

**[Wei52]** A. Weil. Jacobi sums as “grössencharaktere”. *Trans. AMS*, 73:487–495, 1952.

**[Wei74]** A. Weil. Sommes de jacobi et caractères de hecke. *Göttingen Nachr.*, 1:1–14, 1974.

**[Wei76]** A. Weil. Sur les périodes des intégrales abéliennes. *Comm. Pure Appl. Math.*, XXIX:813–819, 1976.

**[Wei55]** A. Weir. Sylow p-subgroups of the classical groups over finite fields with characteristic prime to p. *Proc. Am. Math. Soc*, 6:529–533, 1955.

**[Wet97]** J. L. Wetherell. *Bounding the number of rational points on certain curves of high rank*. PhD thesis, U.C. Berkeley, 1997.

**[Wey50a]** Herman Weyl. *The theory of groups and quantum mechanics*. Dover, New York, 1950.

**[Wey50b]** Hermann Weyl. *The theory of groups and quantum mechanics*. Dover Publications, Inc., New York, 1950. Translated from the second (revised) German edition by H. P. Robertson, Reprint of the 1931 English translation.

**[Whi90]** Elise Whitley. *Modular symbols and elliptic curves over imaginary quadratic fields*. PhD thesis, University of Exeter, 1990.

**[WW15]** E. T. Whittaker and G. N. Watson. *A course of modern analysis*. Cambridge University Press, Cambridge, 2nd edition, 1915.

**[Wie64]** Helmut Wielandt. *Finite Permutation Groups*. Academic Press, 1964.

**[Wil93]** Klaus Wildanger. Über Grundeinheitenberechnung in algebraischen Zahlkörpern. Master's thesis, Heinrich-Heine-Universität Düsseldorf, 1993. \biburl http://www.math.tu-berlin.de/∼kant/publications/diplom/wildanger.ps.gz.

**[Wil97]** Klaus Wildanger. *Über das Lösen von Einheiten- und Indexformgleichungen in algebraischen Zahlkörpern mit einer Anwendung auf die Bestimmung aller ganzen Punkte einer Mordellschen Kurve*. Dissertation, Technische Universität Berlin, 1997. \biburl http://www.math.tu-berlin.de/∼kant/publications/diss/KW_diss.ps.gz.

**[Wil00]** Klaus Wildanger. Über das Lösen von Einheiten- und indexformgleichungen in algebraischen Zahlkörpern. (On the solution of units and index form equations in algebraic number fields). *J. Number Th.*, 2(82):188–224, 2000.

**[Wil12]** James B. Wilson. Existence, algorithms, and asymptotics of direct product decompositions, I. *Groups Complex. Cryptol.*, 4(1):33–72, 2012. URL: [https://doi.org/10.1515/gcc-2012-0007](https://doi.org/10.1515/gcc-2012-0007), [doi:10.1515/gcc-2012-0007](https://doi.org/10.1515/gcc-2012-0007).

**[Wil13a]** James B. Wilson. Division, adjoints, and dualities of bilinear maps. *Comm. Algebra*, 41(11):3989–4008, 2013. URL: [https://doi.org/10.1080/00927872.2012.660668](https://doi.org/10.1080/00927872.2012.660668), [doi:10.1080/00927872.2012.660668](https://doi.org/10.1080/00927872.2012.660668).

**[Wil13b]** James B. Wilson. Optimal algorithms of Gram-Schmidt type. *Linear Algebra Appl.*, 438(12):4573–4583, 2013. URL: [https://doi.org/10.1016/j.laa.2013.02.026](https://doi.org/10.1016/j.laa.2013.02.026), [doi:10.1016/j.laa.2013.02.026](https://doi.org/10.1016/j.laa.2013.02.026).

**[Wil17]** James B. Wilson. On automorphisms of groups, rings, and algebras. *Comm. Algebra*, 45(4):1452–1478, 2017. URL: [https://doi.org/10.1080/00927872.2016.1175617](https://doi.org/10.1080/00927872.2016.1175617), [doi:10.1080/00927872.2016.1175617](https://doi.org/10.1080/00927872.2016.1175617).

**[Wom03]** T. Womack. *Explicit descent on elliptic curves*. PhD thesis, University of Nottingham, 2003.

**[YZ97]** N. Yui and D. Zagier. On the singular values of Weber modular functions. *Mathematics of Computation*, 66(220):1645–1662, 1997.

**[Zag]** **missing booktitle in zagier89**

**[Zas35]** Hans Zassenhaus. Über endliche Fastkörper. *Abh. Math. Sem. Univ. Hamburg*, 11:187–220, 1935.

**[ZSHerbruggen11]** Robert Zeier and Thomas Schulte–Herbrüggen. Symmetry principles in quantum systems theory. *Journal of Mathematical Physics*, 52(11):113510, 2011.

**[ZelmanovK90]** E.I. Zel$'$manov and A.I. Kostrikin. A theorem on sandwich algebras. *Trudy Mat. Inst. Steklov.*, 183:106–111, 225, 1990. Translated in Proc. Steklov Inst. Math. \bf 1991, no. 4, 121–126, Galois theory, rings, algebraic groups and their applications (Russian).

**[JacobsonJr99]** M. J. Jacobson, Jr. Applying sieving to the computation of quadratic class groups. *Math. Comp.*, 68(226):859–867, 1999.

**[KANTGroup97]** KANT Group. KANT V4. *J. Symbolic Comp.*, 24(3–4):267–383, 1997.

**[KANTGroup00]** KANT Group. The Number Theory Package KANT/KASH. \biburl http://www.math.tu-berlin.de/∼kant, 2000.

**[LercierRitzenthalerSijsling18]** R. Lercier, C. Ritzenthaler, and J. Sijsling. Reconstructing plane quartics from their invariants. *Discrete & Computational Geometry*, pages 1–41, 2018.