| |
| * | 2009 | |
|---|---|---|
| 6 | EE | Niklas Sörensson, Armin Biere: Minimizing Learned Clauses. SAT 2009: 237-243 |
| 2007 | ||
| 5 | EE | Niklas Eén, Alan Mishchenko, Niklas Sörensson: Applying Logic Synthesis for Speeding Up SAT. SAT 2007: 272-286 |
| 2006 | ||
| 4 | EE | Niklas Eén, Niklas Sörensson: Translating Pseudo-Boolean Constraints into SAT. JSAT 2(1-4): 1-26 (2006) |
| 2003 | ||
| 3 | EE | Niklas Eén, Niklas Sörensson: An Extensible SAT-solver. SAT 2003: 502-518 |
| 2 | EE | Reiner Hähnle, Niklas Sörensson: Fair Constraint Merging Tableaux in Lazy Functional Programming Style. TABLEAUX 2003: 252-256 |
| 1 | EE | Niklas Eén, Niklas Sörensson: Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci. 89(4): (2003) |
| 1 | Armin Biere | [6] |
| 2 | Niklas Eén | [1] [3] [4] [5] |
| 3 | Reiner Hähnle | [2] |
| 4 | Alan Mishchenko | [5] |