`Travelled to:`

1 × Finland

1 × Hungary

1 × Italy

1 × Portugal

1 × United Kingdom

2 × France

2 × Spain

3 × Germany

`Collaborated with:`

J.Chalopin E.Godard ∅ M.Mosbah A.Sellami A.Bottreau I.Litovsky R.Cori A.W.Mazurkiewicz W.Zielonka A.Muscholl G.Richomme P.Wacrenier R.Ossamy M.Bauderon S.Gruner

`Talks about:`

graph (9) comput (7) relabel (5) system (4) local (4) distribut (3) algorithm (3) commut (3) elect (3) asynchron (2)

## Person: Yves Métivier

### DBLP: M=eacute=tivier:Yves

### Contributed to:

### Wrote 14 papers:

- ICGT-2008-ChalopinMM #graph #problem
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (JC, AWM, YM), pp. 54–68.
- FoSSaCS-2004-ChalopinM
- Election and Local Computations on Edges (JC, YM), pp. 90–104.
- ICGT-2004-ChalopinMZ
- Election, Naming and Cellular Edge Local Computations (JC, YM, WZ), pp. 242–256.
- ICGT-2004-MetivierMOS
- Synchronizers for Local Computations (YM, MM, RO, AS), pp. 271–286.
- FoSSaCS-2002-GodardM #graph #product line
- A Characterization of Families of Graphs in Which Election Is Possible (EG, YM), pp. 159–172.
- ICGT-2002-GodardMMS #algorithm #detection #distributed #graph #termination
- Termination Detection of Distributed Algorithms by Graph Relabelling Systems (EG, YM, MM, AS), pp. 106–119.
- FoSSaCS-1998-BottreauM #graph #normalisation
- Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling (AB, YM), pp. 110–124.
- TAGT-1998-GodardMM #graph #power of
- The Power of Local Computations in Graphs with Initial Knowledge (EG, YM, AM), pp. 71–84.
- ICALP-1995-MetivierRW #set #word
- Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.
- GG-1990-LitovskyM #graph
- Computing with Graph Relabelling Systems with Priorities (IL, YM), pp. 549–563.
- ICALP-1988-CoriM #approximate #automaton #distributed
- Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System (RC, YM), pp. 147–161.
- ICALP-1987-Metivier #algorithm #automaton #graph
- An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.
- ICALP-1986-Metivier #commutative #monad #on the #set
- On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
- GT-VMT-2001-BauderonGMMS #algorithm #distributed #graph #visualisation
- Visualization of Distributed Algorithms Based on Graph Relabelling Systems (MB, SG, YM, MM, AS), pp. 227–237.