Michel Cosnard

Publication Activity (10 Years)

Years Active: 1979-2022
Publications (10 Years): 1

Top Topics

Directed Acyclic Graph

Independence Relations

Equivalence Class

Top Venues

Theor. Comput. Sci.

Publications

Jean-Claude Bermond, Frédéric Havet, Michel Cosnard
Grabbing Olives on Linear Pizzas and Pissaladières. FUN (2022)
Michel Cosnard
Celebrating the 60th birthday of Eric Goles. Theor. Comput. Sci. 504 (2013)
Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes
Directed acyclic graphs with the unique dipath property. Theor. Comput. Sci. 504 (2013)
Raphaël Chand, Luigi Liquori, Michel Cosnard
Resource Discovery in the Arigatoni Model. IICS (2010)
Laura Grigori, John R. Gilbert, Michel Cosnard
Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting. SIAM J. Matrix Anal. Appl. 30 (4) (2008)
Raphaël Chand, Michel Cosnard, Luigi Liquori
Powerful resource discovery for Arigatoni overlay network. Future Gener. Comput. Syst. 24 (1) (2008)
Jean-Claude Bermond, Michel Cosnard
Minimum number of wavelengths equals load in a DAG without internal cycle. IPDPS (2007)
Luigi Liquori, Michel Cosnard
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems. TGC (2007)
Raphaël Chand, Luigi Liquori, Michel Cosnard
Improving Resource Discovery in the Arigatoni Overlay Network. ARCS (2007)
Michel Cosnard, Luigi Liquori, Raphaël Chand
Virtual Organizations in Arigatoni. Electron. Notes Theor. Comput. Sci. 171 (3) (2007)
Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes
Optimal Solution of the Maximum All Request Path Grooming Problem. AICT/ICIW (2006)
Michel Cosnard, Hans-Joachim Bungartz, Efstratios Gallopoulos, Yousef Saad
Topic 10: Parallel Numerical Algorithms. Euro-Par (2006)
Didier Benza, Michel Cosnard, Luigi Liquori, Marc Vesin
Arigatoni: A Simple Programmable Overlay Network. John Vincent Atanasoff Symposium (2006)
Michel Cosnard, Vladimir Getov, Domenico Laforenza, Alexander Reinefeld
04451 Abstracts Collection - Future Generation Grids. Future Generation Grids (2004)
Michel Cosnard, Emmanuel Jeannot, Tao Yang
Compact DAG representation and its symbolic scheduling. J. Parallel Distributed Comput. 64 (8) (2004)
Michel Cosnard, André Merzky
Meta- and Grid-Computing. Euro-Par (2002)
Michel Cosnard
Automatic Parallelization of numerical programss : Application to Solve Linear Dense and Sparse Systemss. OPODIS (2002)
Michel Cosnard
Note from the Editor-in-Chief. Parallel Process. Lett. 11 (1) (2001)
Michel Cosnard, Laura Grigori
A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices. ICS (2001)
Michel Cosnard, Ulrich Finger, Jean-Luc Gaudiot
Editorial Note. Parallel Process. Lett. 11 (1) (2001)
Michel Cosnard
Editorial Note. Parallel Process. Lett. 11 (2/3) (2001)
Michel Cosnard, Emmanuel Jeannot
Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling. Parallel Process. Lett. 11 (1) (2001)
Jean-Paul Allouche, Michel Cosnard
The Komornik-Loreti Constant Is Transcendental. Am. Math. Mon. 107 (5) (2000)
Michel Cosnard, Laura Grigori
Using Postordering and Static Symbolic Factorization for Parallel Sparse LU. IPDPS (2000)
Michel Cosnard
Editorial Note. Parallel Process. Lett. 10 (1) (2000)
Michel Cosnard, Emmanuel Jeannot
Compact DAG Representation and Its Dynamic Scheduling. J. Parallel Distributed Comput. 58 (3) (1999)
Michel Cosnard
Editorial Note. Parallel Process. Lett. 9 (4) (1999)
Michel Cosnard
Theory and Models for Parallel Computation - Introduction. Euro-Par (1999)
Michel Cosnard, Emmanuel Jeannot, Tao Yang
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors. ICPP (1999)
Michel Cosnard
Editorial Note. Parallel Process. Lett. 9 (3) (1999)
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs. IPPS/SPDP (1998)
Michel Cosnard, Emmanuel Jeannot, Tao Yang
Symbolic Partitioning and Scheduling of Parameterized Task Graphs. ICPADS (1998)
Michel Cosnard, Eric Goles Ch.
Discrete State Neural Networks and Energies. Neural Networks 10 (2) (1997)
Michel Cosnard, Michel Loi
A Simple Algorithm for the Generation of Efficient Loop Structures. Int. J. Parallel Program. 24 (3) (1996)
Olivier Bournez, Michel Cosnard
On the Computational Power of Dynamical Systems and Hybrid Systems. Theor. Comput. Sci. 168 (2) (1996)
Michel Cosnard, Michel Loi
Automatic task graph generation techniques. HICSS (2) (1995)
Michel Cosnard, Michel Loi
Automatic Task Graph Generation Techniques. Parallel Process. Lett. 5 (1995)
Michel Cosnard, Michel Loi
A simple algorithm for the generation of efficient loop structures. PACT (1995)
Michel Cosnard, Eric Goles Ch.
A Characterization of the Existence of Energies for Neural Networks. ICALP (1995)
Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. J. Complex. 10 (1) (1994)
Michel Cosnard, Martín Matamala
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. MFCS (1994)
Pascal Koiran, Michel Cosnard, Max H. Garzon
Computability with Low-Dimensional Dynamical Systems. Theor. Comput. Sci. 132 (2) (1994)
Michel Cosnard, Pierre Fraigniaud
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. IEEE Trans. Parallel Distributed Syst. 5 (6) (1994)
Michel Cosnard, El Mostafa Daoudi
Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM. J. ACM 41 (2) (1994)
P. Bigot, Michel Cosnard
Probabilistic decision trees ans multilayered perceptrons. ESANN (1993)
Michel Cosnard, Max H. Garzon, Pascal Koiran
Computability Properties of Low-dimensional Dynamical Systems. STACS (1993)
Selim G. Akl, Michel Cosnard, Afonso Ferreira
Revisiting Parallel Speedup Complexity. ICCI (1992)
Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy
Complexity Issues in Neural Network Computations. LATIN (1992)
Selim G. Akl, Michel Cosnard, Afonso Ferreira
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. Theor. Comput. Sci. 95 (2) (1992)
Michel Cosnard, Pascal Koiran
Relations between Models of Parallel Abstract Machines. Heinz Nixdorf Symposium (1992)
Michel Cosnard, Maurice Tchuente, Gilbert Tindo
Sequences Generated by Neuronal Automata with Memory. Complex Syst. 6 (1) (1992)
Michel Cosnard, Afonso Ferreira
On the Real Power of Loosely Coupled Parallel Architectures. Parallel Process. Lett. 1 (1991)
Michel Cosnard, Afonso Ferreira
A Tight Lower Bound for Selection in Sorted X+Y. ICCI (1991)
Michel Cosnard, Jean Duprat, Yves Robert
Systolic Triangularization over Finite Fields. J. Parallel Distributed Comput. 9 (3) (1990)
Michel Cosnard, Jean-Laurent Philippe
Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor. CONPAR (1990)
Michel Cosnard, Jean Duprat, Afonso Ferreira
The Complexity of Searching in X+Y and Other Multisets. Inf. Process. Lett. 34 (2) (1990)
Michel Cosnard
Designing Parallel Algorithms for Transputer Networks (Abstract). ICCI (1990)
Michel Cosnard, Pierre Fraigniaud
A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. CONPAR (1990)
Michel Cosnard, Jean-Laurent Philippe
Distributed Algorithms for Deciphering. SIGAL International Symposium on Algorithms (1990)
Michel Cosnard, Pierre Fraigniaud
Finding the roots of a polynomial on an MIMD multicomputer. Parallel Comput. 15 (1-3) (1990)
Michel Cosnard, Jean Duprat, Afonso Ferreira
Complexity of Selection in X + Y. Theor. Comput. Sci. 67 (1) (1989)
Michel Cosnard, Yves Robert, Bernard Tourancheau
Evaluating speedups on distributed memory architectures. Parallel Comput. 10 (2) (1989)
Michel Cosnard, Afonso Ferreira
Generating Permutations on a VLSI Suitable Linear Network. Comput. J. 32 (6) (1989)
Michel Cosnard, Afonso Ferreira
Parallel Algorithms for Searching In X+Y. ICPP (3) (1989)
Michel Cosnard, Afonso Ferreira, Hugo Herbelin
The two list algorithm for the knapsack problem on a FPS T20. Parallel Comput. 9 (3) (1989)
Michel Cosnard, El Mostafa Daoudi, Yves Robert
Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. Optimal Algorithms (1989)
Michel Cosnard, Maurice Tchuente, Bernard Tourancheau
Systolic Gauss-Jordan elimination for dense linear systems. Parallel Comput. 10 (1) (1989)
Michel Cosnard, Eric Goles Ch., Driss Moumida
Bifurcation structure of a discrete neuronal equation. Discret. Appl. Math. 21 (1) (1988)
Michel Cosnard, Driss Moumida, Eric Goles, Thierry de St. Pierre
Dynamical Behavior of a Neural Automaton with Memory. Complex Syst. 2 (2) (1988)
Michel Cosnard, Mounir Marrakchi, Yves Robert, Denis Trystram
Parallel Gaussian elimination on an MIMD computer. Parallel Comput. 6 (3) (1988)
Michel Cosnard, Bernard Tourancheau, Gilles Villard
Gaussian Elimination on Message Passing Architecture. ICS (1987)
Michel Cosnard, Alain Guyot, Bertrand Hochet, Jean-Michel Muller, Hassan Ouaouicha, P. Paul, Eytan Zysman
The FELIN arithmetic coprocessor chip. IEEE Symposium on Computer Arithmetic (1987)
Michel Cosnard, Yves Robert
Complexity of parallel QR factorization. J. ACM 33 (4) (1986)
Michel Cosnard, Mounir Marrakchi, Yves Robert, Denis Trystram
Gauss Elimination Algorithms for MIMD Computers. CONPAR (1986)
Jorge J. Moré, Michel Cosnard
Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [C5]. ACM Trans. Math. Softw. 6 (2) (1980)
Jorge J. Moré, Michel Cosnard
Numerical Solution of Nonlinear Equations. ACM Trans. Math. Softw. 5 (1) (1979)