Publications of Yves Métivier
Load the BibTeX file
Academic Journals
- Jérémie Chalopin, Emmanuel Godard, Yves Métivier. Election in Partially Anonymous Networks with Arbitrary Knowledge in Message Passing Systems. Distributed Computing, 25(4):297-311, July 2012.
- Jérémie Chalopin, Yves Métivier, Thomas Morsellino. Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundamenta Informaticae, 120(1):1-27, June 2012.
- Yves Métivier, J.M. Robson, Nasser Saheb-Djahromi, Akka Zemmari. On the Time and the Bit Complexity of Distributed Randomised Anonymous Ring Colouring. Theoretical Computer Science, 445:1-12, May 2012.
- Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. An optimal bit complexity randomised distributed MIS algorithm. Distributed Computing, 23(5):331-340, January 2011.
- Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. About Randomised Distributed Graph Colouring and Graph Partition Algorithms. Information and Computation, 208(2):1296-1304, 2010.
- Yves Métivier, Jérémie Chalopin. On the power of synchronization between two adjacent processes. Distributed Computing, 23(3):177-196, November 2010.
- Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. About Randomised Distributed Graph Colouring and Graph Partition Algorithms. Information and Computation, 208(11):1296-1304, September 2010.
- Jérémie Chalopin, Yves Métivier. An efficient message passing algorithm based on Mazurkiewicz s algorithm. Fundamenta Informaticae, 80(1):221-246, 2007.
- Med-Amine Haddar, Ahmed Hadj-Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel. A Distributed Computational Model for Mobile Agents. Agent Computing and Multi-Agent Systems: 10th Pacific Rim International Conference on Multi-Agent Systems, PRIMA 2007, Bangkok, Thailand, November 21-23, 2007. Revised Papers, pages 416-421, 2007.
- Yves Métivier, Nasser Saheb, Akka Zemmari. Analysis of a randomized rendezvous algorithm. Inf. Comput, 184(1):109-128, 2003.
- Yves Métivier, Nasser Saheb, Akka Zemmari. Randomized local elections. Inf. Process. Lett, 82(6):313-320, 2002.
- Michel Bauderon, Yves Métivier, Mohamed Mosbah, Affif Sellami. Graph Relabelling Systems: A Tool for Encoding, Proving, Studying and Visualizing Distributed Algorithms. Electronic Notes in Theoretical Computer Science, GETGRATS Closing Workshop, 51(0):93-107, 2002.
- Abdelaziz ElHibaoui, Yves Métivier, John-Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. Analysis of a Randomized Dynamic Timetable Handshake Algorithm. Pure Mathematics and Applications (PuMA), to be published, 0.
International Conferences
- Jérémie Chalopin, Yves Métivier, Thomas Morsellino. Snapshots et Détection de Propriétés Stables dans les Systèmes Distribués Anonymes. In 14èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Fabien et Hanusse, Nicolas Mathieu (ed.), La Grande Motte, France, 2012.
- Jérémie Chalopin, Yves Métivier, Thomas Morsellino. On snapshots and stable properties detection in anonymous fully distributed systems (Extended abstract). In 19th International Colloquium on Structural Information and Communication Complexity, G. Even, M. M. Halldorsson (eds.), Lecture notes in computer science, Volume 7355, Pages 207-218, Islande, May 2012.
- Yves Métivier, John-Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. A Bit Complexity Efficient Randomized Distributed MIS Algorithm. In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009), 2009.
- Yves Métivier, John-Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm. In 13th International Conference On Principles Of DIstributed Systems (OPODIS 2009), to be published, 2009.
- Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. An Optimal Bit Complexity Randomized Distributed MIS Algorithm. In SIROCCO 2009, Lecture Notes in Computer Science, Volume 5869, Pages 323-337, Piran, Slovénie, 2009.
- Jérémie Chalopin, Emmanuel Godard, Yves Métivier. Local terminations and distributed computability in anonymous networks. In Distributed computing International symposium on distributed computing (DISC), Lecture notes in computer science, Volume 4218, Pages 47-62, Arcachon France, 2008.
- Jérémie Chalopin, Antoni Mazurkiewicz, Yves Métivier. Labelled (hyper)graphs, negotiations and the naming problem. In Graph transformation International conference on graph transformation (ICGT), Lecture notes in computer science, Volume 5214, Pages 54-68, Royaume-Uni, 2008.
- 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. In Distributed Computing and Networking, Volume 904, Pages 286-291, 2008.
- Med-Amine Haddar, Ahmed Hadj-Kacem, Yves Métivier, Mohamed Mosbah, Mohamed Jmaiel. Electing a leader in the local computation model using mobile agents. In AICCSA '08: Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications, Pages 473-480, Washington, DC, USA, 2008.
- Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel. About the termination detection in the asynchronous message passing model. In Theory and Practice of Computer Science 33rd International conference on Current trends in theory and practice of computer science (SOFSEM 2007), Lecture notes in computer science, Volume 4362, Pages 200-211, Tchèque, République, 2007.
- Jérémie Chalopin, Yves Métivier. Election and Local Computations on Edges. In Foundations of Software Science and Computation Structures, Volume 2987, Pages 90-104, 2004.
- Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka. Election, Naming and Cellular Edge Local Computations. In Graph transformation International Conference on Graph Transformation (ICGT 2004) (EATCS best paper award), Lecture notes in computer science, Volume 3256, Pages 242-256, Italie, 2004.
- Yves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Affif Sellami. Synchronizers for Local Computations. In Graph Transformations, Volume 3256, Pages 271-86, 2004.
- Emmanuel Godard, Yves Métivier, Anca Muscholl. Characterizations of Classes of Graphs Recognizable by Local Computations. In Theory of Computing Systems, Volume 37(2), Pages 249-93, 2004.
- Yves Métivier, Nasser Saheb, Akka Zemmari. A uniform randomized election in trees. In 10th International Colloquium on Structural Information and Communication Complexity, Pages 261-74, 2003.
- Emmanuel Godard, Yves Métivier. Deducible and Equivalent Structural Knowledges in Distributed Algorithms. In Theory of Computing Systems, Pages 631-54, 2003.
- Emmanuel Godard, Yves Métivier. A characterization of families of graphs in which election is possible. In Foundations of Software Science and Computation Structures Foundations of System Specification and Computation Structures (FoSSaCS) (EATCS best paper award), Lecture notes in computer science, Volume 2303, Pages 159-171, Espagne, 2002.
- Emmanuel Godard, Yves Métivier. Equivalence of structural knowledges in distributed algorithms. In 9th International Colloquium on Structural Information and Communication Complexity, Pages 149-64, 2002.
- Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami. Termination Detection of Distributed Algorithms by Graph Relabelling Systems. In ICGT '02: Proceedings of the First International Conference on Graph Transformation, Pages 106-119, London, UK, 2002.
- Yves Métivier, Mohamed Mosbah, Affif Sellami. Proving Distributed Algorithms by Graph Relabelling Systems: Examples of Trees in Networks with Processor Identities. In AGT2002, ETAPS, Grenoble, France, April 2002.
- Stefan Gruner, Yves Métivier, Mohamed Mosbah, Pierre-André Wacrenier. Distributed Algorithm for Computing a Spanning Tree in Anonymous T-prime Graphs. In OPODIS'2001, International Conference On Principles of DIstributed Systems, Manzanillo, Mexico, December 2001.
- Michel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah, Affif Sellami. Visualization of Distributed Algorithms Based on Labeled Rewriting Systems. In Second International Workshop on Graph Transformation and Visual Modeling Techniques, Volume 50(3), Pages 229-39, Crete, Greece, July 2001.
Research Reports
- Emmanuel Godard, Yves Métivier, Gerard Tel. Termination Detection of Local Computations. December 2009.
Misc
- Michel Bauderon, Yves Métivier, Mohamed Mosbah, Affif Sellami. From Local Computations to Asynchronous Message Passing Systems. 2002.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.