| An effective dichotomy for the counting constraint satisfaction problem M Dyer, D Richerby SIAM Journal on Computing 42 (3), 1245-1274, 2013 | 90 | 2013 |
| Approximating fixation probabilities in the generalized moran process J Díaz, LA Goldberg, GB Mertzios, D Richerby, M Serna, PG Spirakis Algorithmica 69, 78-91, 2014 | 63 | 2014 |
| On the complexity of# CSP ME Dyer, DM Richerby Proceedings of the forty-second ACM symposium on Theory of computing, 725-734, 2010 | 53 | 2010 |
| The complexity of weighted and unweighted# CSP A Bulatov, M Dyer, LA Goldberg, M Jalsenius, M Jerrum, D Richerby Journal of Computer and System Sciences 78 (2), 681-688, 2012 | 50 | 2012 |
| The complexity of weighted Boolean# CSP with mixed signs A Bulatov, M Dyer, LA Goldberg, M Jalsenius, D Richerby Theoretical Computer Science 410 (38-40), 3949-3961, 2009 | 40 | 2009 |
| Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs A Dawar, D Richerby, B Rossman Annals of Pure and Applied Logic 152 (1-3), 31-50, 2008 | 37 | 2008 |
| Amplifiers for the Moran process A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby Journal of the ACM (JACM) 64 (1), 1-90, 2017 | 34 | 2017 |
| Absorption time of the Moran process J Díaz, LA Goldberg, D Richerby, M Serna Random Structures & Algorithms 49 (1), 137-159, 2016 | 31 | 2016 |
| On the fixation probability of superstars J Díaz, LA Goldberg, GB Mertzios, D Richerby, M Serna, PG Spirakis Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2013 | 31 | 2013 |
| The complexity of approximating conservative counting CSPs X Chen, M Dyer, LA Goldberg, M Jerrum, P Lu, C McQuillan, D Richerby Journal of Computer and System Sciences 81 (1), 311-329, 2015 | 29 | 2015 |
| The power of counting logics on restricted classes of finite structures A Dawar, D Richerby Computer Science Logic: 21st International Workshop, CSL 2007, 16th Annual …, 2007 | 23 | 2007 |
| The complexity of approximating bounded-degree Boolean# CSP M Dyer, LA Goldberg, M Jalsenius, D Richerby Information and Computation 220, 1-14, 2012 | 21 | 2012 |
| The\# CSP Dichotomy is Decidable M Dyer, D Richerby Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 261-272, 2011 | 20 | 2011 |
| Counting homomorphisms to square-free graphs, modulo 2 A Göbel, LA Goldberg, D Richerby ACM Transactions on Computation Theory (TOCT) 8 (3), 1-29, 2016 | 19 | 2016 |
| The complexity of counting homomorphisms to cactus graphs modulo 2 A Göbel, LA Goldberg, D Richerby ACM Transactions on Computation Theory (TOCT) 6 (4), 1-29, 2014 | 19 | 2014 |
| Graph searching in a crime wave D Richerby, DM Thilikos SIAM Journal on Discrete Mathematics 23 (1), 349-368, 2009 | 17 | 2009 |
| The complexity of approximating conservative counting CSPs X Chen, M Dyer, LA Goldberg, M Jerrum, P Lu, C McQuillan, D Richerby 30th International Symposium on Theoretical Aspects of Computer Science …, 2013 | 10 | 2013 |
| Searching for a visible, lazy fugitive D Richerby, DM Thilikos SIAM Journal on Discrete Mathematics 25 (2), 497-513, 2011 | 10 | 2011 |
| Fixed-point logics with nondeterministic choice A Dawar, D Richerby Journal of Logic and Computation 13 (4), 503-530, 2003 | 10 | 2003 |
| A fixed-point logic with symmetric choice A Dawar, D Richerby CSL, 169-182, 2003 | 10 | 2003 |
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordEmail verificata su cs.ox.ac.uk
