| 2024 | ICPP | Scheduling Machine Learning Compressible Inference Tasks with Limited Energy Budget. | Tiago Da Silva Barros, Davide Ferr, Frdric Giroire, Ramon Aparicio-Pardo, Stephane Perennes |
| 2006 | OPODIS | About the Lifespan of Peer to Peer Networks, . | Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitnyi |
| 2005 | ISAAC | From Balls and Bins to Points and Vertices. | Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes |
| 2004 | Networking | Adaptive Broadcast Consumption (ABC), a New Heuristic and New Bounds for the Minimum Energy Broadcast Routing Problem. | Ralf Klasing, Alfredo Navarra, Aris A. Papadopoulos, Stephane Perennes |
| 2002 | SIROCCO | Hierarchical Ring Network Design. | Jean-Claude Bermond, Sbastien Choplin, Stephane Perennes |
| 2002 | SIROCCO | Disjoint Paths in Symmetric Digraphs. | Aubin Jarry, Stephane Perennes |
| 2001 | ICALP | Fractional Path Coloring with Applications to WDM Networks. | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Herv Rivano |
| 2001 | SODA | Distance labeling in graphs. | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
| 2001 | WG | Approximate Constrained Bipartite Edge Coloring. | Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Herv Rivano |
| 2000 | ESA | The Minimum Range Assignment Problem on Linear Radio Networks. | Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri |
| 2000 | Networking | On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths. | Arunabha Sen, K. Seluk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes |
| 2000 | PODC | Assigning labels in unknown anonymous networks (extended abstract). | Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes |
| 2000 | WG | Efficient Communication in Unknown Networks. | Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro |
| 1999 | SPAA | All-to-All Routing and Coloring in Weighted Trees of Rings. | Bruno Beauquier, Stephane Perennes, David Tth |
| 1997 | ICALP | Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing. | Luisa Gargano, Pavol Hell, Stephane Perennes |
| 1997 | WG | Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). | Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes |
| 1996 | EuroPar | Circuit-Switched Gossiping in 3-Dimensional Torus Networks. | Olivier Delmas, Stephane Perennes |
| 1996 | EuroPar | A Gossip Algorithm for Bus Networks with Buses of Limited Length. | Satoshi Fujita, Christian Laforest, Stephane Perennes |
| 1996 | EuroPar | Lower Bounds on Broadcasting Time of de Bruijn Networks. | Stephane Perennes |
| 1996 | ICALP | Efficient Collective Communication in Optical Networks. | Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro |
| 1996 | PODC | Memory Requirements for Routing in Distributed Networks (Extended Abstract). | Cyril Gavoille, Stephane Perennes |
| 1996 | SIROCCO | Tight Bounds on the Size of 2-Monopolies. | Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes |
| 1996 | SIROCCO | Lower Bounds for Shortest Path Interval Routing. | Cyril Gavoille, Stephane Perennes |
| 1995 | SIROCCO | Efficient Broadcasting Protocols on the de Bruijn and Similar Networks. | Jean-Claude Bermond, Stephane Perennes |