1. M. Blum, R. Floyd, V. Pratt, R. Rivest, R. Tarjan, Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1973)
2. D. Campbell, A survey of models of parallel computation. Technical Report, University of York (1997)
3. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1–12 (1993)
4. J. Dean, S. Ghemawat, MapReduce: simplified data processing on large clusters, in Proceedings of the OSDI, pp. 137–150 (2004)
5. F. Dehne, Guest Editor’s Introduction, special issue on coarse grained parallel algorithms. Algorithmica 24(3–4), 173–176 (1999)