- An extension to the enumeration of solution given by closure operation presented at WEPA. A long version should be avalaible in a few months.
- An article about enumeration complexity classes. In particular the relationship between incremental and polynomial delay problems is investigated. A proof of the separation of these classes modulo ETH is provided.
- The long version of our paper about lacunary polynomial factorization. Several new results, on multivariate and multilinear factors.
- Decomposition-width: extending clique-width to hypergraphs. Extension of chapter 6 of my PHD's thesis. Short version.
More is in the work, hopefully there will be a very extended version in a few months.

Arnaud Mary, Yann Strozecki, STACS 2016

[ Pdf | ArXiv | Abstract | BibTeX ]

Dominique Barth, Olivier David, Franck Quessette, Vincent Reinhard, Yann Strozecki, Sandrine Vial, SEA 2015

[ Site web (code et benchmark) | ArXiv | Abstract | BibTeX | Source ]

David Auger, Pierre Coucheney, Yann Strozecki, TAMC 2014

[ Pdf | ArXiv | Abstract | BibTeX ]

Chattopadhyay, Arkadev and Grenet, Bruno and Koiran, Pascal and Portier, Natacha and Strozecki, Yann. ISSAC 2013.

[ Pdf | ArXiv | Abstract | BibTeX ]

Yann Strozecki. Theory of Computing Systems, 2013.

An extended version of the MFCS paper on enumeration and interpolation.

[ Pdf | Abstract | BibTeX ]

Sylvain Peyronnet, Michel de Rougemont and Yann Strozecki. ICTAC, 2012.

Some additions and corrections to mistakes in the article can be found in the presentation.

[ Pdf | Abstract | BibTeX ]

Joseph Salmon and Yann Strozecki. Signal Processing, 2012.

An improved and extended version of the ICIP paper.

[ Pdf | Abstract | BibTeX | Demo Matlab | Code C ]

Bruno Grenet, Pascal Koiran, Natacha Portier and Yann Strozecki. FSTTCS, 2011.

See the arXiv version for some additional proofs.

[ Pdf | ArXiv | Abstract | BibTeX ]

Arnaud Durand and Yann Strozecki. CSL, 2011.

[ Pdf | Abstract | BibTeX ]

Yann Strozecki. Discrete Applied Mathematics, 2011.

[ Pdf | Abstract | BibTeX ]

David Duris and Yann Strozecki. WALCOM, 2011.

[ Pdf | Abstract | BibTeX ]

"From Patches to Pixels in Non-Local methods: Weighted-Average Reprojection"

Joseph Salmon and Yann Strozecki. ICIP, 2010.

[ Pdf | Abstract | BibTeX | Demo Matlab | Code C ]

Yann Strozecki. MFCS, 2010.

[ Pdf | Abstract | BibTeX ]

Yann Strozecki. Phd Thesis, 2010.

[ Pdf | Abstract | BibTeX ]

Yann Strozecki. Master Thesis, 2007.

[ Pdf | BibTeX ]

- A prensentation at WEPA (Clemont-Ferrand) about mixing saturation and maximal solutions.
- A presentation on enumeration and saturation problems solved faster given at Versailles and Marne la Vallée.

The short version given at STACS 2016. - A presentation on enumeration of molecular graphs given in Lyon to the Bamboo team.
- A presentation on enumeration and an application to cheminformatic presented at the seminar of the LIMOS. Another presentation on the cheminformatic part only : an enumeration algorithm which generates planar maps.
- A short presentation about simple stochastic games and how to solve them when they are almost acyclic. Presentation made for the CMF days in Caen.
- Basics about simple stochastic games, given at the seminar of the Kurt Gödel Institute in Vienna.
- Presentation given at ICTAC 2012, on representing automata by statistical polytopes to separate them.
- Presentation about lower bounds for arithmetic circuits using an improved Descarte's rule, given at the CLI (Paris 7) seminar.
- Presentation about a hypergraph decomposition and its associated parameter, the decomposition-width, given at the seminar of the Graphes et logique team, LABRI (Bordeaux).
- Presentation about three methods (algebraic, logic and geometric) to solve enumeration problems, given in several seminars.
- Presentation done at CSL 2011, on the complexity of enumeration problems defined by first order formulas.
- Presentation on two different approaches to understand enumeration complexity, given at the seminar of the Graphes et logique team, LABRI (Bordeaux).
- Presentation on monomial enumeration given at the seminar of the Theory Team (University of Toronto).
- A more understandable presentation on matroid decomposition for the Paris 7 logic seminar.
- Presentation on matroid decomposition given at the Workshop in Logic, Combinatorics and Computation, Brno 2010.
- Exposé général sur la complexité fait pour le séminaire des thésards de logique.
- Présentation de mon travail sur les matroïdes décomposables faite au séminaire "Complexité, Logique et Informatique" à Paris 7, au séminaire du groupe Graphes et logique du LABRI (Bordeaux) et au séminaire de l'équipe AlGco du LIRMM (Montpellier)
- Présentation de mon travail sur l'énumération des monômes d'un polynôme au séminaire du LAIC (Clermont-Ferrand).
- Présentation faite pour ma soutenance de M2, améliorée pour la présenter au groupe de travail MC2 à l'ENS Lyon.
- Présentation faite sur les algorithmes holographiques au séminaire du LAIC (Clermont-Ferrand). Elle est un peu plus simple et générale que la précédente.

- Sur la demande insistante du prix Kleene de l'année 2008, un petit programme en CAML d'énumération des circuits d'un matroïde binaire.
- Une présentation sur le comptage des couplages dans un graphe planaire pour le cours de théorie de la complexité et applications du LMFI.
- Une présentation sur le théorème de Toda pour le cours de Vérification probabiliste et approximation du LMFI.
- Mémoire de M1 sous la direction de Peter Bürgisser sur la complexité algébrique.

Fait en 2005 au le laboratoire d'Algebraic Complexity de l'université de Paderborn.

Soutenance du stage.

- Quelques notes prises sur le produit matriciel rapide par des méthodes algébriques (groupes finis et représentation) au cours du stage à Paderborn.