default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Cosnard
Person information
- affiliation: INRIA, France
- award (2007): Knight of the Legion of Honour
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c36]Jean-Claude Bermond, Frédéric Havet, Michel Cosnard:
Grabbing Olives on Linear Pizzas and Pissaladières. FUN 2022: 12:1-12:20
2010 – 2019
- 2013
- [j39]Michel Cosnard:
Celebrating the 60th birthday of Eric Goles. Theor. Comput. Sci. 504: 1-2 (2013) - [j38]Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes:
Directed acyclic graphs with the unique dipath property. Theor. Comput. Sci. 504: 5-11 (2013) - 2010
- [c35]Raphaël Chand, Luigi Liquori, Michel Cosnard:
Resource Discovery in the Arigatoni Model. IICS 2010: 437-449
2000 – 2009
- 2008
- [j37]Raphaël Chand, Michel Cosnard, Luigi Liquori
:
Powerful resource discovery for Arigatoni overlay network. Future Gener. Comput. Syst. 24(1): 31-38 (2008) - [j36]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): 1520-1545 (2008) - 2007
- [c34]Raphaël Chand, Luigi Liquori, Michel Cosnard:
Improving Resource Discovery in the Arigatoni Overlay Network. ARCS 2007: 98-111 - [c33]Jean-Claude Bermond, Michel Cosnard:
Minimum number of wavelengths equals load in a DAG without internal cycle. IPDPS 2007: 1-10 - [c32]Luigi Liquori, Michel Cosnard:
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems. TGC 2007: 90-107 - 2006
- [c31]Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes:
Optimal Solution of the Maximum All Request Path Grooming Problem. AICT/ICIW 2006: 28 - [c30]Michel Cosnard, Hans-Joachim Bungartz, Efstratios Gallopoulos, Yousef Saad:
Topic 10: Parallel Numerical Algorithms. Euro-Par 2006: 677-678 - [c29]Didier Benza, Michel Cosnard, Luigi Liquori, Marc Vesin:
Arigatoni: A Simple Programmable Overlay Network. John Vincent Atanasoff Symposium 2006: 82-91 - [c28]Michel Cosnard, Luigi Liquori, Raphaël Chand:
Virtual Organizations in Arigatoni. DCM@ICALP 2006: 55-75 - 2004
- [j35]Michel Cosnard, Emmanuel Jeannot, Tao Yang:
Compact DAG representation and its symbolic scheduling. J. Parallel Distributed Comput. 64(8): 921-935 (2004) - [e6]Michel Cosnard, Vladimir Getov, Domenico Laforenza, Alexander Reinefeld:
Future Generation Grids, 01.11. - 05.11.2004. Dagstuhl Seminar Proceedings 04451, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [i1]Michel Cosnard, Vladimir Getov, Domenico Laforenza, Alexander Reinefeld:
04451 Abstracts Collection - Future Generation Grids. Future Generation Grids 2004 - 2002
- [c27]Michel Cosnard, André Merzky:
Meta- and Grid-Computing. Euro-Par 2002: 861-862 - [c26]Michel Cosnard:
Automatic Parallelization of numerical programss : Application to Solve Linear Dense and Sparse Systemss. OPODIS 2002: 3-5 - 2001
- [j34]Michel Cosnard:
Note from the Editor-in-Chief. Parallel Process. Lett. 11(1): 1 (2001) - [j33]Michel Cosnard, Ulrich Finger, Jean-Luc Gaudiot:
Editorial Note. Parallel Process. Lett. 11(1): 3-5 (2001) - [j32]Michel Cosnard, Emmanuel Jeannot:
Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling. Parallel Process. Lett. 11(1): 151-168 (2001) - [j31]Michel Cosnard:
Editorial Note. Parallel Process. Lett. 11(2/3): 311 (2001) - [c25]Michel Cosnard, Laura Grigori:
A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices. ICS 2001: 146-153 - 2000
- [j30]Michel Cosnard:
Editorial Note. Parallel Process. Lett. 10(1): 1-2 (2000) - [j29]Jean-Paul Allouche, Michel Cosnard:
The Komornik-Loreti Constant Is Transcendental. Am. Math. Mon. 107(5): 448-449 (2000) - [c24]Michel Cosnard, Laura Grigori:
Using Postordering and Static Symbolic Factorization for Parallel Sparse LU. IPDPS 2000: 807-812
1990 – 1999
- 1999
- [j28]Michel Cosnard, Emmanuel Jeannot:
Compact DAG Representation and Its Dynamic Scheduling. J. Parallel Distributed Comput. 58(3): 487-514 (1999) - [j27]Michel Cosnard:
Editorial Note. Parallel Process. Lett. 9(3): 311-312 (1999) - [j26]Michel Cosnard:
Editorial Note. Parallel Process. Lett. 9(4): 451-452 (1999) - [c23]Michel Cosnard:
Theory and Models for Parallel Computation - Introduction. Euro-Par 1999: 523-524 - [c22]Michel Cosnard, Emmanuel Jeannot, Tao Yang:
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors. ICPP 1999: 413-421 - 1998
- [c21]Michel Cosnard, Emmanuel Jeannot, Tao Yang:
Symbolic Partitioning and Scheduling of Parameterized Task Graphs. ICPADS 1998: 428-434 - [c20]Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot:
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs. IPPS/SPDP 1998: 524-530 - 1997
- [j25]Michel Cosnard, Eric Goles Ch.:
Discrete State Neural Networks and Energies. Neural Networks 10(2): 327-334 (1997) - 1996
- [j24]Michel Cosnard, Michel Loi:
A Simple Algorithm for the Generation of Efficient Loop Structures. Int. J. Parallel Program. 24(3): 265-290 (1996) - [j23]Olivier Bournez, Michel Cosnard:
On the Computational Power of Dynamical Systems and Hybrid Systems. Theor. Comput. Sci. 168(2): 417-459 (1996) - 1995
- [b1]Michel Cosnard, Denis Trystram:
Parallel algorithms and architectures. International Thomson 1995, ISBN 978-1-85032-125-5, pp. I-XIV, 1-550 - [j22]Michel Cosnard, Michel Loi:
Automatic Task Graph Generation Techniques. Parallel Process. Lett. 5: 527-538 (1995) - [c19]Michel Cosnard, Michel Loi:
A simple algorithm for the generation of efficient loop structures. PACT 1995: 159-167 - [c18]Michel Cosnard, Michel Loi:
Automatic task graph generation techniques. HICSS (2) 1995: 113-122 - [c17]Michel Cosnard, Eric Goles Ch.:
A Characterization of the Existence of Energies for Neural Networks. ICALP 1995: 570-580 - 1994
- [j21]Michel Cosnard, El Mostafa Daoudi:
Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM. J. ACM 41(2): 399-421 (1994) - [j20]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): 57-63 (1994) - [j19]Pascal Koiran, Michel Cosnard, Max H. Garzon:
Computability with Low-Dimensional Dynamical Systems. Theor. Comput. Sci. 132(2): 113-128 (1994) - [j18]Michel Cosnard, Pierre Fraigniaud:
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer. IEEE Trans. Parallel Distributed Syst. 5(6): 639-648 (1994) - [c16]Michel Cosnard, Martín Matamala:
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC. MFCS 1994: 27-37 - [e5]Michel Cosnard, Afonso Ferreira, Joseph G. Peters:
Parallel and Distributed Computing, First Canada-France Conference, Montréal, Canada, May 19-21, 1994, Proceedings. Lecture Notes in Computer Science 805, Springer 1994, ISBN 3-540-58078-6 [contents] - [e4]Michel Cosnard, Guang R. Gao, Gabriel M. Silberman:
Parallel Architectures and Compilation Techniques, Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques, PACT'94, Montréal, Canada, 24-26 August, 1994. IFIP Transactions A-50, North-Holland 1994, ISBN 0-444-81926-6 [contents] - 1993
- [c15]P. Bigot, Michel Cosnard:
Probabilistic decision trees ans multilayered perceptrons. ESANN 1993 - [c14]Michel Cosnard, Max H. Garzon, Pascal Koiran:
Computability Properties of Low-dimensional Dynamical Systems. STACS 1993: 365-373 - [e3]Michel Cosnard, Kemal Ebcioglu, Jean-Luc Gaudiot:
Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, PACT 1993, Orlando, Florida, USA, January 20-22, 1993. IFIP Transactions A-23, North-Holland 1993, ISBN 0-444-88464-5 [contents] - [e2]Michel Cosnard, Ramón Puigjaner:
Decentralized and Distributed Systems, Proceedings of the IFIP WG10.3 International Conference on Decentralized and Distributed Systems, Palma de Mallorca, Spain, 13-17 September 1993. IFIP Transactions A-39, North-Holland 1993, ISBN 0-444-81791-3 [contents] - 1992
- [j17]Michel Cosnard, Maurice Tchuenté, Gilbert Tindo:
Sequences Generated by Neuronal Automata with Memory. Complex Syst. 6(1) (1992) - [j16]Selim G. Akl, Michel Cosnard, Afonso Ferreira:
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. Theor. Comput. Sci. 95(2): 323-337 (1992) - [c13]Selim G. Akl, Michel Cosnard, Afonso Ferreira:
Revisiting Parallel Speedup Complexity. ICCI 1992: 179-182 - [c12]Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy:
Complexity Issues in Neural Network Computations. LATIN 1992: 530-543 - [c11]Michel Cosnard, Pascal Koiran:
Relations between Models of Parallel Abstract Machines. Heinz Nixdorf Symposium 1992: 37-46 - [e1]Luc Bougé, Michel Cosnard, Yves Robert, Denis Trystram:
Parallel Processing: CONPAR 92 - VAPP V, Second Joint International Conference on Vector and Parallel Processing, Lyon, France, September 1-4, 1992, Proceedings. Lecture Notes in Computer Science 634, Springer 1992, ISBN 3-540-55895-0 [contents] - 1991
- [j15]Michel Cosnard, Afonso Ferreira:
On the Real Power of Loosely Coupled Parallel Architectures. Parallel Process. Lett. 1: 103-111 (1991) - [c10]Michel Cosnard, Afonso Ferreira:
A Tight Lower Bound for Selection in Sorted X+Y. ICCI 1991: 134-138 - 1990
- [j14]Michel Cosnard, Jean Duprat, Afonso Ferreira:
The Complexity of Searching in X+Y and Other Multisets. Inf. Process. Lett. 34(2): 103-109 (1990) - [j13]Michel Cosnard, Jean Duprat, Yves Robert:
Systolic Triangularization over Finite Fields. J. Parallel Distributed Comput. 9(3): 252-260 (1990) - [j12]Michel Cosnard, Pierre Fraigniaud:
Finding the roots of a polynomial on an MIMD multicomputer. Parallel Comput. 15(1-3): 75-85 (1990) - [c9]Michel Cosnard, Jean-Laurent Philippe:
Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor. CONPAR 1990: 863-874 - [c8]Michel Cosnard, Pierre Fraigniaud:
A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. CONPAR 1990: 875-886 - [c7]Michel Cosnard:
Designing Parallel Algorithms for Transputer Networks (Abstract). ICCI 1990: 5 - [c6]Michel Cosnard, Jean-Laurent Philippe:
Distributed Algorithms for Deciphering. SIGAL International Symposium on Algorithms 1990: 191-200
1980 – 1989
- 1989
- [j11]Michel Cosnard, Afonso Ferreira:
Generating Permutations on a VLSI Suitable Linear Network. Comput. J. 32(6): 571-573 (1989) - [j10]Michel Cosnard, Afonso Ferreira, Hugo Herbelin:
The two list algorithm for the knapsack problem on a FPS T20. Parallel Comput. 9(3): 385-388 (1989) - [j9]Michel Cosnard, Maurice Tchuenté, Bernard Tourancheau:
Systolic Gauss-Jordan elimination for dense linear systems. Parallel Comput. 10(1): 117-122 (1989) - [j8]Michel Cosnard, Yves Robert, Bernard Tourancheau:
Evaluating speedups on distributed memory architectures. Parallel Comput. 10(2): 247-253 (1989) - [j7]Michel Cosnard, Jean Duprat, Afonso Ferreira:
Complexity of Selection in X + Y. Theor. Comput. Sci. 67(1): 105-120 (1989) - [c5]Michel Cosnard, Afonso Ferreira:
Parallel Algorithms for Searching In X+Y. ICPP (3) 1989: 16-19 - [c4]Michel Cosnard, El Mostafa Daoudi, Yves Robert:
Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. Optimal Algorithms 1989: 86-105 - 1988
- [j6]Michel Cosnard, Driss Moumida, Eric Goles, Thierry de St. Pierre:
Dynamical Behavior of a Neural Automaton with Memory. Complex Syst. 2(2) (1988) - [j5]Michel Cosnard, Eric Goles Ch., Driss Moumida:
Bifurcation structure of a discrete neuronal equation. Discret. Appl. Math. 21(1): 21-34 (1988) - [j4]Michel Cosnard, Mounir Marrakchi, Yves Robert, Denis Trystram:
Parallel Gaussian elimination on an MIMD computer. Parallel Comput. 6(3): 275-296 (1988) - 1987
- [c3]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: 107-112 - [c2]Michel Cosnard, Bernard Tourancheau, Gilles Villard:
Gaussian Elimination on Message Passing Architecture. ICS 1987: 611-628 - 1986
- [j3]Michel Cosnard, Yves Robert:
Complexity of parallel QR factorization. J. ACM 33(4): 712-723 (1986) - [c1]Michel Cosnard, Mounir Marrakchi, Yves Robert, Denis Trystram:
Gauss Elimination Algorithms for MIMD Computers. CONPAR 1986: 247-254 - 1980
- [j2]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): 240-251 (1980)
1970 – 1979
- 1979
- [j1]Jorge J. Moré, Michel Cosnard:
Numerical Solution of Nonlinear Equations. ACM Trans. Math. Softw. 5(1): 64-85 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
