Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
David Richerby
Observed names:
D. Richerby,
David M. Richerby,
Richerby, David
Institution:
University of Essex
Observed institutions:
University of Essex,
University of Leeds,
University of Liverpool,
Universität Ulm,
National and Kapodistrian University of Athens,
University of Cambridge,
University of Bristol,
University of Oxford
show all 8
ORCID:
0000-0003-1062-8451
Observed ORCID:
0000-0003-1062-8451
OpenAlex ID:
A5074554452
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
2013
·
Martin Dyer
, David Richerby
·
SIAM Journal on Computing
·
82
PDF
On the complexity of #CSP
2010
·
Martin E. Dyer
, David M. Richerby
·
ACM Symposium on Theory of Computing (STOC)
·
48
The complexity of weighted and unweighted #CSP
2011
·
Andrei Bulatov
, Martin Dyer
, et al.
·
Journal of Computer and System Sciences
·
44
Approximating Fixation Probabilities in the Generalized Moran Process
2012
·
Josep Díaz
, Leslie Ann Goldberg
, et al.
·
Algorithmica
·
36
PDF
The complexity of weighted Boolean #CSP with mixed signs
2009
·
Andrei Bulatov
, Martin Dyer
, et al.
·
Theoretical Computer Science
·
28
PDF
Absorption time of the Moran process
2016
·
Josep Díaz
, Leslie Ann Goldberg
, et al.
·
Random Structures and Algorithms
·
24
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs
2008
·
Anuj Dawar
, David Richerby
, et al.
·
Annals of Pure and Applied Logic
·
24
Approximating Fixation Probabilities in the Generalized Moran Process
2012
·
Josep Díaz
, Leslie Ann Goldberg
, et al.
·
23
The complexity of approximating bounded-degree Boolean #CSP
2012
·
Martin Dyer
, Leslie Ann Goldberg
, et al.
·
Information and Computation
·
21
PDF
The #CSP Dichotomy is Decidable
2011
·
Dyer, Martin
, Richerby, David
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
21
PDF
On the fixation probability of superstars
2013
·
Josep Díaz
, Leslie Ann Goldberg
, et al.
·
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
·
18
PDF
The complexity of counting homomorphisms to cactus graphs modulo 2
2014
·
Andreas Göbel
, Leslie Ann Goldberg
, et al.
·
ACM Transactions on Computation Theory
·
16
PDF
The complexity of approximating conservative counting CSPs
2014
·
Xi Chen
, Martin Dyer
, et al.
·
Journal of Computer and System Sciences
·
15
PDF
Graph Searching in a Crime Wave
2009
·
David Richerby
, Dimitrios M. Thilikos
·
SIAM Journal on Discrete Mathematics
·
15
The Power of Counting Logics on Restricted Classes of Finite Structures
2007
·
Anuj Dawar
, David Richerby
·
Lecture notes in computer science
·
15
Counting Homomorphisms to Square-Free Graphs, Modulo 2
2016
·
Andreas Göbel
, Leslie Ann Goldberg
, et al.
·
ACM Transactions on Computation Theory
·
13
PDF
FLUID: A common model for semantic structural graph summaries based on equivalence relations
2020
·
Till Blume
, David Richerby
, et al.
·
Theoretical Computer Science
·
11
Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs
2020
·
Till Blume
, David Richerby
, et al.
·
ACM International Conference on Information and Knowledge Management (CIKM)
·
8
Amplifiers for the Moran Process
2017
·
Andreas Galanis
, Andreas Göbel
, et al.
·
Journal of the ACM
·
7
Approximating Fixation Probabilities in the Generalized Moran Process
2012
·
Josep Díaz
, Leslie Ann Goldberg
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
7
PDF
Searching for a Visible, Lazy Fugitive
2011
·
David Richerby
, Dimitrios M. Thilikos
·
SIAM Journal on Discrete Mathematics
·
7
Choiceless Polynomial Time, Counting and the Cai–Fürer–Immerman Graphs
2005
·
Anuj Dawar
, David Richerby
, et al.
·
Electronic Notes in Theoretical Computer Science
·
7
PDF
A Fixed-Point Logic with Symmetric Choice
2003
·
Anuj Dawar
, David Richerby
·
Lecture notes in computer science
·
7
Functional clones and expressibility of partition functions
2017
·
Andrei Bulatov
, Leslie Ann Goldberg
, et al.
·
Theoretical Computer Science
·
4
PDF
Absorption Time of the Moran Process
2014
·
Josep Dı́az
, Leslie Ann Goldberg
, et al.
·
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
·
4
Show more works
View as search
Works count:
51
Citation count:
530
H-index:
15
I10-index:
17
Year
Topic
Type
