The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pascal Berthomé: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pascal Berthomé, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster
    Self-Simulation for the Passive Optical Star Model. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:369-380 [Conf]
  2. Dominique Barth, Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial
    A Mixed Deflection and Convergence Routing Algorithm: Design and Performance. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:767-774 [Conf]
  3. Pascal Berthomé
    K-Selection in Hypercubes. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:164-167 [Conf]
  4. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
    Sorting-Based Selection Algorithms for Hypercube Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:89-95 [Conf]
  5. Pascal Berthomé, Johanne Cohen, Afonso Ferreira
    Embedding Tori in Partitioned Optical Passive Star Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:40-52 [Conf]
  6. Afonso Ferreira, Pascal Berthomé, Stephane Perennes
    Optimal Information Dissemination in Star and Pancake Networks. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:720-725 [Conf]
  7. Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
    Generalized Parametric Multi-terminal Flows Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:71-80 [Conf]
  8. Pascal Berthomé, Sylvain Lebresne, Kim Nguyen
    Computation of Chromatic Polynomials Using Triangulations and Clique Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:362-373 [Conf]
  9. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
    Sorting-Based Selection Algorithms for Hypercubic Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:2, pp:237-254 [Journal]
  10. Pascal Berthomé, Afonso Ferreira
    Communication Issues in Parallel Systems with Optical Interconnections. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:143-0 [Journal]
  11. Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster
    Self-Simulation for the Passive Optical Star. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:128-147 [Journal]
  12. Dominique Barth, Pascal Berthomé, Johanne Cohen
    The Eulerian Stretch Of A Network Topology And The Ending Guarantee Of A Convergence Routing. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:2, pp:93-109 [Journal]
  13. Dominique Barth, Pascal Berthomé
    Periodic Gossiping in Commuted Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:5, pp:559-584 [Journal]
  14. Dominique Barth, Pascal Berthomé, Paraskevi Fragopoulou
    The Complexity of the Maximal Requests Satisfaction Problem in Multipoint Communication. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2005, v:15, n:1-2, pp:209-222 [Journal]
  15. Pascal Berthomé
    Efficient K-Selection in Hypercube Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:221-230 [Journal]
  16. Pascal Berthomé, Afonso Ferreira, Stephane Perennes
    Optimal Information Dissemination in Star and Pancake Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:12, pp:1292-1300 [Journal]

Search in 0.002secs, Finished in 0.003secs
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