dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Florian Letombe Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTao Xie, Wolfgang Müller, Florian Letombe: HDL-Mutation Based Simulation Data Generation by Propagation Guided Search. DSD 2011: 608-615
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTao Xie, Wolfgang Müller, Florian Letombe: IP-XACT based system level mutation testing. HLDVT 2011: 65-71
2010
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTao Xie, Wolfgang Müller, Florian Letombe: Efficient Mutation-Analysis Coverage for Constrained Random Verification. DIPES/BICC 2010: 114-124
2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicola Bombieri, Franco Fummi, Graziano Pravadelli, Mark Hampton, Florian Letombe: Functional qualification of TLM verification. DATE 2009: 190-195
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGiuseppe Di Guglielmo, Franco Fummi, Graziano Pravadelli, Mark Hampton, Florian Letombe: On the Functional Qualification of a Platform Model. DFT 2009: 182-190
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaulo J. Matos, Jordi Planes, Florian Letombe, João Marques-Silva: A MAX-SAT Algorithm Portfolio. ECAI 2008: 911-912
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFlorian Letombe, João Marques-Silva: Improvements to Hybrid Incremental SAT Algorithms. SAT 2008: 168-181
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis: Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. JSAT 1(1): 61-88 (2006)
2005
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis: Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae. AAAI 2005: 288-293
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSylvie Coste-Marquis, Daniel Le Berre, Florian Letombe: A Branching Heuristics for Quantified Renamable Horn Formulas. SAT 2005: 393-399

Coauthor Index

1Daniel Le Berre [1] [2] [3]
2Nicola Bombieri [7]
3Sylvie Coste-Marquis [1] [2] [3]
4Franco Fummi [6] [7]
5Giuseppe Di Guglielmo [6]
6Mark Hampton [6] [7]
7Pierre Marquis [2] [3]
8Paulo J. Matos [5]
9Wolfgang Müller [8] [9] [10]
10Jordi Planes [5]
11Graziano Pravadelli [6] [7]
12João P. Marques Silva (João Marques-Silva) [4] [5]
13Tao Xie [8] [9] [10]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page