A. Umut, G. E. Acar, R. D. Blelloch, and . Blumofe, The data locality of work stealing, Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (SPAA'00), pp.1-12, 2000.

E. Agullo, P. Amestoy, A. Buttari, A. Guermouche, L. Jean-yves et al., Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, SIAM conf. on Parallel Processing for Scientific Computing (PP12), 2012.
DOI : 10.1137/130938505
URL : https://hal.archives-ouvertes.fr/hal-00726644

E. Guy, P. B. Blelloch, Y. Gibbons, and . Matias, Provably efficient scheduling for languages with fine-grained parallelism, J. ACM, vol.46, issue.2, pp.281-321, 1999.

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall et al., Cilk: An Efficient Multithreaded Runtime System, Journal of Parallel and Distributed Computing, vol.37, issue.1, pp.55-69, 1996.
DOI : 10.1006/jpdc.1996.0107

D. Robert, C. E. Blumofe, and . Leiserson, Space-efficient scheduling of multithreaded computations, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC), pp.362-371, 1993.

G. Cordasco, R. D. Chiara, and A. L. Rosenberg, Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling, Euro-Par 2011 Parallel Processing -17th International Conference, pp.180-192, 2011.
DOI : 10.1016/j.parco.2009.12.005

G. Cordasco and A. L. Rosenberg, ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA, International Journal of Foundations of Computer Science, vol.25, issue.05, pp.597-622, 2014.
DOI : 10.1142/S0129054114500245

D. Eppstein, Parallel recognition of series-parallel graphs. Information and Computation, pp.41-55, 1992.

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

L. Finta and Z. Liu, Scheduling UET-UCT series-parallel graphs on two processors, Theoretical Computer Science, vol.162, issue.2, pp.323-340, 1996.
DOI : 10.1016/0304-3975(96)00035-7
URL : https://hal.archives-ouvertes.fr/inria-00074115

J. R. Gilbert, T. Lengauer, and R. E. Tarjan, The pebbling problem is complete in polynomial space, SIAM J. Comput, vol.9, issue.3, 1980.

A. González-escribano, J. C. Arjan, V. Van-gemund, and . Cardeñoso-payo, Mapping unstructured applications into nested parallelism, High Performance Computing for Computational Science -VECPAR, pp.407-420, 2002.

A. Guermouche and J. Excellent, Memory-based scheduling for a parallel multifrontal solver, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., p.71, 2004.
DOI : 10.1109/IPDPS.2004.1303001
URL : https://hal.archives-ouvertes.fr/hal-00807282

M. Jacquelin, L. Marchal, Y. Robert, and B. Uçar, 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

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

Y. Joseph and . Leung, Handbook of scheduling: algorithms, models, and performance analysis, 2004.

W. H. Joseph and . Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Trans. Math. Software, vol.12, issue.3, pp.249-264, 1986.

W. H. Joseph and . Liu, An application of generalized tree pebbling to sparse matrix factorization, SIAM J. Algebraic Discrete Methods, vol.8, issue.3, 1987.

W. H. Joseph and . Liu, The role of elimination trees in sparse factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990.

B. Monien and I. H. Sudborough, Min cut is NP-complete for edge weighted trees, Theoretical Computer Science, vol.58, issue.1-3, pp.209-229, 1988.
DOI : 10.1016/0304-3975(88)90028-X

C. L. Monma and J. B. Sidney, Sequencing with Series-Parallel Precedence Constraints, Mathematics of Operations Research, vol.4, issue.3, pp.215-224, 1979.
DOI : 10.1287/moor.4.3.215

J. Girija and . Narlikar, Scheduling threads for low space requirement and good locality, Theory of Computing Systemes, pp.151-187, 2002.

A. Ramakrishnan, G. Singh, H. Zhao, E. Deelman, R. Sakellariou et al., Scheduling data-intensive workflows onto storage-constrained distributed resources, CCGRID'07, 2007.

R. Sethi, Complete register allocation problems, STOC'73, pp.182-195, 1973.

R. Sethi and J. D. 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. Valdes, R. E. Tarjan, and E. L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.
DOI : 10.1137/0211023

Y. Wu, P. Austrin, T. Pitassi, and D. Liu, Inapproximability of treewidth and related problems, J. Artif. Intell. Res. (JAIR), vol.49, pp.569-600, 2014.

M. Yannakakis, A polynomial algorithm for the min-cut linear arrangement of trees, Journal of the ACM, vol.32, issue.4, pp.950-988, 1985.
DOI : 10.1145/4221.4228