1995

  1. Daniel Bleichenbacher, Wieb Bosma, and Arjen K. Lenstra, Some remarks on Lucas-based cryptosystems, Advances in Cryptology—CRYPTO '95 (Santa Barbara, CA, 1995), Lecture Notes in Comput. Sci., vol. 963, Springer, Berlin, 1995, pp. 386–396.[MR]
  2. W. Bosma, A. a. Karatsuba, Basic Analytic Number Theory (Book review), Mededelingen Wiskundig Genootschap 38 (1995), no. 7, 255–256.
  3. W. Bosma and H. W. Lenstra, Jr., Complete systems of two addition laws for elliptic curves, J. Number Theory 53 (1995), no. 2, 229–240.[MR]
  4. W. Bosma and A. van der Poorten (eds.), Computational algebra and number theory, Mathematics and its Applications, vol. 325, Kluwer, Dordrecht, 1995.
  5. W. Bosma and P. Stevenhagen, On the computation of quadratic 2-class groups, Full Papers and Extended Abstracts of CANT'95, Macquarie University, April 1995, Macquarie University, 1995, pp. 36–55.
  6. Wieb Bosma, Computation of cyclotomic polynomials with Magma, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 213–225.[MR]
  7. Wieb Bosma and Arjen K. Lenstra, An implementation of the elliptic curve integer factorization method, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 119–136.[MR]
  8. T. Minkwitz, On the computation of ordinary irreducible representations of finite groups, A. H. M. Levelt (ed),Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, Montreal, July 10–12, 1995, Association for Computing Machinery, ACM, 1995, pp. 278–284.
  9. Peter Stevenhagen, A density conjecture for the negative Pell equation, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 187–200.[MR]

1996

  1. Wieb Bosma and Peter Stevenhagen, Density computations for real quadratic units, Math. Comp. 65 (1996), no. 215, 1327–1337.[MR]
  2. Wieb Bosma and Peter Stevenhagen, On the computation of quadratic 2-class groups, J. Théor. Nombres Bordeaux 8 (1996), no. 2, 283–313.[MR]
  3. John Cannon and Catherine Playoust, Magma: A new computer algebra system, Euromath Bull. 2 (1996), no. 1, 113–144.[MR]
  4. C. Fieker and M. E. Pohst, On lattices over number fields, Algorithmic number theory (Talence, 1996), Lecture Notes in Comput. Sci., vol. 1122, Springer, Berlin, 1996, pp. 133–139.[MR]
  5. Derek F. Holt, C. R. Leedham-Green, E. A. O'Brien, and Sarah Rees, Computing matrix group decompositions with respect to a normal subgroup, J. Algebra 184 (1996), no. 3, 818–838.[MR/doi]
  6. Derek F. Holt, C. R. Leedham-Green, E. A. O'Brien, and Sarah Rees, Testing matrix groups for primitivity, J. Algebra 184 (1996), no. 3, 795–817.[MR/doi]
  7. Michael Vaughan-Lee and E. I. Zelmanov, Upper bounds in the restricted Burnside problem. II, Internat. J. Algebra Comput. 6 (1996), no. 6, 735–744.[MR]

1997

  1. Wieb Bosma, John Cannon, and Catherine Playoust, The Magma algebra system. I. The user language, J. Symbolic Comput. 24 (1997), no. 3-4, 235–265.[MR]
  2. Wieb Bosma, John Cannon, and Allan Steel, Lattices of compatibly embedded finite fields, J. Symbolic Comput. 24 (1997), no. 3-4, 351–369.[MR]
  3. J. J. Cannon and D. F. Holt (Eds. ), Computational algebra and number theory:Proceedings of the First MAGMA conference, J. Symb. Comp., vol. 24, 1997.
  4. John J. Cannon, Bruce C. Cox, and Derek F. Holt, Computing Sylow subgroups in permutation groups, J. Symbolic Comput. 24 (1997), no. 3-4, 303–316.[MR]
  5. John Cannon and Derek Holt (eds.), Computational algebra and number theory, in Proceedings of the 1st MAGMA Conference held at Queen Mary and Westfield College, London, August 23–27, 1993, Elsevier Ltd, Oxford, 1997, pp. 233–506.[MR]
  6. John J. Cannon and Derek F. Holt, Computing chief series, composition series and socles in large permutation groups, J. Symbolic Comput. 24 (1997), no. 3-4, 285–301.[MR]
  7. John Cannon and Catherine Playoust, Using the Magma computer algebra system in abstract algebra courses, J. Symbolic Comput. 23 (1997), no. 5-6, 459-484.
  8. John Cannon and Bernd Souvignier, On the computation of conjugacy classes in permutation groups, in Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), ACM, New York, 1997, pp. 392–399 (electronic).[MR]
  9. C. Fieker, A. Jurk, and M. Pohst, On solving relative norm equations in algebraic number fields, Math. Comp. 66 (1997), no. 217, 399–410.[MR]
  10. R. B. Howlett, P. J. Rowley, and D. E. Taylor, On outer automorphism groups of Coxeter groups, Manuscripta Math. 93 (1997), no. 4, 499–513.[MR/doi]
  11. W. Plesken and B. Souvignier, Analysing finitely presented groups by constructing representations, J. Symbolic Comput. 24 (1997), no. 3-4, 335–349.[MR]
  12. W. Plesken and B. Souvignier, Computing isometries of lattices, J. Symbolic Comput. 24 (1997), no. 3-4, 327–334.[MR]
  13. Allan Steel, A new algorithm for the computation of canonical forms of matrices over fields, J. Symbolic Comput. 24 (1997), no. 3-4, 409–432.[MR]

1998

  1. Willem A. de Graaf, Deciding isomorphism of Lie algebras, Proceedings of the Sixth Rhine Workshop on Computer Algebra, Sankt Augustin, March 31 - April 3, 1998, 1998, pp. 9.
  2. Dimitri Leemans, Thin geometries for the Suzuki simple group Sz(8), Bull. Belg. Math. Soc. Simon Stevin 5 (1998), no. 2-3, 373–387.[MR]
  3. Ferdinando Mora, De nugis Groebnerialium. I. Eagon, Northcott, Gröbner, Gröbner bases and applications (Linz, 1998), London Math. Soc. Lecture Note Ser., vol. 251, Cambridge Univ. Press, Cambridge, 1998, pp. 434–447.[MR]
  4. W. Plesken and B. Souvignier, Constructing representations of finite groups and applications to finitely presented groups, J. Algebra 202 (1998), no. 2, 690–703.[MR]
  5. L. J. Rylands and D. E. Taylor, Matrix generators for the orthogonal groups, J. Symbolic Comput. 25 (1998), no. 3, 351–360.[MR/doi]
  6. Michael Vaughan-Lee, Superalgebras and dimensions of algebras, Internat. J. Algebra Comput. 8 (1998), no. 1, 97–125.[MR]

1999

  1. Ljiljana Brankovic, Paulette Lieby, and Mirka Miller, Flattening antichains with respect to the volume, Electron. J. Combin. 6 (1999), Research Paper 1, 12 pp. (electronic).[MR]
  2. Bettina Eick and E. A. O'Brien, Enumerating p-groups, J. Austral. Math. Soc. Ser. A 67 (1999), no. 2, 191–205.[MR]
  3. Gregor Kemper and Allan Steel, Some algorithms in invariant theory of finite groups, Computational Methods for Representations of Groups and Algebras (Essen, 1997), Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 267–285.[MR]
  4. Dimitri Leemans, An atlas of regular thin geometries for small groups, Math. Comp. 68 (1999), no. 228, 1631–1647.[MR]
  5. Arun Ram and D. E. Taylor, Explicit irreducible representations of the Iwahori-Hecke algebra of type F4, Manuscripta Math. 99 (1999), no. 1, 13–37.[MR/doi]
  6. Richard Rannard, Computing immersed normal surfaces in the figure-eight knot complement, Experiment. Math. 8 (1999), no. 1, 73–84.[MR]
  7. J. Rafael Sendra and Franz Winkler, Algorithms for rational real algebraic curves, Fund. Inform. 39 (1999), no. 1-2, 211–228.[MR]