 \providecommand{\andname}{\&} \providecommand{\bibsep}{0cm}
  \providecommand{\toappear}{to appear} \providecommand{\noopsort}[1]{}
\begin{thebibliography}{10}
\itemsep\bibsep

\bibitem{Adl-Len}
{\sc L.~M. Adleman \andname\ H.~W. Lenstra, Jr.}, Finding irreducible
  polynomials over finite fields, {\sl 18th ACM Symposium on Theory of
  Computing} (1986), pp.~350--355.

\bibitem{AKS}
{\sc M.~Agrawal, N.~Kayal, \andname\ N.~Saxena}, {\sc Primes} is in {P}, {\sl
  Ann. of Math. (2)} {\bf 160} (2004), no.~2, pp.~781--793.

\bibitem{Bac:exp}
{\sc E.~Bach}, Explicit bounds for primality testing and related problems, {\sl
  Math. Comp.} {\bf 55} (1990), no.~191, pp.~355--380.

\bibitem{Bac:eul}
{\sc E.~Bach}, Improved approximations for {E}uler products, in {\sl Number
  theory (Halifax, NS, 1994)}, Amer. Math. Soc., 1995, pp.~13--28.

\bibitem{Beau:prod}
{\sc B.~Beauzamy}, Products of polynomials and a priori estimates for
  coefficients in polynomial decompositions: a sharp result, {\sl J. Symbolic
  Comput.} {\bf 13} (1992), no.~5, pp.~463--472.

\bibitem{Bel:top}
{\sc K.~Belabas}, Topics in computational algebraic number theory, {\sl J.
  Th\'eor. Nombres Bordeaux} {\bf 16} (2004), no.~1, pp.~19--63.

\bibitem{Bel:X2005}
{\sc K.~Belabas}, L'algorithmique de la th\'eorie alg\'ebrique des nombres, in
  {\sl Th\'eorie algorithmique des nombres et \'equations diophantiennes}, Ed.
  \'Ec. Polytech., Palaiseau, 2005, pp.~85--155.

\bibitem{BHKS}
{\sc K.~Belabas, M.~van Hoeij, J.~Klüners, \andname\ A.~Steel}, Factoring
  polynomials over global fields, preprint.

\bibitem{Ber:fact}
{\sc E.~R. Berlekamp}, Factoring polynomials over large finite fields, {\sl
  Math. Comp.} {\bf 24} (1970), pp.~713--735.

\bibitem{BiluHanrot1996}
{\sc Y.~Bilu \andname\ G.~Hanrot}, Solving {T}hue equations of high degree,
  {\sl J. Number Theory} {\bf 60} (1996), no.~2, pp.~373--392.

\bibitem{BucLen:app}
{\sc J.~Buchmann \andname\ H.~W. Lenstra, Jr.}, Approximating rings of integers
  in number fields, {\sl J. Th\'eor. Nombres Bordeaux} {\bf 6} (1994), no.~2,
  pp.~221--260.

\bibitem{Buch:subexp}
{\sc J.~Buchmann}, A subexponential algorithm for the determination of class
  groups and regulators of algebraic number fields, in {\sl S\'eminaire de
  Th\'eorie des Nombres, Paris 1988--1989}, Progr. Math., vol.~91,
  Birkh\"auser, 1990, pp.~27--41.

\bibitem{BCS1997}
{\sc P.~B{\"u}rgisser, M.~Clausen, \andname\ M.~A. Shokrollahi}, {\sl Algebraic
  complexity theory}, Grundlehren der Mathematischen Wissenschaften
  [Fundamental Principles of Mathematical Sciences], vol. 315, Springer-Verlag,
  Berlin, 1997, With the collaboration of Thomas Lickteig.

\bibitem{Chistov1989}
{\sc A.~L. Chistov}, The complexity of the construction of the ring of integers
  of a global field, {\sl Dokl. Akad. Nauk SSSR} {\bf 306} (1989), no.~5,
  pp.~1063--1067.

\bibitem{Coh:heucla}
{\sc H.~Cohen \andname\ H.~W. Lenstra, Jr.}, Heuristics on class groups of
  number fields, in {\sl Number theory, Noordwijkerhout 1983} (Berlin), Lecture
  Notes in Math., vol. 1068, Springer, Berlin, 1984, pp.~33--62.

\bibitem{Coh:etuheu}
{\sc H.~Cohen \andname\ J.~Martinet}, {\'E}tudes heuristiques des groupes de
  classes des corps de nombres, {\sl J. reine angew. Math.} {\bf 404} (1990),
  pp.~39--76.

\bibitem{Coh:coucom}
{\sc H.~Cohen}, {\sl A course in computational algebraic number theory},
  Graduate Texts in Mathematics, vol. 138, Springer-Verlag, Berlin, 1993.

\bibitem{CranPom}
{\sc R.~Crandall \andname\ C.~Pomerance}, {\sl Prime numbers}, second ed.,
  Springer, New York, 2005, A computational perspective.

\bibitem{Dav:dendis2}
{\sc H.~Davenport \andname\ H.~Heilbronn}, On the density of discriminants of
  cubic fields (ii), {\sl Proc. Roy. Soc. Lond. A} {\bf 322} (1971),
  pp.~405--420.

\bibitem{Dem:ananum}
{\sc Demailly}, {\sl Analyse num\'erique et \'equations diff\'erentielles},
  Presses Universitaires de Grenoble, 1996.

\bibitem{DSV2001}
{\sc J.-G. Dumas, B.~D. Saunders, \andname\ G.~Villard}, On efficient sparse
  integer matrix {S}mith normal form computations, {\sl J. Symbolic Comput.}
  {\bf 32} (2001), no.~1-2, pp.~71--99, Computer algebra and mechanized
  reasoning (St. Andrews, 2000).

\bibitem{EllVen}
{\sc J.~Ellenberg \andname\ A.~Venkatesh}, {The number of extensions of a
  number field with fixed degree and bounded discriminant}, \emph{Annals of
  Math}, \toappear.

\bibitem{Fie:Art}
{\sc C.~Fieker}, Computing class fields via the {A}rtin map, {\sl Math. Comp.}
  {\bf 70} (2001), no.~235, pp.~1293--1303.

\bibitem{ForRob:round4}
{\sc D.~Ford, S.~Pauli, \andname\ X.-F. Roblot}, A fast algorithm for
  polynomial factorization over {$\mathbb{Q}\sb p$}, {\sl J. Th\'eor. Nombres
  Bordeaux} {\bf 14} (2002), no.~1, pp.~151--169.

\bibitem{Gou:algo}
{\sc X.~Gourdon}, Algorithmique du th\'eor\`eme fondamental de l'alg\`ebre,
  Rapport de recherche 1852, INRIA, 1993.

\bibitem{Haf:rig}
{\sc J.~L. Hafner \andname\ K.~S. McCurley}, A rigorous subexponential
  algorithm for computation of class groups, {\sl J. Amer. Math. Soc.} {\bf 2}
  (1989), no.~4, pp.~837--850.

\bibitem{Hanrot2005}
{\sc G.~Hanrot}, Quelques id\'ees sur l'algorithmique des \'equations
  diophantiennes, in {\sl Th\'eorie algorithmique des nombres et \'equations
  diophantiennes}, Ed. \'Ec. Polytech., Palaiseau, 2005, pp.~157--185.

\bibitem{Has:zah}
{\sc H.~Hasse}, {\sl Zahlentheorie}, Akademie-Verlag GmbH, 1949.

\bibitem{Hen74}
{\sc P.~Henrici}, {\sl Applied and computational complex analysis},
  Wiley-Interscience [John Wiley \& Sons], New York, 1974, Volume 1: Power
  series---integration---conformal mapping---location of zeros, Pure and
  Applied Mathematics.

\bibitem{LagMonOd79}
{\sc J.~C. Lagarias, H.~L. Montgomery, \andname\ A.~M. Odlyzko}, A bound for
  the least prime ideal in the {C}hebotarev density theorem, {\sl Invent.
  Math.} {\bf 54} (1979), no.~3, pp.~271--296.

\bibitem{LagOd77}
{\sc J.~C. Lagarias \andname\ A.~M. Odlyzko}, Effective versions of the
  {C}hebotarev density theorem, in {\sl Algebraic number fields: $L$-functions
  and Galois properties (Proc. Sympos., Univ. Durham, Durham, 1975)} (London),
  Academic Press, London, 1977, pp.~409--464.

\bibitem{Lang:ANT}
{\sc S.~Lang}, {\sl Algebraic number theory}, second ed., Graduate Texts in
  Mathematics, vol. 110, Springer-Verlag, New York, 1994.

\bibitem{Len:NFS}
{\sc A.~K. Lenstra \andname\ H.~W. Lenstra, Jr.} (eds.), {\sl The development
  of the number field sieve}, Lecture Notes in Math., vol. 1554,
  Springer-Verlag, Berlin, 1993.

\bibitem{LLL}
{\sc A.~K. Lenstra, H.~W. Lenstra, Jr., \andname\ L.~Lov{\'a}sz}, Factoring
  polynomials with rational coefficients, {\sl Math. Ann.} {\bf 261} (1982),
  no.~4, pp.~515--534.

\bibitem{Len:algANT}
{\sc H.~W. Lenstra, Jr.}, Algorithms in algebraic number theory, {\sl Bull.
  Amer. Math. Soc. (N.S.)} {\bf 26} (1992), no.~2, pp.~211--244.

\bibitem{Mig:ineq}
{\sc M.~Mignotte}, An inequality about factors of polynomials, {\sl Math.
  Comp.} {\bf 28} (1974), pp.~1153--1157.

\bibitem{NovocinStehleVillard2011}
{\sc A.~Novocin, D.~Stehlé, \andname\ G.~Villard}, An lll-reduction algorithm
  with quasi-linear time complexity, 2011, In \emph{Proceedings of STOC},
  pp.~403--412, version complète
  \url{http://perso.ens-lyon.fr/damien.stehle/L1.html}.

\bibitem{Oes:bour}
{\sc J.~Oesterlé}, Le problème de gauss sur le nombre de classes, {\sl
  Enseign. Math.} {\bf 34} (1988), pp.~43--67.

\bibitem{Pap}
{\sc C.~H. Papadimitriou}, {\sl Computational complexity}, Addison-Wesley,
  1994.

\bibitem{PerStein}
{\sc C.~Pernet \andname\ W.~Stein}, Fast computation of {H}ermite normal forms
  of random integer matrices, {\sl J. Number Theory} {\bf 130} (2010), no.~7,
  pp.~1675--1683.

\bibitem{RouZim}
{\sc F.~Rouillier \andname\ P.~Zimmermann}, Efficient isolation of polynomial
  real roots, {\sl Journal of Computational and Applied Mathematics} {\bf 162}
  (2003), no.~1, pp.~33--50.

\bibitem{Sch:prim}
{\sc R.~Schoof}, Four primality algorithms, \toappear,
  \url{http://www.mat.uniroma2.it/~schoof/millerrabinpom.pdf}.

\bibitem{Schoof2008}
{\sc R.~Schoof}, Computing {A}rakelov class groups, in {\sl Algorithmic number
  theory: lattices, number fields, curves and cryptography} (Cambridge), Math.
  Sci. Res. Inst. Publ., vol.~44, Cambridge Univ. Press, Cambridge, 2008,
  pp.~447--495.

\bibitem{Sik2004}
{\sc S.~Siksek}, The modular approach to diophantine equations, preprint,
  \url{http://igd.univ-lyon1.fr/~webeuler/ihp/LectureNotes_Siksek.dvi}.

\bibitem{Len-Ste}
{\sc P.~Stevenhagen \andname\ H.~W. Lenstra, Jr.}, {Chebotarëv and his density
  theorem.}, {\sl Math. Intell.} {\bf 18} (1996), no.~2, pp.~26--37.

\bibitem{Stevenhagen2008}
{\sc P.~Stevenhagen}, The arithmetic of number rings, in {\sl Algorithmic
  number theory: lattices, number fields, curves and cryptography} (Cambridge),
  Math. Sci. Res. Inst. Publ., vol.~44, Cambridge Univ. Press, Cambridge, 2008,
  pp.~209--266.

\bibitem{Sto2000}
{\sc A.~Storjohann}, Algorithms for matrix canonical forms, Ph.D. thesis, ETH
  Zurich, 2000, \url{http://www.cs.uwaterloo.ca/~astorjoh/dissA4.ps}.

\bibitem{TaniTh2011}
{\sc T.~Taniguchi \andname\ F.~Thorne}, Secondary terms in counting functions
  for cubic fields, 2011, \url{http://arxiv.org/abs/1102.2914}.

\bibitem{TzanakisWeger1989}
{\sc N.~Tzanakis \andname\ B.~M.~M. de~Weger}, On the practical solution of the
  {T}hue equation, {\sl J. Number Theory} {\bf 31} (1989), no.~2, pp.~99--132.

\bibitem{Hoe:fac}
{\sc M.~van Hoeij}, Factoring polynomials and the knapsack problem, {\sl J.
  Number Theory} {\bf 95} (2002), no.~2, pp.~167--189.

\bibitem{GatGer}
{\sc J.~von~zur Gathen \andname\ J.~Gerhard}, {\sl Modern computer algebra},
  Cambridge University Press, New York, 1999.

\end{thebibliography}
