Peter Bürgisser and Felipe Cucker and Martin Lotz (2010). Coverage Processes on Spheres and Condition Numbers for Linear Programming. The Annals of Probability, 570-604.

Peter Bürgisser and Felipe Cucker and Martin Lotz (2008). The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comp., 1559-1583.

Peter Bürgisser and Martin Lotz (2007). The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties. Foundations of Computational Mathematics, 51-86.

Peter Bürgisser and Felipe Cucker and Martin Lotz (2006). General formulas for the smoothed analysis of condition numbers. C. R. Acad. Sci. Paris, 145-150.

Peter Bürgisser and Felipe Cucker and Martin Lotz (2006). Smoothed analysis of complex conic condition numbers. Journal de Mathématiques Pures et Appliquées, 293-309.

Peter Bürgisser and Felipe Cucker and Martin Lotz (2005). Counting Complexity Classes for Numeric Computations III: Complex Projective Sets. Foundations of Computational Mathematics, 351-387.

Martin Lotz (2005). On Numerical Invariants in Algebraic Complexity Theory. Universität Paderborn

Peter Bürgisser and Felipe Cucker and Martin Lotz (2004). The Complexity to Compute the Euler Characteristic of Complex Varieties. C. R. Acad. Sci. Paris, 371-376.

Peter Bürgisser and Martin Lotz (2004). Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. Journal of the ACM, 464-482.

Martin Lotz and Johann Andreas Makowsky (2004). On the algebraic complexity of some families of coloured Tutte polynomials. Advances in Applied Mathematics, 327-349.

Peter Bürgisser and Martin Lotz (2002). Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. In Proceedings of 43rd FOCS, 658-668.