1. Timothy G. Abbott, Kiran S. Kedlaya, and David Roe, Bounding Picard numbers of surfaces using p-adic cohomology, preprint (2006), 33 pages.[arXiv]
  2. Amod Agashe, Kenneth Ribet, and William A. Stein, The Manin constant, Pure Appl. Math. Q. 2 (2006), no. 2, 617–636.[MR]
  3. Seigo Arita, Kazuto Matsuo, Koh-ichi Nagao, and Mahoro Shimura, A Weil descent attack against elliptic curve cryptosystems over quartic extension fields, IEICE Trans. Fundamentals E89-A (2006), no. 5, 28.
  4. Henrik Bäärnhielm, Recognising the Ree groups in their natural representations, Preprint (2006), 22 pages.[link]
  5. Henrik Bäärnhielm, Recognising the Suzuki groups in their natural representations, J. Algebra 300 (2006), no. 1, 171–198.[MR]
  6. Henrik Bäärnhielm, Tensor decomposition of the Ree groups, Preprint (2006), 9 pages.[link]
  7. David H. Bailey, Jonathan M. Borwein, Vishaal Kapoor, and Eric W. Weisstein, Ten problems in experimental mathematics, Amer. Math. Monthly 113 (2006), no. 6, 481–509.[MR]
  8. R. A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, and Leonard H. Soicher, Designs on the web, Discrete Math. 306 (2006), no. 23, 3014–3027.[MR]
  9. Tatiana Bandman, Gert-Martin Greuel, Fritz Grunewald, Boris Kunyavskii, Gerhard Pfister, and Eugene Plotkin, Identities for finite solvable groups and equations in finite simple groups, Compos. Math. 142 (2006), no. 3, 734–764.[MR]
  10. Eiichi Bannai and Etsuko Bannai, On Euclidean tight 4-designs, J. Math. Soc. Japan 58 (2006), no. 3, 775–804.[MR]
  11. Laurent Bartholdi, Benjamin Enriquez, Pavel Etingof, and Eric Rains, Groups and Lie algebras corresponding to the Yang-Baxter equations, J. Algebra 305 (2006), no. 2, 742–764.[MR/arXiv]
  12. Ingrid C. Bauer, Fabrizio Catanese, and Roberto Pignatelli, Complex surfaces of general type: Some recent progress, Global Aspects of Complex Geometry, Springer, Berlin, 2006, pp. 1–58.[MR]
  13. Ingrid C. Bauer, Fabrizio Catanese, and Roberto Pignatelli, The moduli space of surfaces with K2 = 6 and pg = 4, Math. Ann. 336 (2006), no. 2, 421–438.[MR]
  14. M. A. Bennett, N. Bruin, K. Győry, and L. Hajdu, Powers from products of consecutive terms in arithmetic progression, Proc. London Math. Soc. (3) 92 (2006), no. 2, 273–306.[MR]
  15. A. Bérczes, A. Pethő, and V. Ziegler, Parameterized norm form equations with arithmetic progressions, J. Symbolic Comput. 41 (2006), no. 7, 790–810.[MR]
  16. Attila Bérczes and Attila Pethő, Computational experiences on norm form equations with solutions forming arithmetic progressions, Glas. Mat. Ser. III 41(61) (2006), no. 1, 1–8.[MR]
  17. Thomas Beth, Jörn Müller-Quade, and Rainer Steinwandt, Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm, J. Symbolic Comput. 41 (2006), no. 3-4, 372–380.[MR]
  18. Daniel Bierbrauer, Codes auf hyperelliptischen und trigonalen kurven, PhD Thesis, Ruprecht-Karls-Universität Heidelberg, 2006.
  19. Werner Bley and Robert Boltje, Computation of locally free class groups, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 72–86.[MR/link]
  20. Jens-Matthias Bohli, Stefan Röhrich, and Rainer Steinwandt, Key substitution attacks revisited: Taking into account malicious signers, International Journal of Information Security 5 (2006), no. 1, 30–36.
  21. Wieb Bosma, Some computational experiments in number theory, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 1–30.[MR]
  22. Wieb Bosma and John Cannon (eds.), Discovering Mathematics with Magma, Algorithms and Computation in Mathematics, vol. 19, Springer-Verlag, Berlin, 2006, pp. xxiv+374.[MR]
  23. Wieb Bosma, Karma Dajani, and Cor Kraaikamp, Entropy quotients and correct digits in number-theoretic expansions, Dynamics and Stochastics, IMS Lecture Notes Monogr. Ser., vol. 48, Inst. Math. Statist., Beachwood, OH, 2006, pp. 176–188.[MR]
  24. Nigel Boston, Embedding 2-groups in groups generated by involutions, J. Algebra 300 (2006), no. 1, 73–76.[MR]
  25. Nigel Boston, Galois p-groups unramified at p—a survey, Primes and knots, Contemp. Math., vol. 416, Amer. Math. Soc., Providence, RI, 2006, pp. 31–40.[MR]
  26. Nigel Boston and Jordan S. Ellenberg, Pro-p groups and towers of rational homology spheres, Geom. Topol. 10 (2006), 331–334 (electronic).[MR/doi]
  27. Nigel Boston and Harris Nover, Computing pro-p-Galois groups, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 1–10.[MR]
  28. Irene I. Bouw and Stefan Wewers, Indigenous bundles with nilpotent p-curvature, Int. Math. Res. Not. (2006), Art. ID 89254, 37.[MR]
  29. Stefka Bouyuklieva, E. A. O'Brien, and Wolfgang Willems, The automorphism group of a binary self-dual doubly even [72,36,16] code is solvable, IEEE Trans. Inform. Theory 52 (2006), no. 9, 4244–4248.[MR]
  30. J. D. Bradley and R. T. Curtis, Symmetric generation and existence of J3 : 2, the automorphism group of the third Janko group, J. Algebra 304 (2006), no. 1, 256–270.[MR]
  31. Aaron Bradord, Michael Monagan, and Colin Percival, Integer factorization and computing discrete logarithms in Maple, in Proceedings of the 2006 Maple Conference, 2006, pp. 2–13.
  32. John Bray, Marston Conder, Charles Leedham-Green, and Eamonn O'Brien, Short presentations for alternating and symmetric groups, Preprint (2006), 24 pages.
  33. John N. Bray and Robert A. Wilson, Explicit representations of maximal subgroups of the Monster, J. Algebra 300 (2006), no. 2, 834–857.[MR]
  34. John N. Bray and Robert A. Wilson, On the orders of automorphism groups of finite groups. II, J. Group Theory 9 (2006), no. 4, 537–545.[MR]
  35. Martin Bright, Brauer groups of diagonal quartic surfaces, J. Symbolic Comput. 41 (2006), no. 5, 544–558.[MR]
  36. Peter A. Brooksbank and William M. Kantor, Fast constructive recognition of black box orthogonal groups, J. Algebra 300 (2006), no. 1, 256–288.[MR]
  37. Gavin Brown, Graded rings and special K3 surfaces, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 137–159.[MR]
  38. Ronald Brown, Neil Ghani, Anne Heyworth, and Christopher D. Wensley, String rewriting for double coset systems, J. Symbolic Comput. 41 (2006), no. 5, 573–590.[MR/arXiv]
  39. N. Bruin, K. Győry, L. Hajdu, and Sz. Tengely, Arithmetic progressions consisting of unlike powers, Indag. Math. (N.S.) 17 (2006), no. 4, 539–555.[MR]
  40. Nils Bruin, Some ternary Diophantine equations of signature (n,n,2), Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 63–91.[MR]
  41. Nils Bruin, E. Victor Flynn, Josep González, and Victor Rotger, On finiteness conjectures for endomorphism algebras of abelian surfaces, Math. Proc. Cambridge Philos. Soc. 141 (2006), no. 3, 383–408.[MR/arXiv]
  42. Jan Hendrik Bruinier and Tonghai Yang, CM-values of Hilbert modular functions, Invent. Math. 163 (2006), no. 2, 229-288.
  43. Johannes Buchmann, Andrei Pyshkin, and Ralf-Philipp Weinmann, Block ciphers sensitive to Gröbner basis attacks, Topics in Cryptology—CT-RSA 2006, Lecture Notes in Comput. Sci., vol. 3860, Springer, Berlin, 2006, pp. 313–331.[MR]
  44. Jarosław Buczyński, Legendrian subvarieties of projective space, Geom. Dedicata 118 (2006), 87–103.[MR]
  45. Yann Bugeaud, Maurice Mignotte, and Samir Siksek, Classical and modular approaches to exponential Diophantine equations I: Fibonacci and Lucas perfect powers, Ann. of Math. (2) 163 (2006), no. 3, 969–1018.[MR]
  46. Yann Bugeaud, Maurice Mignotte, and Samir Siksek, Classical and modular approaches to exponential Diophantine equations II: The Lebesgue-Nagell equation, Compos. Math. 142 (2006), no. 1, 31–62.[MR]
  47. David M. Bundy and Peter J. Rowley, Symmetric groups and completions of the Goldschmidt amalgams of type G1, J. Group Theory 9 (2006), no. 5, 627–640.[MR]
  48. J. S. Calcut, Rationality and the tangent function, Preprint (2006), 22 pages.
  49. Frank Calegari and Nathan M. Dunfield, Automorphic forms and rational homology 3-spheres, Geom. Topol. 10 (2006), 295–329 (electronic).[MR/arXiv]
  50. H. E. A. Campbell, B. Fodden, and David L. Wehlau, Invariants of the diagonal Cp-action on V3, J. Algebra 303 (2006), no. 2, 501–513.[MR]
  51. John J. Cannon and Derek F. Holt, Computing conjugacy class representatives in permutation groups, J. Algebra 300 (2006), no. 1, 213–222.[MR]
  52. Anne Canteaut, Open problems related to algebraic attacks on stream ciphers, WCC 2005, Lecture Notes in Comput. Sci., vol. 3969, Springer, Berlin, 2006, pp. 120–134.[link]
  53. Jorge Caravantes, Low codimension Fano–Enriques threefolds, preprint (2006), 27 pages.[arXiv]
  54. Gabriel Cardona, Representations of Gk-groups and twists of the genus two curve y2=x5 – x, J. Algebra 303 (2006), no. 2, 707–721.[MR]
  55. Jon F. Carlson, Constructing endotrivial modules, J. Pure Appl. Algebra 206 (2006), no. 1-2, 83–110.[MR]
  56. Jon F. Carlson, Support varieties for modules, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 187–204.[MR]
  57. Jon F. Carlson, When is projectivity detected on subalgebras?, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 205–220.[MR]
  58. Jon F. Carlson and Graham Matthews, Generators and relations for matrix algebras, J. Algebra 300 (2006), no. 1, 134–159.[MR]
  59. Jon F. Carlson, Nadia Mazza, and Daniel K. Nakano, Endotrivial modules for finite groups of Lie type, J. Reine Angew. Math. 595 (2006), 93–119.[MR]
  60. Antoine Chambert-Loir, Compter (rapidement) le nombre de solutions d'equations dans les corps finis, preprint (2006), 46 pages.[arXiv]
  61. C. Chisholm and J. A. MacDougall, Rational and Heron tetrahedra, J. Number Theory 121 (2006), no. 1, 153–185.[MR]
  62. Tracey Cicco, Algorithms for Computing Restricted Root Systems and Weyl Groups, PhD Thesis, North Carolina State University, 2006.
  63. Carlos Cid, Sean Murphy, and Matthew Robshaw, Algebraic Aspects of the Advanced Encryption Standard, Springer, New York, 2006, pp. viii+147.[MR]
  64. Stephen D. Cohen, Primitive polynomials with a prescribed coefficient, Finite Fields Appl. 12 (2006), no. 3, 425–491.[MR]
  65. Marston Conder and Peter Dobcsányi, Normal subgroups of the modular group and other Hecke groups, Combinatorial group theory, discrete groups, and number theory, Contemp. Math., vol. 421, Amer. Math. Soc., Providence, RI, 2006, pp. 65–86.[MR]
  66. Marston Conder, George Havas, and Colin Ramsay, Efficient presentations for the Mathieu simple group M22 and its cover, Finite geometries, groups, and computation, Walter de Gruyter GmbH &Co. KG, Berlin, 2006, pp. 33–41.[MR]
  67. Marston Conder and Vaughan Jones, Highly transitive imprimitivities, J. Algebra 300 (2006), no. 1, 44–56.[MR]
  68. Marston Conder, C. R. Leedham-Green, and E. A. O'Brien, Constructive recognition of PSL(2,q), Trans. Amer. Math. Soc. 358 (2006), no. 3, 1203–1221 (electronic).[MR]
  69. Marston Conder, Aleksander Malnič, Dragan Marušič, and Primož Potočnik, A census of semisymmetric cubic graphs on up to 768 vertices, J. Algebraic Combin. 23 (2006), no. 3, 255–294.[MR]
  70. Marston Conder, Gaven Martin, and Anna Torstensson, Maximal symmetry groups of hyperbolic 3-manifolds, New Zealand J. Math. 35 (2006), no. 1, 37–62.[MR]
  71. A. Cossidente, G. L. Ebert, G. Marino, and A. Siciliano, Shult sets and translation ovoids of the Hermitian surface, Adv. Geom. 6 (2006), no. 4, 523–542.[MR]
  72. Robert S. Coulter, Marie Henderson, and Felix Lazebnik, On certain combinatorial Diophantine equations and their connection to Pythagorean numbers, Acta Arith. 122 (2006), no. 4, 395–406.[MR]
  73. J. E. Cremona, M. Prickett, and Samir Siksek, Height difference bounds for elliptic curves over number fields, J. Number Theory 116 (2006), no. 1, 42–68.[MR]
  74. John Cremona, The elliptic curve database for conductors to 130000, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 11–29.[MR]
  75. Deepak Dalai, On some necessary conditions of boolean functions to resist algebraic attacks, PhD Thesis, Indian Statistical Institute, Kolkata, India, 2006.
  76. Lars Eirik Danielsen and Matthew G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, J. Combin. Theory Ser. A 113 (2006), no. 7, 1351–1367.[MR]
  77. Henri Darmon and Robert Pollack, Efficient calculation of Stark-Heegner points via overconvergent modular symbols, Israel J. Math. 153 (2006), 319–354.[MR]
  78. Wolfram Decker and Christoph Lossen, Computing in algebraic geometry, Algorithms and Computation in Mathematics, vol. 16, Springer-Verlag, Berlin, 2006, pp. xvi+327.[MR]
  79. U. Dempwolff, Automorphisms and equivalence of bent functions and of difference sets in elementary abelian 2-groups, Comm. Algebra 34 (2006), no. 3, 1077–1131.[MR]
  80. Alexander W. Dent and Steven D. Galbraith, Hidden pairings and trapdoor DDH groups, Algorithmic Number Theory (Berlin, 2006), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2006, pp. pp.15.
  81. Ulrich Derenthal, On the Cox ring of del Pezzo surfaces, preprint (2006), 17 pages.[arXiv]
  82. Michael Dettweiler, Galois realizations of classical groups and the middle convolution, preprint (2006), 94 pages.[arXiv]
  83. Michael Dettweiler and Stefan Reiter, On exceptional rigid local systems, preprint (2006), 11 pages.[arXiv]
  84. Claus Diem, An index calculus algorithm for plane curves of small degree, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 543–557.[MR]
  85. Cunsheng Ding and Jin Yuan, A family of skew Hadamard difference sets, J. Combin. Theory Ser. A 113 (2006), no. 7, 1526–1535.[MR]
  86. Jintai Ding, Jason E. Gower, and Dieter Schmidt, Multivariate public key cryptosystems, Springer, Berlin, 2006, pp. xviii+260.
  87. Jintai Ding, Jason E. Gower, and Dieter S. Schmidt, Zhuang-Zi: a new algorithm for solving multivariate polynomial equations over a finite field, Preprint (2006), 14 pages.[link]
  88. C. Dominquez, J. Rubio, and F. Sergeraert, Modelling inheritance as coercion in the Kenzo system, Journal of Universal Computer Science 12 (2006), 1701–1730.
  89. Darrin Doud and Brian Hansen, Explicit Frobenius calculations supporting a generalization of a conjecture of Serre, JP J. Algebra Number Theory Appl. 6 (2006), no. 2, 381–398.[MR/link]
  90. Konstantinos A. Draziotis, Integer points on the curve Y2=X3±pkX, Math. Comp. 75 (2006), no. 255, 1493–1505 (electronic).[MR]
  91. Konstantinos Draziotis and Dimitrios Poulakis, Practical solution of the Diophantine equation y2=x(x+2apb)(x-2apb), Math. Comp. 75 (2006), no. 255, 1585–1593 (electronic).[MR]
  92. Sean V. Droms, Keith E. Mellinger, and Chris Meyer, LDPC codes generated by conics in the classical projective plane, Des. Codes Cryptogr. 40 (2006), no. 3, 343–356.[MR]
  93. Jacques Dubrois and Jean-Guillaume Dumas, Efficient polynomial time algorithms computing industrial-strength primitive roots, Inform. Process. Lett. 97 (2006), no. 2, 41–45.[MR]
  94. Jean-Guillaume Dumas, Thierry Gautier, Pascal Giorgi, and Clément Pernet, Dense linear algebra over finite fields: The FFLAS and FFPACK packages, preprint (2006), 69 pages.[arXiv]
  95. Jean-Guillaume Dumas and Anna Urbanska, An introspective algorithm for the integer determinant, preprint (2006), 32 pages.[arXiv]
  96. Freddy Dumortier, Jaume Llibre, and Joan C. Artés, Qualitative Theory of Planar Differential Systems, Universitext, Springer-Verlag, Berlin, 2006, pp. xvi+298.[MR]
  97. Bas Edixhoven, Comparison of integral structures on spaces of modular forms of weight two, and computation of spaces of forms mod 2 of weight one, J. Inst. Math. Jussieu 5 (2006), no. 1, 1–34.[MR]
  98. Bas Edixhoven, On the computation of the coefficients of a modular form, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 30–39.[MR]
  99. Bettina Eick, M. F. Newman, and E. A. O'Brien, The class-breadth conjecture revisited, J. Algebra 300 (2006), no. 1, 384–393.[MR]
  100. Bettina Eick and Bernd Souvignier, Algorithms for crystallographic groups, Int. J. Quantum. Chem 106 (2006), no. 1, 316–343.
  101. Arsen Elkin, Hyperelliptic Jacobians with real multiplication, J. Number Theory 117 (2006), no. 1, 53–86.[MR]
  102. Arsen Elkin and Yuri G. Zarhin, Endomorphism algebras of hyperelliptic Jacobians and finite projective lines, J. Ramanujan Math. Soc. 21 (2006), 169-187.[MR]
  103. Jordan S. Ellenberg and Akshay Venkatesh, The number of extensions of a number field with fixed degree and bounded discriminant, Ann. of Math. (2) 163 (2006), no. 2, 723–741.[MR]
  104. Nicholas Eriksson, Algebraic Combinatorics for Computational Biology, PhD Thesis, University of California, Berkeley, 2006.[link]
  105. Pavel Etingof and Eric Rains, Central extensions of preprojective algebras, the quantum Heisenberg algebra, and 2-dimensional complex reflection groups, J. Algebra 299 (2006), no. 2, 570–588.[MR/arXiv]
  106. Jeffrey B. Farr and Shuhong Gao, Computing Gröbner bases for vanishing ideals of finite sets of points, Applied Algebra, Algebraic Algorithms and Error-correcting Codes, Lecture Notes in Comput. Sci., vol. 3857, Springer, Berlin, 2006, pp. 118–127.[MR]
  107. Jeffrey B. Farr and Shuhong Gao, Gröbner bases and generalized Padé approximation, Math. Comp. 75 (2006), no. 253, 461–473 (electronic).[MR]
  108. Arash Farzan and J. Ian Munro, Succinct representation of finite abelian groups, in ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2006, pp. 87–92.[doi]
  109. Claus Fieker, Applications of the class field theory of global fields, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 31–62.[MR]
  110. Claus Fieker and Michael E. Pohst, Dependency of units in number fields, Math. Comp. 75 (2006), no. 255, 1507–1518 (electronic).[MR]
  111. Akpodigha Filatei, Implementation of fast polynomial arithmentic in Aldor, Master's Thesis, University of Western Ontario, 2006.
  112. Akpodigha Filatei, Xin Li, Marc Moreno Maza, and Éric Schost, Implementation techniques for fast polynomial arithmetic in a high-level programming environment, in ISSAC '06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 2006, pp. 93–100.[doi]
  113. Luís R. A. Finotti, Minimal degree liftings in characteristic 2, J. Pure Appl. Algebra 207 (2006), no. 3, 631–673.[MR]
  114. Tom Fisher, Testing equivalence of ternary cubics, Algorithmic Number Theory (Berlin, 2006), Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 333–345.[MR]
  115. Tom Fisher, The Hessian of a genus one curve, preprint (2006), 28 pages.[arXiv]
  116. P. Fleischmann, M. Sezer, R. J. Shank, and C. F. Woodcock, The Noether numbers for cyclic groups of prime order, Adv. Math. 207 (2006), no. 1, 149–155.[MR]
  117. S. Fritzsche, Application of point-group symmetries in chemistry and physics: a computer-algebraic approach, Int. J. Quantum. Chem 106 (2006), 98-129.
  118. Joseph H. G. Fu, Structure of the unitary valuation algebra, J. Differential Geom. 72 (2006), no. 3, 509–533.[MR/arXiv]
  119. Steven Galbraith, Disguising tori and elliptic curves, Preprint (2006), 12 pages.[link]
  120. Skip Garibaldi and Michael Carr, Geometries, the principle of duality, and algebraic groups, Expo. Math. 24 (2006), no. 3, 195–234.[MR]
  121. P. Gaudry, T. Houtmann, D. Kohel, C. Ritzenthaler, and A. Weng, The 2-adic CM method for genus 2 curves with application to cryptography, Advances in cryptology—ASIACRYPT 2006, Lecture Notes in Comput. Sci., vol. 4284, Springer, Berlin, 2006, pp. 114–129.[MR]
  122. Volker Gebhardt, Computer aided discovery of a fast algorithm for testing conjugacy in braid groups, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 261–285.[MR]
  123. Volker Gebhardt, Conjugacy search in braid groups: From a braid-based cryptography point of view, Appl. Algebra Engrg. Comm. Comput. 17 (2006), no. 3-4, 219–238.[MR]
  124. Vladimir P. Gerdt and Yuri A. Blinkov, On computing Janet bases for degree compatible orderings, Proceedings of the 10th Rhine Workshop on Computer Algebra (Basel), 2006, University of Basel, Basel, 2006, pp. 107–117.
  125. Vladimir P. Gerdt, Yuri A. Blinkov, and Vladimir V. Mozzhilkin, Gröbner bases and generation of difference schemes for partial differential equations, SIGMA Symmetry Integrability Geom. Methods Appl. 2 (2006), Paper 051, 26 pp. (electronic).[MR]
  126. Lothar Gerritzen, Tree polynomials and non-associative Gröbner bases, J. Symbolic Comput. 41 (2006), no. 3-4, 297–316.[MR]
  127. Modjtaba Ghorbani and Ali Reza Ashrafi, Counting the number of hetero fullerenes, Journal of Computational and Theoretical Nanoscience 3 (2006), no. 5, 803–810.[link]
  128. Martine Girard, The group of Weierstrass points of a plane quartic with at least eight hyperflexes, Math. Comp. 75 (2006), no. 255, 1561–1583 (electronic).[MR]
  129. Martine Girard and David R. Kohel, Classification of genus 3 curves in special strata of the moduli space, Algorithmic Number Theory (Berlin, 2006), Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 346–360.[MR]
  130. Michael Giudici, Factorisations of sporadic simple groups, J. Algebra 304 (2006), no. 1, 311–323.[MR]
  131. S. P. Glasby, C. R. Leedham-Green, and E. A. O'Brien, Writing projective representations over subfields, J. Algebra 295 (2006), no. 1, 51–61.[MR]
  132. David G. Glynn, T. Aaron Gulliver, Johannes G. Maks, and Manish K. Gupta, The geometry of additive quantum codes, Springer, 2006, pp. 219.
  133. Edray Herber Goins and Davin Maddox, Heron triangles via elliptic curves, Rocky Mountain J. Math. 36 (2006), no. 5, 1511–1526.[MR]
  134. Josep González and Victor Rotger, Non-elliptic Shimura curves of genus one, J. Math. Soc. Japan 58 (2006), no. 4, 927–948.[MR]
  135. Nikolai Gordeev, Fritz Grunewald, Boris Kunyavskii, and Eugene Plotkin, On the number of conjugates defining the solvable radical of a finite group, C. R. Math. Acad. Sci. Paris 343 (2006), no. 6, 387–392.[MR]
  136. Willem A. de Graaf, Michael Harrison, Jana Pílniková, and Josef Schicho, A Lie algebra method for rational parametrization of Severi-Brauer surfaces, J. Algebra 303 (2006), no. 2, 514–529.[MR]
  137. Markus Grassl, Constructing matrix representations of finite groups in characteristic zero, Proceedings 10th Rhine Workshop on Computer Algebra (RWCA06, 2006, pp. 143-148.
  138. Markus Grassl, Searching for linear codes with large minimum distance, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 287–313.[MR/doi]
  139. Markus Grassl and Martin Rötteler, Quantum convolutional codes: Encoders and structural properties, Forty-Fourth Annual Allerton Conference,Allerton House, UIUC, Illinois, USA Sept 27-29, 2006, 2006, pp. 510–519.
  140. Matthew Greenberg, Computing Heegner points arising from Shimura curve parametrizations, Preprint (2006), 11 pages.[link]
  141. Matthew Greenberg, Heegner Points and Rigid Analytic Modular Forms, PhD Thesis, McGill University, 2006.[link]
  142. Matthew Greenberg, Heegner point computations via numerical p-adic integration, Algorithmic Number Theory, Lecture Notes in Computer Science, vol. 4076, Springer Berlin / Heidelberg, 2006, pp. 361–376.[link]
  143. Ralph Greenberg, On the structure of certain Galois cohomology groups, Doc. Math. (2006), no. Extra Vol., 335–391 (electronic).[MR]
  144. Anja Groch, Dennis Hofheinz, and Rainer Steinwandt, A practical attack on the root problem in braid groups, Algebraic methods in cryptography, Contemp. Math., vol. 418, Amer. Math. Soc., Providence, RI, 2006, pp. 121–131.[MR/link]
  145. T. Aaron Gulliver and Masaaki Harada, Classification of extremal double circulant self-dual codes of lengths 74–88, Discrete Math. 306 (2006), no. 17, 2064–2072.[MR]
  146. R. Haas and A. G. Helminck, Algorithms for twisted involutions in Weyl groups, Preprint (2006), 10 pages.
  147. Emmanuel Hallouin and Christian Maire, Cancellation in totally definite quaternion algebras, J. Reine Angew. Math. 595 (2006), 189–213.[MR]
  148. Masaaki Harada, Self-orthogonal 3-(56,12,65) designs and extremal doubly-even self-dual codes of length 56, Des. Codes Cryptogr. 38 (2006), no. 1, 5–16.[MR]
  149. Masaaki Harada and Hadi Kharaghani, Orthogonal designs and MDS self-dual codes, Australas. J. Combin. 35 (2006), 57–67.[MR]
  150. Michael Harrison and Josef Schicho, Rational parametrisation for degree 6 Del Pezzo surfaces using Lie algebras, ISSAC 2006, ACM, New York, 2006, pp. 132–137.[MR]
  151. Evelyn L. Hart and Edward C. Keppelmann, Nielsen periodic point theory for periodic maps on orientable surfaces, Topology Appl. 153 (2006), no. 9, 1399–1420.[MR]
  152. G. Havas, C. R. Leedham-Green, E. A. O'Brien, and M. C. Slattery, Certain Roman and flock generalized quadrangles have nonisomorphic elation groups, Adv. Geom. 6 (2006), no. 3, 389–395.[MR]
  153. George Havas, C. R. Leedham-Green, E. A. O'Brien, and Michael C. Slattery, Computing with elation groups, Finite Geometries, Groups, and Computation, Walter de Gruyter GmbH &Co. KG, Berlin, 2006, pp. 95–102.[MR]
  154. Mark van Hoeij and John Cremona, Solving conics over function fields, J. Théor. Nombres Bordeaux 18 (2006), no. 3, 595–606.[MR]
  155. Camilla Hollanti, Jyrki Lahtonen, Kalle Ranto, and Roope Vehkalahti, Optimal matrix lattices for MIMO codes from division algebras, in IEEE International Symposium on Information Theory. ISIT 2006, July 2006, pp. 783-787.[doi]
  156. Derek F. Holt, Cohomology and group extensions in Magma, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 221–241.[MR]
  157. Derek F. Holt and E. A. O'Brien, A computer-assisted analysis of some matrix groups, J. Algebra 300 (2006), no. 1, 199–212.[MR]
  158. Shih-Chang Huang, Uno's conjecture for the Chevalley simple groups G2(3) and G2(4), New Zealand J. Math. 35 (2006), no. 2, 155–182.[MR]
  159. Hendrik Hubrechts, Memory efficient hyperelliptic curve point counting, preprint (2006), 10 pages.[arXiv]
  160. Stephen P. Humphries, Representations and rigidity of Aut(F3), Internat. J. Algebra Comput. 16 (2006), no. 5, 925–929.[MR]
  161. Robert E. Jamison and Gretchen L. Matthews, Distance k colorings of Hamming graphs, in Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 183, 2006, pp. 193–202.[MR]
  162. Henri Johnston, On the trace map between absolutely abelian number fields of equal conductor, Acta Arith. 122 (2006), no. 1, 63–74.[MR]
  163. John W. Jones and David P. Roberts, A database of local fields, J. Symbolic Comput. 41 (2006), no. 1, 80–97.[MR]
  164. Antoine Joux and Reynald Lercier, Counting points on elliptic curves in medium characteristic, Preprint (2006), 15.[link]
  165. David Joyner and Amy Ksir, Automorphism groups of some AG codes, IEEE Trans. Inform. Theory 52 (2006), no. 7, 3325–3329.[MR]
  166. M. Kasatani, T. Miwa, A. N. Sergeev, and A. P. Veselov, Coincident root loci and Jack and Macdonald polynomials for special values of the parameters, Jack, Hall-Littlewood and Macdonald Polynomials, Contemp. Math., vol. 417, Amer. Math. Soc., Providence, RI, 2006, pp. 207–225.[MR]
  167. Masanobu Katagi, Toru Akishita, Izuru Kitamura, and Tsuyoshi Takagi, Efficient hyperelliptic curve cryptosystems using theta divisors, IEICE Trans. Fundamentals E89-A (2006), no. 1, 151–160.
  168. J. D. Key, Recent developments in permutation decoding, Not. S. Afr. Math. Soc. 37 (2006), no. 1, 2–13.[MR]
  169. J. D. Key, T. P. McDonough, and V. C. Mavron, Information sets and partial permutation decoding for codes from finite geometries, Finite Fields Appl. 12 (2006), no. 2, 232–247.[MR]
  170. Sara Khodadad and Michael Monagan, Fast rational function reconstruction, ISSAC 2006, ACM, New York, 2006, pp. 184–190.[MR]
  171. Aristides Kontogeorgis and Victor Rotger, On abelian automorphism groups of Mumford curves and applications to Shimura curves, preprint (2006), 16 pages.[arXiv]
  172. Ilias S. Kotsireas and Christos Koukouvinos, Constructions for Hadamard matrices of Williamson type, J. Combin. Math. Combin. Comput. 59 (2006), 17–32.[MR]
  173. Ilias S. Kotsireas and Christos Koukouvinos, Orthogonal designs via computational algebra, J. Combin. Des. 14 (2006), no. 5, 351–362.[MR]
  174. Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry, Hadamard ideals and Hadamard matrices with circulant core, J. Combin. Math. Combin. Comput. 57 (2006), 47–63.[MR]
  175. Ilias S. Kotsireas, Christos Koukouvinos, and Jennifer Seberry, Hadamard ideals and Hadamard matrices with two circulant cores, European J. Combin. 27 (2006), no. 5, 658–668.[MR]
  176. Greg Kuperberg, Numerical cubature from Archimedes' hat-box theorem, SIAM J. Numer. Anal. 44 (2006), no. 3, 908–935 (electronic).[MR/link]
  177. Greg Kuperberg, Numerical cubature using error-correcting codes, SIAM J. Numer. Anal. 44 (2006), no. 3, 897–907 (electronic).[MR/arXiv]
  178. Klavdija Kutnar, Aleksander Malnič, Dragan Marušič, and Štefko Miklavič, Distance-balanced graphs: Symmetry conditions, Discrete Math. 306 (2006), no. 16, 1881–1894.[MR]
  179. Thorsten Lagemann, Codes und automorphismen optimaler artin-schreier-turme, PhD Thesis, Ruprecht-Karls-Universität Heidelberg, 2006.
  180. Jyrki Lahtonen and Camilla Hollanti, A new tool: constructing STBCs from maximal orders in central simple algebras, in IEEE Information Theory Workshop, Punta del Este, Uruguay, March 13–17, 2006, 2006.
  181. Alan G. B. Lauder, A recursive method for computing zeta functions of varieties, LMS J. Comput. Math. 9 (2006), 222–269 (electronic).[MR]
  182. Sonja Lauer, Entwurf von algorithmen zur konstruktion von differentialgleichungen mit vorgegebener endlicher galoisgruppe, PhD Thesis, Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, 2006.
  183. Dimitri Leemans and Laurence Vauthier, An atlas of abstract regular polytopes for small groups, Aequationes Math. 72 (2006), no. 3, 313–320.[MR]
  184. Claus Lehr and Michel Matignon, Wild monodromy and automorphisms of curves, Duke Math. J. 135 (2006), no. 3, 569–586.[MR]
  185. Reynald Lercier and David Lubicz, A quasi-quadratic time algorithm for hyperelliptic curve point counting, Ramanujan J. 12 (2006), no. 3, 399–423.[MR/doi]
  186. Paulette Lieby, Colouring planar graphs, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 315–330.[MR]
  187. Tian Khoon Lim, Arc-transitive homogeneous factorizations and affine planes, J. Combin. Des. 14 (2006), no. 4, 290–300.[MR]
  188. San Ling, Chaoping Xing, and Ferruh Özbudak, An explicit class of codes with good parameters and their duals, Discrete Appl. Math. 154 (2006), no. 2, 346–356.[MR]
  189. John Little and Hal Schenck, Toric surface codes and Minkowski sums, SIAM J. Discrete Math. 20 (2006), no. 4, 999–1014 (electronic).[MR]
  190. Ronald van Luijk, Quartic K3 surfaces without nontrivial automorphisms, Math. Res. Lett. 13 (2006), no. 2-3, 423–439.[MR/arXiv]
  191. Benjamin Lundell and Jason McCullough, A generalized floor bound for the minimum distance of geometric Goppa codes, J. Pure Appl. Algebra 207 (2006), no. 1, 155–164.[MR]
  192. Le Van Ly, Polly Two: A new algebraic polynomial-based public-key scheme, Appl. Algebra Engrg. Comm. Comput. 17 (2006), no. 3-4, 267–283.[MR]
  193. Aleksander Malnič and Primož Potočnik, Invariant subspaces, duality, and covers of the Petersen graph, European J. Combin. 27 (2006), no. 6, 971–989.[MR]
  194. Stefano Marcugini, Alfredo Milani, and Fernanda Pambianco, Classification of linear codes exploiting an invariant, Contrib. Discrete Math. 1 (2006), no. 1, 1–7 (electronic).[MR]
  195. Phil Martin and Mark Watkins, Symmetric powers of elliptic curve L-functions, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 377–392.[MR]
  196. Krystian Matusiewicz, Scott Contini, and Josef Pieprzyk, Weaknesses of the fork-256 compression function, IACR ePrint 2006/317 (2006), 1–21.[link]
  197. Barry Mazur, William Stein, and John Tate, Computation of p-adic heights and log convergence, Doc. Math. (2006), no. Extra Vol., 577–614 (electronic).[MR]
  198. Gerhard O. Michler, Theory of finite simple groups, New Mathematical Monographs, vol. 8, Cambridge University Press, Cambridge, 2006, pp. 426,583.
  199. Jürgen Müller and Christophe Ritzenthaler, On the ring of invariants of ordinary quartic curves in characteristic 2, J. Algebra 303 (2006), no. 2, 530–542.[MR/link]
  200. G. Nebe, Kneser-Hecke-operators in coding theory, Abh. Math. Sem. Univ. Hamburg 76 (2006), 79–90.[MR]
  201. Gabriele Nebe, Eric M. Rains, and Neil J. A. Sloane, Self-dual Codes and Invariant Theory, Algorithms and Computation in Mathematics, vol. 17, Springer-Verlag, Berlin, 2006, pp. xxviii+430.[MR]
  202. Max Neunhöffer and Ákos Seress, A data structure for a uniform approach to computations with finite groups, ISSAC'06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 2006, pp. 254–261.[MR/doi]
  203. Phong Q. Nguyen and Damien Stehlé, LLL on the average, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 238–256.[MR]
  204. Masayuki Noro, Modular dynamic evaluation, in ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2006, pp. 262–268.[doi]
  205. E. A. O'Brien, Towards effective algorithms for linear groups, Finite Geometries, Groups, and Computation, Walter de Gruyter GmbH &Co. KG, Berlin, 2006, pp. 163–190.[MR]
  206. Michael E. O'Sullivan, Algebraic construction of sparse matrices with large girth, IEEE Trans. Inform. Theory 52 (2006), no. 2, 718–727.[MR/link]
  207. Stavros Argyrios Papadakis, Type II unprojection, J. Algebraic Geom. 15 (2006), no. 3, 399–414.[MR/arXiv]
  208. Christopher Parker and Peter Rowley, Local characteristic p completions of weak BN-pairs, Proc. London Math. Soc. (3) 93 (2006), no. 2, 325–394.[MR]
  209. Sebastian Pauli, Constructing class fields over local fields, J. Théor. Nombres Bordeaux 18 (2006), no. 3, 627–652.[MR]
  210. Tim Penttila, Applications of computer algebra to finite geometry, Finite geometries, groups, and computation, Walter de Gruyter GmbH &Co. KG, Berlin, 2006, pp. 203–221.[MR]
  211. Jana Pílniková, Parametrizing algebraic varieties using Lie algebras, preprint (2006), 74 pages.[arXiv]
  212. W. Plesken and D. Robertz, Representations, commutative algebra, and Hurwitz groups, J. Algebra 300 (2006), no. 1, 223–247.[MR]
  213. Alexandru A. Popa, Central values of Rankin L-series over real quadratic fields, Compos. Math. 142 (2006), no. 4, 811–866.[MR]
  214. Andrea Previtali, Irreducible constituents of monomial representations, J. Symbolic Comput. 41 (2006), no. 12, 1345–1359.[MR]
  215. Renault Guénaél Renault, Computation of the splitting field of a dihedral polynomial, in ISSAC '06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ACM Press, New York, NY, USA, 2006, pp. 290–297.[doi]
  216. I. I. Reznikov and V. I. Sushchanskii, A software system for growth analysis of Mealy automata, Cybernetics and Systems Analysis 42 (2006), no. 2, 265–276.[link]
  217. Eric Robinson and Gene Cooperman, A parallel architecture for disk-based computing over the baby monster and other large finite simple groups, in ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, ACM Press, New York, NY, USA, 2006, pp. 298–305.[doi]
  218. José L. Rodríguez, Jérôme Scherer, and Antonio Viruel, Non-simple localizations of finite simple groups, J. Algebra 305 (2006), no. 2, 765–774.[MR]
  219. Colva M. Roney-Dougal and William R. Unger, Computing the primitive permutation groups of degree less than 1000, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 243–260.[MR]
  220. Jeremy Rouse, Zagier duality for the exponents of Borcherds products for Hilbert modular forms, J. London Math. Soc. (2) 73 (2006), no. 2, 339–354.[MR]
  221. D. Schellekens, B. Preneel, and I. Verbauwhede, FPGA vendor agnostic true random number generator, Field Programmable Logic and Applications, 2006. FPL '06 (2006).
  222. Csaba Schneider, Small derived quotients in finite p-groups, Publ. Math. Debrecen 69 (2006), no. 3, 373–378.[MR]
  223. Andreas M. Schöpp, Fundamental units in a parametric family of not totally real quintic number fields, J. Théor. Nombres Bordeaux 18 (2006), no. 3, 693–706.[MR]
  224. Achill Schürmann and Frank Vallentin, Computational approaches to lattice packing and covering problems, Discrete Comput. Geom. 35 (2006), no. 1, 73–116.[MR]
  225. Ákos Seress, A unified approach to computations with permutation and matrix groups, International Congress of Mathematicians. Vol. II, Eur. Math. Soc., Zürich, 2006, pp. 245–258.[MR]
  226. Müfit Sezer and R. James Shank, On the coinvariants of modular representations of cyclic groups of prime order, J. Pure Appl. Algebra 205 (2006), no. 1, 210–225.[MR]
  227. Amit R. Sharma, J. Wu, B. J. Braams, S. Carter, R. Schneider, B. Shepler, and J. M. Bowman, Potential energy surfaces and MULTIMODE vibrational analysis of C2H3 + , J Chem Phys. 125 (2006), 224306.
  228. R. Shaw and N. A. Gordon, The polynomial degree of the Grassmannian G1,n,2, Des. Codes Cryptogr. 39 (2006), no. 2, 289–306.[MR]
  229. N. I. Shepherd-Barron, Perfect forms and the moduli space of abelian varieties, Invent. Math. 163 (2006), no. 1, 25–45.[MR]
  230. William Stein, Studying the Birch and Swinnerton-Dyer conjecture for modular abelian varieties using Magma, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 93–116.[MR]
  231. Makoto Sugita, Mitsuru Kawazoe, and Hideki Imai, Relation between the XL algorithm and Groebner basis algorithms, IEICE Trans. Fundamentals E89-A (2006), no. 1, 11–18.
  232. Katsuyuki Takashima, A new type of fast endomorphisms on Jacobians of hyperelliptic curves and their cryptographic application, IEICE Trans. Fundamentals E89-A (2006), no. 1, 124–133.
  233. M. Chiara Tamburini and M. Vsemirnov, Irreducible (2,3,7)-subgroups of PGLn(F), n ≤ 7, J. Algebra 300 (2006), no. 1, 339–362.[MR]
  234. Donald E. Taylor, Constructing the split octonions, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 161–185.[MR]
  235. Edlyn Teske, An elliptic curve trapdoor system, J. Cryptology 19 (2006), no. 1, 115–133.[MR]
  236. C. Tjhai, M. Tomlinson, M. Grassl, R. Horan, M. Ahmed, and M. Ambroze, New linear codes derived from binary cyclic codes of length 151, IEE Proceedings: Communications 153 (2006), no. 5, 581–585.
  237. W. R. Unger, Computing the character table of a finite group, J. Symbolic Comput. 41 (2006), no. 8, 847–862.[MR]
  238. W. R. Unger, Computing the soluble radical of a permutation group, J. Algebra 300 (2006), no. 1, 305–315.[MR]
  239. Michael Vaughan-Lee, Simple Lie algebras of low dimension over GF(2), LMS J. Comput. Math. 9 (2006), 174–192 (electronic).[MR]
  240. M. Vsemirnov, Groups G2(p) as quotients of (2,3,7;2p), Transform. Groups 11 (2006), no. 2, 295–304.[MR]
  241. M. A. Vsemirnov, Is the group SL(6,Z) (2,3)-generated?, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 330 (2006), no. Vopr. Teor. Predst. Algebr. i Grupp. 13, 101–130, 272.[MR]
  242. Shayne Waldron and Nick Hay, On computing all harmonic frames of n vectors in Cd, Appl. Comput. Harmon. Anal. 21 (2006), no. 2, 168–181.[MR]
  243. Paul B. van Wamelen, Computing with the analytic Jacobian of a genus 2 curve, Discovering Mathematics with Magma, Algorithms Comput. Math., vol. 19, Springer, Berlin, 2006, pp. 117–135.[MR]
  244. Yan Wang, Xin Gui Fang, and D. F. Hsu, On the edge-forwarding indices of Frobenius graphs, Acta Math. Sin. (Engl. Ser.) 22 (2006), no. 6, 1735–1744.[MR/link]
  245. Mark Watkins, A note on integral points on elliptic curves, J. Théor. Nombres Bordeaux 18 (2006), no. 3, 707–720.[MR]
  246. Mark Watkins, Some remarks on Heegner point computations, preprint (2006), 14 pages.[arXiv]
  247. Michael Weller, Gerhard O. Michler, and Andrea Previtali, Thompson's sporadic group uniquely determined by the centralizer of a 2-central involution, J. Algebra 298 (2006), no. 2, 371–459.[MR]
  248. Annegret Weng, A low-memory algorithm for point counting on Picard curves, Des. Codes Cryptogr. 38 (2006), no. 3, 383–393.[MR]
  249. Greg White and Markus Grassl, A new minimum weight algorithm for additive codes, Proceedings 2006 IEEE International Symposium on Information Theory (ISIT 2006), Seattle, USA, July 2006, IEEE, 2006, pp. 1119-1123.
  250. Robert A. Wilson, New computations in the monster, Preprint (2006), 11.
  251. Pawel Wocjan, Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays, Phy. Rev. A. 73 (2006), no. 6, 7.
  252. Christopher Wolf, An Braeken, and Bart Preneel, On the security of stepwise triangular systems, Des. Codes Cryptogr. 40 (2006), no. 3, 285–302.[MR]
  253. André Yamba Yamba, Krister Ahlander, and Malin Ljungberg, Designing for geometrical symmetry exploitation, Scientific Programming 14 (2006), no. 2, 61–80.[link]
  254. R. Yorgova, Constructing self-dual codes using an automorphism group, IEEE Information Theory Workshop, 2006. ITW '06 Chengdu (2006), 11-15.[doi]
  255. Robert Michael Zeier, Lie-theoretischer zugang zur erzeugung unitärer transformationen auf quantenrechnern, PhD Thesis, Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, 2006.
  256. Huilin Zhu and Jianhua Chen, Integral points on a class of elliptic curve, Wuhan Univ. J. Nat. Sci. 11 (2006), no. 3, 477–480.[MR]
  257. Paul Zimmermann and Bruce Dodson, 20 years of ECM, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 4076, Springer, Berlin, 2006, pp. 525–542.[MR]
  258. Eliana Zoque, A counterexample to the existence of a Poisson structure on a twisted group algebra, preprint (2006), 4 pages.[arXiv]