List of publications

  • A Graph Theory Approach for Regional Controllability of Boolean Cellular Automata
    Sara Dridi, Samira El Yacoubi, Franco Bagnoli, Allyx Fontaine
    International Journal of Parallel, Emergent and Distributed Systems (2019)
  • Monitoring an Environment Using Wireless Sensor Network
    Rayanne Silveira, Thalyson Dutra, Francisco Alves, Allyx Fontaine, Thierry Desjardins, Raimundo Freire, Allan Barros, Ewaldo Santana
    INSCI 2019 – Internet Science - 6th International Conference, France (2019)
  • A Web-Service to Monitor a Wireless Sensor Network
    Rayanne Silveira, Francisco Alves, Allyx Fontaine, Ewaldo Santana
    ICWS 2019 – Web Services - 26th International Conference, Held as Part of the Services Conference Federation (SCF), USA (2019)
  • RDA: A Coq Library to Reason about Randomised Distributed Algorithms in the Message Passing Model
    Allyx Fontaine, Akka Zemmari
    SACS 2016 – Sci. Ann. Comp. Sci. (2016)
  • Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms
    Allyx Fontaine, Akka Zemmari
    ICTAC 2016 – Theoretical Aspects of Computing - 13th International Colloquium, Taiwan (2016)
  • Dynamic and Approximate Pattern Matching in 2D
    Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
    SPIRE 2016 – String Processing and Information Retrieval - 23rd International Symposium, Japan (2016)
  • A Fault-Tolerant Handshake Algorithm for Local Computations
    Allyx Fontaine, Mohamed Mosbah, Mohamed Tounsi, Akka Zemmari
    WAINA 2016 – IEEE 30th International Conference on Advanced Information Networking and Applications, Workshop, Suisse (2016)
  • The k-mismatch problem revisited
    Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
    SODA – 27th Annual Symposium on Discrete Algorithms, USA (2016)
  • Dictionary Matching in a Stream
    Raphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya
    ESA – 23rd Annual European Symposium on Algorithms, Greece (2015)
  • Analyses et Preuves Formelles d’Algorithmes Distribués Probabilistes
    Thèse soutenue le 16 juin 2014 à l’Université de Bordeaux devant le jury composé de :
    Pierre Castéran (Co-directeur), Jérémie Chalopin (Examinateur), Dominique Méry (Rapporteur),
    Mohamed Mosbah (Président), Vlady Ravelomanana (Rapporteur), Akka Zemmari (Directeur)
  • Randomised Distributed Algorithms Library
    Allyx Fontaine, Akka Zemmari
    Coq library to reason about randomised distributed algorithms
  • On Lower Bounds for the Time and the Bit Complexity of some Probabilistic Distributed Graph Algorithms
    Allyx Fontaine, Yves Métivier, Mike Robson, Akka Zemmari
    SOFSEM – 40th International Conference on Current Trends in Theory and Practice of Computer Science,
    Slovakia (2014)
  • Optimal Bit Complexity Randomised Distributed MIS and Maximal Matching Algorithms for Anonymous Rings
    Allyx Fontaine, Yves Métivier, Mike Robson, Akka Zemmari
    Information and Computation (2013)
  • Une Analyse Formelle en Coq d’un Algorithme Distribué Probabiliste résolvant le Problème du Rendez-Vous
    Allyx Fontaine, Akka Zemmari
    JFLA – Journées francophones des langages applicatifs, France (2013)