The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Claudine Peyrat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  11. Fault-tolerant routings in Kautz and de Bruijn networks. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002