1. Bordewich, M., Dyer, M., Karpinski, M.: Path coupling using stopping times and counting independent sets and colourings in hypergraphs (2005), http://arxiv.org/abs/math.PR/0501081
2. Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurrence optimization. Electronic Colloquium on Computational Complexity 10 (2003), Technical Report TR03-008
3. Bubley, R.: Randomized algorithms: approximation, generation and counting. Springer, London (2001)
4. Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 248–257. SIAM, Philadelphia (1997)
5. Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 595–601. ACM, New York (2003)