T. A. Davis, Direct Methods for Sparse Linear Systems, ser. Fundamentals of Algorithms, 2006.

J. W. Liu, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.3, pp.375-395, 1987.
DOI : 10.1137/0608031

M. Jacquelin, L. Marchal, Y. Robert, and B. Ucar, On Optimal Tree Traversals for Sparse Matrix Factorization, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.556-567, 2011.
DOI : 10.1109/IPDPS.2011.60
URL : https://hal.archives-ouvertes.fr/hal-00945078

L. Eyraud-dubois, L. Marchal, O. Sinnen, and F. Vivien, Parallel Scheduling of Task Trees with Limited Memory, ACM Transactions on Parallel Computing, vol.2, issue.2, p.13, 2015.
DOI : 10.1145/2779052
URL : https://hal.archives-ouvertes.fr/hal-01160118

E. Agullo, On the out-of-core factorization of large sparse matrices Available: https, École normale supérieure de, 2008.

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

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, 1986.
DOI : 10.1145/7921.11325

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

E. Agullo, P. R. Amestoy, A. Buttari, A. Guermouche, J. L. Excellent et al., Robust memoryaware mappings for parallel multifrontal factorizations, SIAM J. Scientific Computing, vol.38, issue.3, 2016.
DOI : 10.1137/130938505
URL : https://hal.archives-ouvertes.fr/hal-00726644

S. Toledo, A survey of out-of-core algorithms in numerical linear algebra, External Memory Algorithms Proceedings of a DIMACS Workshop, pp.161-180, 1998.

E. Saule, H. M. Aktulga, C. Yang, E. G. Ng, and Ü. V. Çatalyürek, An out-of-core taskbased middleware for data-intensive scientific computing, pp.647-667978, 2015.

L. A. Belady, A study of replacement algorithms for a virtual-storage computer, IBM Systems Journal, vol.5, issue.2, pp.78-101, 1966.
DOI : 10.1147/sj.52.0078

M. Lee, P. Michaud, J. S. Sim, and D. Nyang, A simple proof of optimality for the MIN cache replacement policy, Information Processing Letters, vol.116, issue.2, pp.168-170, 2016.
DOI : 10.1016/j.ipl.2015.09.004
URL : https://hal.archives-ouvertes.fr/hal-01199424

E. Mäkinen, Generating random binary trees ??? A survey, Information Sciences, vol.115, issue.1-4, pp.123-136, 1999.
DOI : 10.1016/S0020-0255(98)10080-4

D. E. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, pp.201-213, 2002.
DOI : 10.1007/s101070100263
URL : http://arxiv.org/abs/cs/0102001