Yves Métivier

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 15

Top Topics

Fully Distributed

Extended Abstract

Top Venues

Theor. Comput. Sci.

Publications

Bruno Courcelle, Yves Métivier
Unfoldings and coverings of weighted graphs. CoRR (2022)
Arnaud Casteigts, Yves Métivier, John Michael Robson
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR (2021)
Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81 (5) (2019)
Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
Counting in one-hop beeping networks. Theor. Comput. Sci. 780 (2019)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. 264 (2019)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design Patterns in Beeping Algorithms. OPODIS (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design Patterns in Beeping Algorithms. CoRR (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). DISC (2016)
Yves Métivier, J. M. Robson, Akka Zemmari
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. Inf. Comput. 251 (2016)
Yves Métivier, John Michael Robson, Akka Zemmari
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... Inf. Comput. 247 (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). CoRR (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Counting in One-Hop Beeping Networks. CoRR (2016)
Yves Métivier, John Michael Robson, Akka Zemmari
On Distributed Computing with Beeps. CoRR (2015)
Yves Métivier, John Michael Robson, Akka Zemmari
Analysis of fully distributed splitting and naming probabilistic procedures and applications. Theor. Comput. Sci. 584 (2015)
Yves Métivier, John Michael Robson, Akka Zemmari
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter. CoRR (2015)
Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract). SOFSEM (2014)
Yves Métivier, J. M. Robson, Nasser Saheb-Djahromi, Akka Zemmari
On the time and the bit complexity of distributed randomised anonymous ring colouring. Theor. Comput. Sci. 502 (2013)
Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings. Inf. Comput. 233 (2013)
Yves Métivier, John Michael Robson, Akka Zemmari
Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). SIROCCO (2013)
Jérémie Chalopin, Yves Métivier, Thomas Morsellino
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO (2012)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25 (4) (2012)
Jérémie Chalopin, Yves Métivier, Thomas Morsellino
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Informaticae 120 (1) (2012)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. 23 (5-6) (2011)
Jérémie Chalopin, Yves Métivier
On the power of synchronization between two adjacent processes. Distributed Comput. 23 (3) (2010)
Emmanuel Godard, Yves Métivier, Gerard Tel
Termination Detection of Local Computations CoRR (2010)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. 208 (11) (2010)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. OPODIS (2009)
Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). SIROCCO (2009)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
Local Terminations and Distributed Computability in Anonymous Networks. DISC (2008)
Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel
Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks. ICDCN (2008)
Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel
Electing a leader in the local computation model using mobile agents. AICCSA (2008)
Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT (2008)
Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel
A Distributed Computational Model for Mobile Agents. PRIMA (2007)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) (2007)
Jérémie Chalopin, Yves Métivier
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundam. Informaticae 80 (1-3) (2007)
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae 74 (1) (2006)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS (2006)
Yves Métivier, Mohamed Mosbah
Workshop on Graph Computation Models. ICGT (2006)
Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
Locally guided randomized elections in trees: The totally fair case. Inf. Comput. 198 (1) (2005)
Jérémie Chalopin, Yves Métivier
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS (2005)
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS 85 (2005)
Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
Election, Naming and Cellular Edge Local Computations. ICGT (2004)
Yves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Afif Sellami
Synchronizers for Local Computations. ICGT (2004)
Jérémie Chalopin, Yves Métivier
Election and Local Computations on Edges. FoSSaCS (2004)
Emmanuel Godard, Yves Métivier, Anca Muscholl
Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37 (2) (2004)
Yves Métivier, Nasser Saheb, Akka Zemmari
Analysis of a randomized rendezvous algorithm. Inf. Comput. 184 (1) (2003)
Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
A uniform randomized election in trees. SIROCCO (2003)
Emmanuel Godard, Yves Métivier
Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36 (6) (2003)
Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami
Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT (2002)
Yves Métivier, Nasser Saheb, Akka Zemmari
Randomized local elections. Inf. Process. Lett. 82 (6) (2002)
Emmanuel Godard, Yves Métivier
A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS (2002)
Emmanuel Godard, Yves Métivier
Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO (2002)
Michel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah, Afif Sellami
Visualization of Distributed Algorithms Based on Graph Relabelling Systems. Electron. Notes Theor. Comput. Sci. 50 (3) (2001)
Michel Bauderon, Yves Métivier, Mohamed Mosbah, Afif Sellami
Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms. Electron. Notes Theor. Comput. Sci. 51 (2001)
Yves Métivier, Mohamed Mosbah, Pierre-André Wacrenier, Stefan Gruner
A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph. OPODIS (2001)
Emmanuel Godard, Yves Métivier
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO (2001)
Yves Métivier, Gerard Tel
Termination detection and universal graph reconstruction. SIROCCO (2000)
Anne Bottreau, Yves Métivier
Some Remarks on the Kronecker Product of Graphs. Inf. Process. Lett. 68 (2) (1998)
Emmanuel Godard, Yves Métivier, Anca Muscholl
The Power of Local Computations in Graphs with Initial Knowledge. TAGT (1998)
Anne Bottreau, Yves Métivier
Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. FoSSaCS (1998)
Yves Métivier, Anca Muscholl, Pierre-André Wacrenier
About the local detection of termination of local computations in graphs. SIROCCO (1997)
Yves Métivier, Éric Sopena
Graph Relabelling Systems: A General Overview. Comput. Artif. Intell. 16 (2) (1997)
Yves Métivier, Nasser Saheb
Medians and Centres of Polyominoes. Inf. Process. Lett. 57 (4) (1996)
Anne Bottreau, Yves Métivier
The Kronecker Product and Local Computations in Graphs. CAAP (1996)
Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier
Computing the Closure of Sets of Words Under Partial Commutations. ICALP (1995)
Igor Litovsky, Yves Métivier, Éric Sopena
Different Local Controls for Graph Relabeling Systems. Math. Syst. Theory 28 (1) (1995)
Igor Litovsky, Yves Métivier, Éric Sopena
Checking global graph properties by means of local computations: the majority problem. Electron. Notes Theor. Comput. Sci. 2 (1995)
Yves Métivier, Gwénaël Richomme
New Results on the Star Problem in Trace Monoids Inf. Comput. 119 (2) (1995)
Igor Litovsky, Yves Métivier, Wieslaw Zielonka
On the Recognition of Families of Graphs with Local Computations Inf. Comput. 118 (1) (1995)
Bruno Courcelle, Yves Métivier
Coverings and Minors: Application to Local Computations in Graphs. Eur. J. Comb. 15 (2) (1994)
Yves Métivier, Gwénaël Richomme
On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract). STACS (1994)
Yves Métivier, Nasser Saheb
Probabilistic Analysis of an Election Algorithm in a Tree. CAAP (1994)
Igor Litovsky, Yves Métivier
Computing with Graph Rewriting Systems with Priorities. Theor. Comput. Sci. 115 (2) (1993)
Robert Cori, Yves Métivier, Wieslaw Zielonka
Asynchronous Mappings and Asynchronous Cellular Automata Inf. Comput. 106 (2) (1993)
Igor Litovsky, Yves Métivier, Éric Sopena
Definitions and Comparisons of Local Computations on Graphs. MFCS (1992)
Igor Litovsky, Yves Métivier, Wieslaw Zielonka
The Power and the Limitations of Local Computations on Graphs. WG (1992)
Yves Métivier, Brigitte Rozoy
On the Star Operation in Free Partially Commutative Monoids. Int. J. Found. Comput. Sci. 2 (3) (1991)
Igor Litovsky, Yves Métivier
Computing with Graph Relabelling Systems with Priorities. Graph-Grammars and Their Application to Computer Science (1990)
Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena
Graph Rewriting Systems with Priorities. WG (1989)
Robert Cori, Yves Métivier
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. ICALP (1988)
Yves Métivier
On Recognizable Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. 58 (1988)
Yves Métivier
An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. ICALP (1987)
Yves Métivier, Edward Ochmanski
On Lexicographic Semi-Commutations. Inf. Process. Lett. 26 (2) (1987)
Yves Métivier
Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. RAIRO Theor. Informatics Appl. 20 (2) (1986)
Yves Métivier
On Recognizable Subsets of Free Partially Commutative Monoids. ICALP (1986)
Yves Métivier
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. Theor. Comput. Sci. 35 (1985)
Robert Cori, Yves Métivier
Recognizable Subsets of Some Partially Abelian Monoids. Theor. Comput. Sci. 35 (1985)
Yves Métivier
About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. Inf. Process. Lett. 16 (1) (1983)