2000

  1. Daniel Augot and Lancelot Pecquet, A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes, IEEE Trans. Inform. Theory 46 (2000), no. 7, 2605–2614.[MR]
  2. Christine Bachoc and Philippe Gaborit, On extremal additive F4 codes of length 10 to 18, J. Théor. Nombres Bordeaux 12 (2000), no. 2, 255–271.[MR]
  3. Christine Bachoc, T. Aaron Gulliver, and Masaaki Harada, Isodual codes over Z2k and isodual lattices, J. Algebraic Combin. 12 (2000), no. 3, 223–240.[MR]
  4. R. D. Baker, J. M. Dover, G. L. Ebert, and K. L. Wantz, Perfect Baer subplane partitions and three-dimensional flag-transitive planes, Des. Codes Cryptogr. 21 (2000), no. 1-3, 19–39.[MR]
  5. Ronald D. Baker, Jeremy M. Dover, Gary L. Ebert, and Kenneth L. Wantz, Baer subgeometry partitions, J. Geom. 67 (2000), no. 1-2, 23–34.[MR]
  6. Clemens Ballarin, Jacques Calmet, and Peter Kullmann, Integration of deduction and computation, Preprint (2000), 19 pages.
  7. Lynn M. Batten, Michelle Davidson, and Leo Storme, An analysis of Chen's construction of minimum-distance five codes, IEEE Trans. Inform. Theory 46 (2000), no. 2, 505–511.[MR]
  8. D. J. Benson and J. F. Carlson, Cohomology of the double cover of the Mathieu group M12, J. Algebra 226 (2000), no. 1, 547–576.[MR]
  9. T. P. Berger, Quasi-cyclic Goppa codes, in IEEE International Symposium on Information Theory, ISIT 2000, 2000.[doi]
  10. Thierry P. Berger, Goppa and related codes invariant under a prescribed permutation, IEEE Trans. Inform. Theory 46 (2000), no. 7, 2628–2633.[MR]
  11. Christine Bessenrodt, Tensor products of representations of the symmetric groups and related groups, Sūrikaisekikenkyūsho Kōkyūroku (2000), no. 1149, 1–15.[MR]
  12. Grégoire Bommier and Francis Blanchet, Binary quasi-cyclic Goppa codes, Des. Codes Cryptogr. 20 (2000), no. 2, 107–124.[MR]
  13. Arrigo Bonisoli and Antonio Cossidente, Mixed partitions of projective geometries, Des. Codes Cryptogr. 20 (2000), no. 2, 143–154.[MR]
  14. Arrigo Bonisoli and Pasquale Quattrocchi, Each invertible sharply d-transitive finite permutation set with d ≥ 4 is a group, J. Algebraic Combin. 12 (2000), no. 3, 241–250.[MR]
  15. A. Bonnecaze, E. Rains, and P. Solé, 3-colored 5-designs and Z4-codes, J. Statist. Plann. Inference 86 (2000), no. 2, 349–368.[MR]
  16. Nigel Boston and David Perry, Maximal 2-extensions with restricted ramification, J. Algebra 232 (2000), no. 2, 664–672.[MR]
  17. Nigel Boston and Judy L. Walker, 2-groups with few conjugacy classes, Proc. Edinburgh Math. Soc. (2) 43 (2000), no. 1, 211–217.[MR]
  18. John N. Bray, An improved method for generating the centralizer of an involution, Arch. Math. (Basel) 74 (2000), no. 4, 241–245.[MR]
  19. John N. Bray and Robert T. Curtis, A systematic approach to symmetric presentations II: Generators of order 3, Math. Proc. Cambridge Philos. Soc. 128 (2000), no. 1, 1–20.[MR]
  20. John Bray, Christopher Parker, and Peter Rowley, Cayley type graphs and cubic graphs of large girth, Discrete Math. 214 (2000), no. 1-3, 113–121.[MR]
  21. Richard P. Brent, Recent progress and prospects for integer factorisation algorithms, Computing and Combinatorics (Sydney, 2000), Lecture Notes in Comput. Sci., vol. 1858, Springer, Berlin, 2000, pp. 3–22.[MR]
  22. Francis Buekenhout, Philippe Cara, and Koen Vanmeerbeek, Geometries of the group PSL(2,11), Geom. Dedicata 83 (2000), no. 1-3, 169–206.[MR]
  23. Alan R. Camina and Federica Spiezia, Sporadic groups and automorphisms of linear spaces, J. Combin. Des. 8 (2000), no. 5, 353–362.[MR]
  24. H. E. A. Campbell, I. P. Hughes, G. Kemper, R. J. Shank, and D. L. Wehlau, Depth of modular invariant rings, Transform. Groups 5 (2000), no. 1, 21–34.[MR]
  25. David G. Cantor and Daniel M. Gordon, Factoring polynomials over p-adic fields, Algorithmic Number Theory (Leiden, 2000), Lecture Notes in Comput. Sci., vol. 1838, Springer, Berlin, 2000, pp. 185–208.[MR]
  26. Philippe Cara, An infinite family of Petersen geometries with nonlinear diagram, J. Geom. 67 (2000), no. 1-2, 73–88.[MR]
  27. A. Caranti and M. F. Newman, Graded Lie algebras of maximal class. II, J. Algebra 229 (2000), no. 2, 750–784.[MR]
  28. Jon F. Carlson and Jacques Thévenaz, Torsion endo-trivial modules, Algebr. Represent. Theory 3 (2000), no. 4, 303–335.[MR]
  29. Bonifacio Castano, Joos Heintzb, Juan Llovet, and Raquel Martinez, On the data structure straight-line program and its implementation in symbolic computation, Mathematics and Computers in Simulation 51 (2000), no. 5, 497–528.
  30. Henri Cohen, Advanced Topics in Computational Number Theory, Graduate Texts in Mathematics, vol. 193, Springer-Verlag, New York, 2000, pp. xvi+578.[MR]
  31. Olivier Cormier, Michael F. Singer, and Felix Ulmer, Computing the Galois group of a polynomial using linear differential equations, in Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (St. Andrews), ACM, New York, 2000, pp. 78–85 (electronic).[MR]
  32. Christopher M. Cosgrove, Chazy classes IX–XI of third-order differential equations, Stud. Appl. Math. 104 (2000), no. 3, 171–228.[MR]
  33. John Cossey and Trevor Hawkes, On the largest conjugacy class size in a finite group, Rend. Sem. Mat. Univ. Padova 103 (2000), 171–179.[MR]
  34. A. Cossidente, Caps embedded in the Klein quadric, Bull. Belg. Math. Soc. Simon Stevin 7 (2000), no. 1, 13–19.[MR]
  35. Danyo Danev and Jonas Olsson, On a sequence of cyclic codes with minimum distance six, IEEE Trans. Inform. Theory 46 (2000), no. 2, 673–674.[MR]
  36. James H. Davenport, A small OpenMath type system, SIGSAM Bull. 34 (2000), no. 2, 16–21.[doi]
  37. James H. Davenport, Abstract data types in computer algebra, Mathematical Foundations of Computer Science 2000 (Bratislava), Lecture Notes in Comput. Sci., vol. 1893, Springer, Berlin, 2000, pp. 21–35.[MR]
  38. Ana Paula S. Dias, Benoit Dionne, and Ian Stewart, Heteroclinic cycles and wreath product symmetries, Dyn. Stab. Syst. 15 (2000), no. 4, 353–385.[MR]
  39. Cunsheng Ding, David Kohel, and San Ling, Elementary 2-group character codes, IEEE Trans. Inform. Theory 46 (2000), no. 1, 280–284.[MR]
  40. Cunsheng Ding, David R. Kohel, and San Ling, Split group codes, IEEE Trans. Inform. Theory 46 (2000), no. 2, 485–495.[MR]
  41. Cunsheng Ding, Harald Niederreiter, and Chaoping Xing, Some new codes from algebraic curves, IEEE Trans. Inform. Theory 46 (2000), no. 7, 2638–2642.[MR]
  42. Peng Ding and Jennifer D. Key, Minimum-weight codewords as generators of generalized Reed-Muller codes, IEEE Trans. Inform. Theory 46 (2000), no. 6, 2152–2158.[MR]
  43. Jeremy M. Dover, Semiovals with large collinear subsets, J. Geom. 69 (2000), no. 1-2, 58–67.[MR]
  44. G. Everest and T. Ward, The canonical height of an algebraic point on an elliptic curve, New York J. Math. 6 (2000), 331–342 (electronic).[MR]
  45. B. Everitt and C. Maclachlan, Constructing hyperbolic manifolds, Computational and Geometric Aspects of Modern Algebra (Edinburgh, 1998), London Math. Soc. Lecture Note Ser., vol. 275, Cambridge Univ. Press, Cambridge, 2000, pp. 78–86.[MR]
  46. D. L. Flannery and E. A. O'Brien, Computing 2-cocycles for central extensions and relative difference sets, Comm. Algebra 28 (2000), no. 4, 1939–1955.[MR]
  47. Tuval Foguel, Groups, transversals, and loops, Comment. Math. Univ. Carolin. 41 (2000), no. 2, 261–269.[MR]
  48. Tuval Foguel and Abraham A. Ungar, Involutory decomposition of groups into twisted subgroups and subgroups, J. Group Theory 3 (2000), no. 1, 27–46.[MR]
  49. Karin Gatermann, Computer algebra methods for equivariant dynamical systems, Lecture Notes in Mathematics, vol. 1728, Springer-Verlag, Berlin, 2000, pp. xvi+153.[MR]
  50. Pierrick Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves, Advances in Cryptology—Eurocrypt 2000 (Bruges), Lecture Notes in Comput. Sci., vol. 1807, Springer, Berlin, 2000, pp. 19–34.[MR]
  51. Pierrick Gaudry and Robert Harley, Counting points on hyperelliptic curves over finite fields, Algorithmic Number Theory (Leiden, 2000), Lecture Notes in Comput. Sci., vol. 1838, Springer, Berlin, 2000, pp. 313–332.[MR]
  52. Volker Gebhardt, Constructing a short defining set of relations for a finite group, J. Algebra 233 (2000), no. 2, 526–542.[MR]
  53. Volker Gebhardt, Two short presentations for Lyons' sporadic simple group, Experiment. Math. 9 (2000), no. 3, 333–338.[MR]
  54. Katharina Geißler and Jürgen Klüners, Galois group computation for rational polynomials, J. Symbolic Comput. 30 (2000), no. 6, 653–674.[MR]
  55. Massimo Giulietti, Algebraic curves over finite fields and MAGMA, Ital. J. Pure Appl. Math. (2000), no. 8, 19–32.[MR]
  56. Willem A. de Graaf, Lie Algebras: Theory and Algorithms, North-Holland Mathematical Library, vol. 56, North-Holland Publishing Co., Amsterdam, 2000, pp. xii+393.[MR]
  57. Markus Grassl, On the minimum distance of some quadratic-residue codes, in ISlT 2000. Sorrento, Italy, June 25-30, 2000, 2000, pp. 253–253.
  58. Edward L. Green, Lenwood S. Heath, and Craig A. Struble, Constructing endomorphism rings via duals, in ISSAC '00: Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation (St. Andrews), ACM, New York, 2000, pp. 129–136 (electronic).[MR]
  59. T. Aaron Gulliver and Masaaki Harada, Double circulant self-dual codes over GF(5), Ars Combin. 56 (2000), 3–13.[MR]
  60. Michael I. Hartley, Polytopes of finite type, Discrete Math. 218 (2000), no. 1-3, 97–108.[MR]
  61. George Havas and Colin Ramsay, Proving a group trivial made easy: A case study in coset enumeration, Bull. Austral. Math. Soc. 62 (2000), no. 1, 105–118.[MR]
  62. R. J. Higgs and J. F. Humphreys, Projective character degree patterns of 2-groups, Comm. Algebra 28 (2000), no. 3, 1189–1210.[MR]
  63. K. J. Horadam, An introduction to cocyclic generalised Hadamard matrices, Discrete Appl. Math. 102 (2000), no. 1-2, 115–131.[MR]
  64. Everett W. Howe, Higher-order Carmichael numbers, Math. Comp. 69 (2000), no. 232, 1711–1719.[MR]
  65. Ian Hughes and Gregor Kemper, Symmetric powers of modular representations, Hilbert series and degree bounds, Comm. Algebra 28 (2000), no. 4, 2059–2088.[MR]
  66. Mervyn C. Hughes and Alun O. Morris, Root systems for two dimensional complex reflection groups, Sém. Lothar. Combin. 45 (2000/01), Art. B45e, 18 pp. (electronic).[MR]
  67. Stephen P. Humphries, Some linear representations of braid groups, J. Knot Theory Ramifications 9 (2000), no. 3, 341–366.[MR]
  68. Gábor Ivanyos and Klaus Lux, Treating the exceptional cases of the MeatAxe, Experiment. Math. 9 (2000), no. 3, 373–381.[MR]
  69. P. I. Katsylo and V. L. Popov, On fixed points of algebraic actions on Cn, Funktsional. Anal. i Prilozhen. 34 (2000), no. 1, 41–50, 96.[MR/link]
  70. J. D. Key and K. Mackenzie-Fleming, Rigidity theorems for a class of affine resolvable designs, J. Combin. Math. Combin. Comput. 35 (2000), 147–160.[MR]
  71. Jürgen Klüners and Gunter Malle, Explicit Galois realization of transitive groups of degree up to 15, J. Symbolic Comput. 30 (2000), no. 6, 675–716.[MR]
  72. David R. Kohel and William A. Stein, Component groups of quotients of J0(N), Algorithmic Number Theory (Leiden, 2000), Lecture Notes in Comput. Sci., vol. 1838, Springer, Berlin, 2000, pp. 405–412.[MR]
  73. L. G. Kovács and Ralph Stöhr, Lie powers of the natural module for GL(2), J. Algebra 229 (2000), no. 2, 435–462.[MR]
  74. Warwick de Launey and Richard M. Stafford, On cocyclic weighing matrices and the regular group actions of certain Paley matrices, Discrete Appl. Math. 102 (2000), no. 1-2, 63–101.[MR]
  75. Dimitri Leemans, The residually weakly primitive geometries of the dihedral groups, Atti Sem. Mat. Fis. Univ. Modena 48 (2000), no. 1, 179–190.[MR]
  76. Dimitri Leemans, The residually weakly primitive pre-geometries of the Suzuki simple groups, Note Mat. 20 (2000/01), no. 1, 1–20.[MR]
  77. Christiane Lefèvre-Percsy, Nicolas Percsy, and Dimitri Leemans, New geometries for finite groups and polytopes, Bull. Belg. Math. Soc. Simon Stevin 7 (2000), no. 4, 583–610.[MR]
  78. Dino Lorenzini and Thomas J. Tucker, Thue equations and the method of Coleman-Chabauty, preprint (2000), 30 pages.[arXiv]
  79. Johannes Maks and Juriaan Simonis, Optimal subcodes of second order Reed-Muller codes and maximal linear spaces of bivectors of maximal rank, Des. Codes Cryptogr. 21 (2000), no. 1-3, 165–180.[MR]
  80. John Martino, Stewart Priddy, and Jason Douma, On stably decomposing products of classifying spaces, Math. Z. 235 (2000), no. 3, 435–453.[MR]
  81. Saburo Matsumoto and Richard Rannard, The regular projective solution space of the figure-eight knot complement, Experiment. Math. 9 (2000), no. 2, 221–234.[MR]
  82. Jörn Müller-Quade and Rainer Steinwandt, Gröbner bases applied to finitely generated field extensions, J. Symbolic Comput. 30 (2000), no. 4, 469–490.[MR]
  83. Jörn Müller-Quade and Rainer Steinwandt, Recognizing simple subextensions of purely transcendental field extensions, Appl. Algebra Engrg. Comm. Comput. 11 (2000), no. 1, 35–41.[MR]
  84. Tetsuo Nakano and Hiroyasu Nishikubo, On some maximal Galois coverings over affine and projective planes. II, Tokyo J. Math. 23 (2000), no. 2, 295–310.[MR]
  85. Gabriele Nebe and Boris Venkov, The strongly perfect lattices of dimension 10, J. Théor. Nombres Bordeaux 12 (2000), no. 2, 503–518.[MR]
  86. Walter D. Neumann and Penelope G. Wightwick, Algorithms for polynomials in two variables, Combinatorial and Computational Algebra (Hong Kong, 1999), Contemp. Math., vol. 264, Amer. Math. Soc., Providence, RI, 2000, pp. 219–235.[MR]
  87. Igor Pak, The product replacement algorithm is polynomial, 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, pp. 476–485.[MR]
  88. Christopher Parker and Peter Rowley, Ω-covers of graphs, Bull. London Math. Soc. 32 (2000), no. 6, 658–662.[MR]
  89. Christopher Parker and Peter Rowley, Classical groups in dimension 3 as completions of the Goldschmidt G3-amalgam, J. London Math. Soc. (2) 62 (2000), no. 3, 802–812.[MR]
  90. Tim Penttila and Blair Williams, Ovoids of parabolic spaces, Geom. Dedicata 82 (2000), no. 1-3, 1–19.[MR]
  91. Kevin T. Phelps, An enumeration of 1-perfect binary codes, Australas. J. Combin. 21 (2000), 287–298.[MR]
  92. Wilhelm Plesken and Tilman Schulz, Counting crystallographic groups in low dimensions, Experiment. Math. 9 (2000), no. 3, 407–411.[MR]
  93. Bart Preneel (ed.), Advances in Cryptology—Eurocrypt 2000, in Proceedings of the 19th International Annual Conference on the Theory and Application of Cryptographic Techniques held in Bruges, May 14–18, 2000, Lecture Notes in Computer Science, vol. 1807, Springer-Verlag, Berlin, 2000, pp. xiv+608.[MR]
  94. Miles Reid, Graded rings and birational geometry, Preprint (2000), 72 pages.
  95. L. J. Rylands and D. E. Taylor, Constructions for octonion and exceptional Jordan algebras, Des. Codes Cryptogr. 21 (2000), no. 1-3, 191–203.[MR]
  96. M. Salazar-Neumann, Rank 2 geometries of the group PSL(2,q), Mémoire de DEA (2000).
  97. Michael Schmid, Rainer Steinwandt, Jörn Müller-Quade, Martin Rötteler, and Thomas Beth, Decomposing a matrix into circulant and diagonal factors, Linear Algebra Appl. 306 (2000), no. 1-3, 131–143.[MR]
  98. B. de Smit and H. W. Lenstra, Jr., Linearly equivalent actions of solvable groups, J. Algebra 228 (2000), no. 1, 270–285.[MR]
  99. William A. Stein, Explicit Approaches to Modular Abelian Varieties, PhD Thesis, University of California, Berkeley, 2000.
  100. Rainer Steinwandt, On computing a separating transcendence basis, SIGSAM Bulletin 34 (2000), no. 4.
  101. Rainer Steinwandt and Regine Endsuleit, A note on timing attacks based on the evaluation of polynomials, Preprint (2000), 9 pages.
  102. Rainer Steinwandt, Markus Grassl, Willi Geiselmann, and Thomas Beth, Weakness in the SL2(F2n) hashing scheme, Advances in Cryptology—CRYPTO 2000 (Santa Barbara, CA), Lecture Notes in Comput. Sci., vol. 1880, Springer, Berlin, 2000, pp. 287–299.[MR]
  103. Rainer Steinwandt and Jörn Müller-Quade, Freeness, linear disjointness, and implicitization—a classical approach, Beiträge Algebra Geom. 41 (2000), no. 1, 57–66.[MR]
  104. Craig A. Struble, Analysis and implementation of algorithms for noncommutative algebra, PhD Thesis, Virginia Polytechnic Institute and State University, 2000.[link]
  105. Patrick Theobald, Ein framework zur berechnung der hermite-normalform von grössen, dünnbesetzten, ganzzahligen matrizen, PhD Thesis, Technischen Universität Darmstadt, 2000.[link]
  106. Nicolas M. Thiéry, Algebraic invariants of graphs; A study based on computer exploration, SIGSAM Bulletin 34 (2000), no. 3, 9–20.
  107. Pham Huu Tiep and A. E. Zalesskii, Some aspects of finite linear groups: a survey, J. Math. Sci. (New York) 100 (2000), no. 1, 1893–1914.[MR]
  108. A. A. Ungar, Hyperbolic trigonometry in the Einstein relativistic velocity model of hyperbolic geometry, Comput. Math. Appl. 40 (2000), no. 2-3, 313–332.[MR]

2001

  1. A. Adem, J. F. Carlson, D. B. Karagueuzian, and R. James Milgram, The cohomology of the Sylow 2-subgroup of the Higman-Sims group, J. Pure Appl. Algebra 164 (2001), no. 3, 275–305.[MR]
  2. Alejandro Adem, Wenfeng Gao, Dikran B. Karagueuzian, and Ján Mináč, Field theory and the cohomology of some Galois groups, J. Algebra 235 (2001), no. 2, 608–635.[MR]
  3. David F. Anderson, Andrea Frazier, Aaron Lauve, and Philip S. Livingston, The zero-divisor graph of a commutative ring: II, Ideal Theoretic Methods in Commutative Algebra (Columbia, MO, 1999), Lecture Notes in Pure and Appl. Math., vol. 220, Dekker, New York, 2001, pp. 61–72.[MR]
  4. Roberto M. Avanzi, Mathias Kratzer, and Gerhard O. Michler, Janko's simple groups J2 and J3 are irreducible subgroups of SL85(5) with equal centralizers of an involution, Groups and Computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 21–37.[MR]
  5. Christine Bachoc, Harmonic weight enumerators of nonbinary codes and MacWilliams identities, Codes and Association Schemes (Piscataway, NJ, 1999), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 56, Amer. Math. Soc., Providence, RI, 2001, pp. 1–23.[MR]
  6. Christine Bachoc and Philippe Gaborit, On extremal additive F4 codes of length 10 to 18, International Workshop on Coding and Cryptography (Paris, 2001), Electron. Notes Discrete Math., vol. 6, Elsevier, Amsterdam, 2001, pp. 10 pp. (electronic).[MR]
  7. Christine Bachoc and Boris Venkov, Modular forms, lattices and spherical designs, Réseaux Euclidiens, Designs Sphériques et Formes Modulaires, Monogr. Enseign. Math., vol. 37, Enseignement Math., Geneva, 2001, pp. 87–111.[MR]
  8. R. D. Baker, G. L. Ebert, K. H. Leung, and Q. Xiang, A trace conjecture and flag-transitive affine planes, J. Combin. Theory Ser. A 95 (2001), no. 1, 158–168.[MR]
  9. R. D. Baker, G. L. Ebert, and K. L. Wantz, Regular hyperbolic fibrations, Adv. Geom. 1 (2001), no. 2, 119–144.[MR]
  10. Lynn M. Batten and Jeremy M. Dover, Blocking semiovals of type (1,M + 1,N + 1), SIAM J. Discrete Math. 14 (2001), no. 4, 446–457 (electronic).[MR]
  11. Hans Ulrich Besche, Bettina Eick, and E. A. O'Brien, The groups of order at most 2000, Electron. Res. Announc. Amer. Math. Soc. 7 (2001), 1–4 (electronic).[MR]
  12. Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada, and Akihiro Munemasa, On type II codes over F4, IEEE Trans. Inform. Theory 47 (2001), no. 6, 2242–2248.[MR]
  13. Koichi Betsumiya and Masaaki Harada, Binary optimal odd formally self-dual codes, Des. Codes Cryptogr. 23 (2001), no. 1, 11–21.[MR]
  14. Koichi Betsumiya and Masaaki Harada, Classification of formally self-dual even codes of lengths up to 16, Des. Codes Cryptogr. 23 (2001), no. 3, 325–332.[MR]
  15. Aart Blokhuis, Robert S. Coulter, Marie Henderson, and Christine M. O'Keefe, Permutations amongst the Dembowski-Ostrom polynomials, Finite fields and applications (Augsburg, 1999), Springer, Berlin, 2001, pp. 37–42.[MR]
  16. Denis Bonheure, Francis Buekenhout, and Dimitri Leemans, On the Petrials of thin rank 3 geometries, J. Geom. 71 (2001), no. 1-2, 19–25.[MR]
  17. A. Bonnecaze, P. Solé, and P. Udaya, Tricolore 3-designs in type III codes, Discrete Math. 241 (2001), no. 1-3, 129–138.[MR]
  18. Inger Christin Borge, A cohomological approach to the classification of p-groups, PhD Thesis, University of Oxford, 2001.[link]
  19. J. Borwein and P. Borwein, Challenges in mathematical computing, Computing in Science and Engineering 3 (2001), 48–53.
  20. Wieb Bosma and Bart de Smit, Class number relations from a computational point of view, J. Symbolic Comput. 31 (2001), no. 1-2, 97–112.[MR]
  21. Nigel Boston, Bounding minimum distances of cyclic codes using algebraic geometry, International Workshop on Coding and Cryptography (Paris, 2001), Electron. Notes Discrete Math., vol. 6, Elsevier, Amsterdam, 2001, pp. 10 pp. (electronic).[MR]
  22. John N. Bray, Ibrahim A. I. Suleiman, Peter G. Walsh, and Robert A. Wilson, Generating maximal subgroups of sporadic simple groups, Comm. Algebra 29 (2001), no. 3, 1325–1337.[MR]
  23. Richard P. Brent, Peter L. Montgomery, Herman J. J. te Riele, Henk Boender, Stephania Cavallar, Conrad Curry, Bruce Dodson, Jens Franke, Joseph Leherbauer, George Sassoon, and Robert Silverman, Factorizations of cunningham numbers with bases 13 to 99: millennium edition, Report – Modelling, Analysis and Simulation, vol. 7, Centrum voor Wiskunde en Informatica, Amsterdam, 2001, pp. i-viii, pp. 1-19.
  24. Carles Broto and Jesper M. Møller, Embeddings of DI2 in F4, Trans. Amer. Math. Soc. 353 (2001), no. 11, 4461–4479 (electronic).[MR]
  25. S. Allen Broughton, Robert M. Dirks, Maria T. Sloughter, and C. Ryan Vinroot, Triangular surface tiling groups for low genus, Preprint (2001).
  26. John J. Cannon, Bruce C. Cox, and Derek F. Holt, Computing the subgroups of a permutation group, J. Symbolic Comput. 31 (2001), no. 1-2, 149–161.[MR]
  27. Philippe Cara, RWPRI geometries for the alternating group A8, Finite Geometries, Dev. Math., vol. 3, Kluwer Acad. Publ., Dordrecht, 2001, pp. 61–97.[MR]
  28. Philippe Cara, Serge Lehman, and Dmitrii V. Pasechnik, On the number of inductively minimal geometries, Theoret. Comput. Sci. 263 (2001), no. 1-2, 31–35.[MR]
  29. Jon F. Carlson, Calculating group cohomology: Tests for completion, J. Symbolic Comput. 31 (2001), no. 1-2, 229–242.[MR]
  30. Chris Charnes, Martin Rötteler, and Thomas Beth, On homogeneous bent functions, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Melbourne, 2001), Lecture Notes in Comput. Sci., vol. 2227, Springer, Berlin, 2001, pp. 249–259.[MR]
  31. D. Combe, W. D. Palmer, and W. R. Unger, Bhaskar Rao designs and the alternating group A4, Australas. J. Combin. 24 (2001), 275–283.[MR]
  32. Marston Conder and Peter Dobcsányi, Determination of all regular maps of small genus, J. Combin. Theory Ser. B 81 (2001), no. 2, 224–242.[MR]
  33. Marston Conder and Charles R. Leedham-Green, Fast recognition of classical groups over large fields, Groups and Computation III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 113–121.[MR]
  34. Caterina Consani and Jasper Scholten, Arithmetic on a quintic threefold, Internat. J. Math. 12 (2001), no. 8, 943–972.[MR/link]
  35. Gene Cooperman, Parallel GAP: Mature interactive parallel computing, Groups and computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 123–138.[MR]
  36. Olivier Cormier, On Liouvillian solutions of linear differential equations of order 4 and 5, in ISSAC '01: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2001, pp. 93–100 (electronic).[MR]
  37. A. Cossidente, G. L. Ebert, and G. Korchmáros, Unitals in finite Desarguesian planes, J. Algebraic Combin. 14 (2001), no. 2, 119–125.[MR]
  38. Antonio Cossidente and Alessandro Siciliano, A geometric construction of an optimal [67,9,30] binary code, IEEE Trans. Inform. Theory 47 (2001), no. 3, 1187–1189.[MR]
  39. Antonio Cossidente and Sam K. J. Vereecke, Some geometry of the isomorphism Sp(4,q)≅O(5,q), q even, J. Geom. 70 (2001), no. 1-2, 28–37.[MR]
  40. Robert S. Coulter, George Havas, and Marie Henderson, Giesbrecht's algorithm, the HFE cryptosystem and Ore's ps-polynomials, Computer Mathematics (Matsuyama, 2001), Lecture Notes Ser. Comput, vol. 9, World Sci. Publ., River Edge, NJ, 2001, pp. 36–45.[MR]
  41. M. R. Darafsheh, A. R. Ashrafi, and G. A. Moghani, (p,q,r)-generations of the Conway group Co1 for odd p, Kumamoto J. Math. 14 (2001), 1–20.[MR]
  42. Wolfram Decker, Some introductory remarks on computer algebra, European Congress of Mathematics, Vol. II (Barcelona, 2000), Progr. Math., vol. 202, Birkhäuser, Basel, 2001, pp. 121–142.[MR]
  43. Ana Paula S. Dias, Benoit Dionne, and Ian Stewart, Heteroclinic cycles and wreath product symmetries, Symmetry and perturbation theory (Cala Gonone, 2001), World Sci. Publ., River Edge, NJ, 2001, pp. 53–57.[MR]
  44. Steven T. Dougherty, Masaaki Harada, and Manabu Oura, Note on the g-fold joint weight enumerators of self-dual codes over Zk, Appl. Algebra Engrg. Comm. Comput. 11 (2001), no. 6, 437–445.[MR]
  45. Jeremy M. Dover, Subregular spreads of PG(5,2e), Finite Fields Appl. 7 (2001), no. 3, 421–427.[MR/doi]
  46. G. L. Ebert, Constructions in finite geometry using computer algebra systems, J. Symbolic Comput. 31 (2001), no. 1-2, 55–70.[MR]
  47. Graham Ellis, On the relation between upper central quotients and lower central series of a group, Trans. Amer. Math. Soc. 353 (2001), no. 10, 4219–4234 (electronic).[MR]
  48. Susan Evans-Riley, On the derived length of finite, graded Lie rings with prime-power order and groups with prime-power order., Bull. Austral. Math. Soc. 64 (2001), no. 1, 171-172.[doi]
  49. Giorgio Faina and Massimo Giulietti, Decoding Goppa codes with Magma, Ars Combin. 61 (2001), 221–232.[MR]
  50. J. E. Fields, P. Gaborit, W. C. Huffman, and V. Pless, On the classification of extremal even formally self-dual codes of lengths 20 and 22, Discrete Appl. Math. 111 (2001), no. 1-2, 75–86.[MR]
  51. P. Fleischmann, W. Lempken, and A. E. Zalesskii, Linear groups over GF(2k) generated by a conjugacy class of a fixed point free element of order 3, J. Algebra 244 (2001), no. 2, 631–663.[MR]
  52. Tuval Foguel and Abraham A. Ungar, Gyrogroups and the decomposition of groups into twisted subgroups and subgroups, Pacific J. Math. 197 (2001), no. 1, 1–11.[MR]
  53. Peter J. Forrester and Eric M. Rains, Interrelationships between orthogonal, unitary and symplectic matrix ensembles, Random matrix models and their applications, Math. Sci. Res. Inst. Publ., vol. 40, Cambridge Univ. Press, Cambridge, 2001, pp. 171–207.[MR]
  54. Eberhard Freitag and Manabu Oura, A theta relation in genus 4, Nagoya Math. J. 161 (2001), 69–83.[MR]
  55. Philippe Gaborit, W. Cary Huffman, Jon-Lark Kim, and Vera Pless, On additive GF(4) codes, Codes and Association Schemes (Piscataway, NJ, 1999), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 56, Amer. Math. Soc., Providence, RI, 2001, pp. 135–149.[MR]
  56. M. Gailly, Géométries des groupes PSL(3,q), q < 7, Master's Thesis, Université Libre de Bruxelles, 2001.
  57. Steven D. Galbraith, Supersingular curves in cryptography, Advances in Cryptology—Asiacrypt 2001 (Gold Coast), Lecture Notes in Comput. Sci., vol. 2248, Springer, Berlin, 2001, pp. 495–513.[MR]
  58. Armengol Gasull and Joan Torregrosa, A relation between small amplitude and big limit cycles, Rocky Mountain J. Math. 31 (2001), no. 4, 1277–1303.[MR/doi]
  59. P. Gaudry and É. Schost, On the invariants of the quotients of the Jacobian of a curve of genus 2, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Melbourne, 2001), Lecture Notes in Comput. Sci., vol. 2227, Springer, Berlin, 2001, pp. 373–386.[MR]
  60. Pierrick Gaudry and Nicolas Gürel, An extension of Kedlaya's point-counting algorithm to superelliptic curves, Advances in Cryptology—Asiacrypt 2001 (Gold Coast), Lecture Notes in Comput. Sci., vol. 2248, Springer, Berlin, 2001, pp. 480–494.[MR]
  61. Willi Geiselmann, Rainer Steinwandt, and Thomas Beth, Attacking the affine parts of SFLASH, Cryptography and Coding, Lecture Notes in Comput. Sci., vol. 2260, Springer, Berlin, 2001, pp. 355–359.[MR]
  62. Marc Giusti, Grégoire Lecerf, and Bruno Salvy, A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001), no. 1, 154–211.[MR]
  63. Holger W. Gollan, A new existence proof for Ly, the sporadic simple group of R. Lyons, J. Symbolic Comput. 31 (2001), no. 1-2, 203–209.[MR]
  64. María Isabel González Vasco and Rainer Steinwandt, Clouds over a public key cryptosystem based on Lyndon words, Inform. Process. Lett. 80 (2001), no. 5, 239–242.[MR]
  65. Markus Grassl, New binary codes from a chain of cyclic codes, IEEE Trans. Inform. Theory 47 (2001), no. 3, 1178–1181.[MR]
  66. Edward L. Green, Lenwood S. Heath, and Craig A. Struble, Constructing homomorphism spaces and endomorphism rings, J. Symbolic Comput. 32 (2001), no. 1-2, 101–117.[MR/link]
  67. T. Aaron Gulliver and Masaaki Harada, Optimal double circulant Z4-codes, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Melbourne, 2001), Lecture Notes in Comput. Sci., vol. 2227, Springer, Berlin, 2001, pp. 122–128.[MR]
  68. T. Aaron Gulliver and Masaaki Harada, Orthogonal frames in the Leech lattice and a type II code over Z22, J. Combin. Theory Ser. A 95 (2001), no. 1, 185–188.[MR]
  69. G. Hanrot and F. Morain, Solvability by radicals from an algorithmic point of view, in Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2001, pp. 175–182 (electronic).[MR]
  70. George Havas, Derek F. Holt, and M. F. Newman, Certain cyclically presented groups are infinite, Comm. Algebra 29 (2001), no. 11, 5175–5178.[MR]
  71. Emanuel Herrmann and Attila Pethő, S-integral points on elliptic curves. Notes on a paper of B. M. M. de Weger, J. Théor. Nombres Bordeaux 13 (2001), no. 2, 443–451.[MR]
  72. Sabrina A. Hessinger, Computing the Galois group of a linear differential equation of order four, Appl. Algebra Engrg. Comm. Comput. 11 (2001), no. 6, 489–536.[MR]
  73. Miles Lee Holloway, Derived equivalences for group algebras, PhD Thesis, University of Bristol, 2001.
  74. Derek F. Holt, Computing automorphism groups of finite groups, Groups and Computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 201–208.[MR]
  75. R. B. Howlett, L. J. Rylands, and D. E. Taylor, Matrix generators for exceptional groups of Lie type, J. Symbolic Comput. 31 (2001), no. 4, 429–445.[MR]
  76. Ian Hughes and Gregor Kemper, Symmetric powers of modular representations for groups with a Sylow subgroup of prime order, J. Algebra 241 (2001), no. 2, 759–788.[MR]
  77. Alexander Hulpke, Representing subgroups of finitely presented groups by quotient subgroups, Experiment. Math. 10 (2001), no. 3, 369–381.[MR]
  78. Stephen P. Humphries, Action of braid groups on determinantal ideals, compact spaces and a stratification of Teichmüller space, Invent. Math. 144 (2001), no. 3, 451–505.[MR/link]
  79. Stephen P. Humphries, Intersection-number operators for curves on discs. II, Geom. Dedicata 86 (2001), no. 1-3, 153–168.[MR]
  80. William M. Kantor and Ákos Seress, Black box classical groups, Mem. Amer. Math. Soc. 149 (2001), no. 708, viii+168.[MR]
  81. Gregor Kemper, The depth of invariant rings and cohomology, J. Algebra 245 (2001), no. 2, 463–531.[MR]
  82. Gregor Kemper, Elmar Körding, Gunter Malle, B. Heinrich Matzat, Denis Vogel, and Gabor Wiese, A database of invariant rings, Experiment. Math. 10 (2001), no. 4, 537–542.[MR]
  83. J. D. Key, Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes, J. Symbolic Comput. 31 (2001), no. 1-2, 37–53.[MR]
  84. J. D. Key and M. J. de Resmini, Ternary dual codes of the planes of order nine, J. Statist. Plann. Inference 95 (2001), no. 1-2, 229–236.[MR]
  85. Jon-Lark Kim, New extremal self-dual codes of lengths 36, 38, and 58, IEEE Trans. Inform. Theory 47 (2001), no. 1, 386–393.[MR]
  86. Jon-Lark Kim, New good Hermitian self-dual codes over GF(4), in IEEE International Symposium on Information Theory (ISIT), Washington, 2001, pp. 177.
  87. Jon-Lark Kim, New self-dual codes over GF(4) with the highest known minimum weights, IEEE Trans. Inform. Theory 47 (2001), no. 4, 1575–1580.[MR/link]
  88. David R. Kohel, Hecke module structure of quaternions, Class Field Theory—Its Centenary and Prospect (Tokyo, 1998), Adv. Stud. Pure Math., vol. 30, Math. Soc. Japan, Tokyo, 2001, pp. 177–195.[MR]
  89. Mathias Kratzer, Konkrete Charaktertafeln und kompatible Charaktere, Vorlesungen aus dem Fachbereich Mathematik der Universität GH Essen [Lecture Notes in Mathematics at the University of Essen], vol. 30, Universität Essen Fachbereich Mathematik, Essen, 2001, pp. vi+106.[MR]
  90. Charles R. Leedham-Green, The computational matrix group project, Groups and Computation III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 229–247.[MR]
  91. Dimitri Leemans, On a rank five geometry of Meixner for the Mathieu group M12, Geom. Dedicata 85 (2001), no. 1-3, 273–281.[MR]
  92. Dimitri Leemans, Some rank five geometries related to the Mathieu group M23, J. Combin. Theory Ser. A 95 (2001), no. 2, 365–372.[MR]
  93. Wolfgang Lempken, On the existence and uniqueness of the sporadic simple groups J2 and J3 of Z. Janko, J. Group Theory 4 (2001), no. 2, 223–232.[MR]
  94. R. Levi and S. Priddy, On certain homotopy actions of general linear groups on iterated products, Ann. Inst. Fourier (Grenoble) 51 (2001), no. 6, 1719–1739.[MR/link]
  95. San Ling and Patrick Solé, Duadic codes over F2+uF2, Appl. Algebra Engrg. Comm. Comput. 12 (2001), no. 5, 365–379.[MR]
  96. Alexander Lubotzky and Igor Pak, The product replacement algorithm and Kazhdan's property (T), J. Amer. Math. Soc. 14 (2001), no. 2, 347–363 (electronic).[MR]
  97. C. Maclachlan and G. J. Martin, The non-compact arithmetic generalised triangle groups, Topology 40 (2001), no. 5, 927–944.[MR]
  98. Markus Maurer, Alfred Menezes, and Edlyn Teske, Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree (extended abstract), Progress in Cryptology—Indocrypt 2001 (Chennai), Lecture Notes in Comput. Sci., vol. 2247, Springer, Berlin, 2001, pp. 195–213.[MR]
  99. Keith E. Mellinger, A note on line-Baer subspace partitions of PG(3,4), J. Geom. 72 (2001), no. 1-2, 128–131.[MR]
  100. Gerhard O. Michler and Michael Weller, A new computer construction of the irreducible 112-dimensional 2-modular representation of Janko's group J4, Comm. Algebra 29 (2001), no. 4, 1773–1806.[MR]
  101. Jesper M. Møller, Toric morphisms between p-compact groups, Cohomological Methods in Homotopy Theory (Bellaterra, 1998), Progr. Math., vol. 196, Birkhäuser, Basel, 2001, pp. 271–306.[MR]
  102. Peter M. Neumann and Cheryl E. Praeger, Cyclic matrices and the MEATAXE, Groups and Computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 291–300.[MR]
  103. M. F. Newman, On a family of cyclically-presented fundamental groups, J. Aust. Math. Soc. 71 (2001), no. 2, 235–241.[MR]
  104. Graham H. Norton and Ana Sălăgean, Strong Gröbner bases for polynomials over a principal ideal ring, Bull. Austral. Math. Soc. 64 (2001), no. 3, 505–528.[MR]
  105. Simon Norton, Computing in the Monster, J. Symbolic Comput. 31 (2001), no. 1-2, 193–201.[MR]
  106. Igor Pak, What do we know about the product replacement algorithm?, Groups and Computation, III (Columbus, OH, 1999), Ohio State Univ. Math. Res. Inst. Publ., vol. 8, de Gruyter, Berlin, 2001, pp. 301–347.[MR]
  107. Christopher Parker and Peter Rowley, Sporadic simple groups which are completions of the Goldschmidt G3-amalgam, J. Algebra 235 (2001), no. 1, 131–153.[MR]
  108. Sebastian Pauli, Efficient enumeration of extensions of local fields with bounded discriminant, PhD Thesis, Concordia University, 2001.
  109. Manley Perkel, Cheryl E. Praeger, and Richard Weiss, On narrow hexagonal graphs with a 3-homogeneous suborbit, J. Algebraic Combin. 13 (2001), no. 3, 257–273.[MR]
  110. Cheryl E. Praeger, Computers in algebra: New answers, new questions, J. Korean Math. Soc. 38 (2001), no. 4, 763–780.[MR]
  111. Miles Reid, Examples of type IV unprojection, preprint (2001).[arXiv]
  112. Birgit Reinert and Dirk Zeckzer, Coset enumeration using prefix Gröbner bases: an experimental approach, LMS J. Comput. Math. 4 (2001), 74–134 (electronic).[MR/link]
  113. Guyan Robertson and Tim Steger, Asymptotic K-theory for groups acting on A2 buildings, Canad. J. Math. 53 (2001), no. 4, 809–833.[MR]
  114. Fabrice Rouillier, Mohab Safey El Din, and Éric Schost, Solving the Birkhoff interpolation problem via the critical point method: an experimental study, ADG '00: Revised Papers from the Third International Workshop on Automated Deduction in Geometry (Zurich, 2000), Lecture Notes in Computer Science, vol. 2061, Springer-Verlag, Berlin, 2001, pp. viii+325.[MR]
  115. S. M. Salamon, Complex structures on nilpotent Lie algebras, J. Pure Appl. Algebra 157 (2001), no. 2-3, 311–333.[MR]
  116. Ralph-Hardo Schulz, Check character systems and anti-symmetric mappings, Computational Discrete Mathematics, Lecture Notes in Comput. Sci., vol. 2122, Springer, Berlin, 2001, pp. 136–147.[MR]
  117. Michel Sebille, On a result of Cameron and Praeger on block-transitive point-imprimitive t-designs, Algebraic Combinatorics and Applications (Gößweinstein, 1999), Springer, Berlin, 2001, pp. 316–323.[MR]
  118. Michael C. Slattery, Computing double cosets in soluble groups, J. Symbolic Comput. 31 (2001), no. 1-2, 179–192.[MR]
  119. William A. Stein and Helena A. Verrill, Cuspidal modular symbols are transportable, LMS J. Comput. Math. 4 (2001), 170–181 (electronic).[MR]
  120. Rainer Steinwandt, Loopholes in two public key cryptosystems using the modular group, Public Key Cryptography (Cheju Island, 2001), Lecture Notes in Comput. Sci., vol. 1992, Springer, Berlin, 2001, pp. 180–189.[MR]
  121. Michael Stoll, Implementing 2-descent for Jacobians of hyperelliptic curves, Acta Arith. 98 (2001), no. 3, 245–277.[MR]
  122. Gernot Stroth, Algorithms in pure mathematics, Computational discrete mathematics, Lecture Notes in Comput. Sci., vol. 2122, Springer, Berlin, 2001, pp. 148–158.[MR]
  123. Abraham A. Ungar, Beyond the Einstein Addition Law and its Gyroscopic Thomas Precession, Fundamental Theories of Physics, vol. 117, Kluwer Academic Publishers Group, Dordrecht, 2001, pp. xlii+413.[MR/link]
  124. Stéphane Vinatier, Structure galoisienne dans les extensions faiblement ramifiées de Q, J. Number Theory 91 (2001), no. 1, 126–152.[MR/doi]
  125. Judy L. Walker, Constructing critical indecomposable codes, IEEE Trans. Inform. Theory 47 (2001), no. 5, 1780–1795.[MR]
  126. Michael Weller, Construction of large permutation representations for matrix groups II, Appl. Algebra Engrg. Comm. Comput. 11 (2001), no. 6, 463–488.[MR]
  127. Steven R. Weller and Sarah J. Johnson, Iterative decoding of codes from oval designs, Defence Applications of Signal Processing, 2001 Workshop (2001), 1-19.
  128. Chaoping Xing, Applications of algebraic curves to constructions of sequences, Cryptography and Computational Number Theory (Singapore, 1999), Progr. Comput. Sci. Appl. Logic, vol. 20, Birkhäuser, Basel, 2001, pp. 137–146.[MR]
  129. Alexander Zvonkin, Megamaps: Construction and examples, Discrete Models: Combinatorics, Computation, and Geometry (Paris, 2001), Discrete Math. Theor. Comput. Sci. Proc., AA, Maison Inform. Math. Discrèt. (MIMD), Paris, 2001, pp. 329–339 (electronic).[MR]

2002

  1. David Abelson, Seok-Hee Hong, and Donald E. Taylor, A group-theoretic method for drawing graphs symmetrically, Graph Drawing, Lecture Notes in Comput. Sci., vol. 2528, Springer, Berlin, 2002, pp. 86–97.[MR]
  2. Amod Agashe and William Stein, Visibility of Shafarevich-Tate groups of abelian varieties, J. Number Theory 97 (2002), no. 1, 171–185.[MR]
  3. Selma Altınok, Gavin Brown, and Miles Reid, Fano 3-folds, K3 surfaces and graded rings, Topology and Geometry: Commemorating SISTAG, Contemp. Math., vol. 314, Amer. Math. Soc., Providence, RI, 2002, pp. 25–53.[MR]
  4. Jianbei An and E. A. O'Brien, The Alperin and Dade conjectures for the O'Nan and Rudivalis simple groups, Comm. Algebra 30 (2002), no. 3, 1305–1348.[MR]
  5. Avner Ash, Darrin Doud, and David Pollack, Galois representations with conjectural connections to arithmetic cohomology, Duke Math. J. 112 (2002), no. 3, 521–579.[MR]
  6. Werner Backes and Susanne Wetzel, Heuristics on lattice basis reduction in practice, ACM J. Exp. Algorithmics 7 (2002), 21 pp. (electronic).[MR]
  7. Stéphane Ballet, Quasi-optimal algorithms for multiplication in the extensions of \bf F16 of degree 13, 14 and 15, J. Pure Appl. Algebra 171 (2002), no. 2-3, 149–164.[MR]
  8. Hans Ulrich Besche, Bettina Eick, and E. A. O'Brien, A millennium project: Constructing small groups, Internat. J. Algebra Comput. 12 (2002), no. 5, 623–644.[MR]
  9. Alexandre V. Borovik, Centralisers of involutions in black box groups, Computational and Statistical Group Theory (Las Vegas, NV/Hoboken, NJ, 2001), Contemp. Math., vol. 298, Amer. Math. Soc., Providence, RI, 2002, pp. 7–20.[MR]
  10. Wieb Bosma, James Hutton, and Eric R. Verheul, Looking beyond XTR, Advances in Cryptology—Asiacrypt 2002, Lecture Notes in Comput. Sci., vol. 2501, Springer, Berlin, 2002, pp. 46–63.[MR]
  11. Wieb Bosma and Bart de Smit, On arithmetically equivalent number fields of small degree, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 67–79.[MR]
  12. Nigel Boston and Charles Leedham-Green, Explicit computation of Galois p-groups unramified at p, J. Algebra 256 (2002), no. 2, 402–413.[MR]
  13. Iliya Bouyukliev and Juriaan Simonis, Some new results for optimal ternary linear codes, IEEE Trans. Inform. Theory 48 (2002), no. 4, 981–985.[MR]
  14. Ezra Brown and Bruce T. Myers, Elliptic curves from Mordell to Diophantus and back, Amer. Math. Monthly 109 (2002), no. 7, 639–649.[MR]
  15. Nils Bruin and Noam D. Elkies, Trinomials ax7 + bx + c and ax8 + bx + c with Galois groups of order 168 and 8·168, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 172–188.[MR]
  16. Ralph H. Buchholz, Triangles with three rational medians, J. Number Theory 97 (2002), no. 1, 113–131.[MR]
  17. E. Bujalance, Marston Conder, J. M. Gamboa, G. Gromadzki, and M. Izquierdo, Double coverings of Klein surfaces by a given Riemann surface, J. Pure Appl. Algebra 169 (2002), no. 2-3, 137–151.[MR]
  18. Kelley Burgin, The nonexistence of a bijective almost perfect nonlinear function of order 16, Master's Thesis, Auburn University, 2002.
  19. Kevin Buzzard and William A. Stein, A mod five approach to modularity of icosahedral Galois representations, Pacific J. Math. 203 (2002), no. 2, 265–282.[MR]
  20. Peter J. Cameron, Michael Giudici, Gareth A. Jones, William M. Kantor, Mikhail H. Klin, Dragan Marušič, and Lewis A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. (2) 66 (2002), no. 2, 325–333.[MR]
  21. Philippe Cara and Dimitri Leemans, The residually weakly primitive geometries of S5×2, Discrete Math. 255 (2002), no. 1-3, 35–45.[MR]
  22. Robin Chapman, Steven T. Dougherty, Philippe Gaborit, and Patrick Solé, 2-modular lattices from ternary codes, J. Théor. Nombres Bordeaux 14 (2002), no. 1, 73–85.[MR]
  23. Chris Charnes, Martin Rötteler, and Thomas Beth, Homogeneous bent functions, invariants, and designs, Des. Codes Cryptogr. 26 (2002), no. 1-3, 139–154.[MR]
  24. K. L. Clark, J. D. Key, and M. J. de Resmini, Dual codes of translation planes, European J. Combin. 23 (2002), no. 5, 529–538.[MR]
  25. Marston Conder and Peter Dobcsányi, Trivalent symmetric graphs on up to 768 vertices, J. Combin. Math. Combin. Comput. 40 (2002), 41–63.[MR]
  26. Marston Conder, C. Maclachlan, G. J. Martin, and E. A. O'Brien, 2-generator arithmetic Kleinian groups. III, Math. Scand. 90 (2002), no. 2, 161–179.[MR]
  27. Alessio Corti and Miles Reid, Weighted Grassmannians, Algebraic Geometry, de Gruyter, Berlin, 2002, pp. 141–163.[MR]
  28. Robert S. Coulter and Marie Henderson, The compositional inverse of a class of permutation polynomials over a finite field, Bull. Austral. Math. Soc. 65 (2002), no. 3, 521–526.[MR]
  29. John E. Cremona, A solution for note 84.35, The Mathematical Gazette 86 (2002), no. 505, 66–68.[link]
  30. Robert T. Curtis, A fresh approach to the exceptional automorphism and covers of the symmetric groups, Arab. J. Sci. Eng. Sect. A Sci. 27 (2002), no. 1, 93–107.[MR]
  31. Mieczysław K. Dąbkowski and Józef H. Przytycki, Burnside obstructions to the Montesinos-Nakanishi 3-move conjecture, Geom. Topol. 6 (2002), 355–360 (electronic).[MR]
  32. James H. Davenport, Equality in computer algebra and beyond, J. Symbolic Comput. 34 (2002), no. 4, 259–270.[MR]
  33. Michel Dehon and Dimitri Leemans, Constructing coset geometries with Magma: An application to the sporadic groups M12 and J1, Atti Sem. Mat. Fis. Univ. Modena 50 (2002), no. 2, 415–427.[MR]
  34. Jan Denef and Frederik Vercauteren, An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 308–323.[MR]
  35. Harm Derksen and Gregor Kemper, Computational Invariant Theory, Invariant Theory and Algebraic Transformation Groups, I, Springer-Verlag, Berlin, 2002, pp. x+268.[MR]
  36. Alice Devillers, Classification of Some Homogenous and Ultrahomogenous Structures, PhD Thesis, Université Libre de Bruxelles, 2002.
  37. Peng Ding and Jennifer D. Key, Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors, Des. Codes Cryptogr. 26 (2002), no. 1-3, 197–211.[MR]
  38. Michael J. Dinneen, Geoffrey Pritchard, and Mark C. Wilson, Degree- and time-constrained broadcast networks, Networks 39 (2002), no. 3, 121–129.[MR]
  39. Jean-Paul Doignon and Michel Regenwetter, On the combinatorial structure of the approval-voting polytope, J. Math. Psych. 46 (2002), no. 5, 554–563.[MR]
  40. Darrin Doud, Three-dimensional Galois representations with conjectural connections to arithmetic cohomology, Number Theory for the Millennium I (Urbana, IL, 2000), A K Peters, Natick, MA, 2002, pp. 365–375.[MR]
  41. H. Dubner, T. Forbes, N. Lygeros, M. Mizony, H. Nelson, and P. Zimmermann, Ten consecutive primes in arithmetic progression, Math. Comp. 71 (2002), no. 239, 1323–1328 (electronic).[MR]
  42. S. Duquesne, Rational points on hyperelliptic curves and an explicit Weierstrass preparation theorem, Manuscripta Math. 108 (2002), no. 2, 191–204.[MR]
  43. Bettina Eick, C. R. Leedham-Green, and E. A. O'Brien, Constructing automorphism groups of p-groups, Comm. Algebra 30 (2002), no. 5, 2271–2295.[MR]
  44. Louis Ferré and Bertrand Jouve, Vertex partitioning of a class of digraphs, Math. Sci. Hum. (2002), no. 158, 59–77.[MR]
  45. Luís R. A. Finotti, Degrees of the elliptic Teichmüller lift, J. Number Theory 95 (2002), no. 2, 123–141.[MR]
  46. Peter Fleischmann, On pointwise conjugacy of distinguished coset representatives in Coxeter groups, J. Group Theory 5 (2002), no. 3, 269–283.[MR]
  47. David Ford, Sebastian Pauli, and Xavier-François Roblot, A fast algorithm for polynomial factorization over Qp, J. Théor. Nombres Bordeaux 14 (2002), no. 1, 151–169.[MR]
  48. Jason Fulman, Random matrix theory over finite fields, Bull. Amer. Math. Soc. (N.S.) 39 (2002), no. 1, 51–85 (electronic).[MR]
  49. Philippe Gaborit, Quadratic double circulant codes over fields, J. Combin. Theory Ser. A 97 (2002), no. 1, 85–107.[MR]
  50. Steven D. Galbraith, Florian Hess, and Nigel P. Smart, Extending the GHS Weil descent attack, Advances in Cryptology—Eurocrypt 2002 (Amsterdam), Lecture Notes in Comput. Sci., vol. 2332, Springer, Berlin, 2002, pp. 29–44.[MR]
  51. André Galligo and David Rupprecht, Irreducible decomposition of curves, J. Symbolic Comput. 33 (2002), no. 5, 661–677.[MR]
  52. P. Gaudry, F. Hess, and N. P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, J. Cryptology 15 (2002), no. 1, 19–46.[MR]
  53. Volker Gebhardt, Efficient collection in infinite polycyclic groups, J. Symbolic Comput. 34 (2002), no. 3, 213–228.[MR]
  54. Willi Geiselmann, Jörn Müller-Quade, and Rainer Steinwandt, Comment on: "A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits" by G. Drolet, IEEE Trans. Comput. 51 (2002), no. 12, 1460–1461.[MR]
  55. Willi Geiselmann and Rainer Steinwandt, Cryptanalysis of a knapsack-like cryptosystem, Period. Math. Hungar. 45 (2002), no. 1-2, 35–41.[MR]
  56. Willi Geiselmann, Rainer Steinwandt, and Thomas Beth, Revealing the affine parts of SFLASHv1, SFLASHv2, and FLASH, Actas de la VII Reunisn Espaqola de Criptologma y Seguridad de la Informacisn, vol. 7, 2002, pp. 305-314.
  57. Claudia Gohlisch, Helmut Koch, and Gabriele Nebe, Block squares, Math. Nachr. 241 (2002), 73–102.[MR]
  58. Enrique González-Jiménez, Josep González, and Jordi Guàrdia, Computations on modular Jacobian surfaces, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 189–197.[MR]
  59. María Isabel González Vasco and Rainer Steinwandt, Obstacles in two public key cryptosystems based on group factorizations, Tatra Mt. Math. Publ. 25 (2002), 23–37.[MR]
  60. Robert L. Griess, Jr. and A. J. E. Ryba, Embeddings of SL(2,27) in complex exceptional algebraic groups, Michigan Math. J. 50 (2002), no. 1, 89–99.[MR]
  61. Johan P. Hansen, Toric varieties, Hirzebruch surfaces and error-correcting codes, Appl. Algebra Engrg. Comm. Comput. 13 (2002), no. 4, 289–300.[MR]
  62. Masaaki Harada, Masaaki Kitazume, and Michio Ozeki, Ternary code construction of unimodular lattices and self-dual codes over Z6, J. Algebraic Combin. 16 (2002), no. 2, 209–223.[MR]
  63. Masaaki Harada and Akihiro Munemasa, A quasi-symmetric 2-(49,9,6) design, J. Combin. Des. 10 (2002), no. 3, 173–179.[MR]
  64. Julia Hartmann, Invariants and differential Galois groups in degree four, Differential Galois Theory, Banach Center Publ., vol. 58, Polish Acad. Sci., Warsaw, 2002, pp. 79–87.[MR]
  65. Stephan Hell, Die nenner des kontsevich-integrals und ein spezieller drinfeld-assoziator, PhD Thesis, Freie Universität Berlin, 2002.
  66. F. Hess, Computing Riemann-Roch spaces in algebraic function fields and related topics, J. Symbolic Comput. 33 (2002), no. 4, 425–445.[MR]
  67. Florian Hess, An algorithm for computing Weierstrass points, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 357–371.[MR]
  68. Mark van Hoeij, Factoring polynomials and the knapsack problem, J. Number Theory 95 (2002), no. 2, 167–189.[MR]
  69. P. E. Holmes and R. A. Wilson, A new maximal subgroup of the Monster, J. Algebra 251 (2002), no. 1, 435–447.[MR]
  70. Derek F. Holt and Jacqueline Walton, Representing the quotient groups of a finite permutation group, J. Algebra 248 (2002), no. 1, 307–333.[MR]
  71. Everett W. Howe and Hui June Zhu, On the existence of absolutely simple abelian varieties of a given dimension over an arbitrary field, J. Number Theory 92 (2002), no. 1, 139–163.[MR]
  72. Ole Lund Jensen, Symbolic dynamic systems and their invariants, Master's Thesis, University of Copenhagen, 2002.
  73. Gregor Kemper, The calculation of radical ideals in positive characteristic, J. Symbolic Comput. 34 (2002), no. 3, 229–238.[MR]
  74. J. D. Key and J. Moori, Codes, designs and graphs from the Janko groups J1 and J2, J. Combin. Math. Combin. Comput. 40 (2002), 143–159.[MR]
  75. L. J. P. Kilford, Slopes of overconvergent modular forms, PhD Thesis, Imperial College, University of London, 2002.[link]
  76. L. J. P. Kilford, Some non-Gorenstein Hecke algebras attached to spaces of modular forms, J. Number Theory 97 (2002), no. 1, 157–164.[MR]
  77. Jon-Lark Kim, Uri N. Peled, Irina Perepelitsa, and Vera Pless, Explicit construction of families of LDPC codes with girth at least six, Proceedings of the Annual Allerton Conference on Communication, Control and Computing, vol. 40, Part 2, 2002, pp. 1024–1031.
  78. Jason S. Kimberley and Guyan Robertson, Groups acting on products of trees, tiling systems and analytic K-theory, New York J. Math. 8 (2002), 111–131 (electronic).[MR]
  79. Andreas Klappenecker and Martin Rötteler, Beyond stabilizer codes I: Nice error bases, IEEE Trans. Inform. Theory 48 (2002), no. 8, 2392–2395.[MR/doi]
  80. Jürgen Klüners, Algorithms for function fields, Experiment. Math. 11 (2002), no. 2, 171–181.[MR]
  81. Mathias Kratzer, Uniform and natural existence proofs for Janko's sporadic groups J2 and J3, Arch. Math. (Basel) 79 (2002), no. 1, 5–18.[MR]
  82. Andrew Kresch and Yuri Tschinkel, Integral points on punctured abelian surfaces, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 198–204.[MR]
  83. Joan-C. Lario and René Schoof, Some computations with Hecke rings and deformation rings, Experiment. Math. 11 (2002), no. 2, 303–311.[MR]
  84. Felix Lazebnik and Raymond Viglione, An infinite series of regular edge- but not vertex-transitive graphs, J. Graph Theory 41 (2002), no. 4, 249–258.[MR]
  85. G. Lecerf, Quadratic Newton iteration for systems with multiplicity, Found. Comput. Math. 2 (2002), no. 3, 247–293.[MR]
  86. C. R. Leedham-Green and Scott H. Murray, Variants of product replacement, Computational and Statistical Group Theory (Las Vegas, NV/Hoboken, NJ, 2001), Contemp. Math., vol. 298, Amer. Math. Soc., Providence, RI, 2002, pp. 97–104.[MR]
  87. C. R. Leedham-Green and E. A. O'Brien, Recognising tensor-induced matrix groups, J. Algebra 253 (2002), no. 1, 14–30.[MR]
  88. D. Leemans, The residually weakly primitive geometries of M24, Preprint (2002).
  89. Dimitri Leemans, The residually weakly primitive geometries of J2, Note Mat. 21 (2002), no. 1, 77–81.[MR]
  90. Wolfgang Lempken, On 2-local amalgams proving existence and uniqueness of McL and 3.McL, Preprint (IEM, Essen. 2002).
  91. Samuel J. Lomonaco, Jr. and Louis H. Kauffman, Quantum hidden subgroup algorithms: A mathematical perspective, Quantum Computation and Information (Washington, DC, 2000), Contemp. Math., vol. 305, Amer. Math. Soc., Providence, RI, 2002, pp. 139–202.[MR]
  92. Peter Lorimer, Models for a finite universe, Internat. J. Theoret. Phys. 41 (2002), no. 7, 1201–1274.[MR]
  93. Frank Lübeck, On the computation of elementary divisors of integer matrices, J. Symbolic Comput. 33 (2002), no. 1, 57–65.[MR]
  94. Eugene M. Luks and Takunari Miyazaki, Polynomial-time normalizers for permutation groups with restricted composition factors, in ISSAC '02: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2002, pp. 176–183 (electronic).[MR/link]
  95. Stefano Marcugini, Alfredo Milani, and Fernanda Pambianco, NMDS codes of maximal length over Fq, 8 ≤ q ≤ 11, IEEE Trans. Inform. Theory 48 (2002), no. 4, 963–966.[MR]
  96. Dragan Marušič and Primož Potočnik, Bridging semisymmetric and half-arc-transitive actions on graphs, European J. Combin. 23 (2002), no. 6, 719–732.[MR]
  97. Kazuto Matsuo, Jinhui Chao, and Shigeo Tsujii, An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 461–474.[MR]
  98. Markus Maurer, Alfred Menezes, and Edlyn Teske, Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree, LMS J. Comput. Math. 5 (2002), 127–174 (electronic).[MR]
  99. J. McLaughlin, Small prime powers in the Fibonacci sequence, preprint (2002), 22 pages.[arXiv]
  100. Gerhard O. Michler and Michael Weller, The character values of the irreducible constituents of a transitive permutation representation, Arch. Math. (Basel) 78 (2002), no. 6, 417–429.[MR]
  101. Carmen-Simona Nedeloaia, On weight distribution of cyclic self-dual codes, in IEEE International Symposium on Information Theory (ISIT), Lausanne, Switzerland,, 2002.
  102. E. A. O'Brien and Michael Vaughan-Lee, The 2-generator restricted Burnside group of exponent 7, Internat. J. Algebra Comput. 12 (2002), no. 4, 575–592.[MR]
  103. Mikael Olofsson, Vlsi Aspects on Inversion in Finite Fields, PhD Thesis, Linköpings Universitet, Linköping, Sweden, 2002.
  104. Patric R. J. Östergård, Classifying subspaces of Hamming spaces, Des. Codes Cryptogr. 27 (2002), no. 3, 297–305.[MR]
  105. Michio Ozeki, Jacobi polynomials for singly even self-dual codes and the covering radius problems, IEEE Trans. Inform. Theory 48 (2002), no. 2, 547–557.[MR]
  106. Mihran Papikian, On the degree of modular parametrizations over function fields, J. Number Theory 97 (2002), no. 2, 317–349.[MR/doi]
  107. Christopher Parker, Generators and relations for the Lyons sporadic simple group, Arch. Math. (Basel) 78 (2002), no. 2, 97–103.[MR]
  108. Ariane Péladan-Germa, Testing equality in differential ring extensions defined by PDE's and limit conditions, Appl. Algebra Engrg. Comm. Comput. 13 (2002), no. 4, 257–288.[MR]
  109. Sarah B. Perkins and Peter J. Rowley, Minimal and maximal length involutions in finite Coxeter groups, Comm. Algebra 30 (2002), no. 3, 1273–1292.[MR]
  110. Virgile Prevosto and Damien Doligez, Algorithms and proofs inheritance in the Foc language, J. Automat. Reason. 29 (2002), no. 3-4, 337–363.[MR]
  111. E. M. Rains, N. J. A. Sloane, and John Stufken, The lattice of N-run orthogonal arrays, J. Statist. Plann. Inference 102 (2002), no. 2, 477–500.[MR]
  112. Lisa Marie Redekop, Torsion Points of Low Order on Elliptic Curves and Drinfeld Modules, PhD Thesis, 2002.[link]
  113. Marc Stetson Renault, Computing Generators for Rings of Multiplicative Invariants, PhD Thesis, Temple University, 2002.
  114. Christophe Ritzenthaler, Automorphismes des courbes modulaires X(n) en caractéristique p, Manuscripta Math. 109 (2002), no. 1, 49–62.[MR]
  115. Massimiliano Sala, Groebner bases and distance of cyclic codes, Appl. Algebra Engrg. Comm. Comput. 13 (2002), no. 2, 137–162.[MR]
  116. Jasper Scholten and Hui June Zhu, Families of supersingular curves in characteristic 2, Math. Res. Lett. 9 (2002), no. 5-6, 639–650.[MR/link]
  117. Éric Schost, Degree bounds and lifting techniques for triangular sets, in Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2002, pp. 238–245 (electronic).[MR]
  118. R. James Shank and David L. Wehlau, Computing modular invariants of p-groups, J. Symbolic Comput. 34 (2002), no. 5, 307–327.[MR]
  119. R. James Shank and David L. Wehlau, Noether numbers for subrepresentations of cyclic groups of prime order, Bull. London Math. Soc. 34 (2002), no. 4, 438–450.[MR]
  120. Tony Shaska, Genus 2 curves with (3,3)-split Jacobian and large automorphism group, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 205–218.[MR]
  121. Allan Steel, A new scheme for computing with algebraically closed fields, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 491–505.[MR]
  122. William A. Stein, There are genus one curves over Q of every odd index, J. Reine Angew. Math. 547 (2002), 139–147.[MR]
  123. Rainer Steinwandt, Implicitizing without tag variables, Proceedings of the 8th Rhine Workshop on Computer Algebra, 2002, pp. 217-224.
  124. Rainer Steinwandt, Willi Geiselmann, and Regine Endsuleit, Attacking a polynomial-based cryptosystem: polly cracker, Int. J. Inf. Secur. 1 (2002), no. 3, 143-148.
  125. Michael Stoll, On the height constant for curves of genus two. II, Acta Arith. 104 (2002), no. 2, 165–182.[MR]
  126. Aleš Vavpetič and Antonio Viruel, On the homotopy type of the classifying space of the exceptional Lie group F4, Manuscripta Math. 107 (2002), no. 4, 521–540.[MR]
  127. Libero Verardi, Matrices, graphs and equivalence relations, Ann. Mat. Pura Appl. (4) 180 (2002), no. 4, 413–428.[MR]
  128. Helena A. Verrill, Transportable modular symbols and the intersection pairing, Algorithmic Number Theory (Sydney, 2002), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2002, pp. 219–233.[MR]
  129. H. E. Winkelnkemper, Artin presentations. I. Gauge theory, 3 + 1 TQFT's and the braid groups, J. Knot Theory Ramifications 11 (2002), no. 2, 223–275.[MR]
  130. Pawel Wocjan, Martin Rötteler, Dominik Janzing, and Thomas Beth, Universal simulation of Hamiltonians using a finite set of control operations, Quantum Inf. Comput. 2 (2002), no. 2, 133–150.[MR]
  131. Jürgen Zimmer and Louise A. Dennis, Inductive theorem proving and computer algebra in the MathWeb Software Bus, Artificial Intelligence, Automated Reasoning, and Symbolic Computation, Lecture Notes in Comput. Sci., vol. 2385, Springer, Berlin, 2002, pp. 319–331.[MR]

2003

  1. A. Aguglia, A. Cossidente, and G. L. Ebert, Complete spans on Hermitian varieties, in Proceedings of the Conference on Finite Geometries (Oberwolfach, 2001), vol. 29, 2003, pp. 7–15.[MR]
  2. Scott Ahlgren and Matthew Papanikolas, Higher Weierstrass points on X0(p), Trans. Amer. Math. Soc. 355 (2003), no. 4, 1521–1535 (electronic).[MR]
  3. Victor Aladjev, Computer algebra system Maple: A new software library, Proceedings of the International Conference held in Melbourne and St. Petersburg, June 2-4, 2003, Lecture Notes in Computer Science, vol. 2657, Springer-Verlag, Berlin, 2003, pp. lvi+1095.[MR]
  4. Faryad Ali and Jamshid Moori, The Fischer-Clifford matrices of a maximal subgroup of Fi'24, Represent. Theory 7 (2003), 300–321 (electronic).[MR]
  5. Jianbei An and E. A. O'Brien, Conjectures on the character degrees of the Harada-Norton simple group HN, Israel J. Math. 137 (2003), 157–181.[MR]
  6. Jianbei An, E. A. O'Brien, and R. A. Wilson, The Alperin weight conjecture and Dade's conjecture for the simple group J4, LMS J. Comput. Math. 6 (2003), 119–140 (electronic).[MR]
  7. David Applegate, E. M. Rains, and N. J. A. Sloane, On asymmetric coverings and covering numbers, J. Combin. Des. 11 (2003), no. 3, 218–228.[MR]
  8. Vyacheslav A. Artamonov, Alexander A. Mikhalev, and Alexander V. Mikhalev, Combinatorial properties of free algebras of Schreier varieties, Polynomial identities and combinatorial methods (Pantelleria, 2001), Lecture Notes in Pure and Appl. Math., vol. 235, Dekker, New York, 2003, pp. 47–99.[MR]
  9. Laura Bader, Nicola Durante, Maska Law, Guglielmo Lunardon, and Tim Penttila, Symmetries of BLT-sets, in Proceedings of the Conference on Finite Geometries (Oberwolfach, 2001), vol. 29, 2003, pp. 41–50.[MR]
  10. Ronald D. Baker, C. Culbert, Gary L. Ebert, and Keith E. Mellinger, Odd order flag-transitive affine planes of dimension three over their kernel, Adv. Geom. 3 (2003), S215–S223.[MR]
  11. Edoardo Ballico, Antonio Cossidente, and Alessandro Siciliano, External flats to varieties in symmetric product spaces over finite fields, Finite Fields Appl. 9 (2003), no. 3, 300–309.[MR/doi]
  12. Tatiana Bandman, Gert-Martin Greuel, Fritz Grunewald, Boris Kunyavskii, Gerhard Pfister, and Eugene Plotkin, Two-variable identities for finite solvable groups, C. R. Math. Acad. Sci. Paris 337 (2003), no. 9, 581–586.[MR]
  13. David C. Banks and Stephen Linton, Counting cases in marching cubes: toward a generic algorithm for producing substitopes, in VIS '03: Proceedings of the 14th IEEE Visualization 2003 (VIS'03), IEEE Computer Society, Washington, DC, USA, 2003, pp. 8.[doi]
  14. Paulo S. L. M. Barreto, B. Lynn, and M. Scott, Constructing elliptic curves with prescribed embedding degrees, Security in Communication Networks: Third International Conference,SCN 2002,Amalfi,Italy,September 11-13,2002. Revised Papers., Lecture Notes in Comput. Sci., vol. 2576, Springer, Berlin, 2003, pp. 257.
  15. C. Bates, D. Bundy, Sarah B. Perkins, and P. Rowley, Commuting involution graphs for finite Coxeter groups, J. Group Theory 6 (2003), no. 4, 461–476.[MR]
  16. C. Bates, D. Bundy, Sarah B. Perkins, and P. Rowley, Commuting involution graphs for symmetric groups, J. Algebra 266 (2003), no. 1, 133–153.[MR]
  17. Chris Bates and Peter J. Rowley, Centralizers of strongly real elements in finite groups, Preprint (2003), 4 pages.
  18. Thomas Bayer, An algorithm for computing invariants of linear actions of algebraic groups up to a given degree, J. Symbolic Comput. 35 (2003), no. 4, 441–449.[MR]
  19. Thomas Beth, Christopher Charnes, Markus Grassl, Gernot Alber, Aldo Delgado, and Michael Mussinger, A new class of designs which protect against quantum jumps, Des. Codes Cryptogr. 29 (2003), no. 1-3, 51–70.[MR]
  20. Koichi Betsumiya, T. Aaron Gulliver, and Masaaki Harada, Extremal self-dual codes over F2×F2, Des. Codes Cryptogr. 28 (2003), no. 2, 171–186.[MR]
  21. Koichi Betsumiya and Masaaki Harada, Formally self-dual codes related to Type II codes, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 2, 81–88.[MR]
  22. Simon R. Blackburn, Carlos Cid, and Steven D. Galbraith, Cryptanalysis of a cryptosystem based on Drinfeld modules, Cryptology ePrint Archive: Report 2003/223 (2003), 5 pages.
  23. Arrigo Bonisoli and Gloria Rinaldi, A class of complete arcs in multiply derived planes, Adv. Geom. (2003), no. suppl., S113–S118.[MR]
  24. Alexis Bonnecaze, Anne Desideri Bracco, Steven T. Dougherty, Luz R. Nochefranca, and Patrick Solé, Cubic self-dual binary codes, IEEE Trans. Inform. Theory 49 (2003), no. 9, 2253–2259.[MR]
  25. Alexandre V. Borovik, Evgenii I. Khukhro, and Alexei G. Myasnikov, The Andrews-Curtis conjecture and black box groups, Internat. J. Algebra Comput. 13 (2003), no. 4, 415–436.[MR]
  26. Alin Bostan, Bruno Salvy, and Éric Schost, Fast algorithms for zero-dimensional polynomial systems using duality, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 4, 239–272.[MR]
  27. Delphine Boucher, Philippe Gaillard, and Felix Ulmer, Fourth order linear differential equations with imprimitive group, in ISSAC '03: Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2003, pp. 45–49 (electronic).[MR]
  28. Stefka Bouyuklieva and Masaaki Harada, Extremal self-dual [50, 25, 10] codes with automorphisms of order 3 and quasi-symmetric 2-(49,9,6) designs, Des. Codes Cryptogr. 28 (2003), no. 2, 163–169.[MR]
  29. J. N. Bray, R. T. Curtis, C. W. Parker, and C. B. Wiedorn, Symmetric presentations for the Fischer groups. I. The classical groups \rm Sp6(2),\ Sp8(2), and \rm 3·O7(3), J. Algebra 265 (2003), no. 1, 171–199.[MR]
  30. John N. Bray and Robert T. Curtis, Monomial modular representations and symmetric generation of the Harada-Norton group, J. Algebra 268 (2003), no. 2, 723–743.[MR]
  31. Gavin Brown, Datagraphs in algebraic geometry and K3 surfaces, Symbolic and Numerical Scientific Computation (Hagenberg, 2001), Lecture Notes in Comput. Sci., vol. 2630, Springer, Berlin, 2003, pp. 210–224.[MR]
  32. N. Bruin and E. V. Flynn, n-covers of hyperelliptic curves, Math. Proc. Cambridge Philos. Soc. 134 (2003), no. 3, 397–405.[MR]
  33. R. R. Bruner and J. P. C. Greenlees, The connective K-theory of finite groups, Mem. Amer. Math. Soc. 165 (2003), no. 785, viii+127.[MR]
  34. F. Buekenhout, P. O. Dehaye, and D. Leemans, RWPRI and (2T)1 flag-transitive linear spaces, Beiträge Algebra Geom. 44 (2003), no. 1, 25–46.[MR]
  35. Francis Buekenhout, Philippe Cara, Michel Dehon, and Dimitri Leemans, Residually weakly primitive geometries of small sporadic and almost simple groups: a synthesis, Topics in Diagram Geometry, Quad. Mat., vol. 12, Dept. Math., Seconda Univ. Napoli, Caserta, 2003, pp. 1–27.[MR]
  36. Emilio Bujalance, F. J. Cirre, and Marston Conder, On extendability of group actions on compact Riemann surfaces, Trans. Amer. Math. Soc. 355 (2003), no. 4, 1537–1557 (electronic).[MR]
  37. Laurent Busé and Jean-Pierre Jouanolou, On the closed image of a rational map and the implicitization problem, J. Algebra 265 (2003), no. 1, 312–357.[MR]
  38. M. R. Bush, Computation of Galois groups associated to the 2-class towers of some quadratic fields, J. Number Theory 100 (2003), no. 2, 313–325.[MR]
  39. John J. Cannon and Derek F. Holt, Automorphism group computation and isomorphism testing in finite groups, J. Symbolic Comput. 35 (2003), no. 3, 241–267.[MR]
  40. Jean-Claude Carlach and Ayoub Otmani, A systematic construction of self-dual codes, IEEE Trans. Inform. Theory 49 (2003), no. 11, 3005–3009.[MR]
  41. Jon F. Carlson, Lisa Townsley, Luis Valeri-Elizondo, and Mucheng Zhang, Cohomology Rings of Finite Groups, Algebras and Applications, vol. 3, Kluwer Academic Publishers, Dordrecht, 2003, pp. xvi+776.[MR]
  42. David B. Chandler and Qing Xiang, Cyclic relative difference sets and their p-ranks, Des. Codes Cryptogr. 30 (2003), no. 3, 325–343.[MR]
  43. Chien-Yu Chen and Iwan M. Duursma, Geometric Reed-Solomon codes of length 64 and 65 over F8, IEEE Trans. Inform. Theory 49 (2003), no. 5, 1351–1353.[MR]
  44. Arjeh Cohen, Scott H. Murray, Martin Pollet, and Volker Sorge, Certifying solutions to permutation group problems, Automated Deduction - CADE-19, Lecture Notes in Computer Science, vol. 2741, Springer Berlin/Heidelberg, 2003, pp. 258–273.
  45. Arjeh M. Cohen and Luis Paris, On a theorem of Artin, J. Group Theory 6 (2003), no. 4, 421–441.[MR]
  46. Marston Conder, Group actions on graphs, maps and surfaces with maximum symmetry, Groups St. Andrews 2001 in Oxford. Vol. I, London Math. Soc. Lecture Note Ser., vol. 304, Cambridge Univ. Press, Cambridge, 2003, pp. 63–91.[MR]
  47. Marston Conder, Colin Maclachlan, Sanja Todorovic Vasiljevic, and Steve Wilson, Bounds for the number of automorphisms of a compact non-orientable surface, J. London Math. Soc. (2) 68 (2003), no. 1, 65–82.[MR]
  48. Marston Conder and Dragan Marušič, A tetravalent half-arc-transitive graph with non-abelian vertex stabilizer, J. Combin. Theory Ser. B 88 (2003), no. 1, 67–76.[MR]
  49. Marston Conder, Margaret Morton, and Cheryl E. Praeger, Two-arc closed subsets of graphs, J. Graph Theory 42 (2003), no. 4, 350–364.[MR]
  50. Brian Conrad, Bas Edixhoven, and William Stein, J1(p) has connected fibers, Doc. Math. 8 (2003), 331–408 (electronic).[MR]
  51. Scott Contini and Yiqun Lisa Yin, Improved cryptanalysis of securID, Preprint (2003), 25 pages.[link]
  52. Gene Cooperman and Eric Robinson, Memory-based and disk-based algorithms for very high degree permutation groups, in ISSAC '03: Proceedings of the 2003 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2003, pp. 66–73.[doi]
  53. John Cossey and Stewart E. Stonehewer, The embedding of a cyclic permutable subgroup in a finite group, Illinois J. Math. 47 (2003), no. 1-2, 89–111.[MR/link]
  54. J. E. Cremona and D. Rusin, Efficient solution of rational conics, Math. Comp. 72 (2003), no. 243, 1417–1441 (electronic).[MR]
  55. C. J. Cummins and S. Pauli, Congruence subgroups of PSL(2,Z) of genus less than or equal to 24, Experiment. Math. 12 (2003), no. 2, 243–255.[MR]
  56. Daniel B. Dalan, New extremal binary [44,22,8] codes, IEEE Trans. Inform. Theory 49 (2003), no. 3, 747–748.[MR]
  57. Daniel B. Dalan, New extremal type I codes of lengths 40, 42, and 44, Des. Codes Cryptogr. 30 (2003), no. 2, 151–157.[MR]
  58. Tobias Dern and Aloys Krieg, Graded rings of Hermitian modular forms of degree 2, Manuscripta Math. 110 (2003), no. 2, 251–272.[MR]
  59. Claus Diem, The GHS attack in odd characteristic, J. Ramanujan Math. Soc. 18 (2003), no. 1, 1–32.[MR]
  60. M. van Dijk, S. Egner, M. Greferath, and A. Wassermann, Geometric codes over fields of odd prime power order, in IEEE International Symposium on Information Theory (ISIT), Yokohama, 2003.
  61. M. van Dijk, S. Egner, M. Greferath, and A. Wassermann, On binary linear [160,80,24] codes, in IEEE International Symposium on Information Theory (ISIT), Yokohama, 2003.
  62. Radinka Dontcheva and Masaaki Harada, Some extremal self-dual codes with an automorphism of order 7, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 2, 75–79.[MR]
  63. Steven T. Dougherty, T. Aaron Gulliver, and Manabu Oura, Higher weights and graded rings for binary self-dual codes, Discrete Appl. Math. 128 (2003), no. 1, 121–143.[MR]
  64. Neil Dummigan, William Stein, and Mark Watkins, Constructing elements in Shafarevich-Tate groups of modular motives, Number Theory and Algebraic Geometry, London Math. Soc. Lecture Note Ser., vol. 303, Cambridge Univ. Press, Cambridge, 2003, pp. 91–118.[MR]
  65. Nathan M. Dunfield and William P. Thurston, The virtual Haken conjecture: experiments and examples, Geom. Topol. 7 (2003), 399–441 (electronic).[MR]
  66. Sylvain Duquesne, Points rationnels et méthode de Chabauty elliptique, J. Théor. Nombres Bordeaux 15 (2003), no. 1, 99–113.[MR]
  67. Arno van den Essen, Andrzej Nowicki, and Andrzej Tyc, Generalizations of a lemma of Freudenburg, J. Pure Appl. Algebra 177 (2003), no. 1, 43–47.[MR]
  68. H. Evangelaras, I. Kotsireas, and C. Koukouvinos, Application of Gröbner bases to the analysis of certain two or three level factorial designs, Adv. Appl. Stat. 3 (2003), no. 1, 1–13.[MR]
  69. Jean-Charles Faugère and Antoine Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases, Advances in Cryptology—CRYPTO 2003, Lecture Notes in Comput. Sci., vol. 2729, Springer, Berlin, 2003, pp. 44–60.[MR]
  70. Claus Fieker and Jürgen Klüners, Minimal discriminants for fields with small Frobenius groups as Galois groups, J. Number Theory 99 (2003), no. 2, 318–337.[MR]
  71. Sharon M. Frechette, A classical characterization of newforms with equivalent eigenforms in Sk+1/2(4N,χ), J. London Math. Soc. (2) 68 (2003), no. 3, 563–578.[MR]
  72. Philippe Gaborit and Ayoub Otmani, Experimental constructions of self-dual codes, Finite Fields Appl. 9 (2003), no. 3, 372–394.[MR]
  73. Steven D. Galbraith, Weil descent of Jacobians, Discrete Appl. Math. 128 (2003), no. 1, 165–180.[MR]
  74. Willi Geiselmann, Willi Meier, and Rainer Steinwandt, An attack on the isomorphisms of polynomials problem with one secret, Int. J. Inf. Secur. (2003), no. 2, 59-64.
  75. Willi Geiselmann and Rainer Steinwandt, A redundant representation of GF(qn) for designing arithmetic circuits, IEEE Trans. Comp 52 (2003), no. 7, 848–853.
  76. Willi Geiselmann and Rainer Steinwandt, A short comment on the affine parts of SFLASHv3, IACR (2003).[eprint]
  77. Katharina Geißler and Nigel P. Smart, Computing the M = UUt integer matrix decomposition, Cryptography and Coding, Lecture Notes in Comput. Sci., vol. 2898, Springer, Berlin, 2003, pp. 223–233.[MR]
  78. Ian P. Gent, Warwick Harvey, Tom Kelsey, and Steve Linton, Generic SBDD using computational group theory, Principles and Practice of Constraint Programming, CP 2003: 9th International Conference, CP 2003, Kinsale, Ireland, September 29-October 3,2003,Proceedings, Lecture Notes in Comput. Sci., vol. 2833, Springer, Berlin, 2003, pp. 333-347.
  79. Norbert Goeb, Computing the automorphism groups of hyperelliptic function fields, preprint (2003), 16 pages.[arXiv]
  80. María Isabel González Vasco, Martin Rötteler, and Rainer Steinwandt, On minimal length factorizations of finite groups, Experiment. Math. 12 (2003), no. 1, 1–12.[MR]
  81. Harald Gottschalk and Dimitri Leemans, Geometries for the group PSL(3,4), European J. Combin. 24 (2003), no. 3, 267–291.[MR]
  82. David J. Green, Gröbner Bases and the Computation of Group Cohomology, Lecture Notes in Mathematics, vol. 1828, Springer-Verlag, Berlin, 2003, pp. xii+138.[MR]
  83. Jason Grout, Ultraconnected and critical graphs, Master's Thesis, Brigham Young University, 2003.
  84. T. Aaron Gulliver, Masaaki Harada, and Jon-Lark Kim, Construction of new extremal self-dual codes, Discrete Math. 263 (2003), no. 1-3, 81–91.[MR]
  85. T. Aaron Gulliver, Masaaki Harada, and Jon-Lark Kim, Construction of some extremal self-dual codes, Discrete Math. 264 (2003), 55–73.
  86. T. Aaron Gulliver, Patric R. J. Östergård, and Nikolai I. Senkevitch, Optimal quaternary linear rate-1/2 codes of length ≤ 18, IEEE Trans. Inform. Theory 49 (2003), no. 6, 1540–1543.[MR/link]
  87. Masaaki Harada and Vladimir D. Tonchev, Self-orthogonal codes from symmetric designs with fixed-point-free automorphisms, Discrete Math. 264 (2003), no. 1-3, 81–90.[MR]
  88. George Havas and Colin Ramsay, Short balanced presentations of perfect groups, Groups St. Andrews 2001 in Oxford. Vol. I, London Math. Soc. Lecture Note Ser., vol. 304, Cambridge Univ. Press, Cambridge, 2003, pp. 238–243.[MR]
  89. Florian Hess, Computing relations in divisor class groups of algebraic curves over finite fields, Preprint (2003).
  90. Florian Hess, Sebastian Pauli, and Michael E. Pohst, Computing the multiplicative group of residue class rings, Math. Comp. 72 (2003), no. 243, 1531–1548 (electronic).[MR]
  91. G. Hiss, Algorithms of representation theory, Computer Algebra Handbook, vol. 17, Springer, Berlin, 2003, pp. 84–88.
  92. Miles Holloway, Broué's conjecture for the Hall-Janko group and its double cover, Proc. London Math. Soc. (3) 86 (2003), no. 1, 109–130.[MR]
  93. Petra E. Holmes and Robert A. Wilson, A new computer construction of the Monster using 2-local subgroups, J. London Math. Soc. (2) 67 (2003), no. 2, 349–364.[MR]
  94. K. J. Horadam and P. Udaya, A new class of ternary cocyclic Hadamard codes, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 1, 65–73.[MR]
  95. E. W. Howe and K. E. Lauter, Improved upper bounds for the number of points on curves over finite fields, Ann. Inst. Fourier (Grenoble) 53 (2003), no. 6, 1677–1737.[MR]
  96. W. Cary Huffman and Vera Pless, Fundamentals of Error-correcting Codes, Cambridge University Press, Cambridge, 2003, pp. xviii+646.[MR]
  97. Stephen P. Humphries, Finite Hurwitz braid group actions on sequences of Euclidean reflections, J. Algebra 269 (2003), no. 2, 556–588.[MR]
  98. Farzali A. Izadi and V. Kumar Murty, Counting points on an abelian variety over a finite field, Progress in Cryptology—Indocrypt 2003, Lecture Notes in Comput. Sci., vol. 2904, Springer, Berlin, 2003, pp. 323–333.[MR]
  99. Gerold Jaeger, Parallel algorithms for computing the Smith normal form of large matrices, Recent Advances in Parallel Virtual Machine and Message Passing Interface, vol. 2840, Springer, Berlin/Heidelberg, 2003, pp. 170–179.
  100. Jorge Jimenez-Urroz and Tonghai Yang, Heegner zeros of theta functions, Trans. Amer. Math. Soc. 355 (2003), no. 10, 4137–4149 (electronic).[MR]
  101. Norman L. Johnson and Keith E. Mellinger, Multiple spread retraction, Adv. Geom. 3 (2003), no. 3, 263–286.[MR]
  102. Sarah J. Johnson and Steven R. Weller, High-rate LDPC codes from unital designs, IEEE Global Telecommunications Conference 4 (2003), no. 5, 2036– 2040.
  103. D. Joyner, Arithmetic of characters of generalized symmetric groups, Arch. Math. (Basel) 81 (2003), no. 2, 113–120.[MR]
  104. William M. Kantor and Ákos Seress, Computing with matrix groups, Groups, combinatorics &geometry (Durham, 2001), World Sci. Publishing, River Edge, NJ, 2003, pp. 123–137.[MR]
  105. Andrei Kelarev, Graph algebras and automata, Monographs and Textbooks in Pure and Applied Mathematics, vol. 257, Marcel Dekker Inc., New York, 2003, pp. viii+366.[MR]
  106. Gregor Kemper, Computing invariants of reductive groups in positive characteristic, Transform. Groups 8 (2003), no. 2, 159–176.[MR]
  107. J. D. Key, J. Moori, and B. G. Rodrigues, On some designs and codes from primitive representations of some finite simple groups, J. Combin. Math. Combin. Comput. 45 (2003), 3–19.[MR]
  108. Jon-Lark Kim, Keith E. Mellinger, and Vera Pless, Projections of binary linear codes onto larger fields, SIAM J. Discrete Math. 16 (2003), no. 4, 591–603 (electronic).[MR]
  109. Jon-Lark Kim and Vera Pless, Designs in additive codes over GF(4), Des. Codes Cryptogr. 30 (2003), no. 2, 187–199.[MR]
  110. Andreas Klappenecker and Martin Rötteler, Unitary error bases: Constructions, equivalence, and applications, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Toulouse, 2003), Lecture Notes in Comput. Sci., vol. 2643, Springer, Berlin, 2003, pp. 139–149.[MR]
  111. David R. Kohel, The AGM-X0(N) Heegner point lifting algorithm and elliptic curve point counting, Advances in Cryptology—Asiacrypt 2003, Lecture Notes in Comput. Sci., vol. 2894, Springer, Berlin, 2003, pp. 124–136.[MR]
  112. David R. Kohel and Helena A. Verrill, Fundamental domains for Shimura curves, J. Théor. Nombres Bordeaux 15 (2003), no. 1, 205–222.[MR]
  113. M. Kratzer, G. O. Michler, and M. Weller, Harada group uniquely determined by centralizer of a 2-central involution, in Proceedings of the First Sino-German Workshop on Representation Theory and Finite Simple Groups (Beijing, 2002), vol. 10, 2003, pp. 303–372.[MR]
  114. Mathias Kratzer, Constructing pairs of compatible characters, in Proceedings of the First Sino-German Workshop on Representation Theory and Finite Simple Groups (Beijing, 2002), vol. 10, 2003, pp. 285–302.[MR]
  115. Mathias Kratzer, Wolfgang Lempken, Gerhard O. Michler, and Katsushi Waki, Another existence and uniqueness proof for McLaughlin's simple group, J. Group Theory 6 (2003), no. 4, 443–459.[MR]
  116. Boris Kunyavskii, Eugene Plotkin, and Roman Shklyar, A strategy for human-computer study of equations and identities in finite groups, Proc. Latv. Acad. Sci. Sect. B Nat. Exact Appl. Sci. 57 (2003), no. 3-4, 97–101.[MR]
  117. Gohar M. Kyureghyan and Alexander Pott, On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences, in Proceedings of the Conference on Finite Geometries (Oberwolfach, 2001), vol. 29, 2003, pp. 149–164.[MR]
  118. Maska Law, Flocks, generalised quadrangles and translation planes from BLT-sets, PhD Thesis, University of Western Australia, 2003.
  119. Maska Law and Tim Penttila, Classification of flocks of the quadratic cone over fields of order at most 29, Adv. Geom. 3 (2003), no. Special Issue, S232–S244.[MR]
  120. Grégoire Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, J. Complexity 19 (2003), no. 4, 564–596.[MR]
  121. Y. Lee, R. Scheidler, and C. Yarrish, Computation of the fundamental units and the regulator of a cyclic cubic function field, Experiment. Math. 12 (2003), no. 2, 211–225.[MR]
  122. Dimitri Leemans, On a rank four geometry for the Hall-Janko sporadic group, J. Combin. Theory Ser. A 101 (2003), no. 1, 160–167.[MR]
  123. Dimitri Leemans, The residually weakly primitive geometries of M22, in Proceedings of the Conference on Finite Geometries (Oberwolfach, 2001), vol. 29, 2003, pp. 177–178.[MR]
  124. Wolfgang Lempken, 2-local amalgams for the simple groups GL(5,2), M24 and He. II, in Proceedings of the First Sino-German Workshop on Representation Theory and Finite Simple Groups (Beijing, 2002), vol. 10, 2003, pp. 373–380.[MR]
  125. Wolfgang Lempken, 2-local amalgams for the simple groups GL(5,2), M24 and He, Illinois J. Math. 47 (2003), no. 1-2, 361–393.[MR]
  126. Franck Leprévost, Michael Pohst, and Andreas Schöpp, Familles de polynômes liées aux courbes modulaires X(l) unicursales et points rationnels non-triviaux de courbes elliptiques quotient, Acta Arith. 110 (2003), no. 4, 401–410.[MR]
  127. Françoise Levy-dit-Vehel and Ludovic Perret, Polynomial equivalence problems and applications to multivariate cryptosystems, Progress in Cryptology—Indocrypt 2003, Lecture Notes in Comput. Sci., vol. 2904, Springer, Berlin, 2003, pp. 235–251.[MR]
  128. San Ling and Patrick Solé, Nonlinear p-ary sequences, Appl. Algebra Engrg. Comm. Comput. 14 (2003), no. 2, 117–125.[MR]
  129. Klaus M. Lux and Magdolna Szőke, Computing homomorphism spaces between modules over finite dimensional algebras, Experiment. Math. 12 (2003), no. 1, 91–98.[MR]
  130. Colin Maclachlan and Alan W. Reid, The Arithmetic of Hyperbolic 3-manifolds, Graduate Texts in Mathematics, vol. 219, Springer-Verlag, New York, 2003, pp. xiv+463.[MR]
  131. Kay Magaard, Sergey Shpectorov, and Helmut Völklein, A GAP package for braid orbit computation and applications, Experiment. Math. 12 (2003), no. 4, 385–393.[MR]
  132. S. Marcugini and F. Pambianco, Minimal 1-saturating sets in PG(2,q), q ≤ 16, Australas. J. Combin. 28 (2003), 161–169.[MR]
  133. John Martino and Stewart Priddy, Group extensions and automorphism group rings, Homology Homotopy Appl. 5 (2003), no. 1, 53–70 (electronic).[MR]
  134. Dragan Marušič, On 2-arc-transitivity of Cayley graphs, J. Combin. Theory Ser. B 87 (2003), no. 1, 162–196.[MR]
  135. William G. McCallum and Romyar T. Sharifi, A cup product in the Galois cohomology of number fields, Duke Math. J. 120 (2003), no. 2, 269–310.[MR]
  136. Gerhard O. Michler, On the uniqueness of the finite simple groups with a given centralizer of a 2-central involution, Illinois J. Math. 47 (2003), no. 1-2, 419–444.[MR/link]
  137. Gerhard O. Michler, Michael Weller, and Katsushi Waki, Natural existence proof for Lyons simple group, J. Algebra Appl. 2 (2003), no. 3, 277–315.[MR]
  138. Teo Mora and Massimiliano Sala, On the Gröbner bases of some symmetric systems and their application to coding theory, J. Symbolic Comput. 35 (2003), no. 2, 177–194.[MR]
  139. Gabriele Nebe, Even lattices with covering radius < √2, Beiträge Algebra Geom. 44 (2003), no. 1, 229–234.[MR]
  140. Carmen-Simona Nedeloaia, Weight distributions of cyclic self-dual codes, IEEE Trans. Inform. Theory 49 (2003), no. 6, 1582–1591.[MR]
  141. G. H. Norton and A. Salagean, Cyclic codes and minimal strong Gröbner bases over a principal ideal ring, Finite Fields Appl. 9 (2003), no. 2, 237–249.[MR/doi]
  142. Christopher Parker and Peter Rowley, Subgroup-chain graphs, Graphs Combin. 19 (2003), no. 4, 537–545.[MR]
  143. Bernadette Perrin-Riou, Arithmétique des courbes elliptiques à réduction supersingulière en p, Experiment. Math. 12 (2003), no. 2, 155–186.[MR/link]
  144. B. V. Petrenko, On the product of two primitive elements of maximal subfields of a finite field, J. Pure Appl. Algebra 178 (2003), no. 3, 297–306.[MR]
  145. B. V. Petrenko, On the sum of two primitive elements of maximal subfields of a finite field, Finite Fields Appl. 9 (2003), no. 1, 102–116.[MR]
  146. Robert Pollack, On the p-adic L-function of a modular form at a supersingular prime, Duke Math. J. 118 (2003), no. 3, 523–558.[MR]
  147. Roman O. Popovych, Vyacheslav M. Boyko, Maryna O. Nesterenko, and Maxim W. Lutfullin, Realizations of real low-dimensional Lie algebras, J. Phys. A 36 (2003), 7337-7360.[arXiv]
  148. B. B. Ranson and J. M. Dover, Blocking semiovals in PG(2,7) and beyond, European J. Combin. 24 (2003), no. 2, 183–193.[MR]
  149. Colva M. Roney-Dougal and William R. Unger, The affine primitive permutation groups of degree less than 1000, J. Symbolic Comput. 35 (2003), no. 4, 421–439.[MR]
  150. Massimiliano Sala, Upper bounds on the dual distance of BCH(255,k), Des. Codes Cryptogr. 30 (2003), no. 2, 159–168.[MR]
  151. Jonas Samuelsson, Multidimensional companding quantization of the Gaussian source, IEEE Trans. Inform. Theory 49 (2003), no. 5, 1343–1351.[MR]
  152. David Savitt, The maximum number of points on a curve of genus 4 over F8 is 25, Canad. J. Math. 55 (2003), no. 2, 331–352.[MR]
  153. Mohamed Sayed, Nested symmetric representation of elements of the Suzuki chain groups, Int. J. Math. Math. Sci. 2003 (2003), no. 62, 3931–3948.[MR]
  154. Csaba Schneider, Groups of prime-power order with a small second derived quotient, J. Algebra 266 (2003), no. 2, 539–551.[MR]
  155. Éric Schost, Complexity results for triangular sets, J. Symbolic Comput. 36 (2003), no. 3-4, 555–594.[MR]
  156. Éric Schost, Computing parametric geometric resolutions, Appl. Algebra Engrg. Comm. Comput. 13 (2003), no. 5, 349–393.[MR]
  157. Ákos Seress, Permutation Group Algorithms, Cambridge Tracts in Mathematics, vol. 152, Cambridge University Press, Cambridge, 2003, pp. x+264.[MR]
  158. T. Shaska, Computational aspects of hyperelliptic curves, Computer Mathematics, Lecture Notes Ser. Comput., vol. 10, World Sci. Publishing, River Edge, NJ, 2003, pp. 248–257.[MR]
  159. Tanush Shaska, Computational algebra and algebraic curves, Comm. Comp. Alg. 37 (2003), no. 4, 117–124.[link]
  160. Tanush Shaska, Determining the automorphism group of a hyperelliptic curve, in Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2003, pp. 248–254 (electronic).[MR]
  161. Samir Siksek and John E. Cremona, On the Diophantine equation x2+7=ym, Acta Arith. 109 (2003), no. 2, 143–149.[MR]
  162. N. P. Smart, Attacks on asymmetric cryptosystems: An analysis of Goubin's refined power analysis attack, Cryptographic Hardware and Embedded Systems, Lecture Notes in Comput. Sci., vol. 2779, Springer, Berlin, 2003, pp. 281-290.
  163. Blair K. Spearman, Kenneth S. Williams, and Qiduan Yang, The 2-power degree subfields of the splitting fields of polynomials with Frobenius Galois groups, Comm. Algebra 31 (2003), no. 10, 4745–4763.[MR]
  164. Nicolas M. Thiéry, Computing minimal generating sets of invariant rings of permutation groups with SAGBI-Gröbner basis, in Discrete Mathematics and Theoretical Computer Science: 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003: Proceedings, Lecture Notes in Computer Science, vol. 2731, Springer, Berlin, 2003, pp. 315–328.
  165. Felix Ulmer, Liouvillian solutions of third order differential equations, J. Symbolic Comput. 36 (2003), no. 6, 855–889.[MR]
  166. Steven R. Weller and Sarah J. Johnson, Regular low-density parity-check codes from oval designs, European Transactions on Telecommunications 14 (2003), no. 5, 399-409.
  167. Reza Zomorrodian, On a theorem of supersoluble automorphism groups, Proc. Amer. Math. Soc. 131 (2003), no. 9, 2711–2713 (electronic).[MR]

2004

  1. I. Abdeljaouad-Tej, S. Orange, G. Renault, and A. Valibouze, Computation of the decomposition group of a triangular ideal, Appl. Algebra Engrg. Comm. Comput. 15 (2004), no. 3-4, 279–294.[MR]
  2. Fatima Abu Salem, Shuhong Gao, and Alan G. B. Lauder, Factoring polynomials via polytopes, ISSAC 2004, ACM, New York, 2004, pp. 4–11.[MR]
  3. Alejandro Adem, James F. Davis, and Özgün Ünlü, Fixity and free group actions on products of spheres, Comment. Math. Helv. 79 (2004), no. 4, 758–778.[MR/arXiv]
  4. Bill Allombert, An efficient algorithm for the computation of Galois automorphisms, Math. Comp. 73 (2004), no. 245, 359–375 (electronic).[MR]
  5. Jianbei An and E. A. O'Brien, The Alperin and Dade conjectures for the Conway simple group Co1, Algebr. Represent. Theory 7 (2004), no. 2, 139–158.[MR]
  6. Jianbei An and R. A. Wilson, The Alperin weight conjecture and Uno's conjecture for the Baby Monster B, p odd, LMS J. Comput. Math. 7 (2004), 120–166 (electronic).[MR]
  7. Makoto Araya and Masaaki Harada, MDS codes over F9 related to the ternary Golay code, Discrete Math. 282 (2004), no. 1-3, 233–237.[MR]
  8. Makoto Araya, Masaaki Harada, and Hadi Kharaghani, Some Hadamard matrices of order 32 and their binary codes, J. Combin. Des. 12 (2004), no. 2, 142–146.[MR]
  9. S. Arita, S. Miura, and T. Sekiguchi, An addition algorithm on the Jacobian varieties of curves, J. Ramanujan Math. Soc. 19 (2004), no. 4, 235–251.[MR]
  10. Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, and Makoto Sugita, Comparison between XL and Gröbner basis algorithms, Advances in Cryptology—Asiacrypt 2004, Lecture Notes in Comput. Sci., vol. 3329, Springer, Berlin, 2004, pp. 338–353.[MR]
  11. László Babai and Igor Pak, Strong bias of group generators: An obstacle to the "product replacement algorithm", J. Algorithms 50 (2004), no. 2, 215–231.[MR]
  12. Christine Bachoc and Philippe Gaborit, Designs and self-dual codes with long shadows, J. Combin. Theory Ser. A 105 (2004), no. 1, 15–34.[MR]
  13. Laura Bader, Christine M. O'Keefe, and Tim Penttila, Some remarks on flocks, J. Aust. Math. Soc. 76 (2004), no. 3, 329–343.[MR]
  14. R. D. Baker and K. L. Wantz, Unitals in the code of the Hughes plane, J. Combin. Des. 12 (2004), no. 1, 35–38.[MR]
  15. Eiichi Bannai, Osamu Shimabukuro, and Hajime Tanaka, Finite analogues of non-Euclidean spaces and Ramanujan graphs, European J. Combin. 25 (2004), no. 2, 243–259.[MR]
  16. Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, and Nicolas Gürel, Implementing the arithmetic of C3,4 curves, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 87–101.[MR]
  17. C. Bates, D. Bundy, Sarah B. Perkins, and P. Rowley, Commuting involution graphs in special linear groups, Comm. Algebra 32 (2004), no. 11, 4179–4196.[MR]
  18. Chris Bates and Peter Rowley, Involutions in Conway's largest simple group, LMS J. Comput. Math. 7 (2004), 337–351 (electronic).[MR]
  19. Gilbert Baumslag, Sean Cleary, and George Havas, Experimenting with infinite groups. I, Experiment. Math. 13 (2004), no. 4, 495–502.[MR]
  20. Michael J. Beeson, The mechanization of mathematics, Alan Turing: Life and Legacy of a Great Thinker, Springer, Berlin, 2004, pp. 77–134.[MR]
  21. Michael A. Bennett, Kálmán Győry, and Ákos Pintér, On the Diophantine equation 1k+2k+.s+xk=yn, Compos. Math. 140 (2004), no. 6, 1417–1431.[MR]
  22. Dave Benson, Dickson invariants, regularity and computation in group cohomology, Illinois J. Math. 48 (2004), no. 1, 171–197.[MR/link]
  23. Manjul Bhargava, Higher composition laws I: A new view on Gauss composition, and quadratic generalizations, Ann. of Math. (2) 159 (2004), no. 1, 217–250.[MR]
  24. Jonathan Borwein and David Bailey, Mathematics by Experiment, A K Peters Ltd., Natick, MA, 2004, pp. x+288.[MR]
  25. A. Bostan, G. Lecerf, B. Salvy, É. Schost, and B. Wiebelt, Complexity issues in bivariate polynomial factorization, in ISSAC '04: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 2004, pp. 42–49.[doi]
  26. Alin Bostan, Pierrick Gaudry, and Éric Schost, Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves, Finite Fields and Applications, Lecture Notes in Comput. Sci., vol. 2948, Springer, Berlin, 2004, pp. 40–58.[MR]
  27. Mireille Boutin and Gregor Kemper, On reconstructing n-point configurations from the distribution of distances or areas, Adv. in Appl. Math. 32 (2004), no. 4, 709–735.[MR]
  28. Iliya Bouyukliev, Markus Grassl, and Zlatko Varbanov, New bounds for n4(k,d) and classification of some optimal codes over GF(4), Discrete Math. 281 (2004), no. 1-3, 43–66.[MR]
  29. John M. Boyer and Wendy J. Myrvold, On the cutting edge: Simplified O(n) planarity by edge addition, J. Graph Algorithms Appl. 8 (2004), no. 3, 241–273 (electronic).[MR]
  30. An Braeken, Christopher Wolf, and Bart Preneel, Classification of highly nonlinear Boolean power functions with a randomised algorithm for checking normality, IACR (2004), 17 pages.[eprint]
  31. John N. Bray and Robert T. Curtis, Double coset enumeration of symmetrically generated groups, J. Group Theory 7 (2004), no. 2, 167–185.[MR]
  32. A. Bremner and N. Tzanakis, Lucas sequences whose 12th or 9th term is a square, J. Number Theory 107 (2004), no. 2, 215–227.[MR]
  33. A. Bremner and N. Tzanakis, Lucas sequences whose 8th term is a square, preprint (2004), 44 pages.[arXiv]
  34. Richard P. Brent, Note on Marsaglia's xorshift random number generators, J. Stat. Soft 11 (2004), no. 5, 1-5.
  35. A. Brown, A. B. McCoy, B. J. Braams, Z. Jin, and J. M. Bowman, Quantum and classical studies of vibrational motion of CH5+ on a global potential energy surface obtained from a novel ab initio direct dynamics approach, J. Chem. Phys. 121 (2004), 4105-4116.
  36. Nils Bruin, Visualising Sha[2] in abelian surfaces, Math. Comp. 73 (2004), no. 247, 1459–1476 (electronic).[MR]
  37. Johannes Buchmann, Carlos Coronado, Martin Döring, Daniela Engelbert, Christoph Ludwig, Raphael Overbeck, Arthur Schmidt, Ulrich Vollmer, and Ralf-Philipp Weinmann, Post-quantum signatures, Cryptology E-print Archive (2004), no. 2004/297.
  38. Yann Bugeaud, Maurice Mignotte, and Samir Siksek, Sur les nombres de Fibonacci de la forme qkyp, C. R. Math. Acad. Sci. Paris 339 (2004), no. 5, 327–330.[MR]
  39. Kevin Buzzard and Frank Calegari, A counterexample to the Gouvêa-Mazur conjecture, C. R. Math. Acad. Sci. Paris 338 (2004), no. 10, 751–753.[MR]
  40. J. S. Calcut, Torelli Actions and Smooth Structures on 4-manifolds, PhD Thesis, University of Maryland, 2004.
  41. J. S. Calcut and H. E. Winkelnkemper, Artin presentations of complex surfaces, Bol. Soc. Mat. Mexicana (3) 10 (2004), 63–87.[MR/link]
  42. Frank Calegari and William A. Stein, Conjectures about discriminants of Hecke algebras of prime level, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 140–152.[MR]
  43. Colin M. Campbell, George Havas, Colin Ramsay, and Edmund F. Robertson, Nice efficient presentations for all small simple groups and their covers, LMS J. Comput. Math. 7 (2004), 266–283 (electronic).[MR]
  44. John J. Cannon, Bettina Eick, and Charles R. Leedham-Green, Special polycyclic generating sequences for finite soluble groups, J. Symbolic Comput. 38 (2004), no. 5, 1445–1460.[MR]
  45. John Cannon and Derek F. Holt, Computing maximal subgroups of finite groups, J. Symbolic Comput. 37 (2004), no. 5, 589–609.[MR]
  46. Olga Caprotti, James H. Davenport, Mike Dewar, and Julian Padget, Mathematics on the (Semantic) NET, The Semantic Web: Research and Applications, Lecture Notes in Comput. Sci., vol. 3053, 2004, pp. 213–224.
  47. I. Cardinali, N. Durante, T. Penttila, and R. Trombetti, Bruen chains over fields of small order, Discrete Math. 282 (2004), no. 1-3, 245–247.[MR]
  48. Jon F. Carlson and Jacques Thévenaz, The classification of endo-trivial modules, Invent. Math. 158 (2004), no. 2, 389–411.[MR]
  49. Denis Xavier Charles, Complex multiplication tests for elliptic curves, preprint (2004), 13 pages.[arXiv]
  50. Imin Chen and Chris Cummins, Elliptic curves with nonsplit mod 11 representations, Math. Comp. 73 (2004), no. 246, 869–880 (electronic).[MR]
  51. C. Cid, S. Murphy, and M. Robshaw, Computational and algebraic aspects of the advanced encryption standard, in Seventh International Workshop on Computer Algebra in Scientific Computing, CASC 2004, St. Petersburg, Russia, 2004, pp. 93-103.
  52. Mihai Cipu, Dickson polynomials that are permutations, Serdica Math. J. 30 (2004), no. 2-3, 177–194.[MR]
  53. Arjeh M. Cohen, Scott H. Murray, and D. E. Taylor, Computing in groups of Lie type, Math. Comp. 73 (2004), no. 247, 1477–1498 (electronic).[MR]
  54. Robert F. Coleman and William A. Stein, Approximation of eigenforms of infinite slope by eigenforms of finite slope, Geometric Aspects of Dwork Theory. Vol. I, II, Walter de Gruyter GmbH &Co. KG, Berlin, 2004, pp. 437–449.[MR]
  55. Marston Conder and I. M. Isaacs, Derived subgroups of products of an abelian and a cyclic subgroup, J. London Math. Soc. (2) 69 (2004), no. 2, 333–348.[MR]
  56. Marston Conder and Arkadii Slinko, A counterexample to Fishburn's conjecture on finite linear qualitative probability, J. Math. Psych. 48 (2004), no. 6, 425–431.[MR]
  57. Scott Contini and Yiqun Lisa Yin, Fast software-based attacks on SecurID, in Fast Software Encryption, Lecture Notes in Computer Science, vol. 3017, Springer-Verlag, Berlin, 2004, pp. 454–471.
  58. Robert S. Coulter, George Havas, and Marie Henderson, On decomposition of sub-linearised polynomials, J. Aust. Math. Soc. 76 (2004), no. 3, 317–328.[MR/doi]
  59. C. J. Cummins, Congruence subgroups of groups commensurable with PSL(2,Z) of genus 0 and 1, Experiment. Math. 13 (2004), no. 3, 361–382.[MR]
  60. Mieczysław K. Dąbkowski and Józef H. Przytycki, Unexpected connections between Burnside groups and knot theory, Proc. Natl. Acad. Sci. USA 101 (2004), no. 50, 17357–17360 (electronic).[MR]
  61. Xavier Charles Denis, Complex multiplication tests for elliptic curves, Preprint (2004), 13 pages.
  62. Tobias Dern and Aloys Krieg, The graded ring of Hermitian modular forms of degree 2 over Q(√-2), J. Number Theory 107 (2004), no. 2, 241–265.[MR]
  63. Anne Desideri Bracco, Treillis de codes quasi-cycliques, European J. Combin. 25 (2004), no. 4, 505–516.[MR]
  64. Luis V. Dieulefait, Computing the level of a modular rigid Calabi-Yau threefold, Exp. Math 13 (2004), no. 2, 165-169.
  65. Steven T. Dougherty, Masaaki Harada, and Manabu Oura, Note on the biweight enumerators of self-dual codes over Zk, Preprint (2004), 11 pages.
  66. Jean-Guillaume Dumas, Pascal Giorgi, and Clément Pernet, FFPACK: finite field linear algebra package, ISSAC '2004: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2004, pp. 119–126.[MR]
  67. G. L. Ebert, Quasimultiples of geometric designs, Discrete Math. 284 (2004), no. 1-3, 123–129.[MR]
  68. Bettina Eick and Delaram Kahrobaei, Polycyclic groups: a new platform for cryptology?, preprint (2004), 47 pages.[arXiv]
  69. Kirsten Eisenträger and Kristin Lauter, Computing Igusa class polynomials via the chinese remainder theory, preprint (2004).[arXiv]
  70. Noam D. Elkies and Mark Watkins, Elliptic curves of large rank and small conductor, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 42–56.[MR]
  71. Nicholas Eriksson, Toric ideals of homogeneous phylogenetic models, ISSAC 2004, ACM, New York, 2004, pp. 149–154.[MR/arXiv]
  72. H. Evangelaras and C. Koukouvinos, Combined arrays with minimum number of runs and maximum estimation efficiency, Comm. Statist. Theory Methods 33 (2004), no. 7, 1621–1628.[MR/doi]
  73. Brent Everitt, 3-manifolds from Platonic solids, Topology Appl. 138 (2004), no. 1-3, 253–263.[MR]
  74. Pilar Fernandez-Ferreiros and M. Angeles Gomez-Molleda, Deciding the nilpotency of the Galois group by computing elements in the centre, Math. Comp. 73 (2004), no. 248, 2043–2060 (electronic).[MR]
  75. Claus Fieker, Minimizing representations over number fields, J. Symbolic Comput. 38 (2004), no. 1, 833–842.[MR]
  76. Luís R. A. Finotti, Minimal degree liftings of hyperelliptic curves, J. Math. Sci. Univ. Tokyo 11 (2004), no. 1, 1–47.[MR]
  77. Tom Fisher, Genus one curves defined by Pfaffians, preprint (2004), 24 pages.
  78. D. L. Flannery, Irreducible monomial linear groups of degree four over finite fields, Internat. J. Algebra Comput. 14 (2004), no. 3, 253–294.[MR]
  79. E. V. Flynn, The Hasse principle and the Brauer-Manin obstruction for curves, Manuscripta Math. 115 (2004), no. 4, 437–466.[MR]
  80. Philippe Gaborit, Construction of new extremal unimodular lattices, European J. Combin. 25 (2004), no. 4, 549–564.[MR]
  81. Philippe Gaborit, Carmen-Simona Nedeloaia, and Alfred Wassermann, Weight enumerators of duadic and quadratic residue codes, in IEEE International Symposium on Information Theory (ISIT), Chicago, USA, 2004.
  82. Maya Gailly and Dimitri Leemans, The residually weakly primitive geometries of PSL(3,q) with q < 8, Aequationes Math. 67 (2004), no. 1-2, 195–196.[MR]
  83. Greg Gamble, Barbara M. Macnhaut, Jennifer Seberry, and Anne Penfold Street, Further results on strongbox secured secret sharing schemes, Util. Math. 66 (2004), 165–193.[MR]
  84. Karin Gatermann and Pablo A. Parrilo, Symmetry groups, semidefinite programs, and sums of squares, J. Pure Appl. Algebra 192 (2004), no. 1-3, 95–128.[MR]
  85. Pierrick Gaudry, Index calculus for abelian varieties and the elliptic curve discrete logarithm problem, Preprint (2004), 13 pages.
  86. Pierrick Gaudry and Éric Schost, A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 208–222.[MR]
  87. Pierrick Gaudry and Éric Schost, Construction of secure random curves of genus 2 over prime fields, Advances in Cryptology—EuroCrypt 2004, Lecture Notes in Comput. Sci., vol. 3027, Springer, Berlin, 2004, pp. 239–256.[MR]
  88. Willi Geiselmann and Rainer Steinwandt, Yet another sieving device, Topics in Cryptology—CT-RSA 2004, Lecture Notes in Comput. Sci., vol. 2964, Springer, Berlin, 2004, pp. 278–291.[MR]
  89. S. Georgiou, C. Koukouvinos, and S. Stylianou, Construction of new skew Hadamard matrices and their use in screening experiments, Comput. Statist. Data Anal. 45 (2004), no. 3, 423–429.[MR]
  90. Jaume Giné and Xavier Santallusia, Implementation of a new algorithm of computation of the Poincaré-Liapunov constants, J. Comput. Appl. Math. 166 (2004), no. 2, 465–476.[MR]
  91. Edray Goins, Explicit descent via 4-isogeny on an elliptic curve, preprint (2004), 20 pages.[arXiv]
  92. Edray Goins, On the modularity of wildly ramified Galois representations, preprint (2004), 31 pages.[arXiv]
  93. M. Grassl, Thomas Beth, and M. Rötteler, On optimal quantum codes, International Journal of Quantum Information 2 (2004), no. 1, 55-64.
  94. M. Grassl and G. White, New good linear codes by special puncturings, International Symposium on Information Theory, 2004. ISIT 2004 (2004), 454-.
  95. Markus Grassl, On SIC-POVMs and MUBs in dimension 6, preprint (2004), 8 pages.[arXiv]
  96. M. Greferath, M. O'Sullivan, and R. Smarandache, Construction of good LDPC codes using dilation matrices, in Proc. IEEE Intern. Symp. on Inform. Theory, 2004.
  97. Benedict H. Gross and Gabriele Nebe, Globally maximal arithmetic groups, J. Algebra 272 (2004), no. 2, 625–642.[MR]
  98. T. Aaron Gulliver and Jon-Lark Kim, Circulant based extremal additive self-dual codes over GF(4), IEEE Trans. Inform. Theory 50 (2004), no. 2, 359–366.[MR]
  99. Paul R. Hafner, Geometric realisation of the graphs of McKay-Miller-Širáň, J. Combin. Theory Ser. B 90 (2004), no. 2, 223–232.[MR]
  100. Paul R. Hafner, On the graphs of Hoffman-Singleton and Higman-Sims, Electron. J. Combin. 11 (2004), no. 1, Research Paper 77, 33 pp. (electronic).[MR]
  101. Jonathan Hanke, Local densities and explicit bounds for representability by a quadratric form, Duke Math. J. 124 (2004), no. 2, 351–388.[MR]
  102. Johan P. Hansen, Toric surfaces and codes, techniques and examples, Preprint Series No.1., University of Aarhus, Department of Mathematics, Aarhus, Denmark (2004), 12 pages.
  103. Masaaki Harada, Michio Ozeki, and Kenichiro Tanabe, On the covering radius of ternary extremal self-dual codes, Des. Codes Cryptogr. 33 (2004), no. 2, 149–158.[MR]
  104. Michael I. Hartley and Dimitri Leemans, Quotients of a universal locally projective polytope of type {5,3,5}, Math. Z. 247 (2004), no. 4, 663–674.[MR]
  105. Ki-ichiro Hashimoto, Katsuya Miyake, and Hiroaki Nakamura (eds.), Galois Theory and Modular Forms, in Proceedings of the International Conference held at Tokyo Metropolitan University, Tokyo, September 25–29, 2001, Developments in Mathematics, vol. 11, Kluwer Academic Publishers, Boston, MA, 2004, pp. xii+393.[MR]
  106. George Havas, M. F. Newman, and E. A. O'Brien, On the efficiency of some finite groups, Comm. Algebra 32 (2004), no. 2, 649–656.[MR]
  107. Lenwood S. Heath and Nicholas A. Loehr, New algorithms for generating Conway polynomials over finite fields, J. Symbolic Comput. 38 (2004), no. 2, 1003–1024.[MR]
  108. Boris Hemkemeier, Algorithmische konstruktionen von gittern, preprint (2004), 64 pages.[arXiv]
  109. E. Herrmann, I. Járási, and A. Pethő, Note on: "The Diophantine equation xn=Dy2 + 1" by J. H. E. Cohn, Acta Arith. 113 (2004), no. 1, 69–76.[MR]
  110. E. Herrmann, F. Luca, and P. G. Walsh, A note on the Ramanujan-Nagell equation, Publ. Math. Debrecen 64 (2004), no. 1-2, 21–30.[MR]
  111. F. Hess, An algorithm for computing isomorphisms of algebraic function fields, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 263–271.[MR]
  112. Florian Hess, A note on the Tate pairing of curves over finite fields, Arch. Math. (Basel) 82 (2004), no. 1, 28–32.[MR]
  113. Gerhard Hiss, Hermitian function fields, classical unitals, and representations of 3-dimensional unitary groups, Indag. Math. (N.S.) 15 (2004), no. 2, 223–243.[MR]
  114. Florent Hivert and Nicolas M. Thiéry, MuPAD-Combinat, an open-source package for research in algebraic combinatorics, Sém. Lothar. Combin. 51 (2004/05), Art. B51z, 70 pp. (electronic).[MR]
  115. P. E. Holmes, On minimal factorisations of sporadic groups, Experiment. Math. 13 (2004), no. 4, 435–440.[MR]
  116. Stephen P. Humphries, Finite Hurwitz braid group actions for Artin groups, Israel J. Math. 143 (2004), 189–222.[MR]
  117. Pascale Jacobs and Dimitri Leemans, An algorithmic analysis of the intersection property, LMS J. Comput. Math. 7 (2004), 284–299 (electronic).[MR]
  118. Gabriela Jeronimo, Teresa Krick, Juan Sabia, and Martín Sombra, The computational complexity of the Chow form, Found. Comput. Math. 4 (2004), no. 1, 41–117.[MR]
  119. Antoine Joux and Frédéric Muller, A chosen IV attack against Turing, Selected Areas in Cryptography, Lecture Notes in Comput. Sci., vol. 3006, Springer, Berlin, 2004, pp. 194–207.[MR]
  120. David Joyner, Toric codes over finite fields, Appl. Algebra Engrg. Comm. Comput. 15 (2004), no. 1, 63–79.[MR]
  121. David Joyner, Richard Kreminski, and Joann Turisco, Applied abstract algebra, Johns Hopkins University Press, Baltimore, MD, 2004, pp. xii+329.[MR]
  122. David Joyner and Salahoddin Shokranian, Remarks on codes from modular curves: magma application, preprint (2004), 29 pages.[arXiv]
  123. D. B. Karagueuzian and P. Symonds, The module structure of a group action on a polynomial ring: Examples, generalizations, and applications, Invariant Theory in all Characteristics, CRM Proc. Lecture Notes, vol. 35, Amer. Math. Soc., Providence, RI, 2004, pp. 139–158.[MR/link]
  124. Kiran S. Kedlaya, Computing zeta functions via p-adic cohomology, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 1–17.[MR]
  125. Peter Keevash and Benny Sudakov, Packing triangles in a graph and its complement, J. Graph Theory 47 (2004), no. 3, 203–216.[MR]
  126. J. D. Key, J. Moori, and B. G. Rodrigues, Binary codes from graphs on triples, Discrete Math. 282 (2004), no. 1-3, 171–182.[MR]
  127. J. D. Key, J. Moori, and B. G. Rodrigues, Permutation decoding for the binary codes from triangular graphs, European J. Combin. 25 (2004), no. 1, 113–123.[MR]
  128. L. J. P. Kilford, Slopes of 2-adic overconvergent modular forms with small level, Math. Res. Lett. 11 (2004), no. 5-6, 723–739.[MR]
  129. Jon-Lark Kim and Yoonjin Lee, Euclidean and Hermitian self-dual MDS codes over large finite fields, J. Combin. Theory Ser. A 105 (2004), no. 1, 79–95.[MR]
  130. Jon-Lark Kim, Uri N. Peled, Irina Perepelitsa, Vera Pless, and Shmuel Friedland, Explicit construction of families of LDPC codes with no 4-cycles, IEEE Trans. Inform. Theory 50 (2004), no. 10, 2378–2388.[MR]
  131. A. Klappenecker and M. Rötteler, Remarks on Clifford codes, Quantum Information and Computation 4 (2004), no. 2, 152-160.
  132. Andreas Klappenecker and Martin Rötteler, On the structure of nonstabilizer Clifford codes, Quantum Inf. Comput. 4 (2004), no. 2, 152–160.[MR]
  133. Jürgen Klüners and Gunter Malle, Counting nilpotent Galois extensions, J. Reine Angew. Math. 572 (2004), 1–26.[MR]
  134. I. S. Kotsireas and K. Karamanos, Exact computation of the bifurcation point B4 of the logistic map and the Bailey-Broadhurst conjectures, Internat. J. Bifur. Chaos Appl. Sci. Engrg. 14 (2004), no. 7, 2417–2423.[MR]
  135. Andrew Kresch and Yuri Tschinkel, On the arithmetic of del Pezzo surfaces of degree 2, Proc. London Math. Soc. (3) 89 (2004), no. 3, 545–569.[MR]
  136. Teresa Krick, Straight-line programs in polynomial equation solving, Foundations of Computational Mathematics: Minneapolis, 2002, London Math. Soc. Lecture Note Ser., vol. 312, Cambridge Univ. Press, Cambridge, 2004, pp. 96–136.[MR]
  137. L. Kulesz, G. Matera, and É. Schost, Uniform bounds on the number of rational points of a family of curves of genus 2, J. Number Theory 108 (2004), no. 2, 241–267.[MR]
  138. Matthias Künzer, On representations of twisted group rings, J. Group Theory 7 (2004), no. 2, 197–229.[MR/link]
  139. Alan G. B. Lauder, Counting solutions to equations in many variables over finite fields, Found. Comput. Math. 4 (2004), no. 3, 221–267.[MR]
  140. Maska Law and Tim Penttila, Construction of BLT-sets over small fields, European J. Combin. 25 (2004), no. 1, 1–22.[MR]
  141. Dimitri Leemans, Constructions of rank five geometries for the Mathieu group M22, J. Geom. 79 (2004), no. 1-2, 146–155.[MR]
  142. Dimitri Leemans, The residually weakly primitive geometries of J3, Experiment. Math. 13 (2004), no. 4, 429–433.[MR]
  143. Dimitri Leemans, The residually weakly primitive geometries of M23, Atti Semin. Mat. Fis. Univ. Modena Reggio Emilia 52 (2004), no. 2, 313–316 (2005).[MR]
  144. F. Leprévost, M. Pohst, and A. Schöpp, Rational torsion of J0(N) for hyperelliptic modular curves and families of Jacobians of genus 2 and genus 3 curves with a rational point of order 5, 7 or 10, Abh. Math. Sem. Univ. Hamburg 74 (2004), 193–203.[MR]
  145. Françoise Levy-dit-Vehel and Ludovic Perret, A Polly Cracker system based on satisfiability, Coding, cryptography and combinatorics, Progr. Comput. Sci. Appl. Logic, vol. 23, Birkhäuser, Basel, 2004, pp. 177–192.[MR]
  146. Cai Heng Li, Zai Ping Lu, and Dragan Marušič, On primitive permutation groups with small suborbits and their orbital graphs, J. Algebra 279 (2004), no. 2, 749–770.[MR]
  147. Tian Khoon Lim, Edge-transitive homogeneous factorisations of complete graphs, preprint (2004), 130 pages.[arXiv]
  148. San Ling and Chaoping Xing, Polyadic codes revisited, IEEE Trans. Inform. Theory 50 (2004), no. 1, 200–207.[MR]
  149. Christopher Macmeikan, Toral arrangements, The COE Seminar on Mathematical Sciences 2004, Sem. Math. Sci., vol. 31, Keio Univ., Yokohama, 2004, pp. 37–54.[MR]
  150. Aleksander Malnič, Dragan Marušič, and Primož Potočnik, Elementary abelian covers of graphs, J. Algebraic Combin. 20 (2004), no. 1, 71–97.[MR]
  151. Aleksander Malnič, Dragan Marušič, and Primož Potočnik, On cubic graphs admitting an edge-transitive solvable group, J. Algebraic Combin. 20 (2004), no. 1, 99–113.[MR]
  152. Stefano Marcugini, Alfredo Milani, and Fernanda Pambianco, Classification of the (n,3)-arcs in PG(2,7), J. Geom. 80 (2004), no. 1-2, 179–184.[MR]
  153. Graham Matthews, Computing Generators and Relations for Matrix Algebras, PhD Thesis, University of Georgia, 2004.
  154. Keith E. Mellinger, Designs, Geometry, and a Golfer's Dilemma, Math. Mag. 77 (2004), no. 4, 275–282.[MR]
  155. Keith E. Mellinger, LDPC codes from triangle-free line sets, Des. Codes Cryptogr. 32 (2004), no. 1-3, 341–350.[MR]
  156. Michael Monagan, Maximal quotient rational reconstruction: An almost optimal algorithm for rational reconstruction, ISSAC 2004, ACM, New York, 2004, pp. 243–249.[MR]
  157. Meinard Müller and Michael Clausen, DFT-based word normalization in finite supersolvable groups, Appl. Algebra Engrg. Comm. Comput. 15 (2004), no. 3-4, 213–231.[MR/doi]
  158. Siguna Müller, On the computation of square roots in finite fields, Des. Codes Cryptogr. 31 (2004), no. 3, 301–312.[MR]
  159. Akihiro Munemasa and Vladimir D. Tonchev, A new quasi-symmetric 2-(56,16,6) design obtained from codes, Discrete Math. 284 (2004), no. 1-3, 231–234.[MR]
  160. A. Muzereau, N. P. Smart, and F. Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math. 7 (2004), 50–72 (electronic).[MR]
  161. Gabriele Nebe, Strongly modular lattices with long shadow, J. Théor. Nombres Bordeaux 16 (2004), no. 1, 187–196.[MR]
  162. M. F. Newman, E. A. O'Brien, and M. R. Vaughan-Lee, Groups and nilpotent Lie rings whose order is the sixth power of a prime, J. Algebra 278 (2004), no. 1, 383–401.[MR]
  163. Virginia Niculescu, OOLACA: An object oriented library for abstract and computational algebra, in OOPSLA '04: Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications, ACM Press, New York, NY, USA, 2004, pp. 160–161.[doi]
  164. Annika Niehage, Quantum Goppa codes over hypereliptic curves, Master's Thesis, Universität Mannheim, 2004.
  165. Ken Ono, The Web of Modularity: Arithmetic of the Coefficients of Modular Forms and q-series, CBMS Regional Conference Series in Mathematics, vol. 102, Published for the Conference Board of the Mathematical Sciences, Washington, DC, 2004, pp. viii+216.[MR]
  166. Tae-Jun Park, Mun-Kyu Lee, and Kunsoo Park, Efficient scalar multiplication in hyperelliptic curves using a new Frobenius expansion, ICISC 2003: Information Security and Cryptology, Lecture Notes in Comput. Sci., vol. 2971, Springer, Berlin, 2004, pp. 152–165.[MR]
  167. Sebastian Pauli and Florence Soriano-Gafiuk, The discrete logarithm in logarithmic l-class groups and its applications in K-theory, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 367–378.[MR]
  168. Sarah B. Perkins and Peter J. Rowley, On negative orbits of finite Coxeter groups, J. Algebraic Combin. 20 (2004), no. 1, 17–31.[MR]
  169. Titus Piezas, Solving solvable sextics using polynomial decomposition, Preprint (2004), 22 pages.
  170. Joseph M. Renes, Robin Blume-Kohout, A. J. Scott, and Carlton M. Caves, Symmetric informationally complete quantum measurements, J. Math. Phys. 45 (2004), no. 6, 2171–2180.[MR]
  171. Christophe Ritzenthaler, Point counting on genus 3 non hyperelliptic curves, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 379–394.[MR]
  172. Xavier-François Roblot, Polynomial factorization algorithms over number fields, J. Symbolic Comput. 38 (2004), no. 5, 1429–1443.[MR]
  173. Colva M. Roney-Dougal, Conjugacy of subgroups of the general linear group, Experiment. Math. 13 (2004), no. 2, 151–163.[MR]
  174. M. Rötteler, M. Grassl, and Thomas Beth, On quantum MDS codes, in IEEE International Symposium on Information Theory – Proceedings, 2004, pp. 355.
  175. Mohab Safey El Din and Éric Schost, Properness defects of projections and computation of at least one point in each connected component of a real algebraic set, Discrete Comput. Geom. 32 (2004), no. 3, 417–430.[MR]
  176. J. Sándor and B. Crstici, Handbook of Number Theory II, Kluwer Academic Publishers, Dordrecht, 2004, pp. ii+637.[MR]
  177. Edward F. Schaefer and Michael Stoll, How to do a p-descent on an elliptic curve, Trans. Amer. Math. Soc. 356 (2004), no. 3, 1209–1231 (electronic).[MR]
  178. Jasper Scholten, Weil restriction of an elliptic curve over a quadratic extension, Preprint (2004), 6 pages.
  179. A. J. M. Segers, Algebraic Attacks from a Gröbner Basis Perspective, PhD Thesis, Technische Universiteit Eindhoven, 2004.
  180. R. J. Shank, Classical covariants and modular invariants, Invariant Theory in all Characteristics, CRM Proc. Lecture Notes, vol. 35, Amer. Math. Soc., Providence, RI, 2004, pp. 241–249.[MR]
  181. Marcus Palmer da Silva, Erasure thresholds for efficient linear optics quantum computation, Master's Thesis, University of Waterloo, 2004.
  182. Bart de Smit, On arithmetically equivalent fields with distinct p-class numbers, J. Algebra 272 (2004), no. 2, 417–424.[MR]
  183. Leonard H. Soicher, Computing with graphs and groups, Topics in algebraic graph theory, Encyclopedia of Mathematics and its Applications, vol. 102, Cambridge University Press, Cambridge, 2004, pp. 250–266.[MR]
  184. Damien Stehlé and Paul Zimmermann, A binary recursive GCD algorithm, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 411–425.[MR]
  185. William A. Stein, Shafarevich-Tate groups of nonsquare order, Modular curves and abelian varieties, Progr. Math., vol. 224, Birkhäuser, Basel, 2004, pp. 277–289.[MR]
  186. John R. Stembridge, Explicit matrices for irreducible representations of Weyl groups, Represent. Theory 8 (2004), 267–289 (electronic).[MR]
  187. Kozo Sugiyama, Seok-Hee Hong, and Atsuhiko Maeda, The puzzle layout problem, in Graph Drawing, Perugia, 2003, Springer, 2004, pp. 500-501.
  188. Kaori Suzuki, On Fano indices of Q-Fano 3-folds, Manuscripta Math. 114 (2004), no. 2, 229–246.[MR]
  189. R. Michael Tanner, Deepak Sridhara, Arvind Sridharan, Thomas E. Fuja, and Daniel J. Costello, Jr., LDPC block and convolutional codes based on circulant matrices, IEEE Trans. Inform. Theory 50 (2004), no. 12, 2966–2984.[MR]
  190. Szabolcs Tengely, On the Diophantine equation x2+a2=2yp, Indag. Math. (N.S.) 15 (2004), no. 2, 291–304.[MR]
  191. Edlyn Teske, An elliptic curve trapdoor system (extended abstract), High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, Fields Inst. Commun., vol. 41, Amer. Math. Soc., Providence, RI, 2004, pp. 341–352.[MR]
  192. Eric R. Verheul, Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, J. Cryptology 17 (2004), no. 4, 277–296.[MR]
  193. H. A. Verrill, Sums of squares of binomial coefficients, with applications to Picard-Fuchs equations, preprint (2004), 20 pages.[arXiv]
  194. M. Vsemirnov, Hurwitz groups of intermediate rank, LMS J. Comput. Math. 7 (2004), 300–336 (electronic).[MR]
  195. Annegret Weng, Generation of random Picard curves for cryptography, Preprint (2004), 7 pages.
  196. Gabor Wiese, Dihedral Galois representations and Katz modular forms, Doc. Math. 9 (2004), 123–133 (electronic).[MR]
  197. Stewart Wilcox, Complementation in the group of units of matrix rings, Bull. Austral. Math. Soc. 70 (2004), no. 2, 223–227.[MR]
  198. Tonghai Yang, Local densities of 2-adic quadratic forms, J. Number Theory 108 (2004), no. 2, 287–345.[MR]