1995

1. Jianbei An and Marston Conder, The Alperin and Dade conjectures for the simple Mathieu groups, Comm. Algebra 23 (1995), no. 8, 2797–2823.^[MR]
2. 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]
3. 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]
4. Francis Buekenhout, Finite groups and geometries: A view on the present state and on the future, Groups of Lie Type and their Geometries (Como, 1993), London Math. Soc. Lecture Note Ser., vol. 207, Cambridge Univ. Press, Cambridge, 1995, pp. 35–42.^[MR]
5. Francis Buekenhout, Michel Dehon, and Isabelle De Schutter, Projective injections of geometries and their affine extensions, J. Geom. 52 (1995), no. 1-2, 41–53.^[MR]
6. L. L. Carpenter and J. D. Key, On Hadamard matrices from resolvable Steiner designs, in Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 108, 1995, pp. 53–63.^[MR]
7. Donald I. Cartwright, Groups acting simply transitively on the vertices of a building of type A_n, Groups of Lie Type and Their Geometries (Como, 1993), London Math. Soc. Lecture Note Ser., vol. 207, Cambridge Univ. Press, Cambridge, 1995, pp. 43–76.^[MR]
8. 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 (1995), no. 13, 4931–4948.^[MR]
9. Marston Conder, Semi-automated theorem proving – the impact of computers on research in pure mathematics, in Proceedings of the First Asian Technology Conference in Mathematics. Singapore, December 1995, 1995, pp. 1–8.
10. Marston Conder, Two element generation of the finite reflection groups, Quart. J. Math. Oxford Ser. (2) 46 (1995), no. 181, 95–106.^[MR]
11. Marston Conder and Brent Everitt, Regular maps on non-orientable surfaces, Geom. Dedicata 56 (1995), no. 2, 209–219.^[MR]
12. Marston Conder, Peter Lorimer, and Cheryl Praeger, Constructions for arc-transitive digraphs, J. Austral. Math. Soc. Ser. A 59 (1995), no. 1, 61–80.^[MR]
13. Gene Cooperman, Larry Finkelstein, and Michael Tselman, Computing with matrix groups using permutation representations, in ISSAC '95: Proceedings of the 1995 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 1995, pp. 259–264.^[doi]
14. R. T. Curtis, Symmetric generation of the Higman-Sims group, J. Algebra 171 (1995), no. 2, 567–586.^[MR]
15. Graham Ellis and Frank Leonard, Computing Schur multipliers and tensor products of finite groups, Proc. Roy. Irish Acad. Sect. A 95 (1995), no. 2, 137–147.^[MR]
16. S. P. Glasby, Generators for the group of units of Z_n, Austral. Math. Soc. Gaz. 22 (1995), no. 5, 226–228.^[MR]
17. Paul R. Hafner, Large Cayley graphs and digraphs with small degree and diameter, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 291–302.^[MR]
18. J. D. Key and F. E. Sullivan, Steiner triple systems with many affine hyperplanes, in Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 107, 1995, pp. 105–112.^[MR]
19. R. Laue, Construction of groups and the constructive approach to group actions, Symmetry and Structural Properties of Condensed Matter (Zajolhk Aczkowo, 1994), World Sci. Publishing, River Edge, NJ, 1995, pp. 404–416.^[MR]
20. Hsin-Chao Liao and Richard J. Fateman, Evaluation of the heuristic polynomial GCD, in ISSAC '95: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 1995, pp. 240–247.^[doi]
21. Peter Lorimer, Hyperbolic pyritohedra constructed from the Coxeter group [4,3,5], Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 303–321.^[MR]
22. Torsten Minkwitz, On the computation of ordinary irreducible representations of finite groups, ISSAC '95: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 1995, pp. 278–284.
23. Scott H. Murray and E. A. O'Brien, Selecting base points for the Schreier-Sims algorithm for matrix groups, J. Symbolic Comput. 19 (1995), no. 6, 577–584.^[MR]
24. J. Neubüser, An invitation to computational group theory, Groups '93 Galway/St. Andrews, Vol. 2, London Math. Soc. Lecture Note Ser., vol. 212, Cambridge Univ. Press, Cambridge, 1995, pp. 457–475.^[MR]
25. Alice C. Niemeyer, Computing finite soluble quotients, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 75–82.^[MR]
26. E. A. O'Brien, Computing automorphism groups of p-groups, Computational Algebra and Number Theory (Sydney, 1992), Math. Appl., vol. 325, Kluwer Acad. Publ., Dordrecht, 1995, pp. 83–90.^[MR]
27. Christopher Parker and Vladimir D. Tonchev, Linear codes and doubly transitive symmetric designs, Linear Algebra Appl. 226/228 (1995), 237–246.^[MR]
28. M. Anwar Rao and Robert Sandling, The characterisation of modular group algebras having unit groups of nilpotency class 3, Canad. Math. Bull. 38 (1995), no. 1, 112–116.^[MR]
29. M. Anwar Rao and Robert Sandling, Vanishing orbit sums in group algebras of p-groups, Groups '93 Galway/St. Andrews, Vol. 2, London Math. Soc. Lecture Note Ser., vol. 212, Cambridge Univ. Press, Cambridge, 1995, pp. 507–511.^[MR]
30. Joseph J. Rotman, An Introduction to the Theory of Groups, Graduate Texts in Mathematics, vol. 148, Springer-Verlag, New York, 1995, pp. xvi+513.^[MR]
31. Michael F. Singer and Felix Ulmer, Necessary conditions for Liouvillian solutions of (third order) linear differential equations, Appl. Algebra Engrg. Comm. Comput. 6 (1995), no. 1, 1–22.^[MR]
32. N. J. A. Sloane, R. H. Hardin, T. D. S. Duff, and J. H. Conway, Minimal-energy clusters of hard spheres, Discrete Comput. Geom. 14 (1995), no. 3, 237–259.^[MR]
33. Lewis Stiller, Exploiting Symmetry on Parallel Architectures, PhD Thesis, John Hopkins University, 1995.
34. Ibrahim A. I. Suleiman and Robert A. Wilson, Standard generators for J₃, Experiment. Math. 4 (1995), no. 1, 11–18.^[MR]
35. V. A. Ustimenko and A. J. Woldar, An improvement on the Erdős bound for graphs of girth 16, Second International Conference on Algebra (Barnaul, 1991), Contemp. Math., vol. 184, Amer. Math. Soc., Providence, RI, 1995, pp. 419–425.^[MR]
36. Katsushi Waki, An introduction to magma (japanese), Noda, Matu-Tarow (ed.). Research on the theory and applications of computer algebra. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, November 16–18, 1994., RIMS Kokyuroku, vol. 920, Kyoto University, Kyoto, 1995, pp. 173–179.
37. Kenneth L. Wantz, Unitals embedded in finite projective planes, PhD Thesis, University of Delaware, 1995.

1996

1. Jianbei An, Dade's conjecture for the Tits group, New Zealand J. Math. 25 (1996), no. 2, 107–131.^[MR]
2. E. F. Assmus, Jr. and J. D. Key, Designs and codes: an update, Des. Codes Cryptogr. 9 (1996), no. 1, 7–27.^[MR]
3. M. D. Atkinson, The complexity of algorithms, Computing Tomorrow, Cambridge Univ. Press, Cambridge, 1996, pp. 1–20.^[MR]
4. R. D. Baker and G. L. Ebert, Filling the nest gaps, Finite Fields Appl. 2 (1996), no. 1, 42–61.^[MR]
5. R. D. Baker, G. L. Ebert, J. Hemmeter, and A. Woldar, Maximal cliques in the Paley graph of square order, J. Statist. Plann. Inference 56 (1996), no. 1, 33–38.^[MR/doi]
6. Wieb Bosma and Peter Stevenhagen, Density computations for real quadratic units, Math. Comp. 65 (1996), no. 215, 1327–1337.^[MR]
7. 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]
8. Leonid Brailovsky, Dmitrii V. Pasechnik, and Cheryl E. Praeger, Classification of 2-quasi-invariant subsets, Ars Combin. 42 (1996), 65–76.^[MR]
9. Francis Buekenhout, Michel Dehon, and Dimitri Leemans, All geometries of the Mathieu group M₁₁ based on maximal subgroups, Experiment. Math. 5 (1996), no. 2, 101–110.^[MR]
10. Francis Buekenhout and Dimitri Leemans, On the list of finite primitive permutation groups of degree ≤ 50, J. Symbolic Comput. 22 (1996), no. 2, 215–225.^[MR]
11. John Cannon and Catherine Playoust, Magma: A new computer algebra system, Euromath Bull. 2 (1996), no. 1, 113–144.^[MR]
12. L. L. Carpenter and J. D. Key, Reed-Muller codes and Hadamard designs from ovals, J. Combin. Math. Combin. Comput. 22 (1996), 79–85.^[MR]
13. Fokko du Cloux, The state of the art in the computation of Kazhdan-Lusztig polynomials, Appl. Algebra Engrg. Comm. Comput. 7 (1996), no. 3, 211–219.
14. Marston Conder and John McKay, Markings of the Golay code, New Zealand J. Math. 25 (1996), no. 2, 133–139.^[MR]
15. R. T. Curtis, A. M. A. Hammas, and J. N. Bray, A systematic approach to symmetric presentations I: Involutory generators, Math. Proc. Cambridge Philos. Soc. 119 (1996), no. 1, 23–34.^[MR]
16. R. T. Curtis and Z. Hasan, Symmetric representation of the elements of the Janko group J₁, J. Symbolic Comput. 22 (1996), no. 2, 201–214.^[MR]
17. O. Davey, E. Hart, and K. Trapp, Computation of Nielsen numbers for maps of closed surfaces, Trans. Amer. Math. Soc. 348 (1996), no. 8, 3245–3266.^[MR]
18. Mohamed El Marraki, Nicolas Hanusse, Jörg Zipperer, and Alexander Zvonkin, Cacti, braids and complex polynomials, Sém. Lothar. Combin. 37 (1996), Art. B37b, 36 pp. (electronic).^[MR]
19. 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]
20. Louis Granboulan, Construction d'une extension régulière de Q(T) de groupe de Galois M₂₄, Experiment. Math. 5 (1996), no. 1, 3–14.^[MR]
21. George Havas, M. F. Newman, and E. A. O'Brien, Groups of deficiency zero, Geometric and Computational Perspectives on Infinite Groups (Minneapolis, MN and New Brunswick, NJ, 1994), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 25, Amer. Math. Soc., Providence, RI, 1996, pp. 53–67.^[MR]
22. George Havas and Edmund F. Robertson, Central factors of deficiency zero groups, Comm. Algebra 24 (1996), no. 11, 3483–3487.^[MR]
23. 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]
24. 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]
25. Karsten Homann, Symbolisches lösung mathematischer probleme durch kooperation algorithmischer und logischer systeme, PhD Thesis, Fakultät für Informatik der Universität Karlsruhe, 1996.
26. J. D. Key, Extendable Steiner designs from finite geometries, J. Statist. Plann. Inference 56 (1996), no. 2, 181–186.^[MR]
27. Torsten Minkwitz, Extensions of irreducible representations, Appl. Algebra Engrg. Comm. Comput. 7 (1996), no. 5, 391–399.^[MR]
28. M. F. Newman and E. A. O'Brien, Application of computers to questions like those of Burnside. II, Internat. J. Algebra Comput. 6 (1996), no. 5, 593–605.^[MR]
29. M. E. Pohst, Computational aspects of Kummer theory, Algorithmic number theory (Talence, 1996), Lecture Notes in Comput. Sci., vol. 1122, Springer, Berlin, 1996, pp. 259–272.^[MR]
30. Bjorn Poonen, Computational aspects of curves of genus at least 2, Algorithmic Number Theory (Talence, 1996), Lecture Notes in Comput. Sci., vol. 1122, Springer, Berlin, 1996, pp. 283–306.^[MR]
31. Michael F. Singer, Testing reducibility of linear differential operators: A group-theoretic perspective, Appl. Algebra Engrg. Comm. Comput. 7 (1996), no. 2, 77–104.^[MR]
32. Lewis Stiller, Multilinear algebra and chess endgames, Games of no Chance (Berkeley, CA, 1994), Math. Sci. Res. Inst. Publ., vol. 29, Cambridge Univ. Press, Cambridge, 1996, pp. 151–192.^[MR]

1997

1. Alejandro Adem, Recent developments in the cohomology of finite groups, Notices Amer. Math. Soc. 44 (1997), no. 7, 806–812.^[MR]
2. Jianbei An, The Alperin and Dade conjectures for the simple Held group, J. Algebra 189 (1997), no. 1, 34–57.^[MR]
3. Christine Bachoc and Gabriele Nebe, Classification of two genera of 32-dimensional lattices of rank 8 over the Hurwitz order, Experiment. Math. 6 (1997), no. 2, 151–162.^[MR]
4. A. Bonisoli and A. Cossidente, Inscribed bundles, Veronese surfaces and caps, Geometry, Combinatorial Designs and Related Structures (Spetses, 1996), London Math. Soc. Lecture Note Ser., vol. 245, Cambridge Univ. Press, Cambridge, 1997, pp. 27–32.^[MR]
5. 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]
6. Wieb Bosma, John Cannon, and Allan Steel, Lattices of compatibly embedded finite fields, J. Symbolic Comput. 24 (1997), no. 3-4, 351–369.^[MR]
7. Nigel Boston, A use of computers to teach group theory and introduce students to research, J. Symbolic Comput. 23 (1997), no. 5–6, 453–458.
8. Emilio Bujalance, F. J. Cirre, and Marston Conder, On full automorphism groups of Riemann surfaces, J. Symbolic Comput. 24 (1997), 235-265.
9. John Burns and Graham Ellis, On the nilpotent multipliers of a group, Math. Z. 226 (1997), no. 3, 405–428.^[MR]
10. A. R. Calderbank and N. J. A. Sloane, Double circulant codes over Z₄ and even unimodular lattices, J. Algebraic Combin. 6 (1997), no. 2, 119–131.^[MR]
11. 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]
12. 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]
13. 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.
14. 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]
15. A. Caranti, S. Mattarei, and M. F. Newman, Graded Lie algebras of maximal class, Trans. Amer. Math. Soc. 349 (1997), no. 10, 4021–4051.^[MR]
16. Jon F. Carlson, Edward L. Green, and Gerhard J. A. Schnieder, Computing Ext algebras for finite groups, J. Symbolic Comput. 24 (1997), no. 3-4, 317–325.^[MR]
17. Alexander Chistov, Gábor Ivanyos, and Marek Karpinski, Polynomial time algorithms for modules over finite dimensional algebras, in Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), ACM, New York, 1997, pp. 68–74 (electronic).^[MR]
18. Martin Clayton, Computer algebra software, Particle Physics and Astronomy Research Council (1997), no. 47.1, 16 pages.
19. H. Cohen, F. Diaz y Diaz, and M. Olivier, Subexponential algorithms for class group and unit computations, J. Symbolic Comput. 24 (1997), no. 3-4, 433–441.^[MR]
20. Antoine Colin, Relative resolvents and partition tables in Galois group computations, in Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), ACM, New York, 1997, pp. 78–84 (electronic).^[MR]
21. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Partition graphs for finite symmetric groups, J. Graph Theory 25 (1997), no. 2, 107–117.^[MR]
22. Gene Cooperman, Larry Finkelstein, Michael Tselman, and Bryant York, Constructing permutation representations for matrix groups, J. Symbolic Comput. 24 (1997), no. 3-4, 471–488.^[MR]
23. J. E. Cremona, Algorithms for Modular Elliptic Curves, Cambridge University Press, Cambridge, 1997, pp. vi+376.^[MR]
24. M. Daberkow, Computing with subfields, J. Symbolic Comput. 24 (1997), no. 3-4, 371–384.^[MR]
25. M. Daberkow, C. Fieker, J. Klüners, M. Pohst, K. Roegner, M. Schörnig, and K. Wildanger, KANT V4, J. Symbolic Comput. 24 (1997), no. 3-4, 267–283.^[MR]
26. Nicholas James Doye, Order sorted computer algebra and coercions, PhD Thesis, University of Bath, 1997.
27. G. L. Ebert, Buekenhout-Tits unitals, J. Algebraic Combin. 6 (1997), no. 2, 133–140.^[MR]
28. G. L. Ebert, Replaceable nests, Mostly finite geometries (Iowa City, IA, 1996), Lecture Notes in Pure and Appl. Math., vol. 190, Dekker, New York, 1997, pp. 35–49.^[MR]
29. M. van Eupen and P. Lisonek, Classification of some optimal ternary linear codes of small length, Designs, Codes and Cryptography 10 (1997), 63–84.
30. D. L. Flannery, Cocyclic Hadamard matrices and Hadamard groups are equivalent, J. Algebra 192 (1997), no. 2, 749–779.^[MR]
31. M. Grassl, Thomas Beth, and T. Pellizzari, Codes for the quantum erasure channel, Phys. Rev. A (3) 56 (1997), no. 1, 33–38.^[MR]
32. T. Aaron Gulliver and Masaaki Harada, Classification of extremal double circulant formally self-dual even codes, Des. Codes Cryptogr. 11 (1997), no. 1, 25–35.^[MR]
33. Erich Kaltofen, Teaching computational abstract algebra, J. Symbolic Comput. 23 (1997), no. 5–6, 503–515.
34. John K. Karlof and Yaw O. Chang, Optimal permutation codes for the Gaussian channel, IEEE Trans. Inform. Theory 43 (1997), no. 1, 356–358.^[MR]
35. Gregor Kemper, Calculating invariants of modular reflection groups with Magma, Preprint (1997), 5 pages.
36. J. D. Key, B. Novick, and F. E. Sullivan, Binary codes of structures dual to unitals, in Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997), vol. 123, 1997, pp. 119–124.^[MR]
37. J. D. Key and F. D. Shobe, Some transitive Steiner triple systems of Bagchi and Bagchi, J. Statist. Plann. Inference 58 (1997), no. 1, 79–86.^[MR]
38. J. D. Key and V. D. Tonchev, Computational results for the known biplanes of order 9, Geometry, Combinatorial Designs and Related Structures (Spetses, 1996), London Math. Soc. Lecture Note Ser., vol. 245, Cambridge Univ. Press, Cambridge, 1997, pp. 113–122.^[MR]
39. Dimitri Leemans, Two nearly isomorphic groups, Atti Sem. Mat. Fis. Univ. Modena 45 (1997), no. 2, 373–376.^[MR]
40. Zhongshan Li, Frank Hall, and Fuzhen Zhang, Sign patterns of nonnegative normal matrices, in Proceedings of the Fifth Conference of the International Linear Algebra Society (Atlanta, GA, 1995), vol. 254, 1997, pp. 335–354.^[MR]
41. Eugene M. Luks, Ferenc Rákóczi, and Charles R. B. Wright, Some algorithms for nilpotent permutation groups, J. Symbolic Comput. 23 (1997), no. 4, 335–354.^[MR]
42. Jesper M. Møller, The 2-compact groups in the A-family are N-determined, Preprint (1997), 31 pages.
43. Manley Perkel and Cheryl E. Praeger, Polygonal graphs: New families and an approach to their analysis, in Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997), vol. 124, 1997, pp. 161–173.^[MR]
44. Cheryl E. Praeger and Leonard H. Soicher, Low Rank Representations and Graphs for Sporadic Groups, Australian Mathematical Society Lecture Series, vol. 8, Cambridge University Press, Cambridge, 1997, pp. xii+141.^[MR]
45. Ákos Seress, An introduction to computational group theory, Notices Amer. Math. Soc. 44 (1997), no. 6, 671–679.^[MR]
46. Gary J. Sherman, Trying to do group theory with undergraduates and computers, J. Symbolic Comput. 23 (1997), no. 5–6, 577–587.
47. Charles C. Sims, Computing with subgroups of automorphism groups of finite groups, in ISSAC '97: Proceedings of the 1997 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 1997, pp. 400–403.^[doi]
48. N. P. Smart, Thue and Thue-Mahler equations over rings of integers, J. London Math. Soc. (2) 56 (1997), no. 3, 455–462.^[MR]
49. 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]
50. Michael Vaughan-Lee, Engel-4 groups of exponent 5, Proc. London Math. Soc. (3) 74 (1997), no. 2, 306–334.^[MR]
51. N. A. Vavilov, V. I. Mysovskikh, and Yu. G. Teterin, Computational group theory in St. Petersburg, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 236 (1997), no. Vopr. Teor. Predst. Algebr i Grupp. 5, 42–49, 215–216.^[MR]
52. Katsushi Waki, Calculation of direct summands of FG-modules, Sci. Rep. Hirosaki Univ. 44 (1997), no. 2, 193–200.^[MR]
53. Michael Weller, Construction of classes of subgroups of small index in p-groups, Arch. Math. (Basel) 68 (1997), no. 2, 89–99.^[MR]

1998

1. Alejandro Adem, Dikran Karagueuzian, R. James Milgram, and Kristin Umland, The cohomology of the Lyons group and double covers of alternating groups, J. Algebra 208 (1998), no. 2, 452–479.^[MR]
2. Roger C. Alperin, Platonic triangles of groups, Experiment. Math. 7 (1998), no. 3, 191–219.^[MR]
3. Jianbei An and E. A. O'Brien, A local strategy to decide the Alperin and Dade conjectures, J. Algebra 206 (1998), no. 1, 183–207.^[MR]
4. E. F. Assmus, Jr. and J. D. Key, Polynomial codes and finite geometries, Handbook of Coding Theory, Vol. I, II, North-Holland, Amsterdam, 1998, pp. 1269–1343.^[MR]
5. Anton Betten, Adalbert Kerber, Reinhard Laue, and Alfred Wassermann, Simple 8-designs with small parameters, Des. Codes Cryptogr. 15 (1998), no. 1, 5–27.^[MR]
6. Norman Biggs, Constructions for cubic graphs with large girth, Electron. J. Combin. 5 (1998), Article 1, 25 pp. (electronic).^[MR]
7. Jean Brocas, Francis Buekenhout, and Michel Dehon, Enantiomeric labelling of reaction graphs, J. Chem. Inf. Comput. Sci. (1998), no. 38, 798-810.
8. Robert R. Bruner, Some root invariants and Steenrod operations in Ext_A(F₂,F₂), Homotopy Theory via Algebraic Geometry and Group Representations (Evanston, IL, 1997), Contemp. Math., vol. 220, Amer. Math. Soc., Providence, RI, 1998, pp. 27–33.^[MR]
9. Francis Buekenhout, Michel Dehon, and Philippe Cara, Geometries of small almost simple groups based on maximal subgroups, Bull. Belg. Math. Soc. Simon Stevin (1998), no. suppl., ii+128.^[MR]
10. Francis Buekenhout, Michel Dehon, and Dimitri Leemans, On flag-transitive incidence geometries of rank 6 for the Mathieu group M₁₂, Groups and geometries (Siena, 1996), Trends Math., Birkhäuser, Basel, 1998, pp. 39–54.^[MR]
11. A. Robert Calderbank, Eric M. Rains, P. W. Shor, and Neil J. A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory 44 (1998), no. 4, 1369–1387.^[MR]
12. Colin Campbell, George Havas, Stephen Linton, and Edmund Robertson, Symmetric presentations and orthogonal groups, The Atlas of Finite Groups: Ten Years On (Birmingham, 1995), London Math. Soc. Lecture Note Ser., vol. 249, Cambridge Univ. Press, Cambridge, 1998, pp. 1–10.^[MR]
13. Donald I. Cartwright and Tim Steger, Application of the Bruhat–Tits tree of SU₃(h) to some A₂ groups, J. Austral. Math. Soc. Ser. A 64 (1998), no. 3, 329–344.^[MR]
14. Michael Clausen, Beiträge zum Entwurf schneller Spektraltransformationen, PhD Thesis, Universität Karlsruhe, 1998.
15. Marston Conder and Cai Heng Li, On isomorphisms of finite Cayley graphs, European J. Combin. 19 (1998), no. 8, 911–919.^[MR]
16. Marston Conder and Cameron G. Walker, The infinitude of 7-arc-transitive graphs, J. Algebra 208 (1998), no. 2, 619–629.^[MR]
17. John H. Conway, Alexander Hulpke, and John McKay, On transitive permutation groups, LMS J. Comput. Math. 1 (1998), 1–8 (electronic).^[MR]
18. Patrick Kenneth Corn, Del Pezzo Surfaces and the Brauer-Manin obstruction, PhD Thesis, University of California, Berkley, 1998.
19. Wolfram Decker and Theo de Jong, Gröbner bases and invariant theory, Gröbner bases and applications (Linz, 1998), London Math. Soc. Lecture Note Ser., vol. 251, Cambridge Univ. Press, Cambridge, 1998, pp. 61–89.^[MR]
20. P. Diaconis and L. Saloff-Coste, Walks on generating sets of groups, Invent. Math. 134 (1998), no. 2, 251–299.^[MR]
21. Darrin Doud, A procedure to calculate torsion of elliptic curves over Q, Manuscripta Math. 95 (1998), no. 4, 463–469.^[MR]
22. Jeremy Dover, Subregular spreads of PG(2n + 1,q), Finite Fields Appl. 4 (1998), no. 4, 362–380.^[MR/doi]
23. G. L. Ebert, K. Metsch, and T. Szönyi, Caps embedded in Grassmannians, Geom. Dedicata 70 (1998), no. 2, 181–196.^[MR]
24. Graham Ellis, On groups with a finite nilpotent upper central quotient, Arch. Math. (Basel) 70 (1998), no. 2, 89–96.^[MR]
25. Graham Ellis, On the computation of certain homotopical-functors, LMS J. Comput. Math. 1 (1998), 25–41 (electronic).^[MR]
26. Jean-Charles Faugère, François Moreau de Saint-Martin, and Fabrice Rouillier, Design of regular nonseparable bidimensional wavelets using Gröbner basis techniques, IEEE Trans. Signal Process. 46 (1998), no. 4, 845–856.^[MR]
27. A. Fukshansky and G. Stroth, Semiclassical parabolic systems related to M₂₄, Geom. Dedicata 70 (1998), no. 3, 305–329.^[MR]
28. S. Gao and J. D. Key, Bases of minimum-weight vectors for codes from designs, Finite Fields Appl. 4 (1998), no. 1, 1–15.^[MR]
29. Neil A. Gordon, Guglielmo Lunardon, and Ron Shaw, Linear sections of GL(4,2), Bull. Belg. Math. Soc. Simon Stevin 5 (1998), no. 2-3, 287–311.^[MR]
30. Harald Gottschalk and Dimitri Leemans, The residually weakly primitive geometries of the Janko group J₁, Groups and Geometries (Siena, 1996), Trends Math., Birkhäuser, Basel, 1998, pp. 65–79.^[MR]
31. 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.
32. M. Grassl, Thomas Beth, and M. Rötteler, Computing local invariants of quantum-bit systems, Phys. Rev. A. 58 (1998), no. 3, 833-1839.
33. Markus Grassl, Martin Rötteler, and Thomas Beth, Computing local invariants of quantum-bit systems, Phys. Rev. A (3) 58 (1998), no. 3, 1833–1839.^[MR]
34. T. Aaron Gulliver and Masaaki Harada, Classification of extremal double circulant self-dual codes of lengths 64 to 72, Des. Codes Cryptogr. 13 (1998), no. 3, 257–269.^[MR]
35. T. Aaron Gulliver and Masaaki Harada, Double circulant self-dual codes over Z_2k, IEEE Trans. Inform. Theory 44 (1998), no. 7, 3105–3123.^[MR]
36. George Havas, Bohdan S. Majewski, and Keith R. Matthews, Extended GCD and Hermite normal form algorithms via lattice basis reduction, Experiment. Math. 7 (1998), no. 2, 125–136.^[MR]
37. George Havas, M. F. Newman, Alice C. Niemeyer, and Charles C. Sims, Computing in groups with exponent six, Computational and Geometric Aspects of Modern Algebra, London Math. Soc. Lecture Note Ser., vol. 275, Cambridge Univ. Press, Cambridge, 1998, pp. 87–100.
38. Derek F. Holt, The Meataxe as a tool in computational group theory, The Atlas of Finite Groups: Ten Years On (Birmingham, 1995), London Math. Soc. Lecture Note Ser., vol. 249, Cambridge Univ. Press, Cambridge, 1998, pp. 74–81.^[MR]
39. I. M. Isaacs and Dikran Karagueuzian, Conjugacy in groups of upper triangular matrices, J. Algebra 202 (1998), no. 2, 704–711.^[MR]
40. I. M. Isaacs and Dikran Karagueuzian, Erratum: "Conjugacy in groups of upper triangular matrices" [J. Algebra 202 (1998), no. 2, 704–711; MR1617655 (99b:20011)], J. Algebra 208 (1998), no. 2, 722.^[MR]
41. William M. Kantor, Simple groups in computational group theory, in Proceedings of the International Congress of Mathematicians, Vol. II (Berlin, 1998), 1998, pp. 77–86 (electronic).^[MR]
42. Gregor Kemper, Computational invariant theory, The Curves Seminar at Queen's. Vol. XII (Kingston, ON, 1998), Queen's Papers in Pure and Appl. Math., vol. 114, Queen's Univ., Kingston, ON, 1998, pp. 5–26.^[MR]
43. J. D. Key, Codes and finite geometries, in Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), vol. 131, 1998, pp. 85–99.^[MR]
44. J. D. Key and M. J. de Resmini, Small sets of even type and codewords, J. Geom. 61 (1998), no. 1-2, 83–104.^[MR]
45. Peter Kirrinnis, Partial fraction decomposition in C(z) and simultaneous Newton iteration for factorization in C[z], J. Complexity 14 (1998), no. 3, 378–444.^[MR]
46. Czesław Kościelny, Computing in the composite GF(q^m) of characteristic 2 formed by means of an irreducible binomial, Appl. Math. Comput. Sci. 8 (1998), no. 3, 671–680.^[MR]
47. Dimitri Leemans, Classification of RWPRI Geometries for the Suzuki Simple Groups, PhD Thesis, Université Libre de Bruxeelles, 1998.
48. Dimitri Leemans, The rank 2 geometries of the simple Suzuki groups Sz(q), Beiträge Algebra Geom. 39 (1998), no. 1, 97–120.^[MR]
49. 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]
50. G. I. Lehrer, The cohomology of the regular semisimple variety, J. Algebra 199 (1998), no. 2, 666–689.^[MR]
51. Eddie H. Lo, A polycyclic quotient algorithm, J. Symbolic Comput. 25 (1998), no. 1, 61–97.^[MR]
52. Gary McGuire and Harold N. Ward, A determination of the weight enumerator of the code of the projective plane of order 5, Note Mat. 18 (1998), no. 1, 71–99 (1999).^[MR]
53. Gary McGuire and Harold N. Ward, The weight enumerator of the code of the projective plane of order 5, Geom. Dedicata 73 (1998), no. 1, 63–77.^[MR]
54. Gerhard O. Michler and Øyvind Solberg, Testing modules of groups of even order for simplicity, J. Algebra 202 (1998), no. 1, 229–242.^[MR]
55. Torsten Minkwitz, An algorithm for solving the factorization problem in permutation groups, J. Symbolic Comput. 26 (1998), no. 1, 89–95.^[MR]
56. F. Morain, Primality proving using elliptic curves: An update, Algorithmic Number Theory (Portland, OR, 1998), Lecture Notes in Comput. Sci., vol. 1423, Springer, Berlin, 1998, pp. 111–127.^[MR]
57. Margaret Morton, A note on arc-transitive circulants, Bull. Inst. Combin. Appl. 23 (1998), 63–68.^[MR]
58. Gabriele Nebe, Finite quaternionic matrix groups, Represent. Theory 2 (1998), 106–223 (electronic).^[MR]
59. M. F. Newman, Werner Nickel, and Alice C. Niemeyer, Descriptions of groups of prime-power order, J. Symbolic Comput. 25 (1998), no. 5, 665–682.^[MR]
60. Alice C. Niemeyer and Cheryl E. Praeger, A recognition algorithm for classical groups over finite fields, Proc. London Math. Soc. (3) 77 (1998), no. 1, 117–169.^[MR]
61. J. Opgenorth, W. Plesken, and T. Schulz, Crystallographic algorithms and tables, Acta Cryst. Sect. A 54 (1998), no. 5, 517–531.^[MR]
62. E. M. Rains and N. J. A. Sloane, The shadow theory of modular and unimodular lattices, J. Number Theory 73 (1998), no. 2, 359–389.^[MR]
63. Colin Ramsay, Trades and defining sets: theoretical and computational results, PhD Thesis, University of Queensland, 1998.
64. L. J. Rylands and D. E. Taylor, Matrix generators for the orthogonal groups, J. Symbolic Comput. 25 (1998), no. 3, 351–360.^[MR]
65. Fritz Schwarz, ALL TYPES: An algebraic language and type system, Artificial Intelligence and Symbolic Computation: International Conference AISC'98, Plattsburgh, New York, USA, September 1998. Proceedings, Lecture Notes in Computer Science, vol. 1476, Springer, Berlin, 1998, pp. 270.
66. Ákos Seress, Nearly linear time algorithms for permutation groups: an interplay between theory and practice, Acta Appl. Math. 52 (1998), no. 1-3, 183–207.^[MR]
67. P. W. Shor and N. J. A. Sloane, A family of optimal packings in Grassmannian manifolds, J. Algebraic Combin. 7 (1998), no. 2, 157–163.^[MR]
68. Nigel P. Smart, The Algorithmic Resolution of Diophantine Equations, London Mathematical Society Student Texts, vol. 41, Cambridge University Press, Cambridge, 1998, pp. xvi+243.^[MR]
69. Polina Strogova, Finding a finite group presentation using rewriting, Symbolic Rewriting Techniques (Ascona, 1995), Progr. Comput. Sci. Appl. Logic, vol. 15, Birkhäuser, Basel, 1998, pp. 267–276.^[MR]
70. R. M. W. Wood, Problems in the Steenrod algebra, Bull. London Math. Soc. 30 (1998), no. 5, 449–517.^[MR]

1999

1. Jianbei An and E. A. O'Brien, The Alperin and Dade conjectures for the Fischer simple group Fi₂₃, Internat. J. Algebra Comput. 9 (1999), no. 6, 621–670.^[MR]
2. David F. Anderson and Philip S. Livingston, The zero-divisor graph of a commutative ring, J. Algebra 217 (1999), no. 2, 434–447.^[MR]
3. E. F. Assmus, Jr. and Arthur A. Drisko, Binary codes of odd-order nets, Des. Codes Cryptogr. 17 (1999), no. 1-3, 15–36.^[MR]
4. Philippe Aubry and Marc Moreno Maza, Triangular sets for solving polynomial systems: A comparative implementation of four methods, J. Symbolic Comput. 28 (1999), no. 1-2, 125–154.^[MR]
5. László Babai and Robert Beals, A polynomial-time theory of black box groups. I, Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Note Ser., vol. 260, Cambridge Univ. Press, Cambridge, 1999, pp. 30–64.^[MR]
6. Christine Bachoc, On harmonic weight enumerators of binary codes, Des. Codes Cryptogr. 18 (1999), no. 1-3, 11–28.^[MR]
7. R. D. Baker, A. Bonisoli, A. Cossidente, and G. L. Ebert, Mixed partitions of PG(5,q), Discrete Math. 208/209 (1999), 23–29.^[MR]
8. R. D. Baker, J. M. Dover, G. L. Ebert, and K. L. Wantz, Hyperbolic fibrations of PG(3,q), European J. Combin. 20 (1999), no. 1, 1–16.^[MR]
9. Clemens Ballarin, Computer algebra and thereom proving, PhD Thesis, University of Cambridge, 1999.^[link]
10. Eiichi Bannai, Steven T. Dougherty, Masaaki Harada, and Manabu Oura, Type II codes, even unimodular lattices, and invariant rings, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1194–1205.^[MR]
11. L. M. Batten and J. M. Dover, Some sets of type (m,n) in cubic order planes, Des. Codes Cryptogr. 16 (1999), no. 3, 211–213.^[MR]
12. O. Bauduin, Géométries résiduellement faiblement primitives de pitits groupes affins, Master's Thesis, Université Libre de Bruxelles, 1999.
13. Hans Ulrich Besche and Bettina Eick, The groups of order at most 1000 except 512 and 768, J. Symbolic Comput. 27 (1999), no. 4, 405–413.^[MR]
14. Koichi Betsumiya, T. Aaron Gulliver, and Masaaki Harada, Binary optimal linear rate 1/2 codes, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Honolulu, HI, 1999), Lecture Notes in Comput. Sci., vol. 1719, Springer, Berlin, 1999, pp. 462–471.^[MR]
15. Ezio Biglieri, John K. Karlof, and Emanuele Viterbo, Representing group codes as permutation codes, IEEE Trans. Inform. Theory 45 (1999), no. 6, 2204–2207.^[MR]
16. A. Bonnecaze and P. Udaya, Cyclic codes and self-dual codes over F₂+uF₂, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1250–1255.^[MR]
17. Alexis Bonnecaze, Bernard Mourrain, and Patrick Solé, Jacobi polynomials, type II codes, and designs, Des. Codes Cryptogr. 16 (1999), no. 3, 215–234.^[MR]
18. Nigel Boston, The minimum distance of the [137,69] binary quadratic residue code, IEEE Trans. Inform. Theory 45 (1999), no. 1, 282.^[MR]
19. Nigel Boston and Charles Leedham-Green, Counterexamples to a conjecture of Lemmermeyer, Arch. Math. (Basel) 72 (1999), no. 3, 177–179.^[MR]
20. Richard P. Brent, Factorization of the tenth Fermat number, Math. Comp. 68 (1999), no. 225, 429–451.^[MR]
21. Francis Buekenhout, Michel Dehon, and Dimitri Leemans, An atlas of residually weakly primitive geometries for small groups, Acad. Roy. Belg. Cl. Sci. Mém. Collect. 8^o (3) 14 (1999), 175.^[MR]
22. Francis Buekenhout and Dimitri Leemans, On a geometry of Ivanov and Shpectorov for the O'Nan sporadic simple group, J. Combin. Theory Ser. A 85 (1999), no. 2, 148–164.^[MR]
23. Emilio Bujalance and Marston Conder, On cyclic groups of automorphisms of Riemann surfaces, J. London Math. Soc. (2) 59 (1999), no. 2, 573–584.^[MR]
24. A. R. Calderbank, R. H. Hardin, E. M. Rains, P. W. Shor, and N. J. A. Sloane, A group-theoretic framework for the construction of packings in Grassmannian spaces, J. Algebraic Combin. 9 (1999), no. 2, 129–140.^[MR]
25. Neil J. Calkin, Jennifer D. Key, and Marialuisa J. de Resmini, Minimum weight and dimension formulas for some geometric codes, Des. Codes Cryptogr. 17 (1999), no. 1-3, 105–120.^[MR]
26. Peter J. Cameron, Permutation Groups, London Mathematical Society Student Texts, vol. 45, Cambridge University Press, Cambridge, 1999, pp. x+220.^[MR]
27. Jon F. Carlson, Problems in the calculation of group cohomology, Computational Methods for Representations of Groups and Algebras (Essen, 1997), Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 107–120.^[MR]
28. Jon F. Carlson, John S. Maginnis, and R. James Milgram, The cohomology of the sporadic groups J₂ and J₃, J. Algebra 214 (1999), no. 1, 143–173.^[MR]
29. K. L. Clark and J. D. Key, Geometric codes over fields of odd prime power order, in Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), vol. 137, 1999, pp. 177–186.^[MR]
30. Henri Cohen, A survey of computational class field theory, J. Théor. Nombres Bordeaux 11 (1999), no. 1, 1–13.^[MR]
31. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 290, Springer-Verlag, New York, 1999, pp. lxxiv+703.^[MR]
32. G. D. Cooperman, W. Lempken, G. O. Michler, and M. Weller, A new existence proof of Janko's simple group J₄, Computational methods for representations of groups and algebras (Essen, 1997), Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 161–175.^[MR]
33. R. T. Curtis, Symmetric generation and existence of the Janko group J1, J. Group Theory 2 (1999), no. 4, 355–366.^[MR]
34. Harm Derksen, Computation of invariants for reductive groups, Adv. Math. 141 (1999), no. 2, 366–384.^[MR]
35. Cunsheng Ding and Tor Helleseth, Generalized cyclotomic codes of length p₁^e₁…p_t^e_t, IEEE Trans. Inform. Theory 45 (1999), no. 2, 467–474.^[MR]
36. Steven T. Dougherty, Philippe Gaborit, Masaaki Harada, and Patrick Solé, Type II codes over F₂+uF₂, IEEE Trans. Inform. Theory 45 (1999), no. 1, 32–45.^[MR]
37. I. Duursma, P. Gaudry, and F. Morain, Speeding up the discrete log computation on curves with automorphisms, Advances in Cryptology—Asiacrypt'99 (Singapore), Lecture Notes in Comput. Sci., vol. 1716, Springer, Berlin, 1999, pp. 103–121.^[MR]
38. G. L. Ebert and J. W. P. Hirschfeld, Complete systems of lines on a Hermitian surface over a finite field, Des. Codes Cryptogr. 17 (1999), no. 1-3, 253–268.^[MR]
39. Bettina Eick and E. A. O'Brien, Enumerating p-groups, J. Austral. Math. Soc. Ser. A 67 (1999), no. 2, 191–205.^[MR]
40. Graham Ellis, Enumerating prime-power homotopy k-types, Math. Z. 232 (1999), no. 1, 63–71.^[MR]
41. Graham Ellis and Irina Kholodna, Computing second cohomology of finite groups with trivial coefficients, Homology Homotopy Appl. 1 (1999), 163–168 (electronic).^[MR]
42. Graham Ellis and Irina Kholodna, Three-dimensional presentations for the groups of order at most 30, LMS J. Comput. Math. 2 (1999), 93–117+2 appendixes (HTML and source code) (electronic).^[MR]
43. Ronald Evans, Henk D. L. Hollmann, Christian Krattenthaler, and Qing Xiang, Gauss sums, Jacobi sums, and p-ranks of cyclic difference sets, J. Combin. Theory Ser. A 87 (1999), no. 1, 74–119.^[MR]
44. Susan Evans-Riley, M. F. Newman, and Csaba Schneider, On the soluble length of groups with prime-power order, Bull. Austral. Math. Soc. 59 (1999), no. 2, 343–346.^[MR/doi]
45. Xin Gui Fang, George Havas, and Cheryl E. Praeger, On the automorphism groups of quasiprimitive almost simple graphs, J. Algebra 222 (1999), no. 1, 271–283.^[MR]
46. Xin Gui Fang, George Havas, and Jie Wang, Automorphism groups of certain non-quasiprimitive almost simple graphs, Groups St. Andrews 1997 in Bath, I, London Math. Soc. Lecture Note Ser., vol. 260, Cambridge Univ. Press, Cambridge, 1999, pp. 267–274.^[MR]
47. J. E. Fields, P. Gaborit, W. C. Huffman, and V. Pless, On the classification of extremal even formally self-dual codes, Des. Codes Cryptogr. 18 (1999), no. 1-3, 125–148.^[MR]
48. Andrew Francis, The minimal basis for the centre of an Iwahori-Hecke algebra, J. Algebra 221 (1999), no. 1, 1–28.^[MR]
49. Andreas Franke and Michael Kohlhase, System description: mathweb, an agent-based communication layer for distributed automated theorem proving, Automated Deduction - Cade-16: Proceedings of the 16th International Conference on Automated Deduction, Trento, Italy, July 1999, Lecture Notes in Computer Science, vol. 1632, Springer, Berlin, Heidelberg, 1999, pp. 243–258.
50. Anna Fukshansky and Corinna Wiedorn, C-extensions of the Petersen geometry for M₂₂, European J. Combin. 20 (1999), no. 3, 233–238.^[MR]
51. Harald Ganzinger (ed.), Automated deduction—CADE-16, in Proceedings of the 16th International Conference held in Trento, July 7–10, 1999, Lecture Notes in Computer Science, vol. 1632, Springer-Verlag, Berlin, 1999, pp. xiv+429.^[MR]
52. Karin Gatermann and Frédéric Guyard, Gröbner bases, invariant theory and equivariant dynamics, J. Symbolic Comput. 28 (1999), no. 1-2, 275–302.^[MR]
53. Massimo Giulietti, Inviluppi di k-archi in piani proiettivi sopra campi finiti e basi di Gröbner, Rendiconti del Circolo Matematico di Palermo 48 (1999), no. 1, 191–200.
54. Marc Giusti and Éric Schost, Solving some overdetermined polynomial systems, in ISSAC '99: Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (Vancouver, BC), ACM, New York, 1999, pp. 1–8 (electronic).^[MR]
55. W. A. de Graaf, Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras, J. Pure Appl. Algebra 139 (1999), no. 1–3, 25–39.^[MR]
56. Markus Grassl and Thomas Beth, Quantum BCH codes, in Proceedings X Symposium on Theoretical Electrical Engineering. Magdeburg, Sept. 6–9, 1999, 1999, pp. 207-212.
57. Marcus Greferath and Emanuele Viterbo, On Z₄- and Z₉-linear lifts of the Golay codes, IEEE Trans. Inform. Theory 45 (1999), no. 7, 2524–2527.^[MR]
58. Masaaki Harada, Construction of an extremal self-dual code of length 62, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1232–1233.^[MR]
59. Masaaki Harada, New extremal self-dual codes of lengths 36 and 38, IEEE Trans. Inform. Theory 45 (1999), no. 7, 2541–2543.^[MR]
60. Evelyn L. Hart and Edward C. Keppelmann, Explorations in Nielsen periodic point theory for the double torus, Topology Appl. 95 (1999), no. 1, 1–30.^[MR]
61. George Havas, Derek F. Holt, P. E. Kenne, and Sarah Rees, Some challenging group presentations, J. Austral. Math. Soc. Ser. A 67 (1999), no. 2, 206–213.^[MR]
62. George Havas, Bohdan S. Majewski, and Keith R. Matthews, Addenda and errata: "Extended GCD and Hermite normal form algorithms via lattice basis reduction", Experiment. Math. 8 (1999), no. 2, 205.^[MR]
63. George Havas, M. F. Newman, Alice C. Niemeyer, and Charles C. Sims, Groups with exponent six, Comm. Algebra 27 (1999), no. 8, 3619–3638.^[MR]
64. George Havas and Charles C. Sims, A presentation for the Lyons simple group, Computational methods for representations of groups and algebras (Essen, 1997), Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 241–249.^[MR]
65. Lenwood S. Heath and Nicholas A. Loehr, New algorithms for generating Conway polynomials over finite fields, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999), ACM, New York, 1999, pp. 429–437.^[MR]
66. Derek F. Holt and Sarah Rees, Computing with abelian sections of finitely presented groups, J. Algebra 214 (1999), no. 2, 714–728.^[MR]
67. Alexander Hulpke, Computing subgroups invariant under a set of automorphisms, J. Symbolic Comput. 27 (1999), no. 4, 415–427.^[MR]
68. William M. Kantor and Tim Penttila, Reconstructing simple group actions, Geometric Group Theory Down Under (Canberra, 1996), de Gruyter, Berlin, 1999, pp. 147–180.^[MR]
69. Dikran B. Karagueuzian and Peter Symonds, The module structure of a group action on a polynomial ring, J. Algebra 218 (1999), no. 2, 672–692.^[MR]
70. Gregor Kemper, An algorithm to calculate optimal homogeneous systems of parameters, J. Symbolic Comput. 27 (1999), no. 2, 171–184.^[MR]
71. Gregor Kemper and Gunter Malle, Invariant fields of finite irreducible reflection groups, Math. Ann. 315 (1999), no. 4, 569–586.^[MR]
72. 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]
73. J. D. Key, Some error-correcting codes and their applications, Applied Mathematical Modeling: A Multidisciplinary Approach, Edited by D. R. Shier and K. T. Wallenius, CRC Press, Boca Raton, Fl., 1999.
74. Aristides Kontogeorgis, The group of automorphisms of cyclic extensions of rational function fields, J. Algebra 216 (1999), no. 2, 665–706.^[MR]
75. I. Kotsireas and D. Lazard, Central configurations of the 5-body problem with equal masses in three-dimensional space, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 258 (1999), no. Teor. Predst. Din. Sist. Komb. i Algoritm. Metody. 4, 292–317, 360–361.^[MR]
76. Doug Kuhlman, The minimum distance of the [83,42] ternary quadratic residue code, IEEE Trans. Inform. Theory 45 (1999), no. 1, 282.^[MR]
77. Kenneth Kunen, G-loops and permutation groups, J. Algebra 220 (1999), no. 2, 694–708.^[MR]
78. Dimitri Leemans, An atlas of regular thin geometries for small groups, Math. Comp. 68 (1999), no. 228, 1631–1647.^[MR]
79. Dimitri Leemans, The rank 3 geometries of the simple Suzuki groups Sz(q), Note Mat. 19 (1999), no. 1, 43–63 (2000).^[MR]
80. Dimitri Leemans, The residually weakly primitive geometries of the Suzuki simple group Sz(8), Groups St. Andrews 1997 in Bath, II, London Math. Soc. Lecture Note Ser., vol. 261, Cambridge Univ. Press, Cambridge, 1999, pp. 517–526.^[MR]
81. Robert H. Lewis and Michael Wester, Comparison of polynomial-oriented computer algebra systems, SIGSAM Bull. 33 (1999), no. 4, 5–13.^[doi]
82. Yujie Ma, Cohomology of special 128-groups, Mathematics-Mechanization Research Preprints (1999), 5 pages.^[link]
83. Stefan Măruşter, Viorel Negru, Dana Petcu, and Călin Sandru, Intelligent front-end for solving differential and non-linear equations systems, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 258 (1999), no. Teor. Predst. Din. Sist. Komb. i Algoritm. Metody. 4, 318–334, 361.^[MR]
84. Mbakop Guy Merlin, Eziente losung reeller polynomialer gleichungssysteme, PhD Thesis, Humboldt-Universität, Berlin, 1999.^[link]
85. Takunari Miyazaki, Polynomial-time computation in matrix groups, PhD Thesis, University of Oregon, 1999.
86. Eva Nuria Müller, On the crosscorrelation of sequences over GF(p) with short periods, IEEE Trans. Inform. Theory 45 (1999), no. 1, 289–295.^[MR]
87. Jörn Müller-Quade and Rainer Steinwandt, Basic algorithms for rational function fields, J. Symbolic Comput. 27 (1999), no. 2, 143–170.^[MR]
88. M. F. Newman and E. A. O'Brien, Classifying 2-groups by coclass, Trans. Amer. Math. Soc. 351 (1999), no. 1, 131–169.^[MR]
89. M. F. Newman and Michael Vaughan-Lee, Engel-4 groups of exponent 5. II. Orders, Proc. London Math. Soc. (3) 79 (1999), no. 2, 283–317.^[MR]
90. 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 (1999), no. 2, 223–253.^[MR]
91. S. Petitjean, Algebraic geometry and computer vision: Polynomial systems, real and complex roots, J. Math. Imaging Vision 10 (1999), no. 3, 191–220.^[MR]
92. Cheryl E. Praeger, Primitive prime divisor elements in finite classical groups, Groups St. Andrews 1997 in Bath, II, London Math. Soc. Lecture Note Ser., vol. 261, Cambridge Univ. Press, Cambridge, 1999, pp. 605–623.^[MR]
93. Richard Rannard, Computing immersed normal surfaces in the figure-eight knot complement, Experiment. Math. 8 (1999), no. 1, 73–84.^[MR]
94. M. P. F. du Sautoy, J. J. McDermott, and G. C. Smith, Zeta functions of crystallographic groups and analytic continuation, Proc. London Math. Soc. (3) 79 (1999), no. 3, 511–534.^[MR]
95. Csaba Schneider, Some results on the Derived Series of Finite p-groups, PhD Thesis, Australian National University, 1999.
96. Ruth Schwingel, The tensor product of polynomials, Experiment. Math. 8 (1999), no. 4, 395–397.^[MR]
97. R. James Shank and David L. Wehlau, On the depth of the invariants of the symmetric power representations of SL₂(F_p), J. Algebra 218 (1999), no. 2, 642–653.^[MR]
98. Ron Shaw, A property of A₇, and a maximal 3-dimensional linear section of GL(4,2), Discrete Math. 197/198 (1999), 733–747.^[MR/link]
99. N. J. A. Sloane, Packing planes in four dimensions and other mysteries, In Algebraic Combinatorics and Related Topics (Yamagata 1997), ed. E. Bannai and M. Harada and M. Ozeki, Yamagata University, 1999, 21 pages.^[arXiv]
100. Rainer Steinwandt, Decomposing systems of polynomial equations, Computer Algebra in Scientific Computing—CASC'99 (Munich), Springer, Berlin, 1999, pp. 387–407.^[MR]
101. Barbara M. Terhal, Isaac L. Chuang, David P. Di Vincenzo, Markus Grassl, and John A. Smolin, Simulating quantum operations with mixed environments, Phys. Rev 60 (1999), no. 2, 881-885.^[MR]
102. D. W. Vasco, Intersections, ideals, and inversion, Inverse Problems 15 (1999), no. 6, 1573–1602.^[MR]
103. Dongming Wang, Decomposing algebraic varieties, Automated Deduction in Geometry (Beijing, 1998), Lecture Notes in Comput. Sci., vol. 1669, Springer, Berlin, 1999, pp. 180–206.^[MR]
104. Blair Williams, Ovoids of Parabolic and Hyperbolic Spaces, PhD Thesis, University of Western Australia, 1999.
105. Pawel Wocjan, Brill-Noether algorithm construction of geometric Goppa codes and absolute factorization of polynomials, PhD Thesis, Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, 1999.