G. La-bibliothèque-linbox and .. , 213 12.3 SIMPHOM : un package pour, Sommaire 12.1 Corps finis dans, p.217

J. Abbott, V. Shoup, and P. Zimmermann, ? Factorisation in £ ¥ : the searching phase, pp.2000-163, 2000.

A. V. Aho, J. E. Hopcroft, and D. Jeffrey, Ullman. ? The Design and Analysis of Computer Algorithms, 1974.

P. Amestoy, F. Pellegrini, and J. Roman, ? Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, Proceeding of IRREGULAR'99, pp.986-995, 1999.

R. Patrick, T. A. Amestoy, I. S. Davis, and . Duff, ? An approximate minimum degree ordering algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996.

E. Babson, A. Björner, S. Linusson, J. Shareshian, and V. Welker, ? Complexes of not § -connected graphs. Topology, pp.271-299, 1999.

A. Bachem and R. Kannan, ? Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM Journal on Computing, vol.8, issue.4, pp.499-507, 1979.

H. Erwin and . Bareiss, ? Sylvester's identity and multistep integer-preserving Gaussian elimination, Mathematics of Computation, vol.22, issue.103, pp.565-578, 1968.

B. Beckermann and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-823, 1994.
DOI : 10.1137/S0895479892230031

M. Ben-or, Probabilistic algorithms in finite fields. Dans : 22th Annual Symposium on Foundations of Computer Science, octobre 1981, pp.394-398

E. R. Berlekamp, Factoring Polynomials Over Finite Fields, Bell System Technical Journal, vol.46, issue.8, pp.1853-1859, 1967.
DOI : 10.1002/j.1538-7305.1967.tb03174.x

E. R. Berlekamp, ? Factoring polynomials over large finite fields, Mathematics of Computation, vol.24, issue.11, 1970.

P. Berman and G. Schnitger, On the Performance of the Minimum Degree Ordering for Gaussian Elimination, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.83-88, 1990.
DOI : 10.1137/0611005

L. Bernardin, B. Char, and E. Kaltofen, Symbolic computation in Java, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.29-31
DOI : 10.1145/309831.309946

R. Robert, D. O. Bitmead-et-brian, and . Anderson, ? Asymptotically fast solution of Toeplitz and related systems of linear equations, Linear Algebra and its Applications, vol.34, pp.103-116, 1980.

A. Björner, L. Lovász, and T. Sinisa, Chessboard Complexes and Matching Complexes, Journal of the London Mathematical Society, vol.49, issue.1, pp.25-39, 1994.
DOI : 10.1112/jlms/49.1.25

A. Björner and V. Welker, Complexes of Directed Graphs, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.413-424, 1999.
DOI : 10.1137/S0895480198338724

E. Guy and . Blelloch, ? NESL : A Nested Data-Parallel Language (Version 3.1). ? Rapport technique n CMU-CS-95-170, 1995.

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall et al., Cilk, ACM SIGPLAN Notices, vol.30, issue.8, pp.207-216, 1995.
DOI : 10.1145/209937.209958

A. Brauer, Limits for the characteristic roots of a matrix, Duke Mathematical Journal, vol.13, issue.3, pp.387-395, 1946.
DOI : 10.1215/S0012-7094-46-01333-6

A. Brauer, Limits for the characteristic roots of a matrix. II., Duke Mathematical Journal, vol.14, issue.1, pp.21-26, 1947.
DOI : 10.1215/S0012-7094-47-01403-8

C. Brezinski, M. R. Zaglia, and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numerical Algorithms, vol.10, issue.2, pp.261-284, 1991.
DOI : 10.1007/BF02142326

J. Briat, I. Ginzburg, M. Pasin, and B. Plateau, ? Athapascan runtime : efficiency for irregular problems. Dans : EURO-PAR'97 Parallel Processing, ? Lecture Notes in Computer Science, vol.1997, issue.1300, pp.591-600

A. Richard, S. Brualdi, and . Mellendorf, ? Regions in the complex plane containing the eigenvalues of a matrix, American Mathematical Monthly, vol.101, issue.10, pp.975-985, 1994.

J. Buchmann, M. J. Jacobson, and J. Et-edlyn-teske, On some computational problems in finite abelian groups, Mathematics of Computation, vol.66, issue.220, pp.1663-1687, 1997.
DOI : 10.1090/S0025-5718-97-00880-6

M. David and . Burton, ? Elementary number theory, quatrième édition, International series in Pure and Applied Mathematics, 1998.

G. David, H. Cantor, and . Zassenhaus, ? A new algorithm for factoring polynomials over finite fields, Mathematics of Computation, vol.36, issue.154, pp.587-592, 1981.

A. Carissimi, ? Le noyau exécutif Athapascan-0 et l'exploitation de la multiprogrammation légère sur les grappes de stations multiprocesseurs, Thèse de Doctorat en informatique, 1999.

N. Carriero and D. Gelernter, How to write parallel programs: a guide to the perplexed, ACM Computing Surveys, vol.21, issue.3, pp.323-357, 1989.
DOI : 10.1145/72551.72553

B. Carton and F. Giquel, ? Data processing using Athapascan-1. ? Rapport technique, Apache, juin 1999

G. Cavalheiro, F. Galilée, and J. Roch, Athapascan-1 : Parallel programming with asynchronous tasks

G. Cavalheiro, Athapascan-1 : Interface genérique pour l'ordonnancement dans un environnement d'exécution parallèle, Thèse de Doctorat en informatique, 1999.

S. Cavallar, ? Strategies in filtering in the number field sieve. ? Rapport technique, Centrum voor Wiskunde en Informatica, 31 mai, MAS-R0012.ps.Z, 2000.

T. Wu, J. Chou, and G. E. Collins, ? Algorithms for the solution of systems of linear Diophantine equations, SIAM Journal on Computing, vol.11, issue.4, pp.687-708, 1982.

J. Cocteau, ? Les mariés de la tour Eiffel, 1921.

D. Coppersmith, ? Fast evaluation of logarithms in fields of characterstic two, IEEE Transactions on Information Theory, pp.587-594, 1984.

D. Coppersmith, Solving linear equations over GF(2): block Lanczos algorithm, Linear Algebra and its Applications, vol.192, pp.33-60, 1993.
DOI : 10.1016/0024-3795(93)90235-G

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.
DOI : 10.2307/2153413

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396

L. Dagum and R. Menon, OpenMP: an industry standard API for shared-memory programming, IEEE Computational Science and Engineering, vol.5, issue.1, pp.46-55, 1998.
DOI : 10.1109/99.660313

M. Demazure, ? Cours d'algèbre. Primalité, Divisibilité, Codes, 1997.

J. J. Dongarra, J. D. Croz, S. Hammarling, and I. Duff, A set of level 3 basic linear algebra subprograms, ACM Transactions on Mathematical Software, vol.16, issue.1, pp.1-17, 1990.
DOI : 10.1145/77626.79170

J. J. Dongarra, S. W. Otto, M. Snir, and D. Walker, ? An Introduction to the MPI Standard. ? Rapport technique n UT-CS-95-274, 1995.

M. Doreille, ? Calcul Formel et Parallélisme : résolution de systèmes linéaires denses, structurés et creux, 1995.

M. Doreille, Athapascan-1 : vers un modèle de programmation parallèle adapté au calcul scientifique, Thèse de Doctorat en mathématiques appliquées, 1999.

J. Dornstetter, On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.), IEEE Transactions on Information Theory, vol.33, issue.3, pp.428-431, 1987.
DOI : 10.1109/TIT.1987.1057299

J. Dumas, ? Calcul parallèle du polynôme minimal entier en Athapascan-1 et Linbox, pp.119-124, 2000.

J. Dumas, F. Heckenbach, B. D. Saunders, and V. Welker, ? Simplicial Homology, a (proposed) share package for GAP, mars, Manual, 2000.

J. Dumas, B. D. Saunders, and G. Villard, Integer Smith form via the valence, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.2000-163, 2000.
DOI : 10.1145/345542.345590

D. T. Peter, L. Elliott, and . Murata, ? On the average of the least primitive root modulo p, Journal of The london Mathematical Society, vol.56, issue.2, pp.435-454, 1997.

J. Faugère, ? Parallelization of Gröbner basis PASCO '94, Hagenberg/Linz, Austria, édité par Hoon Hong, 26?28 septembre 1994. ? Lecture notes series in computing, First International Symposium on Parallel Symbolic Computation, pp.124-132

J. Faugère, ? A new efficient algorithm for computing Gröbner bases ( ). ? Rapport technique, Laboratoire d'Informatique de Paris 6, janvier 1999

P. Fitzpatrick and G. H. Norton, Linear recurrence relations and an extended subresultant algorithm, Proceedings of the 3rd International Colloquium on Coding Theory and Applications, édité par G. Cohen et J. Wolfmann, novembre 1989. ? Lecture Notes in Computer Science, pp.232-246
DOI : 10.1007/BFb0019862

J. Friedman, Computing Betti numbers via combinatorial Laplacians, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp.22-24

F. Galilée, Athapascan-1 : interprétation distribuée du flot de données d'un programme parallèle, Thèse de Doctorat en informatique, 1999.

. Feliks-rudimovich and . Gantmacher, ? The Theory of Matrices, 1959.

J. Von-zur-gathen and J. Gerhard, ? Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

D. Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems, vol.7, issue.1, pp.80-112, 1985.
DOI : 10.1145/2363.2433

W. Mark and . Giesbrecht, ? Fast computation of the Smith Normal Form of an integer matrix, Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation : July 10?12, pp.110-118, 1995.

W. Mark and . Giesbrecht, ? Probabilistic computation of the Smith Normal Form of a sparse integer matrix, Lecture Notes in Computer Science, vol.1122, pp.173-186, 1996.

H. Gene, . Golub, and F. Charles, Van Loan. ? Matrix computations, troisième édition, Johns Hopkins Studies in the Mathematical Sciences, 1996.

T. Granlund, ? The GNU multiple precision arithmetic library, 2000.

R. G. Grimes, J. G. Lewis, and H. D. Simon, A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.1, pp.228-272, 1994.
DOI : 10.1137/S0895479888151111

J. L. , H. , and K. S. Mccurley, ? A rigorous subexponential algorithm for computation of class groups, Journal, vol.2, pp.837-850, 1989.

B. Hendrickson and E. Rothberg, Improving the Run Time and Quality of Nested Dissection Ordering, SIAM Journal on Scientific Computing, vol.20, issue.2, pp.468-489, 1999.
DOI : 10.1137/S1064827596300656

O. H. Ibarra, S. Moran, and R. Hui, A generalization of the fast LUP matrix decomposition algorithm and applications, Journal of Algorithms, vol.3, issue.1, pp.45-56, 1982.
DOI : 10.1016/0196-6774(82)90007-4

S. Costas and . Iliopoulos, ? Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix, SIAM Journal on Computing, vol.18, issue.4, pp.658-669, 1989.

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Mathematics of Computation, vol.64, pp.777-806, 1995.

E. Kaltofen, Challenges of Symbolic Computation: My Favorite Open Problems, Journal of Symbolic Computation, vol.29, issue.6, pp.891-919, 2000.
DOI : 10.1006/jsco.2000.0370

E. Kaltofen, S. Mukkai, B. D. Krishnamoorthy, and . Saunders, Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices, Proceedings of the 1987 European Conference on Computer Algebra, édité par James H. Davenport, juin 1989. ? Lecture Notes in Computer Science, pp.317-322
DOI : 10.1007/3-540-51517-8_134

E. Kaltofen, S. Mukkai, B. D. Krishnamoorthy, and . Saunders, Parallel algorithms for matrix normal forms, Linear Algebra and its Applications, vol.136, pp.189-208, 1990.
DOI : 10.1016/0024-3795(90)90028-B

E. Kaltofen, W. Lee, and A. Austin, Lobo. ? Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm, pp.2000-163, 2000.

E. Kaltofen and A. Lobo, Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields, Proceedings of High Performance Computing, 1996.
DOI : 10.1007/PL00008266

E. Kaltofen and V. Pan, Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.714-723, 1992.
DOI : 10.1109/SFCS.1992.267779

E. Kaltofen and V. Pan, ? Parallel solution of Toeplitz and Toeplitzlike linear systems over fields of small positive characteristic, First International Symposium on Parallel Symbolic Computation, pp.26-28, 1994.

E. Kaltofen and B. D. Saunders, On wiedemann's method of solving sparse linear systems, ? Lecture Notes in Computer Science, vol.539, pp.29-38
DOI : 10.1007/3-540-54522-0_93

E. Kaltofen and V. Shoup, Fast polynomial factorization over high algebraic extensions of finite fields, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.97-97, 1997.
DOI : 10.1145/258726.258777

R. K. Karp, M. Luby, and F. Meyer-auf-der-heide, ? Efficient PRAM simulation on a distributed memory machine. Algorithmica, pp.1996-517

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1999.
DOI : 10.1137/S1064827595287997

E. Donald and . Knuth, The Art of Computer Programming, ? Seminumerical Algorithms. ? Reading, vol.2, 1997.

N. Koblitz-berlin, /. Germany, . Heidelberg, /. Germany, and . London, ? A course in number theory and cryptography Graduate texts in mathematics, 1987.

W. Wolfgang, Küchlin (éditeur) ? ISSAC'97, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp.21-23

V. Kumar and A. Grama, Anshul Gupta et George Karypis. ? Introduction to parallel computing. Design and analysis of algorithms. ? The Benjamin, 1994.

V. L. Kurakin, ? Representations over / of linear recurring sequence of maximal period over ¡ £ ¢ ¤, Discrete Mathematics and Applications, vol.3, issue.3, pp.275-296, 1993.

V. L. Kurakin, The first coordinate sequence of a linear recurrence of maximal period over a Galois ring, Discrete Mathematics and Applications, vol.4, issue.2, pp.129-141, 1994.
DOI : 10.1515/dma.1994.4.2.129

D. Laksov and A. Thorup, Counting Matrices with Coordinates in Finite Fields and of Fixed Rank., MATHEMATICA SCANDINAVICA, vol.74, issue.1, pp.19-33, 1994.
DOI : 10.7146/math.scand.a-12477

A. Brian, . Lamacchia, and M. Andrew, Solving large sparse linear systems over finite fields, Lecture Notes in Computer Science, vol.537, pp.109-133, 1991.

R. Lambert, Computational aspects of discrete logarithms . ? Doctor of Philosophy Thesis in Electrical engineering, 1996.

P. Lascaux and R. Théodor, ? Analyse numérique matricielle appliquée à l'art de l'ingénieur, Méthodes itératives, 1994.

R. Hong, B. D. Lee, and . Saunders, ? Fraction free Gaussian elimination for sparse matrices, Journal of Symbolic Computation, vol.19, issue.5, pp.393-402, 1995.

H. Lenstra, Factoring Integers with Elliptic Curves, The Annals of Mathematics, vol.126, issue.3, pp.649-673, 1987.
DOI : 10.2307/1971363

R. H. Lewis, ? Fermat, a computer algebra system for polynomial and matrix computations, 1997.

A. Lobo, ? Matrix-free linear system solving and applications to symbolic computation. ? Doctor of Philosophy Thesis in Computer Science, Faculty of Rensselaer Polytechnic Institute, 1995.

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

J. Massias and G. Robin, Bornes effectives pour certaines fonctions concernant les nombres premiers, Journal de Th??orie des Nombres de Bordeaux, vol.8, issue.1, pp.213-238, 1996.
DOI : 10.5802/jtnb.166

M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter et al., ? Maple V Programming Guide, With the assistance of J. S. Devitt, M. L. Hansen, D. Redfern, and, 1998.

B. Mourrain and H. Prieto, ? The ALP reference manual : A framework for symbolic and numeric computations, 2000.

M. ?. Forum and . Mpi, A Message Passing Interface Ketan Mulmuley. ? A fast parallel algorithm to compute the rank of a matrix, Proceedings, Supercomputing '93, pp.878-883, 1987.

J. R. Munkres, ? Elements of algebraic topology, chapitre The computability of homology groups, pp.53-61, 1994.

L. Murata, On the magnitude of the least prime primitive root, Journal of Number Theory, vol.37, issue.1, pp.47-66, 1991.
DOI : 10.1016/S0022-314X(05)80024-1

R. ?. Namyst, un environnement pour une conception portable et une exécution efficace des applications parallèles irrégulières, Thèse de doctorat, 1997.

P. Neruda, ? Oda al libro (II) Dans : Odas Elementales, 1954.

I. Neumann and W. Wilhemi, A parallel algorithm for achieving the Smith Normal Form of an integer matrix, Parallel Computing, vol.22, issue.10, pp.1399-1412, 1996.
DOI : 10.1016/S0167-8191(96)00040-3

H. Graham and . Norton, ? On the minimal realizations of a finite sequence, Journal of Symbolic Computation, vol.20, issue.1, pp.93-115, 1995.

H. Graham and . Norton, ? On minimal realization over a finite chain ring. Designs , Codes, and Cryptography, pp.161-178, 1999.

H. Graham and . Norton, ? On shortest linear recurrences, Journal of Symbolic Computation, vol.27, issue.3, pp.325-349, 1999.

M. Andrew and . Odlyzko, ? Discrete logarithms : The past and the future. Designs , Codes, and Cryptography, pp.129-145, 2000.

P. O. Dianne and . Leary, ? The block conjugate gradient algorithm and related methods, Linear Algebra and its Applications, vol.29, pp.293-322, 1980.

T. Oliveira and . Silva, ? Least primitive root of prime numbers, 3 janvier, 2000.

P. Ozello, ? Calcul exact des formes de Jordan et de Frobenius d'une matrice, Thèse de Doctorat en Informatique et Mathématiques Appliquées, 1987.

N. Beresford, D. R. Parlett, . Taylor, A. Zhishun, and . Liu, ? A look-ahead Lanczos algorithm for unsymmetric matrices, Mathematics of Computation, vol.44, issue.169, pp.105-124, 1985.

O. Penninga, ? Finding column dependencies in sparse matrices over IF by block Wiedemann The Netherlands, 21 août, MAS-R9819.ps.Z, 1998.

J. M. Pollard, A monte carlo method for factorization, BIT, vol.29, issue.129, pp.331-334, 1975.
DOI : 10.1007/BF01933667

O. Michaël and . Rabin, ? A probabilistic algorithm for testing primality, Journal of Number Theory, vol.12, 1980.

J. Victor and . Rayward-smith, ? On computing the Smith normal form of an integer matrix, ACM Transactions on Mathematical Software, vol.5, issue.4, pp.451-456, 1979.

A. James, . Reeds, J. A. Neil, and . Sloane, ? Shift-register synthesis (modulo )

V. Reiner and J. Roberts, ? Minimal resolutions and the homology of matching and chessboard complexes, Journal of Algebraic Combinatorics, vol.11, issue.2, pp.135-154, 2000.
DOI : 10.1023/A:1008728115910

C. Martin, M. S. Rinard, and . Lam, ? The design, implementation, and evaluation of Jade, ACM Transactions on Programming Languages and Systems, vol.20, issue.3, pp.483-545, 1998.

J. Roch and G. Villard, ? Parallel computer algebra, a survey, pp.97-97, 1997.

J. Barkley-rosser and L. Schoenfeld, ? Approximate formulas for some functions of prime numbers, Illinois Journal of Mathematics, vol.6, pp.64-94, 1962.

E. Rothberg and C. Stanley, Node Selection Strategies for Bottom-Up Sparse Matrix Ordering, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.3, pp.682-695, 1998.
DOI : 10.1137/S0895479896302692

Y. Saad, ? On the Lanczos method for solving symmetric systems with several right-hand sides, Mathematics of Computation, vol.48, issue.178, pp.651-662, 1987.

Y. Saad, ? Iterative Methods for Sparse Linear Systems, chapitre Krylov Subspace Methods, pp.144-229, 1996.

Y. Saad, ? Iterative Methods for Sparse Linear Systems, chapitre Storage schemes, pp.84-86, 1996.

V. Shoup, Searching for primitive roots in finite fields, Mathematics of Computation, vol.58, issue.197, pp.369-380, 1992.
DOI : 10.1090/S0025-5718-1992-1106981-9

V. Shoup, Fast Construction of Irreducible Polynomials over Finite Fields, Journal of Symbolic Computation, vol.17, issue.5, pp.371-391, 1994.
DOI : 10.1006/jsco.1994.1025

V. ?. Shoup and . Ntl3, 7a : A library for doing number theory, 2000.

E. Sibert, H. F. Mattson, and P. Jackson, Finite field arithmetic using the connection machine, Proceedings of the second International Workshop on Parallel Algebraic Computation, pp.51-61, 1990.
DOI : 10.1007/3-540-55328-2_4

H. D. Simon, The Lanczos algorithm with partial reorthogonalization, Mathematics of Computation, vol.42, issue.165, pp.115-142, 1984.
DOI : 10.1090/S0025-5718-1984-0725988-X

H. and S. Smith, On Systems of Linear Indeterminate Equations and Congruences, Philosophical Transactions of the Royal Society of London, vol.151, issue.0, pp.293-326, 1861.
DOI : 10.1098/rstl.1861.0016

A. Storjohann, Near optimal algorithms for computing Smith normal forms of integer matrices, Proceedings of the 1996 international symposium on Symbolic and algebraic computation , ISSAC '96, pp.24-26
DOI : 10.1145/236869.237084

A. Storjohann, ? Algorithms for Matrix Canonical Forms. ? Doctor of Philosophy Thesis in Computer Science, Institut für Wissenschaftliches Rechnen, ETH-Zentrum, 2000.

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411

S. Vaidy and . Sunderam, ? PVM : a framework for parallel distributed computing . Concurrency, practice and experience, pp.315-339, 1990.

O. Taussky, Bounds for characteristic roots of matrices, Duke Mathematical Journal, vol.15, issue.4, pp.1043-1044, 1948.
DOI : 10.1215/S0012-7094-48-01593-2

J. Teitelbaum, Euclid's algorithm and the Lanczos method over finite fields, Mathematics of Computation, vol.67, issue.224, pp.1665-1678, 1998.
DOI : 10.1090/S0025-5718-98-00973-9

A. M. Turing, J. L. Édité-par, and . Britton, ROUNDING-OFF ERRORS IN MATRIX PROCESSES, Cité par Felipe Cucker à ISSAC, pp.287-308, 2000.
DOI : 10.1093/qjmam/1.1.287

R. S. Varga, ? Matrix iterative analysis, 2000.

S. Richard, A. Varga, and . Krautstengl, ? On gersgörin-type problems and ovals of cassini, Electronic Transactions on Numerical Analysis, vol.8, pp.15-20, 1999.

G. Villard, Fast Parallel Algorithms for Matrix Reduction to Normal Forms, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.6, pp.511-538, 1997.
DOI : 10.1007/s002000050089

G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract), Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.97-97, 1997.
DOI : 10.1145/258726.258742

G. Villard, ? A study of Coppersmith's block Wiedemann algorithm using matrix polynomials. ? Rapport technique n 975?IM, 1997.

G. Villard, Computing the Frobenius Normal Form of a Sparse Matrix, Proceedings of the Third International Workshop on Computer Algebra in Scientific Computing, pp.5-9, 2000.
DOI : 10.1007/978-3-642-57201-2_30

D. Wal, A. P. Wallis, J. Street, M. Seberry-wallis-stephen, P. A. Watt et al., Combinatorics : Room Squares, Sum-Free Sets The Numerical Algorithms Group, Hadamard Matrices. ? Berlin Steinbach et Robert S. Sutor. ? AXIOM Library Compiler User Guide. ? Rapport technique, 1972.

H. Douglas and . Wiedemann, ? Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.

M. ?. Yannakakis, Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981.
DOI : 10.1137/0602010

R. Zippel, ? Effective Polynomial Computation, chapitre Zero Equivalence Testing, pp.189-206, 1993.