1. Berend, D., Tassa, T.: Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics 30(2), 185–205 (2010)
2. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM Journal on Computing 39(2), 546–563 (2009)
3. Bodirsky, M.: Complexity classification in infinite-domain constraint satisfaction. Mémoire d’habilitation à diriger des recherches, Université Diderot - Paris 7.
arXiv:1201.0856
(2012)
4. Bodirsky, M., Hils, M.: Tractable set constraints. Journal of Artificial Intelligence Research 45, 731–759 (2012)
5. Bodirsky, M., Kára, J.: The complexity of equality constraint languages. Theory of Computing Systems 43(2), 136–158 (2008)