Stephane Perennes

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 4

Top Topics

Failure Recovery

Energy Efficient

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Tiago Da Silva Barros, Davide Ferré, Frédéric Giroire, Ramon Aparicio-Pardo, Stephane Perennes
Scheduling Machine Learning Compressible Inference Tasks with Limited Energy Budget. ICPP (2024)
Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stephane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. CloudNet (2019)
Frédéric Giroire, Stephane Perennes, Issam Tahiri
Grid spanners with low forwarding index for energy efficient networks. Discret. Appl. Math. 246 (2018)
Frédéric Giroire, Stephane Perennes, Issam Tahiri
Grid spanners with low forwarding index for energy efficient networks. Electron. Notes Discret. Math. 52 (2016)
Olivier Dalle, Frédéric Giroire, Julian Monteiro, Stephane Perennes
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems. Peer-to-Peer Computing (2009)
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
Tightening the upper bound for the minimum energy broadcasting. Wirel. Networks 14 (5) (2008)
Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes
Improved Approximation Results for the Minimum Energy Broadcasting Problem. Algorithmica 49 (4) (2007)
David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge
Shared Risk Resource Group Complexity and Approximability Issues. Parallel Process. Lett. 17 (2) (2007)
Jean-Claude Bermond, Jérôme Galtier, Ralf Klasing, Nelson Morales, Stephane Perennes
Hardness and Approximation of Gathering in Static Radio Networks. Parallel Process. Lett. 16 (2) (2006)
Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi
About the Lifespan of Peer to Peer Networks, . OPODIS (2006)
Michele Flammini, Alfredo Navarra, Stephane Perennes
The "real" approximation factor of the MST heuristic for the minimum energy broadcasting. ACM J. Exp. Algorithmics 11 (2006)
Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes
From Balls and Bins to Points and Vertices. ISAAC (2005)
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. NETWORKING (2004)
Zvi Lotker, Marc Martinez de Albeniz, Stephane Perennes
Range-Free Ranking in Sensors Networks and Its Applications to Localization. ADHOC-NOW (2004)
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
Approximate constrained bipartite edge coloring. Discret. Appl. Math. 143 (1-3) (2004)
Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
The Power of Small Coalitions in Graphs. Discret. Appl. Math. 127 (3) (2003)
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. Telecommun. Syst. 24 (2-4) (2003)
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
Directed virtual path layouts in ATM networks. Theor. Comput. Sci. 291 (1) (2003)
Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia
Simultaneous Edge Flipping in Triangulations. Int. J. Comput. Geom. Appl. 13 (2) (2003)
Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
Hierarchical Ring Network design. Theory Comput. Syst. 36 (6) (2003)
Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35 (2) (2003)
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129 (1) (2003)
Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes
Hierarchical Ring Network Design. SIROCCO (2002)
Aubin Jarry, Stephane Perennes
Disjoint Paths in Symmetric Digraphs. SIROCCO (2002)
David Coudert, Afonso Ferreira, Stephane Perennes
Isomorphisms of the De Bruijn digraph and free-space optical networks. Networks 40 (3) (2002)
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano
Fractional Path Coloring with Applications to WDM Networks. ICALP (2001)
Luisa Gargano, Pavol Hell, Stephane Perennes
Coloring all directed paths in a symmetric tree, with an application to optical networks. J. Graph Theory 38 (4) (2001)
Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
Assigning labels in an unknown anonymous network with a leader. Distributed Comput. 14 (3) (2001)
Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
Distance labeling in graphs. SODA (2001)
Michele Flammini, Stephane Perennes
On the Optimality of General Lower Bounds for Broadcasting and Gossiping. SIAM J. Discret. Math. 14 (2) (2001)
Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
Efficient communication in unknown networks. Networks 38 (1) (2001)
Bruno Beauquier, Stephane Perennes, Olivier Delmas
Tight Bounds for Broadcasting in the Linear Cost Model. J. Interconnect. Networks 2 (2) (2001)
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
Approximate Constrained Bipartite Edge Coloring. WG (2001)
Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé
Broadcasting in Hypercubes in the Circuit Switched Model. IPDPS (2000)
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
Efficient collective communication in optical networks. Theor. Comput. Sci. 233 (1-2) (2000)
Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes
Assigning labels in unknown anonymous networks (extended abstract). PODC (2000)
Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro
Efficient Communication in Unknown Networks. WG (2000)
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
Sorting-Based Selection Algorithms for Hypercubic Networks. Algorithmica 26 (2) (2000)
David Coudert, Afonso Ferreira, Stephane Perennes
De Bruijn Isomorphisms and Free Space Optical Networks. IPDPS (2000)
Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
The Minimum Range Assignment Problem on Linear Radio Networks. ESA (2000)
Arunabha Sen, K. Selçuk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes
On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths. NETWORKING (2000)
Bruno Beauquier, Stephane Perennes, David Tóth
All-to-All Routing and Coloring in Weighted Trees of Rings. SPAA (1999)
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes
Optimal Sequential Gossiping by Short Messages. Discret. Appl. Math. 86 (2-3) (1998)
Satoshi Fujita, Stephane Perennes, Joseph G. Peters
Neighbourhood Gossiping in Hypercubes. Parallel Process. Lett. 8 (2) (1998)
Bruno Beauquier, Pavol Hell, Stephane Perennes
Optimal Wavelength-routed Multicasting. Discret. Appl. Math. 84 (1-3) (1998)
Stephane Perennes
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks. Discret. Appl. Math. 83 (1-3) (1998)
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes
Directed Virtual Path Layouts in ATM Networks. DISC (1998)
Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes
Hamilton Cycle Decomposition of the Butterfly Network. Parallel Process. Lett. 8 (3) (1998)
Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes
Hamilton Circuits in the Directed Wrapped Butterfly Network. Discret. Appl. Math. 84 (1-3) (1998)
José Gómez, Carles Padró, Stephane Perennes
Large Generalized Cycles. Discret. Appl. Math. 89 (1-3) (1998)
Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
A Note on the Dimensionality of Modified Knö;del Graphs. Int. J. Found. Comput. Sci. 8 (2) (1997)
Stephane Perennes
A Proof of Jean De Rumeur's Conjecture. Discret. Appl. Math. 74 (3) (1997)
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). WG (1997)
Luisa Gargano, Pavol Hell, Stephane Perennes
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. ICALP (1997)
Michele Flammini, Stephane Perennes
Lower Bounds on Systolic Gossip. IPPS (1997)
Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes
Tight Bounds on the Size of 2-Monopolies. SIROCCO (1996)
Cyril Gavoille, Stephane Perennes
Memory Requirements for Routing in Distributed Networks (Extended Abstract). PODC (1996)
Cyril Gavoille, Stephane Perennes
Lower Bounds for Shortest Path Interval Routing. SIROCCO (1996)
Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro
Efficient Collective Communication in Optical Networks. ICALP (1996)
Olivier Delmas, Stephane Perennes
Circuit-Switched Gossiping in 3-Dimensional Torus Networks. Euro-Par, Vol. I (1996)
Stephane Perennes
Lower Bounds on Broadcasting Time of de Bruijn Networks. Euro-Par, Vol. I (1996)
Satoshi Fujita, Christian Laforest, Stephane Perennes
A Gossip Algorithm for Bus Networks with Buses of Limited Length. Euro-Par, Vol. I (1996)
Pascal Berthomé, Afonso Ferreira, Stephane Perennes
Optimal Information Dissemination in Star and Pancake Networks. IEEE Trans. Parallel Distributed Syst. 7 (12) (1996)
Jean-Claude Bermond, Stephane Perennes
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. SIROCCO (1995)
Jean-Claude Bermond, Takako Kodate, Stephane Perennes
Gossiping in Cayley Graphs by Packets. Combinatorics and Computer Science (1995)
Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
Sorting-Based Selection Algorithms for Hypercube Networks. IPPS (1993)
Afonso Ferreira, Pascal Berthomé, Stephane Perennes
Optimal Information Dissemination in Star and Pancake Networks. SPDP (1993)