dblp.uni-trier.dewww.uni-trier.de

Yves Métivier

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
61EEM. A. Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel: Electing a leader in the local computation model using mobile agents. AICCSA 2008: 473-480
60EEJérémie Chalopin, Emmanuel Godard, Yves Métivier: Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62
59EEMed 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
58EEJérémie Chalopin, Antoni Mazurkiewicz, Yves Métivier: Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT 2008: 54-68
2007
57EEMed Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel: A Distributed Computational Model for Mobile Agents. PRIMA 2007: 416-421
56EEJé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
55EEJérémie Chalopin, Yves Métivier: An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. Fundam. Inform. 80(1-3): 221-246 (2007)
2006
54EEYves Métivier, Mohamed Mosbah: Workshop on Graph Computation Models. ICGT 2006: 463-464
53EEJérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy: Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS 2006: 187-201
52EEJérémie Chalopin, Yves Métivier, Wieslaw Zielonka: Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundam. Inform. 74(1): 85-114 (2006)
2005
51EEJérémie Chalopin, Yves Métivier: A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS 2005: 212-223
50 Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka: Local Computation in Graphs: The Case of Cellular Edge Local Computations. Bulletin of the EATCS 85: 105-109 (2005)
49EEYves Métivier, Nasser Saheb-Djahromi, Akka Zemmari: Locally guided randomized elections in trees: The totally fair case. Inf. Comput. 198(1): 40-55 (2005)
2004
48EEJérémie Chalopin, Yves Métivier: Election and Local Computations on Edges. FoSSaCS 2004: 90-104
47EEJérémie Chalopin, Yves Métivier, Wieslaw Zielonka: Election, Naming and Cellular Edge Local Computations. ICGT 2004: 242-256
46EEYves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Afif Sellami: Synchronizers for Local Computations. ICGT 2004: 271-286
45EEEmmanuel Godard, Yves Métivier, Anca Muscholl: Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37(2): 249-293 (2004)
2003
44 Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari: A uniform randomized election in trees. SIROCCO 2003: 259-274
43EEYves Métivier, Nasser Saheb, Akka Zemmari: Analysis of a randomized rendezvous algorithm. Inf. Comput. 184(1): 109-128 (2003)
42EEEmmanuel Godard, Yves Métivier: Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36(6): 631-654 (2003)
2002
41EEEmmanuel Godard, Yves Métivier: A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS 2002: 159-172
40EEEmmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami: Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT 2002: 106-119
39 Emmanuel Godard, Yves Métivier: Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO 2002: 149-164
38EEYves Métivier, Nasser Saheb, Akka Zemmari: Randomized local elections. Inf. Process. Lett. 82(6): 313-320 (2002)
2001
37 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
36 Emmanuel Godard, Yves Métivier: A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO 2001: 179-194
35EEMichel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah, Afif Sellami: Visualization of Distributed Algorithms Based on Graph Relabelling Systems. Electr. Notes Theor. Comput. Sci. 50(3): (2001)
34EEMichel Bauderon, Yves Métivier, Mohamed Mosbah, Afif Sellami: Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms. Electr. Notes Theor. Comput. Sci. 51: (2001)
2000
33 Yves Métivier, Gerard Tel: Termination detection and universal graph reconstruction. SIROCCO 2000: 237-251
1998
32EEAnne Bottreau, Yves Métivier: Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. FoSSaCS 1998: 110-124
31 Emmanuel Godard, Yves Métivier, Anca Muscholl: The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998: 71-84
30EEAnne Bottreau, Yves Métivier: Some Remarks on the Kronecker Product of Graphs. Inf. Process. Lett. 68(2): 55-61 (1998)
1997
29 Yves Métivier, Anca Muscholl, Pierre-André Wacrenier: About the local detection of termination of local computations in graphs. SIROCCO 1997: 188-200
28 Yves Métivier, Eric Sopena: Graph Relabelling Systems: A General Overview. Computers and Artificial Intelligence 16(2): (1997)
1996
27 Anne Bottreau, Yves Métivier: The Kronecker Product and Local Computations in Graphs. CAAP 1996: 2-16
26EEYves Métivier, Nasser Saheb: Medians and Centres of Polyominoes. Inf. Process. Lett. 57(4): 175-181 (1996)
1995
25 Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier: Computing the Closure of Sets of Words Under Partial Commutations. ICALP 1995: 75-86
24EEIgor Litovsky, Yves Métivier, Eric Sopena: Checking global graph properties by means of local computations: the majority problem. Electr. Notes Theor. Comput. Sci. 2: (1995)
23 Igor Litovsky, Yves Métivier, Wieslaw Zielonka: On the Recognition of Families of Graphs with Local Computations Inf. Comput. 118(1): 110-119 (1995)
22 Yves Métivier, Gwénaël Richomme: New Results on the Star Problem in Trace Monoids Inf. Comput. 119(2): 240-251 (1995)
21 Igor Litovsky, Yves Métivier, Eric Sopena: Different Local Controls for Graph Relabeling Systems. Mathematical Systems Theory 28(1): 41-65 (1995)
1994
20 Yves Métivier, Nasser Saheb: Probabilistic Analysis of an Election Algorithm in a Tree. CAAP 1994: 234-245
19 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
18EEBruno Courcelle, Yves Métivier: Coverings and Minors: Application to Local Computations in Graphs. Eur. J. Comb. 15(2): 127-138 (1994)
1993
17 Robert Cori, Yves Métivier, Wieslaw Zielonka: Asynchronous Mappings and Asynchronous Cellular Automata Inf. Comput. 106(2): 159-202 (1993)
16 Igor Litovsky, Yves Métivier: Computing with Graph Rewriting Systems with Priorities. Theor. Comput. Sci. 115(2): 191-224 (1993)
1992
15 Igor Litovsky, Yves Métivier, Eric Sopena: Definitions and Comparisons of Local Computations on Graphs. MFCS 1992: 364-373
14 Igor Litovsky, Yves Métivier, Wieslaw Zielonka: The Power and the Limitations of Local Computations on Graphs. WG 1992: 333-345
13 Igor Litovsky, Yves Métivier: Computing trees with graph rewriting systems with priorities. Tree Automata and Languages 1992: 115-140
1991
12 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
11 Igor Litovsky, Yves Métivier: Computing with Graph Relabelling Systems with Priorities. Graph-Grammars and Their Application to Computer Science 1990: 549-563
1989
10 Michel Billaud, Pierre Lafon, Yves Métivier, Eric Sopena: Graph Rewriting Systems with Priorities. WG 1989: 94-106
1988
9 Robert Cori, Yves Métivier: Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. ICALP 1988: 147-161
8 Yves Métivier: On Recognizable Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. 58: 201-208 (1988)
1987
7 Yves Métivier: An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. ICALP 1987: 226-236
6 Yves Métivier, Edward Ochmanski: On Lexicographic Semi-Commutations. Inf. Process. Lett. 26(2): 55-59 (1987)
1986
5 Yves Métivier: On Recognizable Subsets of Free Partially Commutative Monoids. ICALP 1986: 254-264
4 Yves Métivier: Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. ITA 20(2): 121-127 (1986)
1985
3 Robert Cori, Yves Métivier: Recognizable Subsets of Some Partially Abelian Monoids. Theor. Comput. Sci. 35: 179-189 (1985)
2 Yves Métivier: Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. Theor. Comput. Sci. 35: 71-87 (1985)
1983
1 Yves Métivier: About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. Inf. Process. Lett. 16(1): 31-34 (1983)

Coauthor Index

1Michel Bauderon [34] [35]
2Michel Billaud [10]
3Anne Bottreau [27] [30] [32]
4Jérémie Chalopin [47] [48] [50] [51] [52] [53] [55] [56] [58] [60]
5Robert Cori [3] [9] [17]
6Bruno Courcelle [18]
7Emmanuel Godard [31] [36] [39] [40] [41] [42] [45] [53] [56] [60]
8Stefan Gruner [35] [37]
9M. A. Haddar [61]
10Med Amine Haddar [57] [59]
11Mohamed Jmaiel [57] [59] [61]
12Ahmed Hadj Kacem [57] [59] [61]
13Pierre Lafon [10]
14Igor Litovsky [11] [13] [14] [15] [16] [21] [23] [24]
15Antoni Mazurkiewicz [58]
16Mohamed Mosbah [34] [35] [37] [40] [46] [54] [57] [59] [61]
17Anca Muscholl [29] [31] [45]
18Edward Ochmanski [6]
19Rodrigue Ossamy [46] [53]
20Gwénaël Richomme [19] [22] [25]
21Brigitte Rozoy [12]
22Nasser Saheb [20] [26] [38] [43]
23Nasser Saheb-Djahromi [44] [49]
24Afif Sellami [34] [35] [40] [46]
25Eric Sopena [10] [15] [21] [24] [28]
26Gerard Tel [33] [56]
27Pierre-André Wacrenier [25] [29] [37]
28Akka Zemmari [38] [43] [44] [49]
29Wieslaw Zielonka [14] [17] [23] [47] [50] [52]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)