Personal:
- Name: Stefan Mengel
- Nationality: German
- Birth: October 1st, 1980
Work address:
École Polytechnique,
Laboratoire d'Informatique de l'École Polytechnique (LIX)
Bâtiment Turing, bureau 2025
1 rue Honoré d'Estienne d'Orves, Campus de l'École Polytechnique, 91120 Palaiseau, France.
"Bâtiment 24" in this plan
Mail address:
LIX - UMR 7161
École polytechnique
91 128 Palaiseau Cedex
France
Education:
- since 2013: Postdoc, Lix-Qualcomm Postdoctoral Fellow, Laboratoire d'Informatique de l'École Polytechnique (LIX), Algorithms and Complexity Team
- 2013: Researcher in the group of Prof. Peter Bürgisser the Technische Universität Berlin
- 2009-2013: PhD student, University of Paderborn, Institute of Mathematics, working group Algebraic Complexity and Algorithmic Algebra, supervisor: Prof. Peter Bürgisser
Thesis: Conjunctive Queries, Arithmetic Circuits and Counting Complexity
- 2001 ‐ 2007: Diploma in Mathematics, Ilmenau University of Technology, Focus on discrete mathematics and theoretical computer science,
Diploma thesis in complexity theory: "Ein kombinatorischer Beweis für das PCP-Theorem" [in German], supervisor: Prof. Martin Dietzfelbinger
Research Stays
- 2012: Université Paris Diderot Paris 7, Équipe de Logique Mathématique, 5 months, Fellow of the Marie Curie Initial Training Network in Mathematical Logic, PITN-GA-2009-238381
- 2011: Université Paris Diderot Paris 7, Équipe de Logique Mathématique, 5 weeks, invited by Arnaud Durand and Guillaume Malod
Talks
- January 2015: Séminaire of the Centre de Recherche en Informatique de Lens (CRIL), Université d’Artois, Lens, France, Expander CNFs have Exponential DNNF Size
- October 2014: Institute of Information Systems, Vienna University of Technology, Vienna, Austria, Tractable Propositional Model Counting by Structural Restrictions
- June 2014: colloquium of the Research Training Group Methods for Discrete Structures, Berlin, Germany, Tractable Propositional Model Counting by Structural Restrictions
- February 2014: Facultad de Informática, Universidad del País Vasco, Donostia-San Sebastián, Spain, Hypergraph Acyclicity and Propositional Model Counting
- November 2013: séminaire algorithmique du plateau de Saclay, Supélec, Gif-sur-Yvette, France, Structural Tractability of Counting Solutions to Conjunctive Queries
- November 2013: Seminar of the Laboratoire Spécification et Vérification, ENS Cachan, Cachan, France, Structural Tractability of Counting Solutions to Conjunctive Queries
- August 2013: 38th International Symposium on Mathematical Foundations of Computer Science, Klosterneuburg, Austria, Arithmetic Branching Programs with Memory
- March 2013: Seminar Complexité, Logique, Informatique, Equipe de Logique Mathématique, Paris, France, Arithmetic Branching Programs with Memory
- January 2013: Dagstuhl Seminar 13031 Computational Counting, Schloss Dagstuhl, Germany, Structural Tractability of Counting Solutions to Conjunctive Queries
- December 2012: Seminar of the group Modèles de Calcul et de Complexité (MC2), Laboratoire d'Informatique du Parallélisme (LIP), ENS Lyon, Lyon, France, Arithmetic Branching Programs with Memory
- October 2012: Seminar Complexité, Logique, Informatique, Equipe de Logique Mathématique, Paris, France, Structural Tractability of Counting of Solutions to Conjunctive Queries
- March 2012: Symposium on Theoretical Aspects of Computer Science (STACS 2012), Paris, France, Monomials in arithmetic circuits: Complete problems in the counting hierarchy
- February 2012: International Workshop on Approximation, Parameterized and EXact algorithms (APEX), Paris, France, The Complexity of Weighted Counting for Acyclic Conjunctive Queries
- July 2011: International Colloquium on Automata, Languages and Programming (ICALP 2011), Zürich, Switzerland, Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
- June 2011: Complexity and finite models (CMF 2011), Paris, France, Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
- December 2010: Dagstuhl Seminar 10481 Computational Counting, Schloss Dagstuhl, Germany, Characterizing VP by Constraint Satisfaction Problems
Teaching Experience
- 2012: Combinatorics, tutorials for the lecture of Prof. Bürgisser, University of Paderborn
- 2011: Introduction to Computer Algebra, tutorials for the lecture of Prof. Bürgisser, University of Paderborn
- 2011: Linear Algebra for Computer Scientists, help in organization of the tutorial, creation of exercises and solutions, stand-in lecturer for the lecture of Prof. Bürgisser, University of Paderborn
- 2004 - 2006: Analysis III-IV, Functional Analysis, tutorials for the lectures of Prof. Marx, Ilmenau University of Technology
Languages
- English: fluent
- French: basic knowledge (approximately B1 CEFR)