default search action
Yves Métivier
Person information
- affiliation: LaBRI, Bordeaux, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [i8]Bruno Courcelle, Yves Métivier:
Unfoldings and coverings of weighted graphs. CoRR abs/2212.07205 (2022) - 2021
- [i7]Arnaud Casteigts, Yves Métivier, John Michael Robson:
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR abs/2101.01409 (2021)
2010 – 2019
- 2019
- [j37]Arnaud Casteigts
, Yves Métivier, J. M. Robson, Akka Zemmari
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81(5): 1901-1920 (2019) - [j36]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. 264: 32-51 (2019) - [j35]Arnaud Casteigts
Counting in one-hop beeping networks. Theor. Comput. Sci. 780: 20-28 (2019) - 2016
- [j34]Yves Métivier, John Michael Robson, Akka Zemmari
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... Inf. Comput. 247: 141-151 (2016) - [j33]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: 208-214 (2016) - [c43]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. OPODIS 2016: 15:1-15:16 - [c42]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: 16-28 - [i6]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 abs/1605.01903 (2016) - [i5]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Counting in One-Hop Beeping Networks. CoRR abs/1605.09516 (2016) - [i4]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. CoRR abs/1607.02951 (2016) - 2015
- [j32]Yves Métivier, John Michael Robson
Analysis of fully distributed splitting and naming probabilistic procedures and applications. Theor. Comput. Sci. 584: 115-130 (2015) - [i3]Yves Métivier, John Michael Robson, Akka Zemmari:
On Distributed Computing with Beeps. CoRR abs/1507.02721 (2015) - [i2]Yves Métivier, John Michael Robson, Akka Zemmari:
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter. CoRR abs/1507.03376 (2015) - 2014
- [c41]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: 235-245 - 2013
- [j31]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: 32-40 (2013) - [j30]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: 64-75 (2013) - [c40]Yves Métivier, John Michael Robson, Akka Zemmari
Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract). SIROCCO 2013: 153-164 - 2012
- [j29]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): 297-311 (2012) - [j28]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): 1-27 (2012) - [c39]Jérémie Chalopin, Yves Métivier, Thomas Morsellino:
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO 2012: 207-218 - 2011
- [j27]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An optimal bit complexity randomized distributed MIS algorithm. Distributed Comput. 23(5-6): 331-340 (2011) - 2010
- [j26]Jérémie Chalopin, Yves Métivier:
On the power of synchronization between two adjacent processes. Distributed Comput. 23(3): 177-196 (2010) - [j25]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
About randomised distributed graph colouring and graph partition algorithms. Inf. Comput. 208(11): 1296-1304 (2010) - [i1]Emmanuel Godard, Yves Métivier, Gerard Tel:
Termination Detection of Local Computations. CoRR abs/1001.2785 (2010)
2000 – 2009
- 2009
- [c38]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: 359-364 - [c37]Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). SIROCCO 2009: 323-337 - 2008
- [c36]Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah
Electing a leader in the local computation model using mobile agents. AICCSA 2008: 473-480 - [c35]Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier:
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT 2008: 54-68 - [c34]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: 286-291 - [c33]Jérémie Chalopin, Emmanuel Godard, Yves Métivier:
Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62 - 2007
- [j24]Jérémie Chalopin, Yves Métivier:
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundam. Informaticae 80(1-3): 221-246 (2007) - [c32]Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah
A Distributed Computational Model for Mobile Agents. PRIMA 2007: 416-421 - [c31]Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel:
About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) 2007: 200-211 - 2006
- [j23]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Informaticae 74(1): 85-114 (2006) - [c30]Yves Métivier, Mohamed Mosbah
Workshop on Graph Computation Models. ICGT 2006: 463-464 - [c29]Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy:
Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS 2006: 187-201 - 2005
- [j22]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bull. EATCS 85: 105-109 (2005) - [j21]Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari
Locally guided randomized elections in trees: The totally fair case. Inf. Comput. 198(1): 40-55 (2005) - [c28]Jérémie Chalopin, Yves Métivier:
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS 2005: 212-223 - 2004
- [j20]Emmanuel Godard, Yves Métivier, Anca Muscholl:
Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37(2): 249-293 (2004) - [c27]Jérémie Chalopin, Yves Métivier:
Election and Local Computations on Edges. FoSSaCS 2004: 90-104 - [c26]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka:
Election, Naming and Cellular Edge Local Computations. ICGT 2004: 242-256 - [c25]Yves Métivier, Mohamed Mosbah
Synchronizers for Local Computations. ICGT 2004: 271-286 - 2003
- [j19]Yves Métivier, Nasser Saheb, Akka Zemmari
Analysis of a randomized rendezvous algorithm. Inf. Comput. 184(1): 109-128 (2003) - [j18]Emmanuel Godard, Yves Métivier:
Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36(6): 631-654 (2003) - [c24]Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari:
A uniform randomized election in trees. SIROCCO 2003: 259-274 - 2002
- [j17]Yves Métivier, Nasser Saheb, Akka Zemmari
Randomized local elections. Inf. Process. Lett. 82(6): 313-320 (2002) - [c23]Emmanuel Godard, Yves Métivier:
A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS 2002: 159-172 - [c22]Emmanuel Godard, Yves Métivier, Mohamed Mosbah
Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT 2002: 106-119 - [c21]Emmanuel Godard, Yves Métivier:
Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO 2002: 149-164 - 2001
- [c20]Yves Métivier, Mohamed Mosbah, Pierre-André Wacrenier, Stefan Gruner:
A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph. OPODIS 2001: 141-158 - [c19]Emmanuel Godard, Yves Métivier:
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO 2001: 179-194 - [c18]Michel Bauderon, Yves Métivier, Mohamed Mosbah
Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms. GETGRATS Closing Workshop 2001: 93-107 - [c17]Michel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah
Visualization of Distributed Algorithms Based on Graph Relabelling Systems. GT-VMT@ICALP 2001: 227-237 - 2000
- [c16]Yves Métivier, Gerard Tel:
Termination detection and universal graph reconstruction. SIROCCO 2000: 237-251
1990 – 1999
- 1998
- [j16]Anne Bottreau, Yves Métivier:
Some Remarks on the Kronecker Product of Graphs. Inf. Process. Lett. 68(2): 55-61 (1998) - [c15]Anne Bottreau, Yves Métivier:
Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. FoSSaCS 1998: 110-124 - [c14]Emmanuel Godard, Yves Métivier, Anca Muscholl:
The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998: 71-84 - 1997
- [j15]Yves Métivier, Éric Sopena:
Graph Relabelling Systems: A General Overview. Comput. Artif. Intell. 16(2): 167-185 (1997) - [c13]Yves Métivier, Anca Muscholl, Pierre-André Wacrenier:
About the local detection of termination of local computations in graphs. SIROCCO 1997: 188-200 - [p2]Volker Diekert, Yves Métivier:
Partial Commutation and Traces. Handbook of Formal Languages (3) 1997: 457-533 - 1996
- [j14]Yves Métivier, Nasser Saheb:
Medians and Centres of Polyominoes. Inf. Process. Lett. 57(4): 175-181 (1996) - [c12]Anne Bottreau, Yves Métivier:
The Kronecker Product and Local Computations in Graphs. CAAP 1996: 2-16 - 1995
- [j13]Igor Litovsky, Yves Métivier, Wieslaw Zielonka:
On the Recognition of Families of Graphs with Local Computations. Inf. Comput. 118(1): 110-119 (1995) - [j12]Yves Métivier, Gwénaël Richomme:
New Results on the Star Problem in Trace Monoids. Inf. Comput. 119(2): 240-251 (1995) - [j11]Igor Litovsky, Yves Métivier, Éric Sopena:
Different Local Controls for Graph Relabeling Systems. Math. Syst. Theory 28(1): 41-65 (1995) - [c11]Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier:
Computing the Closure of Sets of Words Under Partial Commutations. ICALP 1995: 75-86 - [c10]Igor Litovsky, Yves Métivier, Éric Sopena:
Checking global graph properties by means of local computations: the majority problem. SEGRAGRA 1995: 199-206 - 1994
- [j10]Bruno Courcelle, Yves Métivier:
Coverings and Minors: Application to Local Computations in Graphs. Eur. J. Comb. 15(2): 127-138 (1994) - [c9]Yves Métivier, Nasser Saheb:
Probabilistic Analysis of an Election Algorithm in a Tree. CAAP 1994: 234-245 - [c8]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: 341-352 - 1993
- [j9]Robert Cori, Yves Métivier, Wieslaw Zielonka:
Asynchronous Mappings and Asynchronous Cellular Automata. Inf. Comput. 106(2): 159-202 (1993) - [j8]Igor Litovsky, Yves Métivier:
Computing with Graph Rewriting Systems with Priorities. Theor. Comput. Sci. 115(2): 191-224 (1993) - 1992
- [c7]Igor Litovsky, Yves Métivier, Éric Sopena:
Definitions and Comparisons of Local Computations on Graphs. MFCS 1992: 364-373 - [c6]Igor Litovsky, Yves Métivier, Wieslaw Zielonka:
The Power and the Limitations of Local Computations on Graphs. WG 1992: 333-345 - [p1]Igor Litovsky, Yves Métivier:
Computing trees with graph rewriting systems with priorities. Tree Automata and Languages 1992: 115-140 - 1991
- [j7]Yves Métivier, Brigitte Rozoy:
On the Star Operation in Free Partially Commutative Monoids. Int. J. Found. Comput. Sci. 2(3): 257-265 (1991) - 1990
- [c5]Igor Litovsky, Yves Métivier:
Computing with Graph Relabelling Systems with Priorities. Graph-Grammars and Their Application to Computer Science 1990: 549-563
1980 – 1989
- 1989
- [c4]Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena:
Graph Rewriting Systems with Priorities. WG 1989: 94-106 - 1988
- [j6]Yves Métivier:
On Recognizable Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. 58: 201-208 (1988) - [c3]Robert Cori, Yves Métivier:
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. ICALP 1988: 147-161 - 1987
- [j5]Yves Métivier, Edward Ochmanski:
On Lexicographic Semi-Commutations. Inf. Process. Lett. 26(2): 55-59 (1987) - [c2]Yves Métivier:
An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. ICALP 1987: 226-236 - 1986
- [j4]Yves Métivier:
Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. RAIRO Theor. Informatics Appl. 20(2): 121-127 (1986) - [c1]Yves Métivier:
On Recognizable Subsets of Free Partially Commutative Monoids. ICALP 1986: 254-264 - 1985
- [j3]Yves Métivier:
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. Theor. Comput. Sci. 35: 71-87 (1985) - [j2]Robert Cori, Yves Métivier:
Recognizable Subsets of Some Partially Abelian Monoids. Theor. Comput. Sci. 35: 179-189 (1985) - 1983
- [j1]Yves Métivier:
About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. Inf. Process. Lett. 16(1): 31-34 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: