M. Baaz, U. Egly, and A. Leitsch, Normal Form Transformations, Handbook of Automated Reasoning, pp.275-333, 2001.
DOI : 10.1016/B978-044450813-3/50007-2

M. Baaz, S. Hetzl, A. Leitsch, C. Richter, and H. Spohr, Cut-Elimination: Experiments with CERES, Logic for Programming, pp.481-495, 2004.
DOI : 10.1007/978-3-540-32275-7_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.8096

M. Baaz and A. Leitsch, Cut-elimination and Redundancy-elimination by Resolution, Journal of Symbolic Computation, vol.29, issue.2, pp.149-176, 2000.
DOI : 10.1006/jsco.1999.0359
URL : http://doi.org/10.1006/jsco.1999.0359

M. Baaz and A. Leitsch, Comparing the Complexity of Cut-Elimination Methods, Proof Theory in Computer Science, pp.49-67, 2001.
DOI : 10.1007/3-540-45504-3_4

M. Baaz and A. Leitsch, Methods of Cut-Elimination. To Appear, 2009.

M. Baaz and R. Zach, Algorithmic structuring of cut-free proofs, CSL '92: Selected Papers from the Workshop on Computer Science Logic, pp.29-42, 1993.
DOI : 10.1007/3-540-56992-8_4

S. Cook and R. Reckhow, On the lengths of proofs in the propositional calculus (preliminary version), STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computing, pp.135-148, 1974.

U. Egly and K. Genther, Structuring of computer-generated proofs by cut introduction, KGC '97: Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, pp.140-152, 1997.
DOI : 10.1007/3-540-63385-5_39

M. Finger and D. M. Gabbay, Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs, Logic Journal of IGPL, vol.15, issue.5-6, pp.5-6553, 2007.
DOI : 10.1093/jigpal/jzm040

S. Hetzl, Proof Fragments, Cut-Elimination and Cut-Introduction

S. Hetzl, Proof Profiles. Characteristic Clause Sets and Proof Transformations, 2008.

S. Hetzl, A. Leitsch, D. Weller, and B. W. Paleo, Herbrand Sequent Extraction, Proceedings of the Conferences on Intelligent Computer Mathematics, number 5144 in LNAI, 2008.
DOI : 10.1007/978-3-540-85110-3_38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.9347

D. Miller and V. Nigam, Incorporating Tables into Proofs, CSL 2007: Computer Science Logic, pp.466-480, 2007.
DOI : 10.1007/978-3-540-74915-8_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.3026

V. Nigam, Using tables to construct non-redundant proofs, CiE 2008: Abstracts and extended abstracts of unpublished papers, 2008.

V. P. Orevkov, Lower bounds for increasing complexity of derivations after cut-elimination (translation ), Journal Sov. Math, pp.2337-2350, 1979.

R. Statman, Lower bounds on Herbrand's theorem, Proceedings of the American Mathematical Society, pp.104-107, 1979.

A. Urquhart, Abstract, Bulletin of Symbolic Logic, vol.35, issue.04, pp.425-467, 1995.
DOI : 10.1145/136035.136043

P. Bruno-woltzenlogel, A General Analysis of Cut-Elimination by CERes, 2009.

P. Bruno-woltzenlogel, Physics and proof theory. submitted, 2010.