dblp.uni-trier.dewww.uni-trier.de

David Richerby Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
11EEMartin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR abs/0907.2663: (2009)
10EEAndrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38-40): 3949-3961 (2009)
2008
9EEDavid Richerby, Dimitrios M. Thilikos: Searching for a Visible, Lazy Fugitive. WG 2008: 348-359
8EEAnuj 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)
7EEAndrei 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
6EEAnuj Dawar, David Richerby: The Power of Counting Logics on Restricted Classes of Finite Structures. CSL 2007: 84-98
5EEDavid Richerby, Dimitrios M. Thilikos: Graph Searching in a Crime Wave. WG 2007: 21-32
2006
4EEAnuj 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
3EEDavid Richerby: Logical Characterizations of PSPACE. CSL 2004: 370-384
2003
2EEAnuj Dawar, David Richerby: A Fixed-Point Logic with Symmetric Choice. CSL 2003: 169-182
1EEAnuj Dawar, David Richerby: Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. 13(4): 503-530 (2003)

Coauthor Index

1Andrei Bulatov [7] [10]
2Anuj Dawar [1] [2] [4] [6] [8]
3Martin E. Dyer [7] [10] [11]
4Leslie Ann Goldberg [7] [10] [11]
5Markus Jalsenius [7] [10] [11]
6Benjamin Rossman [4] [8]
7Dimitrios M. Thilikos [5] [9]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)