1. Alekhnovich, Michael, Jan Johannsen, Toniann Pitassi, and Alasdair Urquhart, ‘An exponential separation between regular and general resolution’. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing: May 19-21 2002, Montréal, Québec, Canada, 2002, pp. 448–456.
2. Alekhnovich, Michael, Eli Ben-Sasson, Alexander A. Razborov, and Avi Wigderson, ‘Space Complexity in Propositional Calculus’. SIAM Journal of Computing 31(4):1184–1211, 2001. Preliminary version: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 358–367.
3. Atserias, Albert, and Victor Dalmau, ‘A combinatorial characterization of resolution width’. In 18th IEEE Conference on Computational Complexity (CCC). IEEE Computer Society Press, 2003, pp. 239–247.
4. Ben-Sasson, Eli. ‘Size Space Tradeoffs For Resolution’, Proceedings of the 34th ACM Symposium on the Theory of Computing, 2002, pp. 457–464.
5. Ben-Sasson, Eli, Russell Impagliazzo, and Avi Wigderson, ‘Near optimal separation of tree-like and general resolution’. Combinatorica 24:585–603, 2004. Preliminary version, ECCC TR00-005, 2000.