Combining the use of clustering and scale-free nature of user exchanges into a simple and efficient P2P system⋆ Pierre Fraigniaud 1 , Philippe Gauron 2 , and Matthieu Latapy 3 1

Source URL: www.liafa.jussieu.fr

• Concurrent computing
• File sharing networks
• Network architecture
• Peer-to-peer
• Distributed hash table
• ANts P2P
• Chord
• Overlay network
• Connectivity
• Computing
• Distributed data storage
• Software

Rumor Spreading in Random Evolving Graphs? A. Clementi1 , P. Crescenzi2 , C. Doerr3 , P. Fraigniaud4 , M. Isopi5 , A. Panconesi5 , F. Pasquale5 , and R. Silvestri5 1 3

Source URL: www.liafa.jussieu.fr

• Random graph
• Connectivity
• Markov chain
• Graph
• Power graph analysis
• Copying mechanism
• Graph theory
• Mathematics
• Theoretical computer science

U NIVERSITÉ PARIS D IDEROT, C ALCUL S TOCHASTIQUE , F EUILLE 5 C ALCUL D ’I TÔ Dans toute cette feuille, on considère un espace fitré (Ω, F, {Ft }t≥0 , P) sur lequel est défini un

Source URL: www.proba.jussieu.fr

Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4

Source URL: www.liafa.jussieu.fr

• Network theory
• Graph connectivity
• Connectivity
• Cut
• Graph
• Maximum flow problem
• Shortest path problem
• Graph theory
• Mathematics
• Theoretical computer science

Computing with Large Populations Using Interactions Olivier Bournez1? , Pierre Fraigniaud2?? , and Xavier Koegler2 1 2

Source URL: www.liafa.jussieu.fr

• Exponentiation
• Abstract algebra
• Binary operations
• Normal distribution

The Effect of Power-Law Degrees ∗ on the Navigability of Small Worlds [Extended Abstract] Pierre Fraigniaud

Source URL: www.liafa.jussieu.fr

• Markov chain
• Graph theory

Small Worlds as Navigable Augmented Networks — Model, Analysis, and Validation — Pierre Fraigniaud⋆ CNRS and University of Paris 7 Abstract. The small world phenomenon, a.k.a. the six degree of separation between

Source URL: www.liafa.jussieu.fr

• Networks
• Graph
• Tree decomposition
• Connectivity
• Complex network
• Geographic routing
• Minor
• Small-world network
• Graph coloring
• Graph theory
• Mathematics
• Network theory

On the Additive Constant of the k-server Work Function Algorithm Yuval Emek∗ Pierre Fraigniaud† Amos Korman‡

Source URL: www.liafa.jussieu.fr

• Metric
• Metric geometry
• Topology


 
   
    

Source URL: www.liafa.jussieu.fr



 
    ! ^`_ &)#1a;b+-c3d/#%a%a1$ ^ ~ &)#1€()d3‚ ~ $+"ƒ-„54a

Source URL: www.liafa.jussieu.fr