]. D. Anderson, BOINC: A System for Public-Resource Computing and Storage, Fifth IEEE/ACM International Workshop on Grid Computing, pp.4-1014, 2004.
DOI : 10.1109/GRID.2004.14

A. Avizienis, J. Laprie, and B. Randell, Dependability and Its Threats: A Taxonomy, IFIP Congress Topical Sessions, R. Jacquart, Ed. Kluwer, pp.91-120, 2004.
DOI : 10.1007/978-1-4020-8157-6_13

J. Roch and S. Varrette, Probabilistic certification of divide & conquer algorithms on global computing platforms. Application to fault-tolerant exact matrix-vector product, Parallel Symbolic Computation'07 (PASCO'07), A. publishing, 2007.

V. King, J. Saia, V. Sanwalani, and E. Vee, Towards secure and scalable computation in peer-topeer networks, FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp.87-98, 2006.

B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani, Fast asynchronous Byzantine agreement and leader election with full information, SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1038-1047, 2008.
DOI : 10.1145/1824777.1824788

K. Huang and J. Abraham, Algorithm-based fault tolerance for matrix operations, IEEE Transactions on Computers, vol.33, issue.6, pp.518-528, 1984.

G. Bosilca, R. Delmas, J. Dongarra, and J. Langou, Algorithmic based fault tolerance applied to high performance computing, p.3121, 2008.
DOI : 10.1016/j.jpdc.2008.12.002

R. A. Van-de-geijn and J. Watts, SUMMA: scalable universal matrix multiplication algorithm, Concurrency -Practice and Experience, pp.255-274, 1997.
DOI : 10.1002/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, 1960.
DOI : 10.1109/TIT.1962.1057683

J. Dongarra, K. Madsen, J. Wasniewski, and E. , Applied Parallel Computing, Computations in Physics, Proceedings, ser. Lecture Notes in Computer Science, 1995.

R. E. Blahut, Theory and Practice of Error Control Codes

T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.619-637, 2001.
DOI : 10.1109/18.910578

H. D. Pfister, I. Sason, and R. Urbanke, Capacity- Achieving Ensembles for the Binary Erasure Channel with Bounded Complexity, Fourth ETH? Technion Meeting on Information Theory and Communications, 2004.