List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| RDA: a Coq library to reason about randomised distributed algorithms in the message passing model Scientific Annals of Computer Science | 2019-02-08 | Paper |
| Dynamic and approximate pattern matching in 2D | 2018-10-17 | Paper |
| The \(k\)-mismatch problem revisited Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Certified impossibility results and analyses in Coq of some randomised distributed algorithms Theoretical Aspects of Computing – ICTAC 2016 | 2016-12-21 | Paper |
| Dictionary matching in a stream Algorithms - ESA 2015 | 2015-11-19 | Paper |
| On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
| Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings Information and Computation | 2014-01-10 | Paper |
Research outcomes over time
This page was built for person: A. Fontaine
