Bürgisser, P. - The computational complexity to evaluate representations of general linear groups. SIAM J. Comp. 30(3) pp. 1010-1022, 2000.

Bürgisser, P. - The computational complexity of immanants. SIAM J. Comp. 30(3) pp. 1023-1040, 2000.

Bürgisser, P. - Cook's versus Valiant's Hypothesis. Theor. Comp. Sci. 235 pp. 71-88, 2000.

Bürgisser, P. - On the structure of Valiant's complexity classes. Discr. Math. Theoret. Comp. Sci. 3 pp. 73-94, 1999.

Bürgisser, P., Kurth, A., Wagner, A. and Wolf, M. - Credit risk: Integrating correlations. Risk Magazine 12(7) pp. 57-60, 1999.

Bürgisser, P. - On the parallel complexity of the polynomial ideal membership problem. J. Compl. 14 pp. 176-189, 1998.

Bürgisser, P. - The computational complexity to evaluate representations of general linear groups. In Proc. 10th International Conference on Formal Power Series and Algebraic Combinatorics pp. 115-126, Toronto, 1998.

Bürgisser, P. - On the structure of Valiant's complexity classes. In Proc. 15th Symposium on Theoretical Aspects of Computer Science Lecture Notes in Computer Science (1373) pp. 194-204, . Springer Verlag, 1998.

Bürgisser, P. - Completeness and Reduction in Algebraic Complexity Theory. Habilitation, Universität Zürich 1998.

Bürgisser, P. and Clausen, M. H. - Algebraische Komplexitaetstheorie I - Eine Einfuehrung. Seminaire Lotharingien de Combinatoire (B36a) pp. 1-18, 1996.

Bürgisser, P. - Algebraische Komplexitaetstheorie II - Schnelle Matrixmultiplikation und Kombinatorik. Seminaire Lotharingien de Combinatoire (B36b) pp. 1-16, 1996.

Bürgisser, P. - A note on the degeneration order of bilinear maps, Preprint 1996. (University of Zurich)

Bürgisser, P., Karpinski, M. and Lickteig, T. - On randomized semialgebraic decision complexity. J. Compl. 9(2) pp. 231-251, 1993.

Bürgisser, P. and Lickteig, T. - Verification complexity of linear prime ideals. J. Pure Appl. Alg. 81 pp. 247-267, 1992.

Bürgisser, P., Lickteig, T. and Shub, M. - Test complexity of generic polynomials. J. Compl. 8(3) pp. 203-215, 1992.