Academic Journals

2013

  1. Nesrine Ouled Abdallah, Hatem Hadj Kacem, Mohamed Mosbah, Akka Zemmari. Randomized broadcasting in wireless mobile sensor networks. Concurrency and Computation: Practice and Experience, 25(2):203-217, February 2013. details ppt

2012

  1. 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. details ppt
  2. 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. details ppt
  3. 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. details ppt

2011

  1. Pierre Castéran, Vincent Filou. Tasks, types and tactics for local computation systems. Studia Informatica Universalis, http://studia.complexica.net/Art/RI090102.pdf, 9.1:39-86, 2011. details ppt
  2. Mohamed Tounsi, Mohamed Mosbah, Dominique Méry. Proving Distributed Algorithms by Combining Refinement and Local Computations. Electronic Communications of the EASST, 35:0-2122, November 2011. details ppt
  3. 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. details ppt

2010

  1. Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Sublinear Fully Distributed Partition with Applications. Theory of Computing Systems, 47(3):368-404, 2010. details ppt
  2. Abdelaaziz El Hibaoui, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. Uniform Election in Trees and Polyominoids. Discrete Applied Mathematics, (158):981-987, 2010. details ppt
  3. 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. details ppt
  4. Yves Métivier, Jérémie Chalopin. On the power of synchronization between two adjacent processes. Distributed Computing, 23(3):177-196, November 2010. details ppt
  5. 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. details ppt

2009

  1. Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Sublinear Fully Distributed Partition with Applications. Theory of Computing Systems, To appear, 2009. details

2007

  1. Shehla Abbas, Mohamed Mosbah, Akka Zemmari. A Generic Distributed Algorithm for Computing by Random 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 392-397, 2007. details ppt
  2. Shehla Abbas, Mohamed Mosbah, Akka Zemmari. Collecte d'informations par des agents mobiles. NOuvelles TEchnologies de la REpartition (NOTERE), pages 139-48, 2007. details
  3. Jérémie Chalopin, Yves Métivier. An efficient message passing algorithm based on Mazurkiewicz s algorithm. Fundamenta Informaticae, 80(1):221-246, 2007. details ppt
  4. 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. details ppt

2006

  1. Bilel Derbel, Mohamed Mosbah. Distributed Graph Traversals by Relabelling Systems with Applications. Electronic Notes in Theoretical Computer Science, Proceedings of the Workshop on Graph Transformation for Verification and Concurrency (GT-VC 2005), 154(2):79-94, 2006. details ppt

2003

  1. Michel Bauderon, Mohamed Mosbah. A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms. Electronic Notes in Theoretical Computer Science, GT-VMT'2002, Graph Transformation and Visual Modeling Techniques (First International Conference on Graph Transformation), 72(3):13-24, 2003. details ppt
  2. Yves Métivier, Nasser Saheb, Akka Zemmari. Analysis of a randomized rendezvous algorithm. Inf. Comput, 184(1):109-128, 2003. details ppt

2002

  1. 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. details ppt
  2. Yves Métivier, Nasser Saheb, Akka Zemmari. Randomized local elections. Inf. Process. Lett, 82(6):313-320, 2002. details ppt

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.