BACK TO MASCOTTE PUBLICATION INDEX
Publications of Michel Cosnard

M. Cosnard,
A. Ferreira,
and J. Peters, editors.
Parallel and Distributed Computing  Theory and Practice,
volume 805 of Lecture Notes in Computer Science.
SpringerVerlag,
1994.
[bibtexentry]

JeanClaude Bermond,
Michel Cosnard,
and Stéphane Pérennes.
Directed acyclic graphs with the unique dipath property.
Theoretical Computer Science,
504:511,
September 2013.
[WWW
] [PDF
]
Keywords:
DAG (Directed acyclic graphs),
load,
wavelengths,
dipaths,
good labelings,
conflict graphs,
intersection graphs,
chromatic number.
[Abstract] [bibtexentry]

R. Chand,
M. Cosnard,
and L. Liquori.
Powerful resource discovery for Arigatoni overlay network.
Future Generation Computer Systems,
24:3138,
2008.
[WWW
] [PDF
] [bibtexentry]

L. Grigori,
M. Cosnard,
and E. G. Ng.
On the row merge for sparse LU factorization with partial pivoting.
BIT Numerical Mathematics,
47(1):4576,
March 2007.
[PDF
] [Abstract] [bibtexentry]

M. Cosnard,
E. Jeannot,
and T. Yang.
Compact Dag Representation and its Symbolic Scheduling.
Journal of Parallel and Distributed Computing,
64(8):921935,
August 2004.
[bibtexentry]

M. Cosnard.
Introduction to the Complexity of Parallel Algorithms.
In R. Corrêa,
I. Dutra,
M. Fiallos,
and F. Gomes, editors,Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications,
Applied Optimization,
chapter 1, part I,
pages 325.
Kluwer Academic Publishers,
Boston (USA),
2002.
[bibtexentry]

J.P. Allouche and M. Cosnard.
Noninteger bases, iteration of continuous real maps, and an arithmetic selfsimilar set.
Acta Mathematica Hungarica,
91:325332,
2001.
[bibtexentry]

M. Cosnard and E. Jeannot.
Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling.
Parallel Processing Letters,
11(1):151168,
2001.
[bibtexentry]

M. Cosnard and E. Goles.
Discrete state neural networks and energies.
Neural Networks,
10(2):327334,
1997.
[bibtexentry]

O. Bournez and M. Cosnard.
On the computational power of dynamical systems and hybrid systems.
Theoretical Computer Science,
168(2):417459,
1996.
[bibtexentry]

S. Akl,
M. Cosnard,
and A. Ferreira.
Datamovementintensive problems : two folk theorems in parallel computation revisited.
Theoretical Computer Science,
95:323337,
1992.
[bibtexentry]

M. Cosnard and A. Ferreira.
On the real power of loosely coupled parallel architectures.
Parallel Processing Letters,
1(2):103111,
1991.
[bibtexentry]

M. Cosnard,
J. Duprat,
and A. Ferreira.
The complexity of searching in X+Y and other multisets.
Information Processing Letters,
(34):103109,
1990.
[bibtexentry]

M. Cosnard,
J. Duprat,
and A. Ferreira.
Complexity of selection in X+Y.
Theoretical Computer Science,
67:115120,
1989.
[bibtexentry]

M. Cosnard and A. Ferreira.
Generating Permutations on a VLSI Suitable Linear Network.
The Computer Journal,
32(6):571573,
1989.
[bibtexentry]

M. Cosnard,
A. Ferreira,
and H. Herbelin.
The TwoList Algorithm for the Knapsack Problem on a FPS T20.
Parallel Computing,
(9):385388,
1988.
[bibtexentry]

JC. Bermond and M. Cosnard.
Minimum number of wavelengths equals load in a DAG without internal cycle.
In Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International,
Long Beach, CA, U.S.A.,
pages 110,
March 2007.
[PDF
] [bibtexentry]

R. Chand,
L. Liquori,
and M. Cosnard.
Improving Resource Discovery in the Arigatoni Overlay Network.
In 20th International Conference on Architecture of Computing Systems (ARCS 2007),
volume 4415 of Lecture Notes in Computer Science,
Zurich, Switzerland,
pages 98111,
2007.
Springer.
[PDF
] [bibtexentry]

M. Cosnard,
L. Liquori,
and R. Chand.
Virtual Organizations in Arigatoni.
In DCM, International Workshop on Developpment in Computational Models,
volume 171 of Electronique Notes in Theoretical Computer Science,
pages 5575,
2007.
[WWW
] [PDF
] [bibtexentry]

L. Liquori and M. Cosnard.
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems.
In 3rd Symposium on Trustworthy Global Computing (TGC 2007),
volume 4912 of Lecture Notes in Computer Science,
Sophia Antipolis, France,
pages 90107,
November 2007.
Springer.
[PDF
] [bibtexentry]

L. Liquori and M. Cosnard.
Weaving Arigatoni with a Graph Topology.
In International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2007),
Papeete, French Polynesia,
pages 8p,
November 2007.
IEEE Computer Society Press.
[PDF
] [bibtexentry]

D. Benza,
M. Cosnard,
L. Liquori,
and M. Vesin.
Arigatoni: Overlaying Internet via Low Level Network Protocols.
In JVA: John Vincent Atanasoff International Symposium on Modern Computing,
pages 8291,
2006.
IEEE.
[PDF
] [bibtexentry]

JC. Bermond,
M. Cosnard,
D. Coudert,
and S. Pérennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
In Advanced International Conference on Telecommunications (AICT),
pages 6p,
2006.
IEEE.
[PDF
] [Abstract] [bibtexentry]

R. Chand,
M. Cosnard,
and L. Liquori.
Resource Discovery in the Arigatoni Overlay Network.
In Proceedings of the International Workshop on Innovative Internet Community Systems (I2CS),
pages 13p,
2006.
[PDF
] [bibtexentry]

M. Cosnard and L. Grigori.
A Parallel Algorithm for Sparse Symbolic LU Factorization without Pivoting on Out of Core Matrices.
In 15th ACM International Conference on Supercomputing (ICS'01),
2001.
[bibtexentry]

M. Cosnard and E. Jeannot.
Automatic CoarseGrained Parallelization Techniques.
In NATO workshop on Advances in High Performance Computing,
1997.
Kluwer Academic Publishers.
[bibtexentry]

S. Akl,
M. Cosnard,
and A. Ferreira.
Revisiting parallel speedup complexity.
In W.W. Koczkodaj,
P.L. Lauer,
and A.A. Toptsis, editors,
Proceedings of the IEEE International Conference on Computing and Information  ICCI'92,
pages 179182,
1992.
IEEE Press.
[bibtexentry]

M. Cosnard and A. Ferreira.
Designing nonnumerical parallel algorithms.
In D.J. Evans,
G.R. Joubert,
and H. Liddell, editors,
invited paper, Proceedings of the International Conference on Parallel Computing  ParCo'91,
London (UK),
pages 318,
1992.
Elsevier Science Publishers B.V..
[bibtexentry]

M. Cosnard and A. Ferreira.
A tight bound for selection in X+Y.
In F. Dehne et al., editor,
Advances in Computing and Information  ICCI '91,
volume 497 of Lecture Notes in Computer Science,
pages 134138,
1991.
SpringerVerlag.
[bibtexentry]

M. Cosnard and A. Ferreira.
Parallel algorithms for searching in X+Y.
In F.Ris and P.M.Kogge, editors,
Proceedings of the International Conference on Parallel Processing  ICPP'89,
volume 3,
pages 1619,
1989.
Penn State University Press.
[bibtexentry]

M. Cosnard and A. Ferreira.
A processor network for generating all the permutations.
In E. Chiricozzi and A. D'Amico, editors,
Parallel Processing and Applications,
pages 141147,
1988.
NorthHolland.
[bibtexentry]

JC. Bermond,
M. Cosnard,
and S. Pérennes.
Directed acyclic graphs with unique path property.
Technical report 6932,
INRIA,
May 2009.
[WWW
] [PDF
] [Abstract] [bibtexentry]

JC. Bermond,
M. Cosnard,
D. Coudert,
and S. Perennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
Technical report,
INRIA Research Report 5627 (.ps.gz) and I3S Research Report I3S/RR200518FR (.pdf),
2005.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtexentry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:01 2013
This document was translated from BibT_{E}X by
bibtex2html