next up previous
Up: V2.9 Features Previous: Documentation

Bibliography


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


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


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


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

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


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


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


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


9
H. Hijikata, A. Pizer, T. Shemanske. The basis problem for modular forms on $\Gamma \sb{0}(N)$. Proc. Japan Acad. Ser. A Math. Sci. 56 (1980), no. 6, 280-284.


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


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


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


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


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


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


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


17
A. Pizer. An algorithm for computing modular forms on $\Gamma \sb{0}(N)$, J. Algebra 64 (1980), no. 2, 340-390.


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


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


next up previous
Up: V2.9 Features Previous: Documentation