- Reducing Packet-Loss by Taking Long-Range Dependences into Account
- Approximation Algorithms for Structured Communication Problems \Lambda Dominique Barth
- A Space Lower Bound for Routing in Trees Pierre Fraigniaud Cyril Gavoille y
- Assigning labels in an unknown anonymous network with a leader
- Eclecticism Shrinks Even Small Worlds [Extended Abstract]
- Strategies for pathbased multicasting in wormholerouted meshes
- Introduction Cadre probabiliste Graphes reguliers Graphes facilement contamines Dissemination de l'information dans les graphes
- Collective tree exploration Pierre Fraigniaud 1 , Leszek Gasieniec 2? , Dariusz R. Kowalski 3 , and Andrzej Pelc 4
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- The Effect of Power-Law Degrees on the Navigability of Small Worlds
- Online Computation with Advice Yuval Emek1
- On Randomized Representations of Graphs Using Short Labels
- Sub-linear Universal Spatial Gossip Protocols Herve Baumann1
- Networks Become Navigable as Nodes Move and Forget
- Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch
- Tree Exploration with Advice Pierre Fraigniaud
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring
- Universal Augmentation Schemes for Network Navigability: Overcoming the
- Small Worlds as Navigable Augmented Networks --Model, Analysis, and Validation --
- Oracle size: a new measure of difficulty for communication tasks
- Distributed Chasing of Network Intruders Lelia Blin1
- B1 -Scientific Context and Objectives The project ALADDIN deals with the fundamental aspects of large interaction networks en-
- Examen "Graphs and Algorithms" February 13, 2007 --8h45-11h45
- Correction Examen "Graphs and Algorithms" February 13, 2007 --8h45-11h45
- Small Words Navigability
- Minimum-Time Broadcast under Edge-Disjoint Paths Modes
- Liste de publications du projet A.N.R. ALADDIN Articles parus dans des revues internationales
- Locating and repairing faults in a network with mobile agents
- unrestricted Epidemic P2P Live Streaming
- Achievable Catalog Size in Peer-to-Peer Video-on-Demand Systems
- Estimating the Number of Events in a Network
- Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
- Digraphs Exploration with Little Memory Pierre Fraigniaud and David Ilcinkas
- Ecient Trigger-Broadcasting in Heterogeneous Pierre Fraigniaud y
- Correction Partiel "Algorithmique distribuee pour les reseaux" November 30, 2010 --09h00-12h00
- Recognizing Knodel and Fibonacci graphs Johanne Cohen Pierre Fraigniaud y Cyril Gavoille z
- Polynomial Time Algorithms for Minimum-Time Broadcast in Trees
- Distributed Mobile Computing with Incomparable Labels
- Recovering the Long-Range Links in Augmented Graphs
- Correction exercice pair-`a-pair et petits mondes (partiel MPRI 21/11/06)
- Dynamic Construction of Bluetooth Scatternets of Fixed Degree and Low Diameter
- Electing a leader among anonymous mobile agents in anonymous networks with sense-of-direction
- Label-Guided Graph Exploration by a Finite Automaton
- Discrete Applied Mathematics 53 (1994) 799133 MATHEMATICS
- Examen "Graphs and Algorithms" February 12, 2008 --9h00-12h00
- Intro Algo ring Arbitrary graphs Conclusion PING PONG IN DANGEROUS GRAPHS
- A Doubling Dimension Threshold (log log n) for Augmented Graph Navigability
- Robust PositionBased Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges
- MT: A Multicast Protocol with QoS Support J. Ignacio Alvarez-Hamelin and Pierre Fraigniaud
- Compact Ancestry Labeling Schemes for XML Trees Pierre Fraigniaud
- Unslotted deAEection routing: a practical and eOEcient protocol for multihop optical networks
- Interval Routing Schemes allow Broadcasting with Linear Message-Complexity
- COST Office CSO Meeting 1st
- Assigning labels in unknown anonymous Pierre Fraigniaud \Lambda
- The Content-Addressable Network d2b Pierre Fraigniaud z Philippe Gauron yz
- A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs
- Correction Examen "Graphs and Algorithms" February 10, 2009 --08h45-10h15
- Runion Projet ANR ALADDIN 29-30 mai, 2008, La Rochelle
- Tree Exploration with Little Memory Krzysztof Diks y Pierre Fraigniaud z Evangelos Kranakis x Andrzej Pelc {
- Eclecticism Shrinks the World Pierre Fraigniaud
- Recognizing Abelian Cayley Colored Digraphs Lali Barri ere y Pierre Fraigniaud z Cyril Gavoille x Bernard Mans {
- Connected and Internal Graph Searching Lali Barri`ere \Lambda Pierre Fraigniaud y Nicola Santoro z Dimitrios M. Thilikos x
- Routing in Trees Pierre Fraigniaud ? and Cyril Gavoille ??
- The Inframetric Model for the Internet Pierre Fraigniaud
- Oriented Hypercubes Pierre Fraigniaud Jean-Claude Konig y Emmanuel Lazard z
- HiHCoHP---Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors
- Tree Exploration with Little Memory Krzysztof Diks Pierre Fraigniaud y Evangelos Kranakis z Andrzej Pelc x
- Brief Announcement: An Overview of the ContentAddressable Network D2B
- D2B: a de Bruijn Based Content-Addressable Network
- Monotony Properties of Connected Visible Graph Searching
- Approximation Algorithms for Collective Communications with Limited Link and Node-Contention
- Broadcasting and Multicasting in Trees Johanne Cohen y Pierre Fraigniaud z
- Space Lower Bounds for Graph Exploration via Reduced Automata
- Hierarchical Broadcast Networks Pierre Fraigniaud \Lambda
- Examen "Graphs and Algorithms" February 10, 2009 --08h45-10h15
- Correction examen "Graphs and Algorithms" February 12, 2008
- On the Searchability of Small-World Networks with Arbitrary Underlying Structure
- A General Theory for Deadlock Avoidance in WormholeRouted Networks \Lambda
- Tree Exploration with Little Memory Krzysztof Diks y Pierre Fraigniaud z Evangelos Kranakis x Andrzej Pelc {
- On Sparse Spanners Construction locale de
- A Theoretical Model for Routing P. FRAIGNIAUD
- Laboratoire Bordelais de Recherche en Informatique UMR 5800 -Universit e Bordeaux I, 351, cours de la Lib eration,
- Ecient Routing in Networks with Long Range Contacts
- Graph Exploration by a Finite Automaton Pierre Fraigniaud a;1 David Ilcinkas a;1 Guy Peer b
- Comparison of heuristics for onetoall and alltoall communications in partial meshes \Lambda
- Scheduling calls for multicasting in treenetworks Johanne Cohen \Lambda Pierre Fraigniaud yz Margarida Mitjana x
- On the Additive Constant of the k-server Work Function Algorithm Pierre Fraigniaud
- Parsimonious Flooding in Dynamic Graphs Herv Baumann
- Scheduling Jobs in O(congestion + dilation) with Applications to Multi-point Communication Problems
- Oriented Hypercubes Pierre Fraigniaud Jean-Claude Konig y Emmanuel Lazard z
- MinimumTime Broadcast under EdgeDisjoint Paths Modes
- Deterministic rendezvous in graphs Anders Dessmark x Pierre Fraigniaud yx Andrzej Pelc z
- International Journal of Foundations of Computer Science World Scienti c Publishing Company
- Graph Exploration by a Finite Automaton P. Fraigniaud 1 , D. Ilcinkas 1 , G. Peer 2 , A. Pelc 3 , and D. Peleg 2
- Scheduling calls for multicasting in tree-networks Johanne Cohen Pierre Fraigniaud y Margarida Mitjana z
- Partiel "Algorithmique distribuee pour les reseaux" November 30, 2010 --09h00-12h00
- Bounding the impact of unbounded Sbastien Tixeuil (UPMC)
- Optimized Broadcasting and Multicasting Protocols in Cutthrough Routed Networks \Lambda
- Principles of DHTs for P2P Systems
- POLYLOGARITHMIC NETWORK NAVIGABILITY USING COMPACT
- An Optimal Ancestry Scheme and Small Universal Posets Pierre Fraigniaud
- Deterministic rendezvous in trees with little memory
- Nondeterministic Graph Searching: From Pathwidth to Treewidth
- Projet A.N.R. "ALADDIN" Algorithm Design and Analysis for Implicitly
- Robust Position-Based Routing in Wireless Ad Hoc Networks with Irregular Transmission Ranges
- Combining the use of clustering and scale-free nature of user exchanges into a simple and
- Local MST Computation with Short Advice Pierre Fraigniaud
- Exercice pair-`a-pair et petits mondes (5 points) Cet exercice traite de la conception d'une table de hachage distribuee (DHT) pour syst`emes
- SIAM J. COMPUT. Vol. 21, No. 1, pp. 193-201, February 1992
- Locality and checkability in wait-free computing Pierre Fraigniaud1
- Local Distributed Decision Pierre Fraigniaud
- Local Distributed Decision Pierre Fraigniaud
- Local Distributed Decision Pierre Fraigniaud
