The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephane Perennes: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zvi Lotker, Marc Martinez de Albeniz, Stephane Perennes
    Range-Free Ranking in Sensors Networks and Its Applications to Localization. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2004, pp:158-171 [Conf]
  2. Jean-Claude Bermond, Takako Kodate, Stephane Perennes
    Gossiping in Cayley Graphs by Packets. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:301-315 [Conf]
  3. Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
    The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:143-154 [Conf]
  4. Olivier Delmas, Stephane Perennes
    Circuit-Switched Gossiping in 3-Dimensional Torus Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:370-373 [Conf]
  5. Satoshi Fujita, Christian Laforest, Stephane Perennes
    A Gossip Algorithm for Bus Networks with Buses of Limited Length. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:353-360 [Conf]
  6. Stephane Perennes
    Lower Bounds on Broadcasting Time of de Bruijn Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:325-332 [Conf]
  7. Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
    Efficient Collective Communication in Optical Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:574-585 [Conf]
  8. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano
    Fractional Path Coloring with Applications to WDM Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:732-743 [Conf]
  9. Luisa Gargano, Pavol Hell, Stephane Perennes
    Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:505-515 [Conf]
  10. Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé
    Broadcasting in Hypercubes in the Circuit Switched Model. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:21-26 [Conf]
  11. 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]
  12. David Coudert, Afonso Ferreira, Stephane Perennes
    De Bruijn Isomorphisms and Free Space Optical Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:769-0 [Conf]
  13. Michele Flammini, Stephane Perennes
    Lower Bounds on Systolic Gossip. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:517-521 [Conf]
  14. Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes
    From Balls and Bins to Points and Vertices. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:757-766 [Conf]
  15. Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stephane Perennes
    Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2004, pp:866-877 [Conf]
  16. Arunabha Sen, K. Selçuk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes
    On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2000, pp:859-870 [Conf]
  17. Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi
    About the Lifespan of Peer to Peer Networks, . [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:290-304 [Conf]
  18. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in unknown anonymous networks (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:101-111 [Conf]
  19. Cyril Gavoille, Stephane Perennes
    Memory Requirements for Routing in Distributed Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:125-133 [Conf]
  20. Cyril Gavoille, Stephane Perennes
    Lower Bounds for Shortest Path Interval Routing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:88-103 [Conf]
  21. Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
    Tight Bounds on the Size of 2-Monopolies. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:170-179 [Conf]
  22. Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
    Hierarchical Ring Network Design. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:1-16 [Conf]
  23. Jean-Claude Bermond, Stephane Perennes
    Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:199-209 [Conf]
  24. Aubin Jarry, Stephane Perennes
    Disjoint Paths in Symmetric Digraphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:211-222 [Conf]
  25. Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
    Distance labeling in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:210-219 [Conf]
  26. Bruno Beauquier, Stephane Perennes, David Tóth
    All-to-All Routing and Coloring in Weighted Trees of Rings. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:185-190 [Conf]
  27. 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]
  28. Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
    Directed Virtual Path Layouts in ATM Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:75-88 [Conf]
  29. Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:52-64 [Conf]
  30. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate Constrained Bipartite Edge Coloring. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:21-31 [Conf]
  31. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient Communication in Unknown Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:172-183 [Conf]
  32. 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]
  33. Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
    The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:2, pp:95-110 [Journal]
  34. Bruno Beauquier, Pavol Hell, Stephane Perennes
    Optimal Wavelength-routed Multicasting. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:15-20 [Journal]
  35. Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
    The Power of Small Coalitions in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:399-414 [Journal]
  36. Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes
    Hamilton Circuits in the Directed Wrapped Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:21-42 [Journal]
  37. Jean-Claude Bermond, Luisa Gargano, Stephane Perennes
    Optimal Sequential Gossiping by Short Messages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:2-3, pp:145-155 [Journal]
  38. Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
    Deadlock Prevention by Acyclic Orientations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:1, pp:31-47 [Journal]
  39. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate constrained bipartite edge coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:54-61 [Journal]
  40. José Gómez, Carles Padró, Stephane Perennes
    Large Generalized Cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:107-123 [Journal]
  41. Stephane Perennes
    A Proof of Jean De Rumeur's Conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:3, pp:295-299 [Journal]
  42. Stephane Perennes
    Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:247-262 [Journal]
  43. Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
    Assigning labels in an unknown anonymous network with a leader. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:3, pp:163-183 [Journal]
  44. Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia
    Simultaneous Edge Flipping in Triangulations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:2, pp:113-133 [Journal]
  45. Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
    A Note on the Dimensionality of Modified Knö;del Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:109-0 [Journal]
  46. Michele Flammini, Alfredo Navarra, Stephane Perennes
    The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  47. Bruno Beauquier, Stephane Perennes, Olivier Delmas
    Tight Bounds for Broadcasting in the Linear Cost Model. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2001, v:2, n:2, pp:175-188 [Journal]
  48. Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
    Hierarchical Ring Network design. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:663-682 [Journal]
  49. David Coudert, Afonso Ferreira, Stephane Perennes
    Isomorphisms of the De Bruijn digraph and free-space optical networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:3, pp:155-164 [Journal]
  50. Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
    Efficient communication in unknown networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:39-49 [Journal]
  51. Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes
    Hamilton Cycle Decomposition of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:3, pp:371-385 [Journal]
  52. Satoshi Fujita, Stephane Perennes, Joseph G. Peters
    Neighbourhood Gossiping in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:2, pp:189-195 [Journal]
  53. Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes
    Hardness and Approximation of Gathering in Static Radio Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:2, pp:165-184 [Journal]
  54. Michele Flammini, Stephane Perennes
    On the Optimality of General Lower Bounds for Broadcasting and Gossiping. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:267-282 [Journal]
  55. Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
    Efficient collective communication in optical networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:165-189 [Journal]
  56. Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
    Directed virtual path layouts in ATM networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:291, n:1, pp:3-28 [Journal]
  57. Afonso Ferreira, Stephane Perennes, Hervé Rivano, Andréa W. Richa, Nicolás E. Stier Moses
    Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2003, v:24, n:2-4, pp:123-138 [Journal]
  58. 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]

  59. Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems. [Citation Graph (, )][DBLP]


  60. Improved Approximation Results for the Minimum Energy Broadcasting Problem. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
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