A. Andoni, A. Nikolov, K. Onak, and G. Yaroslavtsev, Parallel algorithms for geometric graph problems, Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC '14, pp.574-583, 2014.
DOI : 10.1145/2591796.2591805

P. Beame, P. Koutris, and D. Suciu, Communication steps for parallel query processing, Proceedings of the 32nd symposium on Principles of database systems, PODS '13, pp.273-284, 2013.
DOI : 10.1145/2463664.2465224

C. Chu, S. K. Kim, Y. Lin, Y. Yu, G. R. Bradski et al., Map-reduce for machine learning on multicore, NIPS, pp.281-288, 2006.

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

A. K. Farahat, A. Elgohary, A. Ghodsi, and M. S. Kamel, Distributed Column Subset Selection on MapReduce, 2013 IEEE 13th International Conference on Data Mining, pp.171-180, 2013.
DOI : 10.1109/ICDM.2013.155

J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina, On distributing symmetric streaming computations, ACM Transactions on Algorithms, vol.6, issue.4, 2010.
DOI : 10.1145/1824777.1824786

L. Fortnow, Time???Space Tradeoffs for Satisfiability, Journal of Computer and System Sciences, vol.60, issue.2, pp.337-353, 2000.
DOI : 10.1006/jcss.1999.1671

T. Michael, N. Goodrich, Q. Sitchinava, and . Zhang, Sorting, searching, and simulation in the mapreduce framework, ISAAC, pp.374-383, 2011.

R. Impagliazzo and R. Paturi, Complexity of k-SAT, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317), p.237, 1999.
DOI : 10.1109/CCC.1999.766282

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516

S. Kamara and M. Raykova, Parallel Homomorphic Encryption, Financial Cryptography Workshops, pp.213-225, 2013.
DOI : 10.1007/978-3-642-41320-9_15

H. Karloff, S. Suri, and S. Vassilvitskii, A Model of Computation for MapReduce, SODA '10, pp.938-948, 2010.
DOI : 10.1137/1.9781611973075.76

R. Kumar, B. Moseley, S. Vassilvitskii, and A. Vattani, Fast greedy algorithms in mapreduce and streaming, SPAA '13, pp.1-10, 2013.

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the exponential time hypothesis, Bulletin of the EATCS, vol.105, pp.41-72, 2011.

P. Matthew-felice, BSP vs mapreduce, Proceedings of the International Conference on Computational Science, pp.4-6

A. Das-sarma, F. N. Afrati, S. Salihoglu, and J. D. Ullman, Upper and lower bounds on the cost of a map-reduce computation, PVLDB'13, pp.277-288, 2013.

J. C. Shepherdson, The Reduction of Two-Way Automata to One-Way Automata, IBM Journal of Research and Development, vol.3, issue.2, pp.198-200, 1959.
DOI : 10.1147/rd.32.0198

K. Shvachko, H. Kuang, S. Radia, and R. Chansler, The Hadoop Distributed File System, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), pp.1-10, 2010.
DOI : 10.1109/MSST.2010.5496972

A. Szepietowski, Turing Machines with Sublogarithmic Space. Ernst Schering Research Foundation Workshops, 1994.

G. Leslie and . Valiant, A bridging model for parallel computation, Commun. ACM, vol.33, issue.8, pp.103-111, 1990.

R. Williams, Time-Space Tradeoffs for Counting NP Solutions Modulo Integers, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pp.179-219, 2008.
DOI : 10.1109/CCC.2007.34