Travelled to:1 × France
1 × Iceland
1 × Poland
1 × Portugal
1 × USA
2 × Greece
Collaborated with:A.Korman C.Gavoille ∅ G.Giakkoupis D.Ilcinkas A.Chaintreau E.Lebhar Y.Emek A.Rosén A.Pelc R.Cohen D.Peleg
Talks about:network (2) scheme (2) inform (2) comput (2) small (2) label (2) graph (2) advic (2) searchabl (1) distribut (1)
Person: Pierre Fraigniaud
 DBLP: Fraigniaud:Pierre
Facilitated 2 volumes:
Contributed to:
Wrote 8 papers:
- ICALP-v2-2010-Fraigniaud
 - Informative Labeling Schemes (PF), p. 1.
 - STOC-2010-FraigniaudG #network #on the
 - On the searchability of small-world networks with arbitrary underlying structure (PF, GG), pp. 389–398.
 - STOC-2010-FraigniaudK
 - An optimal ancestry scheme and small universal posets (PF, AK), pp. 611–620.
 - ICALP-v1-2009-EmekFKR #online
 - Online Computation with Advice (YE, PF, AK, AR), pp. 427–438.
 - ICALP-A-2008-ChaintreauFL #network
 - Networks Become Navigable as Nodes Move and Forget (AC, PF, EL), pp. 133–144.
 - ICALP-2007-FraigniaudGIP #distributed #graph
 - Distributed Computing with Advice: Information Sensitivity of Graph Coloring (PF, CG, DI, AP), pp. 231–242.
 - ICALP-2005-CohenFIKP #automaton #finite #graph
 - Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.
 - ICALP-2001-FraigniaudG
 - Routing in Trees (PF, CG), pp. 757–772.
 













