About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. - Yves Métivier (Inf. Process. Lett., 1983)

Recognizable Subsets of Some Partially Abelian Monoids. - Robert Cori; Yves Métivier (Theor. Comput. Sci., 1985)

Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. - Yves Métivier (Theor. Comput. Sci., 1985)

Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. - Yves Métivier (RAIRO Theor. Informatics Appl., 1986)

An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. - Yves Métivier (ICALP, 1987)

On Lexicographic Semi-Commutations. - Yves Métivier; Edward Ochmanski (Inf. Process. Lett., 1987)

Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. - Robert Cori; Yves Métivier (ICALP, 1988)

On Recognizable Subsets of Free Partially Commutative Monoids. - Yves Métivier (Theor. Comput. Sci., 1988)

Graph Rewriting Systems with Priorities. - Michel Billaud; Pierre Lafon; Yves Métivier; Éric Sopena (WG, 1989)

Computing with Graph Relabelling Systems with Priorities. - Igor Litovsky; Yves Métivier (Graph-Grammars and Their Application to Computer Science, 1990)

On the Star Operation in Free Partially Commutative Monoids. - Yves Métivier; Brigitte Rozoy (Int. J. Found. Comput. Sci., 1991)

Computing trees with graph rewriting systems with priorities. - Igor Litovsky; Yves Métivier (Tree Automata and Languages, 1992)

Definitions and Comparisons of Local Computations on Graphs. - Igor Litovsky; Yves Métivier; Éric Sopena (MFCS, 1992)

The Power and the Limitations of Local Computations on Graphs. - Igor Litovsky; Yves Métivier; Wieslaw Zielonka (WG, 1992)

Computing with Graph Rewriting Systems with Priorities. - Igor Litovsky; Yves Métivier (Theor. Comput. Sci., 1993)

Asynchronous Mappings and Asynchronous Cellular Automata - Robert Cori; Yves Métivier; Wieslaw Zielonka (Inf. Comput., 1993)

Probabilistic Analysis of an Election Algorithm in a Tree. - Yves Métivier; Nasser Saheb (CAAP, 1994)

On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). - Yves Métivier; Gwénaël Richomme (STACS, 1994)

Coverings and Minors: Application to Local Computations in Graphs. - Bruno Courcelle; Yves Métivier (Eur. J. Comb., 1994)

Computing the Closure of Sets of Words Under Partial Commutations. - Yves Métivier; Gwénaël Richomme; Pierre-André Wacrenier (ICALP, 1995)

Checking global graph properties by means of local computations: the majority problem. - Igor Litovsky; Yves Métivier; Éric Sopena (SEGRAGRA, 1995)

Different Local Controls for Graph Relabeling Systems. - Igor Litovsky; Yves Métivier; Éric Sopena (Math. Syst. Theory, 1995)

On the Recognition of Families of Graphs with Local Computations - Igor Litovsky; Yves Métivier; Wieslaw Zielonka (Inf. Comput., 1995)

New Results on the Star Problem in Trace Monoids - Yves Métivier; Gwénaël Richomme (Inf. Comput., 1995)

The Kronecker Product and Local Computations in Graphs. - Anne Bottreau; Yves Métivier (CAAP, 1996)

Medians and Centres of Polyominoes. - Yves Métivier; Nasser Saheb (Inf. Process. Lett., 1996)

About the local detection of termination of local computations in graphs. - Yves Métivier; Anca Muscholl; Pierre-André Wacrenier (SIROCCO, 1997)

Graph Relabelling Systems: A General Overview. - Yves Métivier; Éric Sopena (Comput. Artif. Intell., 1997)

Partial Commutation and Traces. - Volker Diekert; Yves Métivier (Handbook of Formal Languages (3), 1997)

Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. - Anne Bottreau; Yves Métivier (FoSSaCS, 1998)

The Power of Local Computations in Graphs with Initial Knowledge. - Emmanuel Godard; Yves Métivier; Anca Muscholl (TAGT, 1998)

Some Remarks on the Kronecker Product of Graphs. - Anne Bottreau; Yves Métivier (Inf. Process. Lett., 1998)

Termination detection and universal graph reconstruction. - Yves Métivier; Gerard Tel (SIROCCO, 2000)

A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph. - Yves Métivier; Mohamed Mosbah 001; Pierre-André Wacrenier; Stefan Gruner (OPODIS, 2001)

A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. - Emmanuel Godard; Yves Métivier (SIROCCO, 2001)

Visualization of Distributed Algorithms Based on Graph Relabelling Systems. - Michel Bauderon; Stefan Gruner; Yves Métivier; Mohamed Mosbah 001; Afif Sellami (GT-VMT@ICALP, 2001)

Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms. - Michel Bauderon; Yves Métivier; Mohamed Mosbah 001; Afif Sellami (GETGRATS Closing Workshop, 2001)

A Characterization of Families of Graphs in Which Election Is Possible. - Emmanuel Godard; Yves Métivier (FoSSaCS, 2002)

Termination Detection of Distributed Algorithms by Graph Relabelling Systems. - Emmanuel Godard; Yves Métivier; Mohamed Mosbah 001; Afif Sellami (ICGT, 2002)

Equivalence of Structural Knowledges in Distributed Algorithms. - Emmanuel Godard; Yves Métivier (SIROCCO, 2002)

Randomized local elections. - Yves Métivier; Nasser Saheb; Akka Zemmari (Inf. Process. Lett., 2002)

A uniform randomized election in trees. - Yves Métivier; Nasser Saheb-Djahromi; Akka Zemmari (SIROCCO, 2003)

Analysis of a randomized rendezvous algorithm. - Yves Métivier; Nasser Saheb; Akka Zemmari (Inf. Comput., 2003)

Deducible and Equivalent Structural Knowledges in Distributed Algorithms. - Emmanuel Godard; Yves Métivier (Theory Comput. Syst., 2003)

Election and Local Computations on Edges. - Jérémie Chalopin; Yves Métivier (FoSSaCS, 2004)

Election, Naming and Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (ICGT, 2004)

Synchronizers for Local Computations. - Yves Métivier; Mohamed Mosbah 001; Rodrigue Ossamy; Afif Sellami (ICGT, 2004)

Characterizations of Classes of Graphs Recognizable by Local Computations. - Emmanuel Godard; Yves Métivier; Anca Muscholl (Theory Comput. Syst., 2004)

A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. - Jérémie Chalopin; Yves Métivier (MFCS, 2005)

Local Computation in Graphs: The Case of Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (Bull. EATCS, 2005)

Locally guided randomized elections in trees: The totally fair case. - Yves Métivier; Nasser Saheb-Djahromi; Akka Zemmari (Inf. Comput., 2005)

Workshop on Graph Computation Models. - Yves Métivier; Mohamed Mosbah 001 (ICGT, 2006)

Mobile Agent Algorithms Versus Message Passing Algorithms. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier; Rodrigue Ossamy (OPODIS, 2006)

Local Computations in Graphs: The Case of Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (Fundam. Informaticae, 2006)

A Distributed Computational Model for Mobile Agents. - Med Amine Haddar; Ahmed Hadj Kacem; Yves Métivier; Mohamed Mosbah 001; Mohamed Jmaiel (PRIMA, 2007)

About the Termination Detection in the Asynchronous Message Passing Model. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier; Gerard Tel (SOFSEM (1), 2007)

An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. - Jérémie Chalopin; Yves Métivier (Fundam. Informaticae, 2007)

Electing a leader in the local computation model using mobile agents. - Med Amine Haddar; Ahmed Hadj Kacem; Yves Métivier; Mohamed Mosbah 001; Mohamed Jmaiel (AICCSA, 2008)

Labelled (Hyper)Graphs, Negotiations and the Naming Problem. - Jérémie Chalopin; Antoni W. Mazurkiewicz; Yves Métivier (ICGT, 2008)

Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks. - Med Amine Haddar; Ahmed Hadj Kacem; Yves Métivier; Mohamed Mosbah 001; Mohamed Jmaiel (ICDCN, 2008)

Local Terminations and Distributed Computability in Anonymous Networks. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier (DISC, 2008)

Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (OPODIS, 2009)

An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (SIROCCO, 2009)

Termination Detection of Local Computations - Emmanuel Godard; Yves Métivier; Gerard Tel (CoRR, 2010)

On the power of synchronization between two adjacent processes. - Jérémie Chalopin; Yves Métivier (Distributed Comput., 2010)

About randomised distributed graph colouring and graph partition algorithms. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Inf. Comput., 2010)

An optimal bit complexity randomized distributed MIS algorithm. - Yves Métivier; John Michael Robson; Nasser Saheb-Djahromi; Akka Zemmari (Distributed Comput., 2011)

On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). - Jérémie Chalopin; Yves Métivier; Thomas Morsellino (SIROCCO, 2012)

Election in partially anonymous networks with arbitrary knowledge in message passing systems. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier (Distributed Comput., 2012)

Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. - Jérémie Chalopin; Yves Métivier; Thomas Morsellino (Fundam. Informaticae, 2012)

Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). - Yves Métivier; John Michael Robson; Akka Zemmari (SIROCCO, 2013)

Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. - Allyx Fontaine; Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2013)

On the time and the bit complexity of distributed randomised anonymous ring colouring. - Yves Métivier; J. M. Robson; Nasser Saheb-Djahromi; Akka Zemmari (Theor. Comput. Sci., 2013)

On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). - Allyx Fontaine; Yves Métivier; John Michael Robson; Akka Zemmari (SOFSEM, 2014)

On Distributed Computing with Beeps. - Yves Métivier; John Michael Robson; Akka Zemmari (CoRR, 2015)

Analysis of fully distributed splitting and naming probabilistic procedures and applications. - Yves Métivier; John Michael Robson; Akka Zemmari (Theor. Comput. Sci., 2015)

Design Patterns in Beeping Algorithms. - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (OPODIS, 2016)

Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (DISC, 2016)

A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... - Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2016)

Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. - Yves Métivier; J. M. Robson; Akka Zemmari (Inf. Comput., 2016)

Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. - Arnaud Casteigts; Yves Métivier; J. M. Robson; Akka Zemmari (Algorithmica, 2019)

Design patterns in beeping algorithms: Examples, emulation, and analysis. - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2019)

Counting in one-hop beeping networks. - Arnaud Casteigts; Yves Métivier; J. M. Robson; Akka Zemmari (Theor. Comput. Sci., 2019)

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. - Arnaud Casteigts; Yves Métivier; John Michael Robson (CoRR, 2021)

Unfoldings and coverings of weighted graphs. - Bruno Courcelle; Yves Métivier (CoRR, 2022)