Publications of Jeremie Chalopin
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érémie Chalopin. On the power of synchronization between two adjacent processes. Distributed Computing, 23(3):177-196, November 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.
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.
- 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.
- 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, Shantanu Das, Nicola Santoro. Rendezvous of mobile agents in unknown graphs with faulty links. In Distributed Computing, Volume 4731, Pages 108-22, 2007.
- Jérémie Chalopin. Election and local computations on closed unlabelled edges (extended abstract. In Proc. of SOFSEM 2005, 2005.
- 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.
Research Reports
- Jérémie Chalopin, Daniel Paulsuma. Graph labelling derived from models in distributed computing: a complete complexity classification. Research Report Laboratoire Bordelais de Recherche en Informatique (LaBRI), No 0, 2008.
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.