Ehemalige Mitarbeiter

Arnaud Durand and Stefan Mengel (2014). The Complexity of Weighted Counting for Acyclic Conjunctive Queries [3]. Journal of Computer and System Sciences, 277-296.

Stefan Mengel (2013). Arithmetic Branching Programs with Memory [4]. Mathematical foundations of computer science 2013. Springer, Heidelberg, 667-678.

Florent Capelli and Arnaud Durand and Stefan Mengel (2013). The arithmetic complexity of tensor contractions [5]. Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2013

Arnaud Durand and Stefan Mengel (2013). Structural Tractability of Counting of Solutions to Conjunctive Queries [6]. Proceeding of the 16th International Conference on Database Theory (ICDT 2013)

Stefan Mengel (2013). Conjunctive Queries, Arithmetic Circuits and Counting Complexity [7]. Universität Paderborn

Hervé Fournier and Guillaume Malod and Stefan Mengel (2012). Monomials in arithmetic circuits: Complete problems in the counting hierarchy [8]. Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2012

Stefan Mengel (2011). Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems [9]. In Proceedings of ICALP 2011. Springer, 700-711.