Claudine Peyrat

14 papers Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2007 J jnl
A single-copy minimal-time simulation of a torus of automata by a ring of automata.
Discret. Appl. Math.
Bruno Martin, Claudine Peyrat
1997 J jnl
Large Cayley Graphs on an Abelian Group.
Discret. Appl. Math.
Christine Garcia, Claudine Peyrat
1996 J jnl
Parallelization of the {Gaussian} Elimination Algorithm on Systolic Arrays.
J. Parallel Distributed Comput.
Jean-Claude Bermond, Claudine Peyrat, I. Sakho, Maurice Tchuenté
1995 — conf
Broadcasting in an n-grid with a given neighborhood template.
HICSS (2)
Christine Garcia, Claudine Peyrat
1993 J jnl
Connectivity of kautz networks.
Discret. Math.
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
1991 J jnl
Broadcasting in a Hypercube when Some Calls Fail.
Inf. Process. Lett.
Pierre Fraigniaud, Claudine Peyrat
1989 J jnl
Fault-tolerant routings in Kautz and de Bruijn networks.
Discret. Appl. Math.
Nathalie Homobono, Claudine Peyrat
1989 J jnl
Graphs such that every two edges are contained in a shortest cycle.
Discret. Math.
Nathalie Homobono, Claudine Peyrat
1989 J jnl
Induced Subgraphs of the Power of a Cycle.
SIAM J. Discret. Math.
Jean-Claude Bermond, Claudine Peyrat
1989 J jnl
Large fault-tolerant interconnection networks.
Graphs Comb.
Jean-Claude Bermond, Nathalie Homobono, Claudine Peyrat
1988 J jnl
Connectivity of Imase and Itoh Digraphs.
IEEE Trans. Computers
Nathalie Homobono, Claudine Peyrat
1987 J jnl
Sufficient conditions for maximally connected dense graphs.
Discret. Math.
Terunao Soneoka, Hiroshi Nakada, Makoto Imase, Claudine Peyrat
1986 J jnl
On iterated clique graphs with increasing diameters.
J. Graph Theory
Claudine Peyrat, Douglas F. Rall, Peter J. Slater
1984 J jnl
Diameter vulnerability of graphs.
Discret. Appl. Math.
Claudine Peyrat