Article(s) de revue(s) internationale(s)

2016 Florent Capelli, Arnaud Durand, Stefan Mengel, The Arithmetic Complexity of Tensor Contraction in Theory of Computing Systems (TOCS),vol. 58, n° 4, Springer, pp. 506?527, mai 2016. [Download]

Article(s) de conférence(s) internationale(s)

2017 Hubie Chen, Stefan Mengel, The logic of counting query answers in 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’17),{IEEE} Computer Society, pp. 1-12, juin 2017. [Download]

2017 Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel, A Circuit-Based Approach to Efficient Enumeration in 44th International Colloquium on Automata, Languages, and Programming (ICALP’17),Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 111:1–111:15, juillet 2017. [Download]

2016 Hubie Chen, Stefan Mengel, Counting Answers to Existential Positive Queries: A Complexity Classification in 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS’16),ACM, pp. 315–326, juin 2016. [Download]

2016 Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky, Knowledge Compilation Meets Communication Complexity in 25th International Joint Conference on Artificial Intelligence (IJCAI’16),IJCAI/AAAI Press, pp. 1008–1014, juillet 2016. [Download]

2016 Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer, The Next Whisky Bar in 11th International Computer Science Symposium in Russia (CSR’16),Springer, pp. 41–56, juin 2016. [Download]

2016 Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer, As Close as It Gets in 10th International Workshop on Algorithms and Computation (WALCOM ‘16),Springer, pp. 222–235, mars 2016. [Download]

2016 Stefan Mengel, Parameterized Compilation Lower Bounds for Restricted CNF-Formulas in Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference (SAT’16),Springer, pp. 3–12, juillet 2016. [Download]