\begin{thebibliography}{10}

\bibitem{banas}
W.~Banaszczyk.
\newblock New bounds in some transference theorems in the geometry of number.
\newblock {\em Math.\ Ann}, 296:625--635, 1993.

\bibitem{Labahn}
Bernhard Beckermann and George Labahn.
\newblock A uniform approach for the fast computation of matrix-type pade
  approximants.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 15:804--823, July 1994.

\bibitem{BHKS}
Karim Belabas, Mark van Hoeij, J\"urgen Kl\"uners, and Allan Steel.
\newblock Factoring polynomials over global fields.
\newblock {\em J. Th\'eor. Nombres Bordeaux}, 21:15--39, 2009.

\bibitem{CasMcKay}
D.~Casperson and J.~McKay.
\newblock Symmetric functions, $m$-sets, and {G}alois groups.
\newblock {\em Math. Comput.}, 63:749--757, 1994.

\bibitem{polred}
Henri Cohen and Francisco Diaz~y Diaz.
\newblock A polynomial reduction algorithm.
\newblock {\em S\'eminaire de Th\'eorie des Nombres de Bordeaux 2}, 3:351--360,
  1991.

\bibitem{schost}
Xavier Dahan and \'{E}ric Schost.
\newblock Sharp estimates for triangular sets.
\newblock In {\em Proceedings of the 2004 international symposium on Symbolic
  and algebraic computation}, ISSAC '04, pages 103--110, New York, NY, USA,
  2004. ACM.

\bibitem{Harm}
H.~Derksen.
\newblock An algorithm to compute generalized {P}ad\'e-{H}ermite forms.
\newblock Preprint, Catholic University Nijmegen, 1994.

\bibitem{dixon}
J~Dixon.
\newblock Computing subfields in algebraic number fields.
\newblock {\em J. Austral. Math. Soc. Series A}, 49:434--448, 1990.

\bibitem{FLINT}
W.~Hart.
\newblock Flint.
\newblock open-source C-library \texttt{http://www.flintlib.org}.

\bibitem{hoeij}
Mark van Hoeij.
\newblock Factoring polynomials and the knapsack problem.
\newblock {\em J. Number Theory}, 95:167--189, 2002.

\bibitem{Hul}
A.~Hulpke.
\newblock Block systems of a {G}alois group.
\newblock {\em Exp. Math.}, 4(1):1--9, 1995.

\bibitem{Kl3}
J.~Kl{\"u}ners.
\newblock {\em {\"U}ber die Berechnung von Automorphismen und Teilk{\"o}rpern
  algebraischer Zahlk{\"o}rper}.
\newblock {D}issertation, Technische Universit{\"a}t Berlin, 1997.

\bibitem{Kl4}
J.~Kl{\"u}ners.
\newblock On computing subfields - a detailed description of the algorithm.
\newblock {\em Journal de Th\'eorie des Nombres de Bordeaux}, 10:243--271,
  1998.

\bibitem{LaVa}
D.~Lazard and A.~Valibouze.
\newblock Computing subfields: Reverse of the primitive element problem.
\newblock In A.~Galligo F.~Eyssete, editor, {\em MEGA-92, Computational
  algebraic geometry}, volume 109, pages 163--176. Birkh\"auser, Boston, 1993.

\bibitem{LLL}
A.~K. Lenstra, H.~W. Lenstra~Jr., and L.~Lov\'{a}sz.
\newblock Factoring polynomials with rational coefficients.
\newblock {\em Math. Ann.}, 261:515--534, 1982.

\bibitem{Maple10}
Michael~B. Monagan, Keith~O. Geddes, K.~Michael Heal, George Labahn, Stefan~M.
  Vorkoetter, James McCarron, and Paul DeMarco.
\newblock {\em Maple~10 Programming Guide}.
\newblock Maplesoft, Waterloo ON, Canada, 2005.

\bibitem{Nar}
W\l{}adis\l{}aw Narkiewicz.
\newblock {\em Elementary and Analytic Theory of Algebraic Numbers}.
\newblock Springer, 2004.

\bibitem{isopaper}
M.~v.~Hoeij and V.~Pal.
\newblock Isomorphisms of algebraic number fields.
\newblock arXiv:1012.0096v2, 2010.

\bibitem{LATIN}
Mark van Hoeij and Andrew Novocin.
\newblock Gradual sub-lattice reduction and a new complexity for factoring
  polynomials.
\newblock In {\em LATIN}, pages 539--553, 2010.

\bibitem{qrpert}
G.~Villard.
\newblock Certification of the {QR} factor {R}, and of lattice basis
  reducedness.
\newblock In {\em Proceedings of the 2007 {I}nternational {S}ymposium on
  {S}ymbolic and {A}lgebraic {C}omputation ({ISSAC'07})}, pages 361--368, 2007.

\end{thebibliography}
