| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari |
An optimal bit complexity randomized distributed MIS algorithm.  |
Distributed Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari |
About randomised distributed graph colouring and graph partition algorithms. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier, Gerard Tel |
Termination Detection of Local Computations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
On the power of synchronization between two adjacent processes. |
Distributed Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari |
An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). |
SIROCCO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier |
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. |
ICGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
distributed algorithms, mobile agents, spanning tree, proofs |
| 1 | Jérémie Chalopin, Emmanuel Godard, Yves Métivier |
Local Terminations and Distributed Computability in Anonymous Networks. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel |
About the Termination Detection in the Asynchronous Message Passing Model. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Med Amine Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel |
A Distributed Computational Model for Mobile Agents. |
PRIMA |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithms, mobile agent, computations model, transition systems |
| 1 | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka |
Local Computations in Graphs: The Case of Cellular Edge Local Computations. |
Fundam. Inform. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Yves Métivier, Mohamed Mosbah |
Workshop on Graph Computation Models. |
ICGT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy |
Mobile Agent Algorithms Versus Message Passing Algorithms. |
OPODIS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari |
Locally guided randomized elections in trees: The totally fair case. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka |
Local Computation in Graphs: The Case of Cellular Edge Local Computations. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier, Anca Muscholl |
Characterizations of Classes of Graphs Recognizable by Local Computations. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Afif Sellami |
Synchronizers for Local Computations. |
ICGT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka |
Election, Naming and Cellular Edge Local Computations. |
ICGT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Yves Métivier |
Election and Local Computations on Edges. |
FoSSaCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Nasser Saheb, Akka Zemmari |
Analysis of a randomized rendezvous algorithm. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier |
Deducible and Equivalent Structural Knowledges in Distributed Algorithms. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari |
A uniform randomized election in trees. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Yves Métivier, Nasser Saheb, Akka Zemmari |
Randomized local elections. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami |
Termination Detection of Distributed Algorithms by Graph Relabelling Systems. |
ICGT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier |
Equivalence of Structural Knowledges in Distributed Algorithms. |
SIROCCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier |
A Characterization of Families of Graphs in Which Election Is Possible. |
FoSSaCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah, Afif Sellami |
Visualization of Distributed Algorithms Based on Graph Relabelling Systems. |
Electr. Notes Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel 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. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Mohamed Mosbah, Pierre-André Wacrenier, Stefan Gruner |
A Distributed Algorithm for Computing a Spanning Tree in Anonymous Tprime Graph. |
OPODIS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier |
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. |
SIROCCO |
2001 |
DBLP BibTeX RDF |
|
| 1 | Yves Métivier, Gerard Tel |
Termination detection and universal graph reconstruction. |
SIROCCO |
2000 |
DBLP BibTeX RDF |
|
| 1 | Anne Bottreau, Yves Métivier |
Some Remarks on the Kronecker Product of Graphs. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Godard, Yves Métivier, Anca Muscholl |
The Power of Local Computations in Graphs with Initial Knowledge. |
TAGT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Bottreau, Yves Métivier |
Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. |
FoSSaCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Eric Sopena |
Graph Relabelling Systems: A General Overview. |
Computers and Artificial Intelligence |
1997 |
DBLP BibTeX RDF |
|
| 1 | Yves Métivier, Anca Muscholl, Pierre-André Wacrenier |
About the local detection of termination of local computations in graphs. |
SIROCCO |
1997 |
DBLP BibTeX RDF |
|
| 1 | Yves Métivier, Nasser Saheb |
Medians and Centres of Polyominoes. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Bottreau, Yves Métivier |
The Kronecker Product and Local Computations in Graphs. |
CAAP |
1996 |
DBLP DOI BibTeX RDF |
Cut-edge, Cut-vertex, k-covering, Local computations on graphs, The Kronecker product, Planar, Subgraph, Minor |
| 1 | Igor Litovsky, Yves Métivier, Wieslaw Zielonka |
On the Recognition of Families of Graphs with Local Computations |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Gwénaël Richomme |
New Results on the Star Problem in Trace Monoids |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Litovsky, Yves Métivier, Eric Sopena |
Checking global graph properties by means of local computations: the majority problem. |
Electr. Notes Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Litovsky, Yves Métivier, Eric Sopena |
Different Local Controls for Graph Relabeling Systems. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier |
Computing the Closure of Sets of Words Under Partial Commutations. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
Star Problem, trace monoids, rank, commutation, recognizability |
| 1 | Bruno Courcelle, Yves Métivier |
Coverings and Minors: Application to Local Computations in Graphs. |
Eur. J. Comb. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
trace monoids, finite power property, recognizability |
| 1 | Yves Métivier, Nasser Saheb |
Probabilistic Analysis of an Election Algorithm in a Tree. |
CAAP |
1994 |
DBLP DOI BibTeX RDF |
Labelled Graphs, Tree, Probabilistic analysis, Election, Median |
| 1 | Igor Litovsky, Yves Métivier |
Computing with Graph Rewriting Systems with Priorities. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Cori, Yves Métivier, Wieslaw Zielonka |
Asynchronous Mappings and Asynchronous Cellular Automata |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Litovsky, Yves Métivier |
Computing trees with graph rewriting systems with priorities. |
Tree Automata and Languages |
1992 |
DBLP BibTeX RDF |
|
| 1 | Igor Litovsky, Yves Métivier, Wieslaw Zielonka |
The Power and the Limitations of Local Computations on Graphs. |
WG |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Litovsky, Yves Métivier, Eric Sopena |
Definitions and Comparisons of Local Computations on Graphs. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Brigitte Rozoy |
On the Star Operation in Free Partially Commutative Monoids. |
Int. J. Found. Comput. Sci. |
1991 |
DBLP BibTeX RDF |
|
| 1 | Igor Litovsky, Yves Métivier |
Computing with Graph Relabelling Systems with Priorities. |
Graph-Grammars and Their Application to Computer Science |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Billaud, Pierre Lafon, Yves Métivier, Eric Sopena |
Graph Rewriting Systems with Priorities. |
WG |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier |
On Recognizable Subsets of Free Partially Commutative Monoids. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Cori, Yves Métivier |
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier, Edward Ochmanski |
On Lexicographic Semi-Commutations. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier |
An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
partially commutative, asynchronous automaton, tree, Monoid, recognizable |
| 1 | Yves Métivier |
Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif. |
ITA |
1986 |
DBLP BibTeX RDF |
|
| 1 | Yves Métivier |
On Recognizable Subsets of Free Partially Commutative Monoids. |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
Fr Monode, partiellement commutatif, hauteur d'étoile, reconnaissable |
| 1 | Robert Cori, Yves Métivier |
Recognizable Subsets of Some Partially Abelian Monoids. |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier |
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre. |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Métivier |
About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. |
Inf. Process. Lett. |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")