| Partial commutation and traces V Diekert, Y Métivier Handbook of formal languages, 457-533, 1997 | 215 | 1997 |
| Graph relabelling systems and distributed algorithms I Litovsky, Y Métivier, É Sopena Handbook Of Graph Grammars And Computing By Graph Transformation: Volume 3 …, 1999 | 135 | 1999 |
| An optimal bit complexity randomized distributed MIS algorithm Y Métivier, JM Robson, N Saheb-Djahromi, A Zemmari International Colloquium on Structural Information and Communication …, 2009 | 104 | 2009 |
| Asynchronous mappings and asynchronous cellular automata R Cori, Y Métivier, W Zielonka Information and Computation 106 (2), 159-202, 1993 | 99 | 1993 |
| About the rewriting systems produced by the Knuth-Bendix completion algorithm Y Métivier Information Processing Letters 16 (1), 31-34, 1983 | 85 | 1983 |
| Recognizable subsets of some partially abelian monoids R Cori, Y Métivier Theoretical Computer Science 35, 179-189, 1985 | 79 | 1985 |
| An optimal bit complexity randomized distributed MIS algorithm Y Métivier, JM Robson, N Saheb-Djahromi, A Zemmari Distributed Computing 23 (5), 331-340, 2011 | 68 | 2011 |
| Some remarks on the Kronecker product of graphs A Bottreau, Y Métivier Information Processing Letters 68 (2), 55-61, 1998 | 66 | 1998 |
| Mobile agent algorithms versus message passing algorithms J Chalopin, E Godard, Y Métivier, R Ossamy International Conference On Principles Of Distributed Systems, 187-201, 2006 | 61 | 2006 |
| Different local controls for graph relabeling systems I Litovsky, Y Métivier, E Sopena Mathematical systems theory 28 (1), 41-65, 1995 | 57 | 1995 |
| Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif Y Métivier RAIRO-Theoretical Informatics and Applications 20 (2), 121-127, 1986 | 56 | 1986 |
| Coverings and minors: Application to local computations in graphs B Courcelle, Y Métivier European Journal of Combinatorics 15 (2), 127-138, 1994 | 52 | 1994 |
| On the recognition of families of graphs with local computations I Litovsky, Y Metivier, W Zielonka Information and computation 118 (1), 110-119, 1995 | 50 | 1995 |
| Local computations in graphs: the case of cellular edge local computations J Chalopin, Y Métivier, W Zielonka Fundamenta Informaticae 74 (1), 85-114, 2006 | 47* | 2006 |
| Computing with graph rewriting systems with priorities I Litovsky, Y Métivier Theoretical Computer Science 115 (2), 191-224, 1993 | 40 | 1993 |
| Characterizations of classes of graphs recognizable by local computations E Godard, Y Métivier, A Muscholl Theory of Computing Systems 37 (2), 249-293, 2004 | 39 | 2004 |
| Analysis of a randomized rendezvous algorithm Y Métivier, N Saheb, A Zemmari Information and Computation 184 (1), 109-128, 2003 | 39 | 2003 |
| An efficient message passing election algorithm based on Mazurkiewicz's algorithm J Chalopin, Y Métivier Fundamenta Informaticae 80 (1-3), 221-246, 2007 | 37 | 2007 |
| The power and the limitations of local computations on graphs I Litovsky, Y Métivier, W Zielonka International Workshop on Graph-Theoretic Concepts in Computer Science, 333-345, 1992 | 37 | 1992 |
| Randomized rendezvous Y Metivier, N Saheb, A Zemmari Mathematics and Computer Science, 183-194, 2000 | 35 | 2000 |
Akka ZEMMARIProfessor of Computer Science, LaBRI - Univ. Bordeaux, FRANCEAdresse e-mail validée de labri.fr
