| |
| 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) |
| 1 | Anuj Dawar | [1] [2] [4] [6] |
| 2 | Benjamin Rossman | [4] |
| 3 | Dimitrios M. Thilikos | [5] |