1. Lecture Notes in Computer Science;A. Atserias,2007
2. Atserias, A., Dalmau, V.: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3), 323–334 (2008)
3. Lecture Notes in Computer Science;A. Atserias,2004
4. Berkholz, C.: Lower bounds for existential pebble games and k-consistency tests. In: LICS 2012, pp. 25–34. IEEE Computer Society, Los Alamitos (2012)
5. Berkholz, C.: On the complexity of finding narrow proofs. In: FOCS 2012, pp. 351–360. IEEE Computer Society, Los Alamitos (2012)