1. J.A. Barnett, Computational methods for a mathematical theory of evidence, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), vol. 81, 1981, pp. 868–875.
2. Trimmed Moebius inversion and graphs of bounded degree;Björklund;Theory Comput. Syst.,2010
3. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, J. Nederlof, P. Parviainen, Fast zeta transforms for lattices with few irreducibles, ACM Trans. Algorithms 12(1) (2016) 4.
4. M. Chaveroche, F. Davoine, V. Cherfaoui, Calcul exact de faible complexité des décompositions conjonctive et disjonctive pour la fusion d’information, in: Proceedings of XXVIIth Francophone Symposium on signal and image processing (GRETSI), 2019a.
5. M. Chaveroche, F. Davoine, V. Cherfaoui, Efficient Möbius transformations and their applications to DS theory, in: International Conference on Scalable Uncertainty Management, Springer, 2019b, pp. 390–403.