In Proceedings

Bürgisser, P. - Optimization, Complexity and Invariant Theory [4]. 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) Leibniz International Proceedings in Informatics (LIPIcs) 187 pp. 1:1–1:20, . Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021.

Bürgisser, P., Franks, C., Garg, A., Oliveira, R., Walter, M. and Wigderson, A. - Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes [5]. 60th Annual IEEE Symposium on Foundations of Computer Science–FOCS 2019 pp. 845–861, 2019.

Bürgisser, P., Franks, C., Garg, A., Oliveira, R., Walter, M. and Wigderson, A. - Efficient algorithms for tensor scaling, quantum marginals and moment polytopes [6]. Proceedings 59th Annual IEEE Symposium on Foundations of Computer Science pp. 883-897, 04/ 2018.

Bürgisser, P., Garg, A., Oliveira, R., Walter, M. and Wigderson, A. - Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory [7]. 9th Innovations in Theoretical Computer Science Leibniz International Proceedings in Informatics (LIPIcs) 94 pp. 24:1–24:20, 11/ 2017.

Bürgisser, P., Ikenmeyer, C. and Panova, G. - No occurrence obstructions in geometric complexity theory [8]. Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science pp. 386–395, 04/ 2016.

Bürgisser, P., Kohn, K., Lairez, P. and Sturmfels, B. - Computing the Chow variety of quadratic space curves [9]. Mathematical Aspects of Computer and Information Sciences (eds. I. Kotsireas, S. Rump and C. Yap) - MACIS 2015, Berlin, Germany, November 11-13, Revised Selected Papers pp. 130-136, 4/ 2016.

Mengel, S. - Arithmetic Branching Programs with Memory [10]. Mathematical foundations of computer science 2013 8087 pp. 667-678, . Springer, Heidelberg, 2013.

Capelli, F., Durand, A. and Mengel, S. - The arithmetic complexity of tensor contractions [11]. Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2013 , 2013.

Durand, A. and Mengel, S. - Structural Tractability of Counting of Solutions to Conjunctive Queries [12]. Proceeding of the 16th International Conference on Database Theory (ICDT 2013) , 2013.

Bürgisser, P. and Ikenmeyer, C. - Explicit Lower Bounds via Geometric Complexity Theory [13]. Proceedings 45th ACM Symposium on Theory of Computing pp. 141-150, 2013.

Fournier, H., Malod, G. and Mengel, S. - Monomials in arithmetic circuits: Complete problems in the counting hierarchy [14]. Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2012 , 2012.

Mengel, S. - Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems [15]. In Proceedings of ICALP 2011 Lecture Notes in Computer Science 6755 pp. 700-711, . Springer, 2011.

Bürgisser, P. and Ikenmeyer, C. - Geometric Complexity Theory and Tensor Rank [16]. Proceedings 43rd Annual ACM Symposium on Theory of Computing 2011 pp. 509-518, 2011.

Bürgisser, P. - Smoothed analysis of condition numbers [17]. Proceedings of the International Congress of Mathematicians IV pp. 2609-2633, . Hindustan Book Agency, New Delhi, 2010.

Bürgisser, P. and Cucker, F. - Solving Polynomial Equations in Smoothed Polynomial Time and a Near Solution to Smale's 17th Problem [18]. In Proceedings STOC 2010 pp. 503-512, 2010.