Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. - Sylvie Coste-Marquis; Daniel Le Berre; Florian Letombe; Pierre Marquis (AAAI, 2005)

A Branching Heuristics for Quantified Renamable Horn Formulas. - Sylvie Coste-Marquis; Daniel Le Berre; Florian Letombe (SAT, 2005)

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. - Sylvie Coste-Marquis; Daniel Le Berre; Florian Letombe; Pierre Marquis (J. Satisf. Boolean Model. Comput., 2006)

A MAX-SAT Algorithm Portfolio. - Paulo J. Matos; Jordi Planes; Florian Letombe; João Marques-Silva 001 (ECAI, 2008)

Improvements to Hybrid Incremental SAT Algorithms. - Florian Letombe; João Marques-Silva 001 (SAT, 2008)

Functional qualification of TLM verification. - Nicola Bombieri; Franco Fummi; Graziano Pravadelli; Mark Hampton; Florian Letombe (DATE, 2009)

On the Functional Qualification of a Platform Model. - Giuseppe Di Guglielmo; Franco Fummi; Graziano Pravadelli; Mark Hampton; Florian Letombe (DFT, 2009)

Efficient Mutation-Analysis Coverage for Constrained Random Verification. - Tao Xie 006; Wolfgang Müller 003; Florian Letombe (DIPES/BICC, 2010)

HDL-Mutation Based Simulation Data Generation by Propagation Guided Search. - Tao Xie 006; Wolfgang Müller 003; Florian Letombe (DSD, 2011)

IP-XACT based system level mutation testing. - Tao Xie 006; Wolfgang Müller 003; Florian Letombe (HLDVT, 2011)

Mutation-analysis driven functional verification of a soft microprocessor. - Tao Xie 006; Wolfgang Müller 003; Florian Letombe (SoCC, 2012)

Hybrid Incremental Algorithms for Boolean Satisfiability. - Florian Letombe; João Marques-Silva 001 (Int. J. Artif. Intell. Tools, 2012)