J. W. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software, vol.12, issue.3, pp.249-264, 1986.
DOI : 10.1145/7921.11325

J. Hong and H. Kung, I/O complexity: The red-blue pebble game, STOC'81: Proceedings of the 13th ACM symposium on Theory of Computing, pp.326-333, 1981.

R. Schreiber, A New Implementation of Sparse Gaussian Elimination, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.256-276, 1982.
DOI : 10.1145/356004.356006

J. W. Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990.
DOI : 10.1137/0611010

I. S. Duff and J. K. Reid, The Multifrontal Solution of Indefinite Sparse Symmetric Linear, ACM Transactions on Mathematical Software, vol.9, issue.3, pp.302-325, 1983.
DOI : 10.1145/356044.356047

J. W. Liu, The Multifrontal Method for Sparse Matrix Solution: Theory and Practice, SIAM Review, vol.34, issue.1, pp.82-109, 1992.
DOI : 10.1137/1034004

C. Ashcraft and R. Grimes, The influence of relaxed supernode partitions on the multifrontal method, ACM Transactions on Mathematical Software, vol.15, issue.4, pp.291-309, 1989.
DOI : 10.1145/76909.76910

R. Sethi and J. Ullman, The Generation of Optimal Code for Arithmetic Expressions, Journal of the ACM, vol.17, issue.4, pp.715-728, 1970.
DOI : 10.1145/321607.321620

R. Sethi, Complete register allocation problems, STOC'73: Proceedings of the fifth annual ACM symposium on Theory of computing, pp.182-195, 1973.
DOI : 10.1137/0204020
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7491

J. R. Gilbert, T. Lengauer, and R. E. Tarjan, The Pebbling Problem is Complete in Polynomial Space, SIAM Journal on Computing, vol.9, issue.3, pp.513-524, 1980.
DOI : 10.1137/0209038

J. E. Savage, Models of Computation: Exploring the Power of Computing, 1997.

P. R. Amestoy, I. S. Duff, J. Koster, and J. Excellent, A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
DOI : 10.1137/S0895479899358194
URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, A. Guermouche, J. Excellent, and S. Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, vol.32, issue.2, pp.136-156, 2006.
DOI : 10.1016/j.parco.2005.07.004
URL : https://hal.archives-ouvertes.fr/hal-00358623

M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979.

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, pp.201-213, 2002.
DOI : 10.1007/s101070100263

G. Karypis and V. Kumar, MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices Version 4.0, 1998.

J. R. Gilbert, G. L. Miller, and S. Teng, Geometric Mesh Partitioning: Implementation and Experiments, SIAM Journal on Scientific Computing, vol.19, issue.6, pp.2091-2110, 1998.
DOI : 10.1137/S1064827594275339
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3807