David Richerby (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

8 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)

6 Anuj Dawar, David Richerby: The Power of Counting Logics on Restricted Classes of Finite Structures. CSL 2007: 84-98

4 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)

2 Anuj Dawar, David Richerby: A Fixed-Point Logic with Symmetric Choice. CSL 2003: 169-182

1 Anuj Dawar, David Richerby: Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. 13(4): 503-530 (2003)

Selection of 5 from 25 records - David Richerby has 15 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

8		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)
6		Anuj Dawar, David Richerby: The Power of Counting Logics on Restricted Classes of Finite Structures. CSL 2007: 84-98
4		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)
2		Anuj Dawar, David Richerby: A Fixed-Point Logic with Symmetric Choice. CSL 2003: 169-182
1		Anuj Dawar, David Richerby: Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. 13(4): 503-530 (2003)