|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis |
Can Fixation be Guaranteed in the Generalized Moran Process?  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis |
Approximating fixation probabilities in the generalized Moran process. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis |
Approximating Fixation Probabilities in the Generalized Moran Process |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Richerby, Dimitrios M. Thilikos |
Searching for a Visible, Lazy Fugitive. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
The #CSP Dichotomy is Decidable. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby |
The complexity of weighted and unweighted #CSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
The Complexity of #CSP |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
On the complexity of #CSP. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
complexity dichotomy, constraint satisfaction problem, counting problems |
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The complexity of weighted Boolean #CSP with mixed signs. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Richerby |
Interval bigraphs are unit grid intersection graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Approximating Bounded-Degree Boolean #CSP |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Richerby, Dimitrios M. Thilikos |
Graph Searching in a Crime Wave. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, David Richerby, Benjamin Rossman |
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. |
Ann. Pure Appl. Logic |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby |
The Complexity of Weighted Boolean #CSP with Mixed Signs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Richerby, Dimitrios M. Thilikos |
Searching for a Visible, Lazy Fugitive. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | David Richerby, Dimitrios M. Thilikos |
Graph Searching in a Crime Wave. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, David Richerby |
The Power of Counting Logics on Restricted Classes of Finite Structures. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, David Richerby, Benjamin Rossman |
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). |
Electr. Notes Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David Richerby |
Logical Characterizations of PSPACE. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
choice operators, partial fixed points, descriptive complexity, Finite model theory |
| 1 | Anuj Dawar, David Richerby |
Fixed-point Logics with Nondeterministic Choice. |
J. Log. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anuj Dawar, David Richerby |
A Fixed-Point Logic with Symmetric Choice. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")