Search the dblp DataBase

Publications of Author

1. Anuj Dawar, David Richerby
   A Fixed-Point Logic with Symmetric Choice. [Citation Graph (0, 0)][DBLP]
   CSL, 2003, pp:169-182 [Conf]
   
2. David Richerby
   Logical Characterizations of PSPACE. [Citation Graph (0, 0)][DBLP]
   CSL, 2004, pp:370-384 [Conf]
   
3. Anuj Dawar, David Richerby, Benjamin Rossman
   Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:13-26 [Journal]
   
4. Anuj Dawar, David Richerby
   Fixed-point Logics with Nondeterministic Choice. [Citation Graph (0, 0)][DBLP]
   J. Log. Comput., 2003, v:13, n:4, pp:503-530 [Journal]
   
5. Anuj Dawar, David Richerby
   The Power of Counting Logics on Restricted Classes of Finite Structures. [Citation Graph (0, 0)][DBLP]
   CSL, 2007, pp:84-98 [Conf]
   
6. 
   The Complexity of Approximating Bounded-Degree Boolean #CSP. [Citation Graph (, )][DBLP]
   
   
7. 
   On the complexity of #CSP. [Citation Graph (, )][DBLP]
   
   
8. 
   Graph Searching in a Crime Wave. [Citation Graph (, )][DBLP]
   
   
9. 
   Searching for a Visible, Lazy Fugitive. [Citation Graph (, )][DBLP]
   
   
10. 
    Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    The Complexity of Weighted Boolean #CSP with Mixed Signs [Citation Graph (, )][DBLP]
    
    
12. 
    The Complexity of Approximating Bounded-Degree Boolean #CSP [Citation Graph (, )][DBLP]
    
    
13. 
    The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) [Citation Graph (, )][DBLP]
    
    
14. 
    The Complexity of #CSP [Citation Graph (, )][DBLP]
    
    
15. 
    The complexity of weighted and unweighted #CSP [Citation Graph (, )][DBLP]
    
    
16. 
    Interval bigraphs are unit grid intersection graphs. [Citation Graph (, )][DBLP]