| 2007 |
|---|
| 10 | EE | Bruno Martin,
Claudine Peyrat:
A single-copy minimal-time simulation of a torus of automata by a ring of automata.
Discrete Applied Mathematics 155(16): 2130-2139 (2007) |
| 1997 |
|---|
| 9 | EE | Christine Garcia,
Claudine Peyrat:
Large Cayley Graphs on an Abelian Group.
Discrete Applied Mathematics 75(2): 125-133 (1997) |
| 1996 |
|---|
| 8 | | Jean-Claude Bermond,
Claudine Peyrat,
I. Sakho,
Maurice Tchuente:
Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays.
J. Parallel Distrib. Comput. 33(1): 69-75 (1996) |
| 1995 |
|---|
| 7 | EE | Christine Garcia,
Claudine Peyrat:
Broadcasting in an n-grid with a given neighborhood template.
HICSS (2) 1995: 574-583 |
| 1993 |
|---|
| 6 | EE | Jean-Claude Bermond,
Nathalie Homobono,
Claudine Peyrat:
Connectivity of kautz networks.
Discrete Mathematics 114(1-3): 51-62 (1993) |
| 1991 |
|---|
| 5 | | Pierre Fraigniaud,
Claudine Peyrat:
Broadcasting in a Hypercube when Some Calls Fail.
Inf. Process. Lett. 39(3): 115-119 (1991) |
| 1989 |
|---|
| 4 | EE | Nathalie Homobono,
Claudine Peyrat:
Graphs such that every two edges are contained in a shortest cycle.
Discrete Mathematics 76(1): 37-44 (1989) |
| 3 | | Jean-Claude Bermond,
Claudine Peyrat:
Induced Subgraphs of the Power of a Cycle.
SIAM J. Discrete Math. 2(4): 452-455 (1989) |
| 1988 |
|---|
| 2 | | Nathalie Homobono,
Claudine Peyrat:
Connectivity of Imase and Itoh Digraphs.
IEEE Trans. Computers 37(11): 1459-1461 (1988) |
| 1987 |
|---|
| 1 | EE | Terunao Soneoka,
Hiroshi Nakada,
Makoto Imase,
Claudine Peyrat:
Sufficient conditions for maximally connected dense graphs.
Discrete Mathematics 63(1): 53-66 (1987) |
