Numerical Solution of Nonlinear Equations. - Jorge J. Moré; Michel Cosnard (ACM Trans. Math. Softw., 1979)

Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [C5]. - Jorge J. Moré; Michel Cosnard (ACM Trans. Math. Softw., 1980)

Gauss Elimination Algorithms for MIMD Computers. - Michel Cosnard; Mounir Marrakchi; Yves Robert; Denis Trystram (CONPAR, 1986)

Complexity of parallel QR factorization. - Michel Cosnard; Yves Robert (J. ACM, 1986)

The FELIN arithmetic coprocessor chip. - Michel Cosnard; Alain Guyot; Bertrand Hochet; Jean-Michel Muller; Hassan Ouaouicha; P. Paul; Eytan Zysman (IEEE Symposium on Computer Arithmetic, 1987)

Gaussian Elimination on Message Passing Architecture. - Michel Cosnard; Bernard Tourancheau; Gilles Villard (ICS, 1987)

Dynamical Behavior of a Neural Automaton with Memory. - Michel Cosnard; Driss Moumida; Eric Goles 001; Thierry de St. Pierre (Complex Syst., 1988)

Bifurcation structure of a discrete neuronal equation. - Michel Cosnard; Eric Goles Ch.; Driss Moumida (Discret. Appl. Math., 1988)

Parallel Gaussian elimination on an MIMD computer. - Michel Cosnard; Mounir Marrakchi; Yves Robert; Denis Trystram (Parallel Comput., 1988)

Parallel Algorithms for Searching In X+Y. - Michel Cosnard; Afonso Ferreira (ICPP (3), 1989)

Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. - Michel Cosnard; El Mostafa Daoudi; Yves Robert (Optimal Algorithms, 1989)

Generating Permutations on a VLSI Suitable Linear Network. - Michel Cosnard; Afonso Ferreira (Comput. J., 1989)

The two list algorithm for the knapsack problem on a FPS T20. - Michel Cosnard; Afonso Ferreira; Hugo Herbelin (Parallel Comput., 1989)

Evaluating speedups on distributed memory architectures. - Michel Cosnard; Yves Robert; Bernard Tourancheau (Parallel Comput., 1989)

Systolic Gauss-Jordan elimination for dense linear systems. - Michel Cosnard; Maurice Tchuenté; Bernard Tourancheau (Parallel Comput., 1989)

Complexity of Selection in X + Y. - Michel Cosnard; Jean Duprat; Afonso Ferreira (Theor. Comput. Sci., 1989)

A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. - Michel Cosnard; Pierre Fraigniaud (CONPAR, 1990)

Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor. - Michel Cosnard; Jean-Laurent Philippe (CONPAR, 1990)

Designing Parallel Algorithms for Transputer Networks (Abstract). - Michel Cosnard (ICCI, 1990)

Distributed Algorithms for Deciphering. - Michel Cosnard; Jean-Laurent Philippe (SIGAL International Symposium on Algorithms, 1990)

The Complexity of Searching in X+Y and Other Multisets. - Michel Cosnard; Jean Duprat; Afonso Ferreira (Inf. Process. Lett., 1990)

Systolic Triangularization over Finite Fields. - Michel Cosnard; Jean Duprat; Yves Robert (J. Parallel Distributed Comput., 1990)

Finding the roots of a polynomial on an MIMD multicomputer. - Michel Cosnard; Pierre Fraigniaud (Parallel Comput., 1990)

A Tight Lower Bound for Selection in Sorted X+Y. - Michel Cosnard; Afonso Ferreira (ICCI, 1991)

On the Real Power of Loosely Coupled Parallel Architectures. - Michel Cosnard; Afonso Ferreira (Parallel Process. Lett., 1991)

Revisiting Parallel Speedup Complexity. - Selim G. Akl; Michel Cosnard; Afonso Ferreira (ICCI, 1992)

Complexity Issues in Neural Network Computations. - Michel Cosnard; Pascal Koiran; Hélène Paugam-Moisy (LATIN, 1992)

Relations between Models of Parallel Abstract Machines. - Michel Cosnard; Pascal Koiran (Heinz Nixdorf Symposium, 1992)

Sequences Generated by Neuronal Automata with Memory. - Michel Cosnard; Maurice Tchuenté; Gilbert Tindo (Complex Syst., 1992)

Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. - Selim G. Akl; Michel Cosnard; Afonso Ferreira (Theor. Comput. Sci., 1992)

Probabilistic decision trees ans multilayered perceptrons. - P. Bigot; Michel Cosnard (ESANN, 1993)

Computability Properties of Low-dimensional Dynamical Systems. - Michel Cosnard; Max H. Garzon; Pascal Koiran (STACS, 1993)

On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. - Michel Cosnard; Martín Matamala (MFCS, 1994)

Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM. - Michel Cosnard; El Mostafa Daoudi (J. ACM, 1994)

Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. - Michel Cosnard; Pascal Koiran; Hélène Paugam-Moisy (J. Complex., 1994)

Computability with Low-Dimensional Dynamical Systems. - Pascal Koiran; Michel Cosnard; Max H. Garzon (Theor. Comput. Sci., 1994)

Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. - Michel Cosnard; Pierre Fraigniaud (IEEE Trans. Parallel Distributed Syst., 1994)

Parallel algorithms and architectures. - Michel Cosnard; Denis Trystram (International Thomson, 1995)

A Characterization of the Existence of Energies for Neural Networks. - Michel Cosnard; Eric Goles Ch. (ICALP, 1995)

Automatic Task Graph Generation Techniques. - Michel Cosnard; Michel Loi (Parallel Process. Lett., 1995)

A Simple Algorithm for the Generation of Efficient Loop Structures. - Michel Cosnard; Michel Loi (Int. J. Parallel Program., 1996)

On the Computational Power of Dynamical Systems and Hybrid Systems. - Olivier Bournez; Michel Cosnard (Theor. Comput. Sci., 1996)

Discrete State Neural Networks and Energies. - Michel Cosnard; Eric Goles Ch. (Neural Networks, 1997)

Symbolic Partitioning and Scheduling of Parameterized Task Graphs. - Michel Cosnard; Emmanuel Jeannot; Tao Yang (ICPADS, 1998)

Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs. - Michel Cosnard; Emmanuel Jeannot; Laurence Rougeot (IPPS/SPDP, 1998)

Theory and Models for Parallel Computation - Introduction. - Michel Cosnard (Euro-Par, 1999)

SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors. - Michel Cosnard; Emmanuel Jeannot; Tao Yang (ICPP, 1999)

Compact DAG Representation and Its Dynamic Scheduling. - Michel Cosnard; Emmanuel Jeannot (J. Parallel Distributed Comput., 1999)

Using Postordering and Static Symbolic Factorization for Parallel Sparse LU. - Michel Cosnard; Laura Grigori (IPDPS, 2000)

Editorial Note. - Michel Cosnard (Parallel Process. Lett., 2000)

The Komornik-Loreti Constant Is Transcendental. - Jean-Paul Allouche; Michel Cosnard (Am. Math. Mon., 2000)

A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices. - Michel Cosnard; Laura Grigori (ICS, 2001)

Note from the Editor-in-Chief. - Michel Cosnard (Parallel Process. Lett., 2001)

Editorial Note. - Michel Cosnard; Ulrich Finger; Jean-Luc Gaudiot (Parallel Process. Lett., 2001)

Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling. - Michel Cosnard; Emmanuel Jeannot (Parallel Process. Lett., 2001)

Meta- and Grid-Computing. - Michel Cosnard; André Merzky (Euro-Par, 2002)

Automatic Parallelization of numerical programss : Application to Solve Linear Dense and Sparse Systemss. - Michel Cosnard (OPODIS, 2002)

04451 Abstracts Collection - Future Generation Grids. - Michel Cosnard; Vladimir Getov; Domenico Laforenza; Alexander Reinefeld (Future Generation Grids, 2004)

Compact DAG representation and its symbolic scheduling. - Michel Cosnard; Emmanuel Jeannot; Tao Yang (J. Parallel Distributed Comput., 2004)

Optimal Solution of the Maximum All Request Path Grooming Problem. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Stéphane Pérennes (AICT/ICIW, 2006)

Topic 10: Parallel Numerical Algorithms. - Michel Cosnard; Hans-Joachim Bungartz; Efstratios Gallopoulos; Yousef Saad (Euro-Par, 2006)

Arigatoni: A Simple Programmable Overlay Network. - Didier Benza; Michel Cosnard; Luigi Liquori; Marc Vesin (John Vincent Atanasoff Symposium, 2006)

Virtual Organizations in Arigatoni. - Michel Cosnard; Luigi Liquori; Raphaël Chand (DCM@ICALP, 2006)

Improving Resource Discovery in the Arigatoni Overlay Network. - Raphaël Chand; Luigi Liquori; Michel Cosnard (ARCS, 2007)

Minimum number of wavelengths equals load in a DAG without internal cycle. - Jean-Claude Bermond; Michel Cosnard (IPDPS, 2007)

Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems. - Luigi Liquori; Michel Cosnard (TGC, 2007)

Powerful resource discovery for Arigatoni overlay network. - Raphaël Chand; Michel Cosnard; Luigi Liquori (Future Gener. Comput. Syst., 2008)

Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting. - Laura Grigori; John R. Gilbert; Michel Cosnard (SIAM J. Matrix Anal. Appl., 2008)

Resource Discovery in the Arigatoni Model. - Raphaël Chand; Luigi Liquori; Michel Cosnard (IICS, 2010)

Directed acyclic graphs with the unique dipath property. - Jean-Claude Bermond; Michel Cosnard; Stéphane Pérennes (Theor. Comput. Sci., 2013)

Celebrating the 60th birthday of Eric Goles. - Michel Cosnard (Theor. Comput. Sci., 2013)

Grabbing Olives on Linear Pizzas and Pissaladières. - Jean-Claude Bermond; Frédéric Havet; Michel Cosnard (FUN, 2022)

New lower bounds on the cutwidth of graphs. - Jean-Claude Bermond; Michel Cosnard; David Coudert; Frédéric Havet (Comput. Oper. Res., 2025)