no. 1
Implementing the Round Four maximal order algorithm
Journal de théorie des nombres de Bordeaux, Tome 6 (1994) no. 1, pp. 39-80. 
@article{JTNB_1994__6_1_39_0,
     author = {Ford, David and Letard, Pascal},
     title = {Implementing the {Round} {Four} maximal order algorithm},
     journal = {Journal de th\'eorie des nombres de Bordeaux},
     pages = {39--80},
     publisher = {Universit\'e Bordeaux I},
     volume = {6},
     number = {1},
     year = {1994},
     mrnumber = {1305287},
     zbl = {0817.11064},
     language = {en},
     url = {http://www.numdam.org/item/JTNB_1994__6_1_39_0/}
}
TY  - JOUR
AU  - Ford, David
AU  - Letard, Pascal
TI  - Implementing the Round Four maximal order algorithm
JO  - Journal de théorie des nombres de Bordeaux
PY  - 1994
SP  - 39
EP  - 80
VL  - 6
IS  - 1
PB  - Université Bordeaux I
UR  - http://www.numdam.org/item/JTNB_1994__6_1_39_0/
LA  - en
ID  - JTNB_1994__6_1_39_0
ER  - 
%0 Journal Article
%A Ford, David
%A Letard, Pascal
%T Implementing the Round Four maximal order algorithm
%J Journal de théorie des nombres de Bordeaux
%D 1994
%P 39-80
%V 6
%N 1
%I Université Bordeaux I
%U http://www.numdam.org/item/JTNB_1994__6_1_39_0/
%G en
%F JTNB_1994__6_1_39_0
Ford, David; Letard, Pascal. Implementing the Round Four maximal order algorithm. Journal de théorie des nombres de Bordeaux, Tome 6 (1994) no. 1, pp. 39-80. http://www.numdam.org/item/JTNB_1994__6_1_39_0/

1 A. Ash, R. Pinch, R. Taylor, An Â4 extension of Q attached to a non-selfdual autormorphic form on GL(3), Mathennatische Annalen 291 (1991), 753-766. | MR | Zbl

2 R. Böffgen, Der Algorithmus von Ford/Zassenhaus zur Benechnung von Genzheitsbasen. in Polynomalgebren, Annales Universitatis Saraviensis, Series Mathematicae 1 (1987), no. 3, 60-129. | MR | Zbl

3 R. Böffgen, M.A. Reichert, Computing the Decomposition of Primes p and p-adic Absolute Values in Semi-simple Algebras over Q, Journal of Symbolic Computation 4 (1987), 3-10. | MR | Zbl

4 R.J. Bradford, On the Computation of Iritegnal Bases and Defects of Integrity, PhD Dissertation, University of Bath, 1988.

5 B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, S.M. Watt, Maple V Language Reference Manual, Springer-Verlag, New York, 1991. | Zbl

6 H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, New York, 1993. | MR | Zbl

7 D. Ford, On the Computation of the Maximal Order in a Dedekind Domain, PhD Dissertation, Ohio State University, 1978.

8 D. Ford, The Construction of Maximal Orders over a Dedekind Domain, Journal of Symbolic Computation 4 (1987), 69-75. | MR | Zbl

9 M. Pohst, H. Zassenhaus, Algorithmic Algebraic Number Theory, Cambridge University Press, Cambridge, 1989. | MR | Zbl

10 O. Zariski, P. Samuel, Commutative Algebra, Vol I, Van Nostrand, Princeton, New Jersey, 1958. | MR | Zbl

11 H. Zassenhaus, On Hensel Factorization II, Symposia Mathematica. XV (1975), Academic Press, London, 499-513. | MR | Zbl

12 H. Zimmer, Computational Problems, Methods and Results in Algebraic Number Theory, Lecture Notes in Mathematics 262, Springer-Verlag, 1972. | MR | Zbl