Bürgisser, P. and Cucker, F. - Counting Complexity Classes for Numeric Computations I: Semilinear Sets. SIAM J. Comp. 33(1) pp. 227-260, 2003.

Bürgisser, P. and Cucker, F. - Counting Complexity Classes over the Reals I: The Additive Case. In Proceedings of ISAAC 2003 Lecture Notes in Computer Science (2906) pp. 625-634, . Springer, 2003.

Bürgisser, P. and Lotz, M. - Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. In Proceedings of 43rd FOCS pp. 658-668, Vancouver, November 16-19/ 2002.

Bürgisser, P. - The Complexity of Factors of Multivariate Polynomials. Proceedings 42nd FOCS pp. 378-385, Las Vegas, October 14-17/ 2001.

Bürgisser, P., Kurth, A. and Wagner, A. - Incorporating Severity Variations into Credit Risk. Journal of Risk 3(4) pp. 5-31, 2001.

Bürgisser, P. - On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity. Proc. 26th Symposium on Mathematical Foundations of Computer Science Lecture Notes in Computer Science (2136) pp. 3-17, . Springer Verlag, Marianske Lazne, 2001.

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.