معرفی
Arnaud Durand is a Professor at Paris-Diderot University's Faculty of Mathematics since 2005. He currently serves as Director of the Mathematics Department (UFR de mathématiques) and has held several leadership roles including Pole Manager (2006-2010), Deputy Director (2010-2014), and Co-Director (2014-2017) of the GDR IM - Mathematical Computer Science research group. He previously headed the Master's program in Mathematical Logic and Foundations of Computer Science (2007-2013) and the Logic research team (2014-2017), and was instrumental in establishing the university's Mathematics and Computer Science double degree program (2009-2016).
Education includes:
- Ph.D. from University of Caen (1994-1996)
- Postdoctoral research at University of Pisa (1997-1998)
His research bridges mathematics and computer science, focusing on:
- Structural complexity: Counting and enumeration problems
- Descriptive complexity: Logical characterization of complexity classes
- Database theory: Query evaluation and tractability
- Finite model theory: Logical aspects of finite structures
- Graph/hypergraph theory: Algorithmic and structural properties
Recent publications demonstrate a strong emphasis on computational complexity, logical methods in computer science, and database theory, with frequent exploration of counting problems, team semantics, and conjunctive query evaluation. Research consistently intersects theoretical computer science, mathematical logic, and discrete mathematics.
Student Advising: Has supervised doctoral candidates including:
- David Duris (2006-2009)
- Yann Strozecki (2007-2010)
- Nicolas de Rugy-Altherre (2011-2015, co-supervised)
- Florent Capelli (2013-2016)
- Alexandre Vigny (current, co-supervised)
