Anja Remshagen

According to our database1, Anja Remshagen authored at least 13 papers between 2003 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Consistency checking in access control.
Proceedings of the Fourth ACM Conference on Data and Application Security and Privacy, 2014

Contextualized learning tools: animations and robots.
Proceedings of the 2014 ACM Southeast Regional Conference, Kennesaw, GA, USA, March 28, 2014

2013
Consistency checking in privacy-aware access control.
Proceedings of the ACM Southeast Regional Conference 2013, 2013

2010
An upper bound for the circuit complexity of existentially quantified Boolean formulas.
Theor. Comput. Sci., 2010

Making discrete mathematics relevant.
Proceedings of the 48th Annual Southeast Regional Conference, 2010

2009
An Alternative Representation for QBF.
Proceedings of the 2009 International Conference on Artificial Intelligence, 2009

2007
The Complexity of Futile Questioning.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2006
A SAT-based solver for Q-ALL SAT.
Proceedings of the 44st Annual Southeast Regional Conference, 2006

2005
An Effective Algorithm for the Futile Questioning Problem.
J. Autom. Reason., 2005

Local search for quantified Boolean formulas.
Proceedings of the 43nd Annual Southeast Regional Conference, 2005

2004
An Effective QBF Solver for Planning Problems.
Proceedings of the International Conference on Modeling, 2004

2003
Learning in a Compiler for MINSAT Algorithms.
Theory Pract. Log. Program., 2003

On the Graph-Density of Random 0/1-Polytopes.
Proceedings of the Approximation, 2003


  Loading...