A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir, A model for hierarchical memory, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.305-314, 1987.
DOI : 10.1145/28395.28428

A. Aggarwal and J. S. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988.
DOI : 10.1145/48529.48535
URL : https://hal.archives-ouvertes.fr/inria-00075827

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Minimizing Communication in Numerical Linear Algebra, SIAM Journal on Matrix Analysis and Applications, vol.32, issue.3, pp.866-901, 2011.
DOI : 10.1137/090769156

G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, Graph expansion and communication costs of fast matrix multiplication, J. ACM, vol.59, issue.6, p.32, 2012.

G. Bilardi, A. Pietracaprina, and P. , On the Space and Access Complexity of Computation DAGs, Graph-Theoretic Concepts in Computer Science, pp.81-92, 1928.
DOI : 10.1007/3-540-40064-8_6

G. Bilardi and F. P. Preparata, Processor??Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds, Theory of Computing Systems, vol.32, issue.5, pp.531-559, 1999.
DOI : 10.1007/s002240000131

M. Christ, J. Demmel, N. Knight, T. Scanlon, and K. Yelick, Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays ? Part 1, EECS Technical Report EECS, pp.2013-61, 2013.

S. A. Cook, An observation on time-storage trade off, Journal of Computer and System Sciences, vol.9, issue.3, pp.308-316, 1974.
DOI : 10.1016/S0022-0000(74)80046-2

K. Czechowski, C. Battaglino, C. Mcclanahan, A. Chandramowlishwaran, and R. Vuduc, Balance principles for algorithm-architecture co-design, Proceedings of the 3rd USENIX Conference on Hot Topic in Parallelism, pp.9-9, 2011.

K. Czechowski and R. Vuduc, A Theoretical Framework for Algorithm-Architecture Co-design, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp.791-802, 2013.
DOI : 10.1109/IPDPS.2013.99

J. Demmel, L. Grigori, M. Hoemmen, and J. Langou, Communication-optimal Parallel and Sequential QR and LU Factorizations, SIAM Journal on Scientific Computing, vol.34, issue.1, p.2012
DOI : 10.1137/080731992
URL : https://hal.archives-ouvertes.fr/hal-00870930

V. Elango, F. Rastello, L. Pouchet, J. Ramanujam, and P. Sadayappan, Data access complexity: The red/blue pebble game revisited, 2013.

M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, 1952.

J. Hong and H. T. Kung, The red-blue pebble game, Proc. of the 13th annual ACM sympo. on Theory of computing (STOC'81), pp.326-333, 1981.

I. Blue and G. Team, The ibm blue gene project, IBM Journal of Research and Development, vol.57, issue.12, pp.0-1

D. Irony, S. Toledo, and A. Tiskin, Communication lower bounds for distributed-memory matrix multiplication, Journal of Parallel and Distributed Computing, vol.64, issue.9, pp.1017-1026, 2004.
DOI : 10.1016/j.jpdc.2004.03.021

D. Ranjan, J. Savage, and M. Zubair, Strong I/O Lower Bounds for Binomial and FFT Computation Graphs, Computing and Combinatorics, pp.134-145, 2011.
DOI : 10.1007/978-3-642-22685-4_12

D. Ranjan, J. E. Savage, and M. Zubair, Upper and lower I/O bounds for pebbling r-pyramids, Journal of Discrete Algorithms, vol.14, pp.2-12, 2012.
DOI : 10.1016/j.jda.2011.12.005

D. Ranjan and M. Zubair, VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH, International Journal of Foundations of Computer Science, vol.23, issue.04, pp.941-2012
DOI : 10.1142/S0129054112500128

Y. Saad and M. H. Schultz, GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.3, pp.856-869, 1986.
DOI : 10.1137/0907058

J. Savage, Extending the Hong-Kung model to memory hierarchies, Computing and Combinatorics, pp.270-281, 1995.
DOI : 10.1007/BFb0030842

J. E. Savage, Models of computation -exploring the power of computing, 1998.

J. E. Savage and M. Zubair, A unified model for multicore architectures, Proceedings of the 1st international forum on Next-generation multicore/manycore technologies, IFMT '08, p.9, 2008.
DOI : 10.1145/1463768.1463780

J. E. Savage and M. Zubair, Cache-optimal algorithms for option pricing, ACM Transactions on Mathematical Software, vol.37, issue.1, 2010.
DOI : 10.1145/1644001.1644008

M. Scquizzato and F. Silvestri, Communication lower bounds for distributed-memory computations . CoRR, abs, 1307.

E. Solomonik, A. Buluç, and J. Demmel, Minimizing Communication in All-Pairs Shortest Paths, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, 2013.
DOI : 10.1109/IPDPS.2013.111

L. G. Valiant, A bridging model for multi-core computing, Inria RESEARCH CENTRE GRENOBLE ? RHÔNE-ALPES Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria.fr ISSN, pp.154-166, 2011.
DOI : 10.1016/j.jcss.2010.06.012