S. Peyronnet, A. Demaille, and B. Sigoure, Modeling of sensor networks using XRM, Isola, vol.0, issue.83, pp.271-276, 2006.

A. Al-kiswany, E. Gharaibeh, G. Santos-neto, M. Yuan, and . Ripeanu, StoreGPU, Proceedings of the 17th international symposium on High performance distributed computing, HPDC '08, pp.165-174, 2008.
DOI : 10.1145/1383422.1383443

L. De-alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala, Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation, Proc. 6th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems, pp.395-410, 2000.

M. Andrecut, Fast GPU implementation of sparse signal recovery from random projections, p.70, 2009.

A. O. Atkin and D. J. Bernstein, Prime sieves using binary quadratic forms, Mathematics of Computation, vol.73, issue.246, pp.1023-1030, 2004.
DOI : 10.1090/S0025-5718-03-01501-1

D. A. Bader and V. Agarwal, FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine, HiPC, pp.172-184, 2007.
DOI : 10.1007/978-3-540-77220-0_19

W. U. Bajwa, J. D. Haupt, G. M. Raz, S. J. Wright, and R. D. Nowak, Toeplitzstructured compressed sensing matrices, Proceedings of the 14th IEEE/SP Workshop on Statistical Signal Processing (SSP), pp.294-298, 2007.

C. Barnhart, C. A. Hane, and P. H. Vance, Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems, Operations Research, vol.48, issue.2, pp.318-326, 2000.
DOI : 10.1287/opre.48.2.318.12378

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1998.
DOI : 10.1287/opre.46.3.316

M. Beran, Decomposable Bulk Synchronous Parallel Computers, SOFSEM '99: Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics, pp.349-359, 1999.
DOI : 10.1007/3-540-47849-3_22

D. J. Bernstein, The Tangent FFT, Serdar Boztas and Hsiao feng Lu, pp.291-300, 2007.
DOI : 10.1007/978-3-540-77224-8_34

D. J. Bernstein, T. Chen, C. Cheng, T. Lange, and B. Yang, ECM on Graphics Cards, Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques, EUROCRYPT '09, pp.483-501, 2009.
DOI : 10.1049/ip-ifs:20055018

D. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Athena Scientific, p.53, 1996.

J. Bioucas-dias and M. Figueiredo, A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration, IEEE Transactions on Image Processing, vol.16, issue.12, pp.2992-3004, 2007.
DOI : 10.1109/TIP.2007.909319

R. H. Bisseling and W. F. Mccoll, Scientific computing on bulk synchronous parallel architectures, Proc. 13th IFIP World Computer Congress, pp.31-78, 1994.

R. E. Bixby, Solving Real-World Linear Programs: A Decade and More of Progress, Operations Research, vol.50, issue.1, pp.3-15, 2002.
DOI : 10.1287/opre.50.1.3.17780

R. G. Bland, New Finite Pivoting Rules for the Simplex Method, Mathematics of Operations Research, vol.2, issue.2, pp.103-107, 1977.
DOI : 10.1287/moor.2.2.103

P. Bloomfield and W. Steiger, Least Absolute Deviations: Theory, Applications, and Algorithms, p.34, 1983.
DOI : 10.1007/978-1-4684-8574-5

O. Bonorden and B. H. , The Paderborn University BSP (PUB) library, Parallel Computing, vol.29, issue.2, pp.187-207, 2003.
DOI : 10.1016/S0167-8191(02)00218-1

A. Borghi, J. Darbon, and S. Peyronnet, L1 compressive sensing: Exact optimization a la Dantzig-Wolfe, 2010 IEEE Workshop On Signal Processing Systems, pp.7-12, 2010.
DOI : 10.1109/SIPS.2010.5624822

A. Borghi, J. Darbon, and S. Peyronnet, Exact optimization for the <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msup><mml:mrow><mml:mi>???</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>-Compressive Sensing problem using a modified Dantzig???Wolfe method, Theoretical Computer Science, vol.412, issue.15, pp.1325-1337, 2011.
DOI : 10.1016/j.tcs.2010.10.032

A. Borghi, J. Darbon, S. Peyronnet, T. F. Chan, and S. Osher, A Simple Compressive Sensing Algorithm for Parallel Many-Core Architectures, Journal of Signal Processing Systems, vol.1, issue.1, 1951.
DOI : 10.1007/s11265-012-0671-9

URL : https://hal.archives-ouvertes.fr/hal-01086454

A. Borghi, J. Darbon, S. Peyronnet, T. F. Chan, and S. Osher, A Compressive Sensing Algorithm for Many-Core Architectures, Proceedings of the International Symposium on Visual Computing, pp.678-686, 2010.
DOI : 10.1007/978-3-642-17274-8_66

URL : https://hal.archives-ouvertes.fr/hal-01086454

A. Borghi, T. Herault, R. Lassaigne, and S. Peyronnet, Cell Assisted APMC, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.75-76, 2008.
DOI : 10.1109/QEST.2008.36

S. Boyd and L. Vandenberghe, Convex Optimization, p.37, 2004.

K. Bredies and D. A. Lorenz, Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints, SIAM Journal on Scientific Computing, vol.30, issue.2, pp.657-683, 2008.
DOI : 10.1137/060663556

R. P. Brent, Some Parallel Algorithms for Integer Factorisation, Proc. Third Australian Supercomputer Conference, p.17, 1999.
DOI : 10.1007/3-540-48311-X_1

E. Candès and J. Romberg, Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions, Foundations of Computational Mathematics, vol.6, issue.2, pp.227-254, 2006.
DOI : 10.1007/s10208-004-0162-x

E. Candès, J. Romberg, and T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory, vol.52, issue.2, pp.489-509, 2006.
DOI : 10.1109/TIT.2005.862083

E. Candès and T. Tao, Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5406-5426, 2006.
DOI : 10.1109/TIT.2006.885507

F. Cappello and D. Etiemble, MPI versus MPI+OpenMP on the IBM SP for the NAS Benchmarks, ACM/IEEE SC 2000 Conference (SC'00), pp.12-77, 2000.
DOI : 10.1109/SC.2000.10001

A. Chambolle, R. A. Devore, N. Lee, and B. J. Lucier, Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage, IEEE Transactions on Image Processing, vol.7, issue.3, pp.319-335, 1998.
DOI : 10.1109/83.661182

B. Chapman, B. Jost, and R. V. Pas, Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation), 2007.

S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic Decomposition by Basis Pursuit, SIAM Review, vol.43, issue.1, pp.129-159, 2001.
DOI : 10.1137/S003614450037906X

E. Chow and D. Hysom, Assessing performance of hybrid MPI/OpenMP programs on SMP clusters

M. Cole, Research Directions in Parallel Functional Programming, chapter 13, Algorithmic skeletons, p.78, 1999.

P. Combettes and J. Pesquet, Proximal Thresholding Algorithm for Minimization over Orthonormal Bases, SIAM Journal on Optimization, vol.18, issue.4, pp.1351-1376, 2007.
DOI : 10.1137/060669498

URL : https://hal.archives-ouvertes.fr/hal-00621819

C. Courcoubetis and M. Yannakakis, The complexity of probabilistic verification, Journal of the ACM, vol.42, issue.4, pp.857-907, 1995.
DOI : 10.1145/210332.210339

L. Dagum and R. Menon, OpenMP: an industry standard API for shared-memory programming, IEEE Computational Science and Engineering, vol.5, issue.1, pp.46-55, 1998.
DOI : 10.1109/99.660313

G. B. Dantzig, Programming in a linear structure, p.42, 1948.

G. B. Dantzig, Linear Programming and Extensions, p.41, 1963.
DOI : 10.1515/9781400884179

G. B. Dantzig and P. Wolfe, The decomposition algorithm for linear programming, Econometrica, vol.9, issue.32, pp.31-33, 1961.

I. Daubechies, M. Defrise, and C. Mol, An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, Communications on Pure and Applied Mathematics, vol.58, issue.11, pp.1413-1457, 2004.
DOI : 10.1002/cpa.20042

A. Demaille, S. Peyronnet, and B. Sigoure, Modeling of Sensor Networks Using XRM, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006), pp.271-276, 2006.
DOI : 10.1109/ISoLA.2006.27

R. A. Devore, Deterministic constructions of compressed sensing matrices, Journal of Complexity, vol.23, issue.4-6, pp.4-6918, 2007.
DOI : 10.1016/j.jco.2007.04.002

K. Diefendorff, P. K. Dubey, R. Hochsprung, and H. Scale, AltiVec extension to PowerPC accelerates media processing, IEEE Micro, vol.20, issue.2, pp.85-95, 2000.
DOI : 10.1109/40.848475

D. Donoho, Y. Tsaig, I. Drori, and J. Starck, Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.58, issue.2, p.52, 2006.
DOI : 10.1109/TIT.2011.2173241

D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1289-1306, 2006.
DOI : 10.1109/TIT.2006.871582

URL : https://hal.archives-ouvertes.fr/inria-00369486

N. Drosinos and N. Koziris, Performance comparison of pure MPI vs hybrid MPI-OpenMP parallelization models on SMP clusters, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., pp.15-77, 2004.
DOI : 10.1109/IPDPS.2004.1302919

F. Dupe, J. Fadili, and J. Starck, A Proximal Iteration for Deconvolving Poisson Noisy Images Using Sparse Representations, IEEE Transactions on Image Processing, vol.18, issue.2, pp.2992-3004, 2008.
DOI : 10.1109/TIP.2008.2008223

URL : https://hal.archives-ouvertes.fr/hal-00264972

B. P. Dzielinski and R. E. Gomory, Optimal Programming of Lot Sizes, Inventory and Labor Allocations, Management Science, vol.11, issue.9, pp.874-890, 1965.
DOI : 10.1287/mnsc.11.9.874

W. Yin, E. T. Hale, and Y. Zhang, A fixed-point continuation method for l1- regularized minimization with applications to compressed sensing, p.56, 2007.

M. Elad, Why Simple Shrinkage Is Still Relevant for Redundant Representations?, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5559-5569, 2006.
DOI : 10.1109/TIT.2006.885522

G. and D. Fabritiis, Performance of the Cell processor for biomolecular simulations, Computer Physics Communications, vol.176, issue.11-12, pp.660-664, 2007.
DOI : 10.1016/j.cpc.2007.02.107

M. Figueiredo and R. Nowak, An EM algorithm for wavelet-based image restoration, IEEE Transactions on Image Processing, vol.12, issue.8, pp.906-916, 2003.
DOI : 10.1109/TIP.2003.814255

M. Figueiredo, R. Nowak, and S. Wright, Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems, IEEE Journal of Selected Topics in Signal Processing, vol.1, issue.4, pp.586-598, 2007.
DOI : 10.1109/JSTSP.2007.910281

J. J. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming, pp.341-374, 1992.
DOI : 10.1007/BF01581089

M. Forum, MPI: A message-passing interface standard, International Journal of Supercomputer Application, vol.8, pp.165-416, 1994.

M. P. Friedlander and M. A. Saunders, Discussion: The Dantzig selector: Statistical estimation when p is much larger than n, The Annals of Statistics, vol.35, issue.6, pp.2385-2391, 2007.
DOI : 10.1214/009053607000000479

M. Frigo and S. G. Johnson, FFTW: an adaptive software architecture for the FFT, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), pp.1381-1384, 1998.
DOI : 10.1109/ICASSP.1998.681704

S. I. Gass and S. Vinjamuri, Cycling in linear programming problems, Computers & Operations Research, vol.31, issue.2, pp.303-311, 2004.
DOI : 10.1016/S0305-0548(02)00226-5

L. Gesbert and F. Gava, New syntax of a high-level BSP language with application to parallel pattern-matching and exception handling, Complexity and Logic), p.79, 2009.

L. Gesbert, F. Gava, F. Loulergue, and F. Dabrowski, Bulk synchronous parallel ML with exceptions, Future Generation Computer Systems, vol.26, issue.3, pp.486-490, 2010.
DOI : 10.1016/j.future.2009.05.021

URL : https://hal.archives-ouvertes.fr/inria-00452559

L. Giraud, Combining shared and distributed memory programming models on clusters of symmetric multiprocessors: Some basic promising experiments, International Journal of High Performance Computing Applications, vol.16, pp.425-430, 2002.

D. Goldfarb and J. Reid, A practicable steepest-edge simplex algorithm, Mathematical Programming, vol.5, issue.1, pp.361-371, 1977.
DOI : 10.1007/BF01593804

T. Goldstein and S. Osher, The Split Bregman Method for L1-Regularized Problems, SIAM Journal on Imaging Sciences, vol.2, issue.2, p.52, 2008.
DOI : 10.1137/080725891

R. Griesse and D. A. Lorenz, A semismooth Newton method for Tikhonov functionals with sparsity constraints, Inverse Problems, vol.24, issue.3, p.52, 2008.
DOI : 10.1088/0266-5611/24/3/035007

K. Hamidouche, A. Borghi, P. Esterie, J. Falcou, and S. Peyronnet, Three high performance architectures in the parallel approximate probabilistic model checking boat, Proceedings of the 9th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC), p.73, 2010.

K. Hamidouche, J. Falcou, and D. Etiemble, Hybrid bulk synchronous parallelism library for clustered smp architectures, Proceedings of the fourth international workshop on High-level parallel programming and applications, HLPP '10, pp.55-62, 2010.
DOI : 10.1145/1863482.1863494

P. M. Harris, Pivot selection methods of the Devex LP code, Mathematical Programming, pp.1-28, 1973.

J. Hastad, On using RSA with low exponent in a public key network In Lecture notes in computer sciences; 218 on Advances in cryptology?CRYPTO 85, pp.403-408, 1986.

T. Hérault, R. Lassaigne, F. Magniette, and S. Peyronnet, Approximate Probabilistic Model Checking, Proceedings of the 5th Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.73-84, 2004.
DOI : 10.1007/978-3-540-24622-0_8

J. M. Hill, B. Mccoll, D. C. Stefanescu, M. W. Goudreau, K. Lang et al., BSPlib: The BSP programming library, Parallel Computing, vol.24, issue.14, pp.1947-1980, 1998.
DOI : 10.1016/S0167-8191(98)00093-3

A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker, PRISM: A Tool for Automatic Verification of Probabilistic Systems, Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), pp.441-444, 2006.
DOI : 10.1007/11691372_29

J. Hiriart-urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms Two volumes -2nd printing, p.55, 1996.

S. Horie and O. Watanabe, Hard instance generation for SAT, ISAAC '97: Proceedings of the 8th International Symposium on Algorithms and Computation, pp.22-31, 1997.
DOI : 10.1007/3-540-63890-3_4

C. J. Noble, I. J. Bush, and R. J. Allan, Mixed OpenMP and for MPI parallel fortran applications, European workshop on OpenMP, p.77, 2000.

R. M. Karp and M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.56-64, 1983.
DOI : 10.1109/SFCS.1983.35

W. Karush, Minima of Functions of Several Variables with Inequalities as Side Conditions, p.37, 1939.
DOI : 10.1007/978-3-0348-0439-4_10

S. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, An Interior-Point Method for Large-Scale -Regularized Least Squares, IEEE Journal of Selected Topics in Signal Processing, vol.1, issue.4, pp.606-617, 2007.
DOI : 10.1109/JSTSP.2007.910971

T. Kleinjung, K. Aoki, J. Franke, A. Lenstra, E. Thomé et al., Factorization of a 768-Bit RSA Modulus, p.16, 2010.
DOI : 10.1007/978-3-642-14623-7_18

URL : https://hal.archives-ouvertes.fr/inria-00444693

G. Krawezik and F. Cappello, Performance comparaison of MPI and three OpenMP programming styles on shared memory multiprocessors, ACM Symposium on Parallel Algorithms, pp.118-127, 2003.

H. W. Kuhn and A. W. Tucker, Nonlinear programming, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pp.481-492, 1951.

A. Kumar, G. Senthilkumar, M. Krishna, N. Jayam, P. K. Baruah et al., A Buffered-Mode MPI Implementation for the Cell BETM Processor, Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007, ICCS'07, pp.603-610, 2007.
DOI : 10.1007/978-3-540-72584-8_80

J. Kurzak and J. Dongarra, Implementation of mixed precision in solving systems of linear equations on the Cell processor, Concurrency and Computation: Practice and Experience, vol.14, issue.10, pp.1371-1385, 2007.
DOI : 10.1002/cpe.1164

L. S. Lasdon, Optimization Theory for Large Systems. The Macmillan Company, pp.31-37, 1970.

R. Lassaigne and S. Peyronnet, Probabilistic verification and approximation, Annals of Pure and Applied Logic, vol.152, issue.1-3, pp.122-131, 2008.
DOI : 10.1016/j.apal.2007.11.006

URL : http://doi.org/10.1016/j.entcs.2005.05.031

C. Lemaréchal and C. Sagastizábal, Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries, SIAM Journal on Optimization, vol.7, issue.2, pp.367-385, 1997.
DOI : 10.1137/S1052623494267127

A. K. Lenstra and H. W. Lenstra-jr, The development of the number field sieve, Lecture Notes in Mathematics, vol.1554, p.16, 1993.
DOI : 10.1007/BFb0091534

H. W. Lenstra, Factoring Integers with Elliptic Curves, The Annals of Mathematics, vol.126, issue.3, pp.649-673, 1987.
DOI : 10.2307/1971363

M. D. Lieberman, J. Sankaranarayanan, and H. Samet, A Fast Similarity Join Algorithm Using Graphics Processing Units, 2008 IEEE 24th International Conference on Data Engineering, pp.1111-1120, 2008.
DOI : 10.1109/ICDE.2008.4497520

F. Loulergue, F. Gava, and D. Billiet, Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction, International Conference on Computational Science (ICCS 2005), Part II, pp.1046-1054, 2005.
DOI : 10.1007/11428848_132

G. Mahinthaumar and F. Said, A hybrid MPI-OpenMP implementation of an implicit finite-element code on parallel architectures, International Journal of High Performance Computing Applications, vol.16, issue.4, pp.371-393, 2002.

G. Mccormick, Computability of global solutions to factorable nonconvex programs: Part I ??? Convex underestimating problems, Mathematical Programming, vol.17, issue.11, pp.146-175, 1976.
DOI : 10.1287/mnsc.17.11.759

J. Milan, Factoring Small Integers: An Experimental Comparison, p.16
URL : https://hal.archives-ouvertes.fr/inria-00188645

J. J. Moreau, Proximit?? et dualit?? dans un espace hilbertien, Bulletin de la Soci&#233;t&#233; math&#233;matique de France, vol.79, issue.52, pp.273-299, 1965.
DOI : 10.24033/bsmf.1625

URL : http://archive.numdam.org/article/BSMF_1965__93__273_0.pdf

J. Nickolls, I. Buck, M. Garland, and K. Skadron, Scalable parallel programming with CUDA. Queue, pp.40-53, 2008.

M. Nikolova, Markovian reconstruction using a GNC approach, IEEE Transactions on Image Processing, vol.8, issue.9, pp.1204-1220, 1999.
DOI : 10.1109/83.784433

M. Nikolova, J. Idier, and A. Mohammad-djafari, Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF, IEEE Transactions on Image Processing, vol.7, issue.4, pp.571-585, 1998.
DOI : 10.1109/83.663502

M. Nikolova, M. K. Ng, S. Q. Zhang, and W. K. Ching, Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization, SIAM Journal on Imaging Sciences, vol.1, issue.1, pp.2-25, 2008.
DOI : 10.1137/070692285

R. Nowak and M. Figueiredo, Fast wavelet-based image deconvolution using the EM algorithm, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256), pp.371-275, 2001.
DOI : 10.1109/ACSSC.2001.986953

J. D. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Kruger et al., A Survey of General-Purpose Computation on Graphics Hardware, Computer Graphics Forum, vol.7, issue.4, pp.80-113, 2007.
DOI : 10.1016/j.rti.2005.04.002

D. Pham, S. Asano, M. Bolliger, M. N. Day, H. P. Hofstee et al., The design and implementation of a first-generation CELL processor, ISSCC. 2005 IEEE International Digest of Technical Papers. Solid-State Circuits Conference, 2005., pp.184-185, 2005.
DOI : 10.1109/ISSCC.2005.1493930

A. Pnueli and L. D. Zuck, Verification of multiprocess probabilistic protocols, Distributed Computing, vol.17, issue.1, pp.53-72, 1986.
DOI : 10.1007/BF01843570

D. Goswami, S. Siu, M. D. Simone, and A. Singh, Design patterns for parallel programming, Proceedings of the 1996 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'96), pp.230-240, 1996.

D. B. Skillicorn and D. Talia, Models and languages for parallel computation, ACM Computing Surveys, vol.30, issue.2, pp.123-169, 1998.
DOI : 10.1145/280277.280278

S. Peyronnet, T. Hérault, and R. Lassaigne, Apmc 3.0: Approximate verification of discrete and continuous time markov chains, QEST'06, pp.129-130, 2006.

T. Tcheng, Scheduling of a Large Forestry-Cutting Problem by Linear Programming Decomposition, p.31, 1966.

R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society Series B, vol.58, pp.267-288, 2006.

J. A. Tropp, Greed is Good: Algorithmic Results for Sparse Approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.
DOI : 10.1109/TIT.2004.834793

J. A. Tropp, Just relax: convex programming methods for identifying sparse signals in noise, IEEE Transactions on Information Theory, vol.52, issue.3, pp.1030-1051, 2006.
DOI : 10.1109/TIT.2005.864420

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

F. Vanderbeck, On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm, Operations Research, vol.48, issue.1, pp.111-128, 2000.
DOI : 10.1287/opre.48.1.111.12453

URL : https://hal.archives-ouvertes.fr/inria-00342641

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

A. J. Wallcraft, SPMD OpenMP versus MPI for ocean models. concurrency: Practice and Experience, pp.1155-1164, 2000.

S. Williams, J. Carter, L. Oliker, J. Shalf, and K. Yelick, Lattice Boltzmann simulation optimization on leading multicore platforms, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-14, 2008.
DOI : 10.1109/IPDPS.2008.4536295

S. Williams, J. Shalf, L. Oliker, S. Kamil, P. Husbands et al., The potential of the cell processor for scientific computing, Proceedings of the 3rd conference on Computing frontiers , CF '06, pp.9-20, 2006.
DOI : 10.1145/1128022.1128027

T. L. Williams and R. J. Parsons, The heterogeneous bulk synchronous parallel model. Workshop on Advances in Parallel and Distributed Computational Models, pp.102-108, 2000.

L. T. Yang, L. Xu, and M. Lin, Integer Factorization by a Parallel GNFS Algorithm for Public Key Cryptosystems, Lecture Notes in Computer Science, vol.3820, pp.683-695, 2005.
DOI : 10.1007/11599555_65

L. T. Yang, L. Xu, S. Yeo, and S. Hussain, An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2), Computers & Mathematics with Applications, vol.60, issue.2, pp.338-346, 2010.
DOI : 10.1016/j.camwa.2010.01.020

W. Yin, S. Osher, D. Goldfarb, and J. Darbon, Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing, SIAM Journal on Imaging Sciences, vol.1, issue.1, pp.143-168, 2008.
DOI : 10.1137/070703983

K. Yosida, Functional Analysis, p.52, 1965.

H. L. Younes and R. G. Simmons, Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling, Proceedings of CAV, pp.223-235, 2002.
DOI : 10.1007/3-540-45657-0_17