The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yves Métivier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  55. Electing a leader in the local computation model using mobile agents. [Citation Graph (, )][DBLP]


  56. Labelled (Hyper)Graphs, Negotiations and the Naming Problem. [Citation Graph (, )][DBLP]


  57. Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. [Citation Graph (, )][DBLP]


  58. A Distributed Computational Model for Mobile Agents. [Citation Graph (, )][DBLP]


  59. An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). [Citation Graph (, )][DBLP]


  60. Local Terminations and Distributed Computability in Anonymous Networks. [Citation Graph (, )][DBLP]


  61. Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks. [Citation Graph (, )][DBLP]


  62. Termination Detection of Local Computations [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002