| |
| 2008 | ||
|---|---|---|
| 4 | EE | Dominik Scheder: Guided Search and a Faster Deterministic Algorithm for 3-SAT. LATIN 2008: 60-71 |
| 3 | EE | Dominik Scheder, Philipp Zumstein: How Many Conflicts Does It Need to Be Unsatisfiable?. SAT 2008: 246-256 |
| 2007 | ||
| 2 | EE | Dominik Scheder, Philipp Zumstein: Satisfiability with Exponential Families. SAT 2007: 148-158 |
| 1 | EE | Dominik Scheder: Unsatisfiable Linear k-CNFs Exist, for every k CoRR abs/0708.2336: (2007) |
| 1 | Philipp Zumstein | [2] [3] |