| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 8 |       | Armin Biere, Florian Lonsing, Martina Seidl: Blocked Clause Elimination for QBF. CADE 2011: 101-115 |
| 7 | | Florian Lonsing, Armin Biere: Failed Literal Detection for QBF. SAT 2011: 259-272 |
| 6 | | Florian Lonsing, Armin Biere: Integrating Dependency Schemes in Search-Based QBF Solvers. SAT 2010: 158-171 |
| 5 | | Robert Brummayer, Florian Lonsing, Armin Biere: Automated Testing and Debugging of SAT and QBF Solvers. SAT 2010: 44-57 |
| 4 | | Florian Lonsing, Armin Biere: DepQBF: A Dependency-Aware QBF Solver. JSAT 7(2-3): 71-76 (2010) |
| 3 | | Florian Lonsing, Armin Biere: A Compact Representation for Syntactic Dependencies in QBFs. SAT 2009: 398-411 |
| 2 | | Florian Lonsing, Armin Biere: Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. Electr. Notes Theor. Comput. Sci. 251: 83-95 (2009) |
| 1 | | Florian Lonsing, Armin Biere: Nenofex: Expanding NNF for QBF Solving. SAT 2008: 196-210 |
Selection of 8 from 8 records - Florian Lonsing has 3 coauthors
Last update 2012-02-17 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page