Journals
Approximate consistency for transformations on words and trees, avec Michel de Rougemont, Theoretical Computer Science, 2016 [éditeur, bibtex]
The directed Switching Game on Lawrence Oriented Matroids, with David Forge, European Journal of Combinatorics, 2009. [article, editor, bibtex]
Approximate Schemas, Source-Consistency and Query Answering, with Michel de Rougemont. Journal of Intelligent Information Systems, 2008. [article, editor, bibtex]
Conferences
Improving time travel experience by combining annotations, Web Audio Conferebce 2016, [article, poster, editor, bibtex]
Approximate Structural Consistency with Michel de Rougemont, SOFSEM 2010, p. 685-696. [article, slides, editor, bibtex]
Équivalence Approchée de Transducteurs,CMF (Complexité et Modèles Finis), 2007.[slides]
Approximate Data Exchange, with Michel de Rougemont, International Conference on Database Theory, 2007. [article, slides, editor, bibtex]
Approximate schemas and Query Answering, with Michel de Rougemont, Information Search, Integration and Personalization, 2005.
Some Properties of Directed Switching Games on Oriented Matroids, with David Forge, Combinatorial Geometries and Applications : Oriented Matroids and Matroids, 2005. [slides]
Research Projets
DoCoVi : Document Composition through Visual Interaction : response to ANR CONTINT 2011.
CIPE : Composition, Indexation, et Personnalization of Ebooks : response to Digiteo-Ile-de-France 2010.
VERAP : Approximate VeRification of Probabilistic systems : ACI « sécurité et informatique » 2006-2008
VISIR : VISual InteRaction : Digiteo Projet 2008 [poster]
Workshops
From Approximate membership To Data Integration, MOVE 2010. [présentation]
Approximate Tree Transducers, On Verification of Web Services (VerAp) 2008.
Reports
Semantic games and Model Checking, Theoretical Computer Science School, 2006.
Algorithmic Complexity, Theoretical Computer Science School, 2005.
Complexity and Game Theory, Research internship in L.R.I in the team “Algorithm and Complexity”, supervised by Michel de Rougemont, 2004. [Manuscrit]
Matroïdes Algorithms : Research internship in L.R.I in the team Graphcom, supervised par David Forge, 2003.
Chromatic Polynomials, Research internship in team Graphcom of L.R.I, supervised by Pascal Berthomé, 2002.
Enumeration of paterns and repetition : internship mathematics magisterium, 2002.