The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anja Remshagen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  8. The Complexity of Futile Questioning. [Citation Graph (, )][DBLP]


  9. An Alternative Representation for QBF. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002