| 2008 |
|---|
| 9 | EE | David Richerby,
Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive.
WG 2008: 348-359 |
| 8 | EE | Anuj Dawar,
David Richerby,
Benjamin Rossman:
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs.
Ann. Pure Appl. Logic 152(1-3): 31-50 (2008) |
| 7 | EE | Andrei Bulatov,
Martin E. Dyer,
Leslie Ann Goldberg,
Markus Jalsenius,
David Richerby:
The Complexity of Weighted Boolean #CSP with Mixed Signs
CoRR abs/0812.4171: (2008) |
| 2007 |
|---|
| 6 | EE | Anuj Dawar,
David Richerby:
The Power of Counting Logics on Restricted Classes of Finite Structures.
CSL 2007: 84-98 |
| 5 | EE | David Richerby,
Dimitrios M. Thilikos:
Graph Searching in a Crime Wave.
WG 2007: 21-32 |
| 2006 |
|---|
| 4 | EE | Anuj Dawar,
David Richerby,
Benjamin Rossman:
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 143: 13-26 (2006) |
| 2004 |
|---|
| 3 | EE | David Richerby:
Logical Characterizations of PSPACE.
CSL 2004: 370-384 |
| 2003 |
|---|
| 2 | EE | Anuj Dawar,
David Richerby:
A Fixed-Point Logic with Symmetric Choice.
CSL 2003: 169-182 |
| 1 | EE | Anuj Dawar,
David Richerby:
Fixed-point Logics with Nondeterministic Choice.
J. Log. Comput. 13(4): 503-530 (2003) |
