Allyx Fontaine
Orcid: 0009-0006-8926-5153
According to our database1,
Allyx Fontaine
authored at least 20 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Desertification Control Strategies: A Hybrid Approach Using Cellular Automata and Reinforcement Learning.
Proceedings of the Cellular Automata, 2024
Proceedings of the Cellular Automata, 2024
2022
A novel approach for detecting error measurements in a network of automatic weather stations.
Int. J. Parallel Emergent Distributed Syst., 2022
Assessing the Impact of Anthropogenic Factors on Desertification Through the DESERTICAS Software.
J. Cell. Autom., 2022
2021
A novel Encoder-Decoder structure for Time Series analysis based on Bayesian Uncertainty reduction.
Proceedings of the IEEE Latin American Conference on Computational Intelligence, 2021
Proceedings of the IEEE Latin American Conference on Computational Intelligence, 2021
2020
Int. J. Parallel Emergent Distributed Syst., 2020
DESERTICAS, a Software to Simulate Desertification Based on MEDALUS and Cellular Automata.
Proceedings of the Cellular Automata, 2020
2019
Proceedings of the Internet Science - 6th International Conference, 2019
Proceedings of the Web Services - ICWS 2019, 2019
2016
RDA: A Coq Library to Reason about Randomised Distributed Algorithms in the Message Passing Model.
Sci. Ann. Comput. Sci., 2016
Proceedings of the String Processing and Information Retrieval, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2016, 2016
Proceedings of the 30th International Conference on Advanced Information Networking and Applications Workshops, 2016
2015
2014
Analyses et preuves formelles d'algorithmes distribués probabilistes. (Analyses and Formal Proofs of Randomised Distributed Algorithms).
PhD thesis, 2014
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms - (Extended Abstract).
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014
2013
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings.
Inf. Comput., 2013