Michel Cosnard

Affiliations:
  • INRIA, France


According to our database1, Michel Cosnard authored at least 72 papers between 1979 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Grabbing Olives on Linear Pizzas and Pissaladières.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2013
Celebrating the 60th birthday of Eric Goles.
Theor. Comput. Sci., 2013

Directed acyclic graphs with the unique dipath property.
Theor. Comput. Sci., 2013

2010
Resource Discovery in the Arigatoni Model.
Proceedings of the 10th International Conference on Innovative Internet Community Services (I<sup>2</sup>CS), 2010

2008
Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting.
SIAM J. Matrix Anal. Appl., 2008

Powerful resource discovery for Arigatoni overlay network.
Future Gener. Comput. Syst., 2008

2007
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems.
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Minimum number of wavelengths equals load in a DAG without internal cycle.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Improving Resource Discovery in the Arigatoni Overlay Network.
Proceedings of the Architecture of Computing Systems, 2007

2006
Virtual Organizations in Arigatoni.
Proceedings of the Second International Workshop on Developments in Computational Models, 2006

Arigatoni: A Simple Programmable Overlay Network.
Proceedings of the 2006 IEEE John Vincent Atanasoff International Symposium on Modern Computing (JVA2006), 2006

Topic 10: Parallel Numerical Algorithms.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

Optimal Solution of the Maximum All Request Path Grooming Problem.
Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2004
Compact DAG representation and its symbolic scheduling.
J. Parallel Distributed Comput., 2004

04451 Abstracts Collection - Future Generation Grids.
Proceedings of the Future Generation Grids, 01.11. - 05.11.2004, 2004

2002
Automatic Parallelization of numerical programss : Application to Solve Linear Dense and Sparse Systemss.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

Meta- and Grid-Computing.
Proceedings of the Euro-Par 2002, 2002

2001
Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling.
Parallel Process. Lett., 2001

Editorial Note.
Parallel Process. Lett., 2001

Note from the Editor-in-Chief.
Parallel Process. Lett., 2001

A parallel algorithm for sparse symbolic LU factorization without pivoting on out-of-core matrices.
Proceedings of the 15th international conference on Supercomputing, 2001

2000
The Komornik-Loreti Constant Is Transcendental.
Am. Math. Mon., 2000

Editorial Note.
Parallel Process. Lett., 2000

Using Postordering and Static Symbolic Factorization for Parallel Sparse LU.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Compact DAG Representation and Its Dynamic Scheduling.
J. Parallel Distributed Comput., 1999

SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors.
Proceedings of the International Conference on Parallel Processing 1999, 1999

Theory and Models for Parallel Computation - Introduction.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

Symbolic Partitioning and Scheduling of Parameterized Task Graphs.
Proceedings of the International Conference on Parallel and Distributed Systems, 1998

1997
Discrete State Neural Networks and Energies.
Neural Networks, 1997

1996
On the Computational Power of Dynamical Systems and Hybrid Systems.
Theor. Comput. Sci., 1996

A Simple Algorithm for the Generation of Efficient Loop Structures.
Int. J. Parallel Program., 1996

1995
Automatic Task Graph Generation Techniques.
Parallel Process. Lett., 1995

A Characterization of the Existence of Energies for Neural Networks.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Parallel algorithms and architectures.
International Thomson, ISBN: 978-1-85032-125-5, 1995

1994
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer.
IEEE Trans. Parallel Distributed Syst., 1994

Computability with Low-Dimensional Dynamical Systems.
Theor. Comput. Sci., 1994

Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons.
J. Complex., 1994

Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM.
J. ACM, 1994

On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993
Computability Properties of Low-dimensional Dynamical Systems.
Proceedings of the STACS 93, 1993

Probabilistic decision trees ans multilayered perceptrons.
Proceedings of the 1st European Symposium on Artificial Neural Networks, 1993

1992
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited.
Theor. Comput. Sci., 1992

Sequences Generated by Neuronal Automata with Memory.
Complex Syst., 1992

Relations between Models of Parallel Abstract Machines.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Complexity Issues in Neural Network Computations.
Proceedings of the LATIN '92, 1992

Revisiting Parallel Speedup Complexity.
Proceedings of the Computing and Information, 1992

1991
On the Real Power of Loosely Coupled Parallel Architectures.
Parallel Process. Lett., 1991

A Tight Lower Bound for Selection in Sorted X+Y.
Proceedings of the Advances in Computing and Information, 1991

1990
Finding the roots of a polynomial on an MIMD multicomputer.
Parallel Comput., 1990

Systolic Triangularization over Finite Fields.
J. Parallel Distributed Comput., 1990

The Complexity of Searching in X+Y and Other Multisets.
Inf. Process. Lett., 1990

Distributed Algorithms for Deciphering.
Proceedings of the Algorithms, 1990

Designing Parallel Algorithms for Transputer Networks (Abstract).
Proceedings of the Advances in Computing and Information, 1990

Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor.
Proceedings of the CONPAR 90, 1990

A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial.
Proceedings of the CONPAR 90, 1990

1989
Complexity of Selection in X + Y.
Theor. Comput. Sci., 1989

Systolic Gauss-Jordan elimination for dense linear systems.
Parallel Comput., 1989

Evaluating speedups on distributed memory architectures.
Parallel Comput., 1989

The two list algorithm for the knapsack problem on a FPS T20.
Parallel Comput., 1989

Generating Permutations on a VLSI Suitable Linear Network.
Comput. J., 1989

Complexity of the Parallel Givens Facotrization on Shared Memory Architectures.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Parallel Algorithms for Searching In X+Y.
Proceedings of the International Conference on Parallel Processing, 1989

1988
Parallel Gaussian elimination on an MIMD computer.
Parallel Comput., 1988

Bifurcation structure of a discrete neuronal equation.
Discret. Appl. Math., 1988

Dynamical Behavior of a Neural Automaton with Memory.
Complex Syst., 1988

1987
Gaussian Elimination on Message Passing Architecture.
Proceedings of the Supercomputing, 1987

The FELIN arithmetic coprocessor chip.
Proceedings of the 8th IEEE Symposium on Computer Arithmetic, 1987

1986
Complexity of parallel QR factorization.
J. ACM, 1986

Gauss Elimination Algorithms for MIMD Computers.
Proceedings of the CONPAR 86: Conference on Algorithms and Hardware for Parallel Processing, 1986

1980
Algorithm 554: BRENTM, A Fortran Subroutine for the Numerical Solution of Nonlinear Equations [C5].
ACM Trans. Math. Softw., 1980

1979
Numerical Solution of Nonlinear Equations.
ACM Trans. Math. Softw., 1979


  Loading...