×

zbMATH — the first resource for mathematics

Richerby, David M.

Compute Distance To:
Author ID: richerby.david-m Recent zbMATH articles by "Richerby, David M."
Published as: Richerby, David; Richerby, David M.
External Links: MGP · Wikidata
Documents Indexed: 34 Publications since 2003

Publications by Year

Citations contained in zbMATH

28 Publications have been cited 161 times in 90 Documents Cited by Year
On the fixation probability of superstars. Zbl 1371.92097
Díaz, Josep; Goldberg, Leslie Ann; Mertzios, George B.; Richerby, David; Serna, Maria; Spirakis, Paul G.
22
2013
Approximating fixation probabilities in the generalized Moran process. Zbl 1303.92095
Díaz, Josep; Goldberg, Leslie Ann; Mertzios, George B.; Richerby, David; Serna, Maria; Spirakis, Paul G.
21
2014
An effective dichotomy for the counting constraint satisfaction problem. Zbl 1275.68077
Dyer, Martin; Richerby, David
17
2013
Absorption time of the Moran process. Zbl 1359.92093
Díaz, Josep; Goldberg, Leslie Ann; Richerby, David; Serna, Maria
16
2014
On the complexity of #CSP. Zbl 1293.68165
Dyer, Martin E.; Richerby, David M.
13
2010
The complexity of weighted Boolean #CSP with mixed signs. Zbl 1171.68013
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
12
2009
The complexity of weighted and unweighted \(\#\)CSP. Zbl 1282.68110
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Jerrum, Mark; Richerby, David
10
2012
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Zbl 1136.03024
Dawar, Anuj; Richerby, David; Rossman, Benjamin
7
2008
The complexity of approximating bounded-degree Boolean #CSP. Zbl 1230.68105
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
5
2010
The complexity of approximating conservative counting CSPs. Zbl 1354.68114
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; McQuillan, Colin; Richerby, David
4
2015
Amplifiers for the Moran process. Zbl 1388.68296
Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David
3
2016
The #CSP dichotomy is decidable. Zbl 1230.68078
Dyer, Martin; Richerby, David
3
2011
Searching for a visible, lazy fugitive. Zbl 1294.05115
Richerby, David; Thilikos, Dimitrios M.
3
2011
Amplifiers for the Moran process. Zbl 1426.68296
Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David
2
2017
Absorption time of the Moran process. Zbl 1344.05135
Díaz, Josep; Goldberg, Leslie Ann; Richerby, David; Serna, Maria
2
2016
Counting homomorphisms to cactus graphs modulo 2. Zbl 1359.05061
Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
2
2014
The complexity of approximating conservative counting CSPs. Zbl 1354.68115
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; Mcquillan, Colin; Richerby, David
2
2013
The complexity of approximating bounded-degree Boolean \(\#\)CSP. Zbl 1282.68136
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
2
2012
Graph searching in a crime wave. Zbl 1216.05150
Richerby, David; Thilikos, Dimitrios M.
2
2009
Searching for a visible, lazy fugitive. Zbl 1202.68287
Richerby, David; Thilikos, Dimitrios M.
2
2008
The power of counting logics on restricted classes of finite structures. Zbl 1179.68061
Dawar, Anuj; Richerby, David
2
2007
Graph searching in a crime wave. Zbl 1141.68548
Richerby, David; Thilikos, Dimitrios M.
2
2007
A fixed-point logic with symmetric choice. Zbl 1116.03316
Dawar, Anuj; Richerby, David
2
2003
Functional clones and expressibility of partition functions. Zbl 1418.08001
Bulatov, Andrei; Goldberg, Leslie Ann; Jerrum, Mark; Richerby, David; Živný, Stanislav
1
2017
The complexity of counting homomorphisms to cactus graphs modulo 2. Zbl 1347.68181
Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
1
2014
Approximating fixation probabilities in the generalized Moran process. Zbl 1423.92217
Díaz, Josep; Goldberg, Leslie Ann; Mertzios, George B.; Richerby, David; Serna, Maria; Spirakis, Paul G.
1
2012
Logical characterizations of PSPACE. Zbl 1095.68032
Richerby, David
1
2004
Fixed-point logics with nondeterministic choice. Zbl 1045.03033
Dawar, Anuj; Richerby, David
1
2003
Amplifiers for the Moran process. Zbl 1426.68296
Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David
2
2017
Functional clones and expressibility of partition functions. Zbl 1418.08001
Bulatov, Andrei; Goldberg, Leslie Ann; Jerrum, Mark; Richerby, David; Živný, Stanislav
1
2017
Amplifiers for the Moran process. Zbl 1388.68296
Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie Ann; Lapinskas, John; Richerby, David
3
2016
Absorption time of the Moran process. Zbl 1344.05135
Díaz, Josep; Goldberg, Leslie Ann; Richerby, David; Serna, Maria
2
2016
The complexity of approximating conservative counting CSPs. Zbl 1354.68114
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; McQuillan, Colin; Richerby, David
4
2015
Approximating fixation probabilities in the generalized Moran process. Zbl 1303.92095
Díaz, Josep; Goldberg, Leslie Ann; Mertzios, George B.; Richerby, David; Serna, Maria; Spirakis, Paul G.
21
2014
Absorption time of the Moran process. Zbl 1359.92093
Díaz, Josep; Goldberg, Leslie Ann; Richerby, David; Serna, Maria
16
2014
Counting homomorphisms to cactus graphs modulo 2. Zbl 1359.05061
Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
2
2014
The complexity of counting homomorphisms to cactus graphs modulo 2. Zbl 1347.68181
Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David
1
2014
On the fixation probability of superstars. Zbl 1371.92097
Díaz, Josep; Goldberg, Leslie Ann; Mertzios, George B.; Richerby, David; Serna, Maria; Spirakis, Paul G.
22
2013
An effective dichotomy for the counting constraint satisfaction problem. Zbl 1275.68077
Dyer, Martin; Richerby, David
17
2013
The complexity of approximating conservative counting CSPs. Zbl 1354.68115
Chen, Xi; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Lu, Pinyan; Mcquillan, Colin; Richerby, David
2
2013
The complexity of weighted and unweighted \(\#\)CSP. Zbl 1282.68110
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Jerrum, Mark; Richerby, David
10
2012
The complexity of approximating bounded-degree Boolean \(\#\)CSP. Zbl 1282.68136
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
2
2012
Approximating fixation probabilities in the generalized Moran process. Zbl 1423.92217
Díaz, Josep; Goldberg, Leslie Ann; Mertzios, George B.; Richerby, David; Serna, Maria; Spirakis, Paul G.
1
2012
The #CSP dichotomy is decidable. Zbl 1230.68078
Dyer, Martin; Richerby, David
3
2011
Searching for a visible, lazy fugitive. Zbl 1294.05115
Richerby, David; Thilikos, Dimitrios M.
3
2011
On the complexity of #CSP. Zbl 1293.68165
Dyer, Martin E.; Richerby, David M.
13
2010
The complexity of approximating bounded-degree Boolean #CSP. Zbl 1230.68105
Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
5
2010
The complexity of weighted Boolean #CSP with mixed signs. Zbl 1171.68013
Bulatov, Andrei; Dyer, Martin; Goldberg, Leslie Ann; Jalsenius, Markus; Richerby, David
12
2009
Graph searching in a crime wave. Zbl 1216.05150
Richerby, David; Thilikos, Dimitrios M.
2
2009
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Zbl 1136.03024
Dawar, Anuj; Richerby, David; Rossman, Benjamin
7
2008
Searching for a visible, lazy fugitive. Zbl 1202.68287
Richerby, David; Thilikos, Dimitrios M.
2
2008
The power of counting logics on restricted classes of finite structures. Zbl 1179.68061
Dawar, Anuj; Richerby, David
2
2007
Graph searching in a crime wave. Zbl 1141.68548
Richerby, David; Thilikos, Dimitrios M.
2
2007
Logical characterizations of PSPACE. Zbl 1095.68032
Richerby, David
1
2004
A fixed-point logic with symmetric choice. Zbl 1116.03316
Dawar, Anuj; Richerby, David
2
2003
Fixed-point logics with nondeterministic choice. Zbl 1045.03033
Dawar, Anuj; Richerby, David
1
2003
all top 5

Cited by 150 Authors

13 Goldberg, Leslie Ann
12 Cai, Jin-Yi
9 Richerby, David M.
6 Lu, Pinyan
5 Guo, Heng
5 Jerrum, Mark R.
4 Bulatov, Andrei A.
4 Galanis, Andreas
4 Thilikos, Dimitrios M.
4 Williams, Tyson
4 Yamakami, Tomoyuki
3 Chen, Xi
3 Dawar, Anuj
3 Dyer, Martin E.
3 Mcquillan, Colin
3 Štefankovič, Daniel
3 Vigoda, Eric
2 Cauwet, Marie-Liesse
2 Fu, Zhiguo
2 Göbel, Andreas-Nikolas
2 Grohe, Martin
2 Jalsenius, Markus
2 Kreutzer, Stephan
2 Lehre, Per Kristian
2 Lengler, Johannes
2 Maua, Denis Deratani
2 Ordyniak, Sebastian
2 Rossman, Benjamin
2 Shapiro, Jonathan L.
2 Teytaud, Olivier
2 Turner, Jacob M.
2 Xia, Mingji
2 Živný, Stanislav
1 Anderson, Matthew T.
1 Astete-Morales, Sandra
1 Backens, Miriam
1 Badkobeh, Golnaz
1 Barto, Libor
1 Bezáková, Ivona
1 Blanca, Antonio
1 Blass, Andreas Raphael
1 Burjorjee, Keki M.
1 Calitz, Andre
1 Carbonnel, Clément
1 Carvalho, Catarina A.
1 Chalub, Fabio A. C. C.
1 Chatterjee, Krishnendu
1 Chatzigiannakis, Ioannis
1 Chen, Hubie
1 Chen, Zongchen
1 Chicano, Francisco
1 Chiu, Shih-Yuan
1 Cooper, Martin C.
1 Cozman, Fabio G.
1 Dang, Duc-Cuong
1 de Campos, Cassio Polpo
1 De Jong, Kenneth Alan
1 Dershowitz, Nachum
1 Díaz, Josep
1 Du Plessis, Mathys C.
1 Durand, Arnaud
1 Egri, László
1 Engelbrecht, Andries Petrus
1 Fomin, Fedor V.
1 Fotakis, Dimitris A.
1 Gagliardi Cozman, Fabio
1 Ganian, Robert
1 Golovach, Petr A.
1 González-Ruiz, J. Leonardo
1 Grädel, Erich
1 Gurevich, Yuri
1 Hernández-Servín, J. A.
1 Huang, Sangxia
1 Ibsen-Jensen, Rasmus
1 Igel, Christian
1 Jackson, Marcel G.
1 Jansen, Thomas
1 Kamiński, Marcin Marek
1 Kim, Jonghoek
1 Kohandel, Mohammad
1 Komarova, Natalia L.
1 Kontogiannis, Spyros C.
1 Kötzing, Timo
1 Kowalczyk, Michael
1 Krause, Oswin
1 Lapinskas, John
1 Li, Liang
1 Limnios, Stratis
1 Lin, Jiabao
1 Lin, Kuo-Min
1 Lissovoi, Andrei
1 Lockett, Alan J.
1 Malagò, Luigi
1 Manem, V. S. K.
1 Marcial-Romero, José Raymundo
1 Margulies, Susan
1 Mayr, Peter
1 Mealing, Richard
1 Meier, Florian
1 Mengel, Stefan
...and 50 more Authors

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.