Stephane Perennes

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