| |
| 2007 | ||
|---|---|---|
| 8 | Anja Remshagen, Klaus Truemper: The Complexity of Futile Questioning. FCS 2007: 132-138 | |
| 2006 | ||
| 7 | EE | Ben Browning, Anja Remshagen: A SAT-based solver for Q-ALL SAT. ACM Southeast Regional Conference 2006: 30-33 |
| 2005 | ||
| 6 | EE | N. Hristov, Anja Remshagen: Local search for quantified Boolean formulas. ACM Southeast Regional Conference (1) 2005: 116-120 |
| 5 | EE | Anja Remshagen, Klaus Truemper: An Effective Algorithm for the Futile Questioning Problem. J. Autom. Reasoning 34(1): 31-47 (2005) |
| 2004 | ||
| 4 | Charles Otwell, Anja Remshagen, Klaus Truemper: An Effective QBF Solver for Planning Problems. MSV/AMCS 2004: 311-316 | |
| 2003 | ||
| 3 | EE | Volker Kaibel, Anja Remshagen: On the Graph-Density of Random 0/1-Polytopes. RANDOM-APPROX 2003: 318-328 |
| 2 | EE | Anja Remshagen, Klaus Truemper: Learning in a Compiler for MINSAT Algorithms CoRR cs.LO/0312032: (2003) |
| 1 | Anja Remshagen, Klaus Truemper: Learning in a Compiler for MINSAT Algorithms. TPLP 3(3): 271-286 (2003) | |
| 1 | Ben Browning | [7] |
| 2 | N. Hristov | [6] |
| 3 | Volker Kaibel | [3] |
| 4 | Charles Otwell | [4] |
| 5 | Klaus Truemper | [1] [2] [4] [5] [8] |