Search the dblp DataBase
Michel Cosnard :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jean-Claude Bermond , Michel Cosnard , David Coudert , Stéphane Pérennes Optimal Solution of the Maximum All Request Path Grooming Problem. [Citation Graph (0, 0)][DBLP ] AICT/ICIW, 2006, pp:28- [Conf ] Raphaël Chand , Luigi Liquori , Michel Cosnard Improving Resource Discovery in the Arigatoni Overlay Network. [Citation Graph (0, 0)][DBLP ] ARCS, 2007, pp:98-111 [Conf ] Michel Cosnard , Mounir Marrakchi , Yves Robert , Denis Trystram Gauss Elimination Algorithms for MIMD Computers. [Citation Graph (0, 0)][DBLP ] CONPAR, 1986, pp:247-254 [Conf ] Michel Cosnard , Pierre Fraigniaud A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. [Citation Graph (0, 0)][DBLP ] CONPAR, 1990, pp:875-886 [Conf ] Michel Cosnard , Jean-Laurent Philippe Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor. [Citation Graph (0, 0)][DBLP ] CONPAR, 1990, pp:863-874 [Conf ] Michel Cosnard Theory and Models for Parallel Computation - Introduction. [Citation Graph (0, 0)][DBLP ] Euro-Par, 1999, pp:523-524 [Conf ] Michel Cosnard , Hans-Joachim Bungartz , Efstratios Gallopoulos , Yousef Saad Topic 10: Parallel Numerical Algorithms. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2006, pp:677-678 [Conf ] Michel Cosnard , André Merzky Meta- and Grid-Computing. [Citation Graph (0, 0)][DBLP ] Euro-Par, 2002, pp:861-862 [Conf ] Michel Cosnard , Michel Loi Automatic task graph generation techniques. [Citation Graph (0, 0)][DBLP ] HICSS (2), 1995, pp:113-122 [Conf ] Michel Cosnard , Eric Goles Ch. A Characterization of the Existence of Energies for Neural Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 1995, pp:570-580 [Conf ] Selim G. Akl , Michel Cosnard , Afonso Ferreira Revisiting Parallel Speedup Complexity. [Citation Graph (0, 0)][DBLP ] ICCI, 1992, pp:179-182 [Conf ] Michel Cosnard , Afonso Ferreira A Tight Lower Bound for Selection in Sorted X+Y. [Citation Graph (0, 0)][DBLP ] ICCI, 1991, pp:134-138 [Conf ] Michel Cosnard Designing Parallel Algorithms for Transputer Networks (Abstract). [Citation Graph (0, 0)][DBLP ] ICCI, 1990, pp:5- [Conf ] Michel Cosnard , Emmanuel Jeannot , Tao Yang Symbolic Partitioning and Scheduling of Parameterized Task Graphs. [Citation Graph (0, 0)][DBLP ] ICPADS, 1998, pp:428-434 [Conf ] Michel Cosnard , Afonso Ferreira Parallel Algorithms for Searching In X+Y. [Citation Graph (0, 0)][DBLP ] ICPP (3), 1989, pp:16-19 [Conf ] Michel Cosnard , Emmanuel Jeannot , Tao Yang SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors. [Citation Graph (0, 0)][DBLP ] ICPP, 1999, pp:413-421 [Conf ] Michel Cosnard , Laura Grigori A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices. [Citation Graph (0, 0)][DBLP ] ICS, 2001, pp:146-153 [Conf ] Michel Cosnard , Bernard Tourancheau , G. Villard Gaussian Elimination on Message Passing Architecture. [Citation Graph (0, 0)][DBLP ] ICS, 1987, pp:611-628 [Conf ] Michel Cosnard , Laura Grigori Using Postordering and Static Symbolic Factorization for Parallel Sparse LU. [Citation Graph (0, 0)][DBLP ] IPDPS, 2000, pp:807-0 [Conf ] Michel Cosnard , Emmanuel Jeannot , Laurence Rougeot Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs. [Citation Graph (0, 0)][DBLP ] IPPS/SPDP, 1998, pp:524-530 [Conf ] Michel Cosnard , Pascal Koiran , Hélène Paugam-Moisy Complexity Issues in Neural Network Computations. [Citation Graph (0, 0)][DBLP ] LATIN, 1992, pp:530-543 [Conf ] Michel Cosnard , Martín Matamala On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. [Citation Graph (0, 0)][DBLP ] MFCS, 1994, pp:27-37 [Conf ] Michel Cosnard , Pascal Koiran Relations between Models of Parallel Abstract Machines. [Citation Graph (0, 0)][DBLP ] Heinz Nixdorf Symposium, 1992, pp:37-46 [Conf ] Michel Cosnard , El Mostafa Daoudi , Yves Robert Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. [Citation Graph (0, 0)][DBLP ] Optimal Algorithms, 1989, pp:86-105 [Conf ] Michel Cosnard Automatic Parallelization of numerical programss : Application to Solve Linear Dense and Sparse Systemss. [Citation Graph (0, 0)][DBLP ] OPODIS, 2002, pp:3-5 [Conf ] Michel Cosnard , Jean-Laurent Philippe Distributed Algorithms for Deciphering. [Citation Graph (0, 0)][DBLP ] SIGAL International Symposium on Algorithms, 1990, pp:191-200 [Conf ] Michel Cosnard , Max H. Garzon , Pascal Koiran Computability Properties of Low-dimensional Dynamical Systems. [Citation Graph (0, 0)][DBLP ] STACS, 1993, pp:365-373 [Conf ] Didier Benza , Michel Cosnard , Luigi Liquori , Marc Vesin Arigatoni: A Simple Programmable Overlay Network. [Citation Graph (0, 0)][DBLP ] John Vincent Atanasoff Symposium, 2006, pp:82-91 [Conf ] Michel Cosnard , Afonso Ferreira Generating Permutations on a VLSI Suitable Linear Network. [Citation Graph (0, 0)][DBLP ] Comput. J., 1989, v:32, n:6, pp:571-573 [Journal ] Michel Cosnard , Jean Duprat , Afonso Ferreira The Complexity of Searching in X+Y and Other Multisets. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:34, n:2, pp:103-109 [Journal ] Michel Cosnard , El Mostafa Daoudi Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:2, pp:399-421 [Journal ] Michel Cosnard , Yves Robert Complexity of parallel QR factorization. [Citation Graph (0, 0)][DBLP ] J. ACM, 1986, v:33, n:4, pp:712-723 [Journal ] Michel Cosnard , Pascal Koiran , Hélène Paugam-Moisy Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1994, v:10, n:1, pp:57-63 [Journal ] Michel Cosnard , Jean Duprat , Yves Robert Systolic Triangularization over Finite Fields. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1990, v:9, n:3, pp:252-260 [Journal ] Michel Cosnard , Emmanuel Jeannot Compact DAG Representation and Its Dynamic Scheduling. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1999, v:58, n:3, pp:487-514 [Journal ] Michel Cosnard , Emmanuel Jeannot , Tao Yang Compact DAG representation and its symbolic scheduling. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2004, v:64, n:8, pp:921-935 [Journal ] Michel Cosnard , Eric Goles Ch. Discrete State Neural Networks and Energies. [Citation Graph (0, 0)][DBLP ] Neural Networks, 1997, v:10, n:2, pp:327-334 [Journal ] Michel Cosnard , Pierre Fraigniaud Finding the roots of a polynomial on an MIMD multicomputer. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1990, v:15, n:1-3, pp:75-85 [Journal ] Michel Cosnard , Afonso Ferreira , Hugo Herbelin The two list algorithm for the knapsack problem on a FPS T20. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1989, v:9, n:3, pp:385-388 [Journal ] Michel Cosnard , Mounir Marrakchi , Yves Robert , Denis Trystram Parallel Gaussian elimination on an MIMD computer. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1988, v:6, n:3, pp:275-296 [Journal ] Michel Cosnard , Yves Robert , Bernard Tourancheau Evaluating speedups on distributed memory architectures. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1989, v:10, n:2, pp:247-253 [Journal ] Michel Cosnard , Maurice Tchuente , Bernard Tourancheau Systolic Gauss-Jordan elimination for dense linear systems. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1989, v:10, n:1, pp:117-122 [Journal ] Michel Cosnard Editorial Note. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2000, v:10, n:1, pp:1-2 [Journal ] Michel Cosnard Note from the Editor-in-Chief. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2001, v:11, n:1, pp:1- [Journal ] Michel Cosnard Editorial Note. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2001, v:11, n:2/3, pp:311- [Journal ] Michel Cosnard Editorial Note. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1999, v:9, n:4, pp:451-452 [Journal ] Michel Cosnard Editorial Note. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1999, v:9, n:3, pp:311-312 [Journal ] Michel Cosnard , Afonso Ferreira On the Real Power of Loosely Coupled Parallel Architectures. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1991, v:1, n:, pp:103-111 [Journal ] Michel Cosnard , Ulrich Finger , Jean-Luc Gaudiot Editorial Note. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2001, v:11, n:1, pp:3-5 [Journal ] Michel Cosnard , Emmanuel Jeannot Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 2001, v:11, n:1, pp:151-168 [Journal ] Michel Cosnard , Michel Loi Automatic Task Graph Generation Techniques. [Citation Graph (0, 0)][DBLP ] Parallel Processing Letters, 1995, v:5, n:, pp:527-538 [Journal ] Selim G. Akl , Michel Cosnard , Afonso Ferreira Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:95, n:2, pp:323-337 [Journal ] Olivier Bournez , Michel Cosnard On the Computational Power of Dynamical Systems and Hybrid Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:168, n:2, pp:417-459 [Journal ] Michel Cosnard , Jean Duprat , Afonso Ferreira Complexity of Selection in X + Y. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1989, v:67, n:1, pp:105-120 [Journal ] Pascal Koiran , Michel Cosnard , Max H. Garzon Computability with Low-Dimensional Dynamical Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:132, n:2, pp:113-128 [Journal ] Jorge J. Moré , Michel Cosnard Numerical Solution of Nonlinear Equations. [Citation Graph (0, 0)][DBLP ] ACM Trans. Math. Softw., 1979, v:5, n:1, pp:64-85 [Journal ] Jorge J. Moré , Michel Cosnard Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [C5]. [Citation Graph (0, 0)][DBLP ] ACM Trans. Math. Softw., 1980, v:6, n:2, pp:240-251 [Journal ] Michel Cosnard , Pierre Fraigniaud Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:6, pp:639-648 [Journal ] Jean-Claude Bermond , Michel Cosnard Minimum number of wavelengths equals load in a DAG without internal cycle. [Citation Graph (0, 0)][DBLP ] IPDPS, 2007, pp:1-10 [Conf ] Michel Cosnard , Luigi Liquori , Raphaël Chand Virtual Organizations in Arigatoni. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2007, v:171, n:3, pp:55-75 [Journal ] Resource Discovery in the Arigatoni Model. [Citation Graph (, )][DBLP ] Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems. [Citation Graph (, )][DBLP ] Bifurcation structure of a discrete neuronal equation. [Citation Graph (, )][DBLP ] Search in 0.010secs, Finished in 0.014secs