All the publications

Load the BibTeX file

Books

  1. Yves Bertot, Pierre Castéran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, Springer Verlag, 2004. details ppt

Academic Journals

  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
  2. 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
  3. 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
  4. 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
  5. 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
  6. 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
  7. 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
  8. Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Sublinear Fully Distributed Partition with Applications. Theory of Computing Systems, 47(3):368-404, 2010. details ppt
  9. 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
  10. 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
  11. 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
  12. 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
  13. Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Sublinear Fully Distributed Partition with Applications. Theory of Computing Systems, To appear, 2009. details
  14. 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
  15. 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
  16. Shehla Abbas, Mohamed Mosbah, Akka Zemmari. Collecte d'informations par des agents mobiles. NOuvelles TEchnologies de la REpartition (NOTERE), pages 139-48, 2007. details
  17. 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
  18. 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
  19. Yves Métivier, Nasser Saheb, Akka Zemmari. Analysis of a randomized rendezvous algorithm. Inf. Comput, 184(1):109-128, 2003. details ppt
  20. 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
  21. Yves Métivier, Nasser Saheb, Akka Zemmari. Randomized local elections. Inf. Process. Lett, 82(6):313-320, 2002. details ppt
  22. 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
  23. Abdelaziz ElHibaoui, John-Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari. Uniform Election in Trees and Polyominoids. Discrete Applied Mathematics, to be published, 0. details
  24. 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. details

Book Chapters

  1. Mohamed Mosbah, Rachid Echahed, Annegret Habel. Graph Computation Models.. In Graph Computation Models., Electronic Communications of the EASST, EASST, October 2011. details ppt

International Conferences

  1. Allyx Fontaine, Akka Zemmari. Une Analyse Formelle en Coq d'un Algorithme Distribué Probabiliste résolvant le Problème du Rendez-Vous. In JFLA - Journées francophones des langages applicatifs, Damien Pous, Christine Tasson (eds.), Aussois, France, February 2013. details pdf
  2. 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. details pdf
  3. Cédric Aguerre, Thomas Morsellino, Mohamed Mosbah. Debugging the Execution of Distributed Algorithms over Anonymous Networks. In Proceedings of the International Conference on Information Visualisation, Pages 464-470, Montpellier, France, July 2012. details ppt
  4. 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. details ppt
  5. Cédric Aguerre, Thomas Morsellino, Mohamed Mosbah. Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks. In Proceedings of the International Conference on Information Visualization Theory and Applications, M. Kraus, R. S. Laramee P. Richard, J. Braz (eds.), Pages 764-767, Rome, Italie, February 2012. details pdf
  6. Dominique Méry, Mohamed Mosbah, Mohamed Tounsi. Refinement-based Verification of Local Synchronization Algorithms. In Formal Methods FM2011, Lecture Notes in Computer Science, Limerick, Irlande, June 2011. details ppt
  7. Pierre Castéran, Vincent Filou. Tâches, types et tactiques pour les systèmes de calculs locaux. In Journées Francophones des Langages Applicatifs, 2010. details
  8. Dominique Méry, Mohammed Mosbah, Mohammed Tounsi. Proving Distributed Algorithms by Combining Refinement and Local Computations. In AVOCS 2010 10th International Workshop on Automated Verification of Critical Systems, Michael Leuschel, Markus Roggenbach Jens Bendisposto (ed.), Dusseldorf, Allemagne, September 2010. details ppt
  9. Nesrine Ouled Abdallah, Hatem Hadj Kacem, Mohamed Mosbah, Akka Zemmari. Broadcast in wireless mobile sensor networks with population protocols and extension with the rendezvous model. In NOuvelles TEchnologies de la REpartition, Khalil Drira, Ahmed Hadj Kacem, Mohamed Jmaiel (eds.), IEEE, Pages 219-226, Tozeur, Tunisie, August 2010. details ppt
  10. Pierre Castéran, Vincent Filou. Tâches, types et tactiques pour les systèmes de calculs locaux. In Actes des vingt-et-unièmes Journées Francophones des Langages Applicatifs, Ivan Lavallée (ed.), Studia Informatica Universalis, Pages 83-110, La Ciotat, France, March 2010. details ppt
  11. Pierre Castéran, Vincent Filou, Mohamed Mosbah. Certifying Distributed Algorithms by Embedding Local Computation Systems in the Coq Proof Assistant. In Symbolic Computation in Software Science (SCSS'09), 2009. details
  12. Imen Jemili, Abdelfattah Belghith, Mohamed Mosbah. Exploiting a clustering mechanism for power saving in ad hoc networks: Performance evaluation. In AICCSA 2009 IEEE/ACS International Conference on Computer Systems and Applications, 2009. AICCSA 2009, Pages 717-724, Rabat Maroc, 2009. details ppt
  13. Jean-Francois Marckert, Nasser Saheb-Djahromi, Akka Zemmari. Election Algorithms with Random Delays in Trees. In 21st Formal Power Series and Algebraic Combinatorics (FPSAC), to be published, 2009. details
  14. 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. details
  15. 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. details
  16. Mohamed Tounsi, Ahmed Hadj-Kacem, Mohamed Mosbah, Dominique Méry. A Refinement Approach for Proving Distributed Algorithms : Examples of Spanning Tree Problems. In Integration of Model based Formal Methods and Tools(IMFMT 2009), Düsseldorf Allemagne, 2009. details
  17. Mohamed Mosbah, Mohamed Tounsi. Automatic Implementation of Distributed Algorithms Specified in Event-B. In proceedings of Symbolic Computation in Software Science ( SCSS 2009) Symbolic Computation in Software Science (SCSS 2009), Tunisie, 2009. details ppt
  18. Pierre Castéran, Vincent Filou, Mohamed Mosbah. Certifying Distributed Algorithms by Embedding Local Computation Systems in the Coq Proof Assistant. In Proceedings of Symbolic Computation in Software Science (SCSS 2009) Symbolic Computation in Software Science (SCSS 2009), Tunisie, 2009. details ppt
  19. 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. details ppt
  20. 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. details ppt
  21. 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. details ppt
  22. 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. details ppt
  23. 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. details ppt
  24. Bilel Derbel, Mohamed Mosbah, Stefan Gruner. Mobile Agents Implementing Local Computations in Graphs. In ICGT '08: Proceedings of the 4th international conference on Graph Transformations, Pages 99-114, Berlin, Heidelberg, 2008. details ppt
  25. Shehla Abbas, Mohamed Mosbah, Akka Zemmari. Merging Time of Random Mobile Agents. In Dynamics in Logistics, Pages 179-90, 2008. details ppt
  26. 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. details ppt
  27. 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. details ppt
  28. Hedi Hamdi, Mohamed Mosbah, Adel Bouhoula. A Domain Specific Language for Securing Distributed Systems. In ICSNC '07: Proceedings of the Second International Conference on Systems and Networks Communications, Washington, DC, USA, 2007. details ppt
  29. Brahim Hamid, Bertrand LeSaec, Mohamed Mosbah. Distributed Local 2-Connectivity Test of Graphs and Applications. In Parallel and Distributed Processing and Applications, Volume 4742, Pages 195-207, 2007. details ppt
  30. Brahim Hamid, Bertrand LeSaec, Mohamed Mosbah. Distributed $2$-Vertex Connectivity Test of Graphs Using Local Knowledge. In Proceeding of the International Conference on Parallel and Distributed Computing Systems, Pages 71-6, 2007. details
  31. Brahim Hamid, Mohamed Mosbah, Akka Zemmari. A Self-stabilizing Distributed Algorithm for Resolving Conflicts. In On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops, Volume 4806, Pages 1042-51, 2007. details ppt
  32. Hedi Hamdi, ADEL Bouhoula, Mohamed Mosbah. A Software Architecture for Automatic Security Policy Enforcement in Distributed Systems. In SECUREWARE '07: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies, Pages 187-192, Washington, DC, USA, 2007. details ppt
  33. Brahim Hamid, Bertrand LeSaec, Mohamed Mosbah. A Simple Distributed Algorithm for the Maintenance of a Spanning Tree. In First International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2007), Algiers, Algeria, May 2007. details ppt
  34. Bilel Derbel, Mohamed Mosbah, Akka Zemmari. Fast distributed graph partition and application. In Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International, 2006. details ppt
  35. Shehla Abbas, Mohamed Mosbah, Akka Zemmari. Distributed Computation of a Spanning Tree in a Dynamic Graph by Mobile Agents. In IEEE International Conference on Engineering of Intelligent Systems, 2006, 2006. details ppt
  36. Mohamed Mosbah, Rodrigue Ossamy. Distributed Recognition of Graph Properties with Local Computations. In International Symposium and School on Advance Distributed Systems (ISSADS 2006), Guadalajara, Mexico, January 2006. details
  37. Jérémie Chalopin. Election and local computations on closed unlabelled edges (extended abstract. In Proc. of SOFSEM 2005, 2005. details
  38. Brahim Hamid, Mohamed Mosbah. A Formal Model for Fault-Tolerance in Distributed Systems. In Computer Safety, Reliability, and Security, Volume 3688, Pages 108-21, 2005. details ppt
  39. Brahim Hamid, Mohamed Mosbah. An Automatic Approach to Self-Stabilization. In SNPD-SAWN '05: Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks, Pages 123-128, Washington, DC, USA, 2005. details ppt
  40. Brahim Hamid, Mohamed Mosbah. An Implementation of a Failure Detector for Local Computations in Graphs. In International Conference on Parallel and Distributed Computing Networks, PDCN 2005, Pages 473-8, Innsbruck, Austria, 2005. details ppt
  41. 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. details ppt
  42. 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. details ppt
  43. Bilel Derbel, Mohamed Mosbah. Fully Distributed Linear Time Algorithm for Cluster Network Decomposition. In 16th International Conference on PARALLEL AND DISTRIBUTED COMPUTING AND SYSTEMS, PDCS 2004, Pages 548-53, Cambridge, MA, USA, 2004. details ppt
  44. Yves Métivier, Mohamed Mosbah, Rodrigue Ossamy, Affif Sellami. Synchronizers for Local Computations. In Graph Transformations, Volume 3256, Pages 271-86, 2004. details ppt
  45. 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. details ppt
  46. Mohamed Mosbah, Rodrigue Ossamy. A Programming Language for Local Computations in Graphs: Computational Completeness. In ENC '04: Proceedings of the Fifth Mexican International Conference in Computer Science, Pages 12-19, Washington, DC, USA, 2004. details ppt
  47. Mohamed Mosbah, Rodrigue Ossamy. Checking Global Properties for Local Computations in Graphs with Applications to Invariant Testing. In ENC '04: Proceedings of the Fifth Mexican International Conference in Computer Science, Pages 35-42, Washington, DC, USA, 2004. details ppt
  48. Mohamed Mosbah, Rodrigue Ossamy. A Programming Language for Local Computation Graphs. In MCSEAI'04, Eighth Maghrebian Conference on Software Engineering and Artificial Intelligence, Sousse, Tunisia, May 2004. details
  49. Mohamed Mosbah, Affif Sellami. Visidia: un environnement général pour étudier et implémenter les algorithmes distribués. In MCSEAI'04, Eighth Maghrebian Conference on Software Engineering and Artificial Intelligence, Sousse, Tunisia, May 2004. details
  50. Bilel Derbel, Mohamed Mosbah. Distributing the Execution of a Distributed Algorithm over a Network. In IV '03: Proceedings of the Seventh International Conference on Information Visualization, Washington, DC, USA, 2003. details ppt
  51. 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. details
  52. Emmanuel Godard, Yves Métivier. Deducible and Equivalent Structural Knowledges in Distributed Algorithms. In Theory of Computing Systems, Pages 631-54, 2003. details ppt
  53. Bilel Derbel, Mohamed Mosbah. Distribution de l'exécution d'un algorithme distribué sur un réseau. In Conférence Internationale Sciences Electroniques, Technologies de l'Information et des Técommunications (SETIT 2002), IEEE, Sousse, Tunisia, March 2003. details
  54. Mohamed Mosbah, Affif Sellami. Un modèle général pour l'étude, l'implémentation et la visualisation d'algorithmes distribués. In Conférence Internationale Sciences Electroniques, Technologies de l'Information et des Técommunications (SETIT 2002), IEEE, Sousse, Tunisia, March 2003. details
  55. 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. details ppt
  56. 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. details
  57. 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. details ppt
  58. 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. details ps
  59. 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. details ps
  60. Mohamed Mosbah, Affif Sellami. Implementation of an Enumeration Protocol Algorithm Using Local Graph Computations. In Second International Workshop on Graph Transformation and Visual Modeling Techniques, Crete, Greece, July 2001. details ps
  61. 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. details ps
  62. Michel Bauderon, Stefan Gruner, Mohamed Mosbah. A New Tool for the Simulation And Visualization of Distributed Algorithms. In MFI'01, Volume I, Pages 165-77, Toulouse, France, May 2001. details ps

Research Reports

  1. Emmanuel Godard, Yves Métivier, Gerard Tel. Termination Detection of Local Computations. December 2009. details pdf
  2. Pierre Castéran, Vincent Filou, Mohamed Mosbah. Formal Proofs of Local Computation Systems. March 2009. details pdf
  3. 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. details

Misc

  1. Michel Bauderon, Yves Métivier, Mohamed Mosbah, Affif Sellami. From Local Computations to Asynchronous Message Passing Systems. 2002. details ps
  2. Pierre Castéran, Vincent Filou. Loco: A Coq Library on Local Computation Systems. http://www.labri.fr/$\sim$casteran/Loco, 0. details

Thesis

  1. Afif Sellami. Des calculs locaux aux algorithmes distribués. PhD Thesis Université Bordeaux I, Talence, France, 2004. details pdf

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.