Stéphane Pérennes

According to our database, Stéphane Pérennes authored at least 119 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Scheduling Machine Learning Compressible Inference Tasks with Limited Energy Budget.

Tiago Da Silva Barros, Davide Ferré, Frédéric Giroire, Ramon Aparicio-Pardo, Stephane Perennes

Proceedings of the 53rd International Conference on Parallel Processing, 2024

Scheduling with Fully Compressible Tasks: Application to Deep Learning Inference with Neural Network Compression.

Tiago Da Silva Barros, Frédéric Giroire, Ramon Aparicio-Pardo, Stéphane Pérennes, Emanuele Natale

Proceedings of the 24th IEEE International Symposium on Cluster, 2024

2022

Biased Majority Opinion Dynamics: Exploiting Graph k-domination.

Hicham Lesfari, Frédéric Giroire, Stéphane Pérennes

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Design of robust programmable networks with bandwidth-optimal failure recovery scheme.

Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac

Comput. Networks, 2021

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.

Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2021

2020

Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter.

Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes

Proceedings of the Complex Networks & Their Applications IX, 2020

A Random Growth Model with Any Real or Theoretical Degree Distribution.

Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery.

Andrea Tomassilli, Chidung Lac, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck

Proceedings of the 2019 IFIP Networking Conference, 2019

When Network Matters: Data Center Scheduling with Network Tasks.

Frédéric Giroire, Nicolas Huin, Andrea Tomassilli, Stéphane Pérennes

Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.

Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stephane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac

Proceedings of the 2019 IEEE 8th International Conference on Cloud Networking, 2019

Eternal Domination in Grids.

Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Spy-game on graphs: Complexity and simple topologies.

Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio

Theor. Comput. Sci., 2018

Sequential Metric Dimension.

Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints.

Andrea Tomassilli, Frédéric Giroire, Nicolas Huin, Stéphane Pérennes

Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017

Exclusive graph searching vs. pathwidth.

Euripides Markou, Nicolas Nisse, Stéphane Pérennes

Inf. Comput., 2017

Study of a Combinatorial Game in Graphs Through Linear Programming.

Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Grid spanners with low forwarding index for energy efficient networks.

Frédéric Giroire, Stephane Perennes, Issam Tahiri

Electron. Notes Discret. Math., 2016

Combinatorial optimization in networks with Shared Risk Link Groups.

David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge

Discret. Math. Theor. Comput. Sci., 2016

Bin Packing with Colocations.

Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Spy-Game on Graphs.

Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Connected surveillance game.

Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, R. Soares

Theor. Comput. Sci., 2015

Design of fault-tolerant on-board networks with variable switch sizes.

Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes

Theor. Comput. Sci., 2015

On the complexity of equal shortest path routing.

Frédéric Giroire, Stéphane Pérennes, Issam Tahiri

Networks, 2015

How to Design Graphs with Low Forwarding Index and Limited Number of Edges.

Frédéric Giroire, Stéphane Pérennes, Issam Tahiri

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

P2P storage systems: Study of different placement policies.

Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes

Peer-to-Peer Netw. Appl., 2014

Weighted Coloring in Trees.

Júlio Araújo, Nicolas Nisse, Stéphane Pérennes

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013

Optimal time data gathering in wireless networks with multidirectional antennas.

Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro

Theor. Comput. Sci., 2013

Directed acyclic graphs with the unique dipath property.

Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes

Theor. Comput. Sci., 2013

On the Hardness of Equal Shortest Path Routing.

Frédéric Giroire, Stéphane Pérennes, Issam Tahiri

Electron. Notes Discret. Math., 2013

Gathering Radio Messages in the Path.

Jean-Claude Bermond, Ralf Klasing, Nelson Morales, Stéphane Pérennes, Patricio Reyes

Discret. Math. Algorithms Appl., 2013

Connected Surveillance Game.

Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares

Proceedings of the Structural Information and Communication Complexity, 2013

Maintaining Balanced Trees for Structured Distributed Streaming Systems.

Frédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes

Proceedings of the Structural Information and Communication Complexity, 2013

Repair Time in Distributed Storage Systems.

Frédéric Giroire, Sandeep Kumar Gupta, Remigiusz Modrzejewski, Julian Monteiro, Stéphane Pérennes

Proceedings of the Data Management in Cloud, Grid and P2P Systems, 2013

Connectivity Inference in Mass Spectrometry Based Structure Determination.

Deepesh Agarwal, Júlio César Silva Araújo, Christelle Caillouet, Frédéric Cazals, David Coudert, Stéphane Pérennes

Proceedings of the Algorithms - ESA 2013, 2013

2012

GMPLS label space minimization through hypergraph layouts.

Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado

Theor. Comput. Sci., 2012

On the approximability of some degree-constrained subgraph problems.

Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh

Discret. Appl. Math., 2012

Feasibility Study on Distributed Simulations of BGP.

David Coudert, Luc Hogie, Aurélien Lancin, Dimitri Papadimitriou, Stéphane Pérennes, Issam Tahiri

Proceedings of the 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation, 2012

2011

Framework for optimizing the capacity of wireless mesh networks.

Christelle Caillouet, Stéphane Pérennes, Hervé Rivano

Comput. Commun., 2011

Optimal Time Data Gathering in Wireless Networks with Omni-Directional Antennas.

Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennes, Adele A. Rescigno, Ugo Vaccaro

Proceedings of the Structural Information and Communication Complexity, 2011

2010

Minimal selectors and fault tolerant networks.

Omid Amini, Frédéric Giroire, Stéphane Pérennes, Florian Huc

Networks, 2010

Cross line and column generation for the cut covering problem in wireless networks.

Christelle Caillouet, Stéphane Pérennes, Hervé Rivano

Electron. Notes Discret. Math., 2010

Fractional Path Coloring in Bounded Degree Trees with Applications.

Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano

Algorithmica, 2010

Stability of a localized and greedy routing algorithm.

Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy.

Frédéric Giroire, Julian Monteiro, Stéphane Pérennes

Proceedings of the Global Communications Conference, 2010

Data Life Time for Different Placement Policies in P2P Storage Systems.

Stéphane Caron, Frédéric Giroire, Dorian Mazauric, Julian Monteiro, Stéphane Pérennes

Proceedings of the Data Management in Grid and Peer-to-Peer Systmes, 2010

2009

On the Path-Width of Planar Graphs.

Omid Amini, Florian Huc, Stéphane Pérennes

SIAM J. Discret. Math., 2009

Designing Hypergraph Layouts to GMPLS Routing Strategies.

Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado

Proceedings of the Structural Information and Communication Complexity, 2009

Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems.

Olivier Dalle, Frédéric Giroire, Julian Monteiro, Stephane Perennes

Proceedings of the Proceedings P2P 2009, 2009

MPLS Label Stacking on the Line Network.

Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Hervé Rivano, Ignasi Sau, Fernando Solano Donado

Proceedings of the NETWORKING 2009, 2009

P2P storage systems: How much locality can they tolerate?

Frédéric Giroire, Julian Monteiro, Stéphane Pérennes

Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

2008

Tightening the upper bound for the minimum energy broadcasting.

Michele Flammini, Ralf Klasing, Alfredo Navarra, Stephane Perennes

Wirel. Networks, 2008

On the complexity of bandwidth allocation in radio networks.

Ralf Klasing, Nelson Morales, Stéphane Pérennes

Theor. Comput. Sci., 2008

Degree-Constrained Subgraph Problems: Hardness and Approximation Results.

Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Informations.

Christelle Molle, Fabrice Peix, Stéphane Pérennes, Hervé Rivano

Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

2007

Neighborhood Broadcasting in Hypercubes.

Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters

SIAM J. Discret. Math., 2007

Shared Risk Resource Group Complexity and Approximability Issues.

David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge

Parallel Process. Lett., 2007

Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions.

Jean-Claude Bermond, Frédéric Giroire, Stéphane Pérennes

Proceedings of the Structural Information and Communication Complexity, 2007

Hardness and Approximation of Traffic Grooming.

Omid Amini, Stéphane Pérennes, Ignasi Sau

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Hardness and approximation of Gathering in static radio networks.

Jean-Claude Bermond, Nelson Morales, Stéphane Pérennes, Jérôme Galtier, Ralf Klasing

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

About the Lifespan of Peer to Peer Networks, .

Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, Paul M. B. Vitányi

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Optimal Solution of the Maximum All Request Path Grooming Problem.

Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes

Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW 2006), 2006

2005

Virtual network embedding in the cycle.

Sébastien Choplin, Aubin Jarry, Stéphane Pérennes

Discret. Appl. Math., 2005

The "Real" Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting.

Michele Flammini, Alfredo Navarra, Stéphane Pérennes

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Asymptotically Optimal Solutions for Small World Graphs.

Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes

Proceedings of the Distributed Computing, 19th International Conference, 2005

From Balls and Bins to Points and Vertices.

Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols.

Michele Flammini, Stéphane Pérennes

SIAM J. Discret. Math., 2004

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

Proceedings of the NETWORKING 2004, 2004

Improved approximation results for the minimum energy broadcasting problem.

Michele Flammini, Alfredo Navarra, Ralf Klasing, Stéphane Pérennes

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

Range-Free Ranking in Sensors Networks and Its Applications to Localization.

Zvi Lotker, Marc Martinez de Albeniz, Stephane Perennes

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003

Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks.

Afonso Ferreira, Stephane Perennes, Hervé Rivano, Andréa W. Richa, Nicolás E. Stier Moses

Telecommun. Syst., 2003

Simultaneous Edge Flipping in Triangulations.

Jérôme Galtier, Ferran Hurtado, Marc Noy, Stephane Perennes, Jorge Urrutia

Int. J. Comput. Geom. Appl., 2003

Deadlock Prevention by Acyclic Orientations.

Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes

Discret. Appl. Math., 2003

The Power of Small Coalitions in Graphs.

Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes

Discret. Appl. Math., 2003

2002

Isomorphisms of the De Bruijn digraph and free-space optical networks.

David Coudert, Afonso Ferreira, Stephane Perennes

Networks, 2002

Disjoint Paths in Symmetric Digraphs.

Aubin Jarry, Stephane Perennes

Proceedings of the SIROCCO 9, 2002

Hierarchical Ring Network Design.

Jean-Claude Bermond, Sébastien Choplin, Stephane Perennes

Proceedings of the SIROCCO 9, 2002

Traffic grooming in WDM networks with multi-layer switches.

Gurvan Huiban, Stéphane Pérennes, Michel Syska

Proceedings of the IEEE International Conference on Communications, 2002

2001

On the Optimality of General Lower Bounds for Broadcasting and Gossiping.

Michele Flammini, Stephane Perennes

SIAM J. Discret. Math., 2001

Tight Bounds for Broadcasting in the Linear Cost Model.

Bruno Beauquier, Stephane Perennes, Olivier Delmas

J. Interconnect. Networks, 2001

Coloring all directed paths in a symmetric tree, with an application to optical networks.

Luisa Gargano, Pavol Hell, Stephane Perennes

J. Graph Theory, 2001

Complete Rotations in Cayley Graphs.

Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes

Eur. J. Comb., 2001

Assigning labels in an unknown anonymous network with a leader.

Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes

Distributed Comput., 2001

Approximate Constrained Bipartite Edge Coloring.

Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Distance labeling in graphs.

Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Fractional Path Coloring with Applications to WDM Networks.

Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Rotational Cayley Graphs on Transposition Generated Groups.

Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes

Electron. Notes Discret. Math., 2000

Sorting-Based Selection Algorithms for Hypercubic Networks.

Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton

Algorithmica, 2000

Efficient Communication in Unknown Networks.

Luisa Gargano, Andrzej Pelc, Stephane Perennes, Ugo Vaccaro

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Assigning labels in unknown anonymous networks (extended abstract).

Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths.

Arunabha Sen, K. Selçuk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes

Proceedings of the NETWORKING 2000, 2000

De Bruijn Isomorphisms and Free Space Optical Networks.

David Coudert, Afonso Ferreira, Stephane Perennes

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Broadcasting in Hypercubes in the Circuit Switched Model.

Jean-Claude Bermond, Takako Kodate, Stephane Perennes, Alexis Bonnecaze, Patrick Solé

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

The Minimum Range Assignment Problem on Linear Radio Networks.

Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri

Proceedings of the Algorithms, 2000

1999

All-to-All Routing and Coloring in Weighted Trees of Rings.

Bruno Beauquier, Stephane Perennes, David Tóth

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998

Neighbourhood Gossiping in Hypercubes.

Satoshi Fujita, Stephane Perennes, Joseph G. Peters

Parallel Process. Lett., 1998

Hamilton Cycle Decomposition of the Butterfly Network.

Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes

Parallel Process. Lett., 1998

Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks.

Stephane Perennes

Discret. Appl. Math., 1998

Large Generalized Cycles.

José Gómez, Carles Padró, Stephane Perennes

Discret. Appl. Math., 1998

Optimal Sequential Gossiping by Short Messages.

Jean-Claude Bermond, Luisa Gargano, Stephane Perennes

Discret. Appl. Math., 1998

Hamilton Circuits in the Directed Wrapped Butterfly Network.

Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes

Discret. Appl. Math., 1998

Optimal Wavelength-routed Multicasting.

Bruno Beauquier, Pavol Hell, Stephane Perennes

Discret. Appl. Math., 1998

Directed Virtual Path Layouts in ATM Networks.

Jean-Claude Bermond, Nausica Marlin, David Peleg, Stephane Perennes

Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997

A Note on the Dimensionality of Modified Knö;del Graphs.

Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes

Int. J. Found. Comput. Sci., 1997

A Proof of Jean De Rumeur's Conjecture.

Stephane Perennes

Discret. Appl. Math., 1997

Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract).

Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

Lower Bounds on Systolic Gossip.

Michele Flammini, Stephane Perennes

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.

Luisa Gargano, Pavol Hell, Stephane Perennes

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Lower Bounds for Shortest Path Interval Routing.

Cyril Gavoille, Stephane Perennes

Proceedings of the SIROCCO'96, 1996

Tight Bounds on the Size of 2-Monopolies.

Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes

Proceedings of the SIROCCO'96, 1996

Memory Requirements for Routing in Distributed Networks (Extended Abstract).

Cyril Gavoille, Stephane Perennes

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Efficient Collective Communication in Optical Networks.

Jean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Lower Bounds on Broadcasting Time of de Bruijn Networks.

Stephane Perennes

Proceedings of the Euro-Par '96 Parallel Processing, 1996

A Gossip Algorithm for Bus Networks with Buses of Limited Length.

Satoshi Fujita, Christian Laforest, Stephane Perennes

Proceedings of the Euro-Par '96 Parallel Processing, 1996

Circuit-Switched Gossiping in 3-Dimensional Torus Networks.

Olivier Delmas, Stephane Perennes

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

All-to-all broadcast in torus with wormhole-like routing.

Christophe Calvin, Stéphane Pérennes, Denis Trystram

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.

Jean-Claude Bermond, Stephane Perennes

Proceedings of the Structure, Information and Communication Complexity, 1995

Gossiping in Cayley Graphs by Packets.

Jean-Claude Bermond, Takako Kodate, Stephane Perennes

Proceedings of the Combinatorics and Computer Science, 1995

1993

Optimal Information Dissemination in Star and Pancake Networks.

Afonso Ferreira, Pascal Berthomé, Stephane Perennes

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Sorting-Based Selection Algorithms for Hypercube Networks.

Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton

Proceedings of the Seventh International Parallel Processing Symposium, 1993