T. A. Davis, Direct Methods for Sparse Linear Systems, ser. Fundamentals of Algorithms, 2006.
DOI : 10.1137/1.9780898718881

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, A. Buttari, A. Guermouche, and F. Lopez, Multifrontal QR Factorization for Multicore Architectures over Runtime Systems, Euro-Par 2013 Parallel Processing - 19th International Conference, pp.521-532, 2013.
DOI : 10.1007/978-3-642-40047-6_53
URL : https://hal.archives-ouvertes.fr/hal-01220611

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 outof-core multifrontal method for sparse factorization, ACM Transaction on Mathematical Software, 1986.

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

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

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07), pp.401-409, 2007.
DOI : 10.1109/CCGRID.2007.101
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.3658

C. Lam, T. Rauber, G. Baumgartner, D. Cociorva, and P. Sadayappan, Memory-optimal evaluation of expression trees involving large objects, Computer Languages, Systems & Structures, vol.37, issue.2, pp.63-75, 2011.
DOI : 10.1016/j.cl.2010.09.003

E. Agullo, P. R. Amestoy, A. Buttari, A. Guermouche, J. L. Excellent et al., Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, SIAM Journal on Scientific Computing, vol.38, issue.3, 2016.
DOI : 10.1137/130938505
URL : https://hal.archives-ouvertes.fr/hal-00726644

G. Aupy, C. Brasseur, and L. Marchal, Dynamic memoryaware task-tree scheduling, Research Report, vol.8966, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01472062