David Richerby

Available identifiers

zbMath Open richerby.david-mDBLPr/DavidRicherbyWikidataQ102279003 ScholiaQ102279003MaRDI QIDQ313798

List of research outcomes

Publication	Date of Publication	Type
Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis	2024-01-12	Paper
Faster exponential-time algorithms for approximately counting independent sets	2021-10-21	Paper
FLUID: a common model for semantic structural graph summaries based on equivalence relations	2021-01-25	Paper
Phase transitions of the Moran process and algorithmic consequences	2020-06-19	Paper
Counting Homomorphisms to Square-Free Graphs, Modulo 2	2019-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q5743450	2019-05-10	Paper
Amplifiers for the Moran Process	2018-08-02	Paper
Amplifiers for the Moran Process	2017-12-19	Paper
On the fixation probability of superstars	2017-09-29	Paper
Functional clones and expressibility of partition functions	2017-06-13	Paper
https://portal.mardi4nfdi.de/entity/Q2969651	2017-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q2965497	2017-03-03	Paper
The complexity of approximating conservative counting CSPs.	2017-01-30	Paper
The complexity of counting homomorphisms to cactus graphs modulo 2	2016-10-24	Paper
Counting \(4 \times 4\) matrix partitions of graphs	2016-09-12	Paper
Absorption time of the Moran process	2016-09-07	Paper
Counting Homomorphisms to Square-Free Graphs, Modulo 2	2015-10-27	Paper
Counting List Matrix Partitions of Graphs	2015-09-02	Paper
Approximating fixation probabilities in the generalized Moran process	2014-11-19	Paper
The complexity of approximating conservative counting CSPs	2014-09-22	Paper
On the complexity of \#CSP	2014-08-13	Paper
An effective dichotomy for the counting constraint satisfaction problem	2013-09-25	Paper
The complexity of approximating bounded-degree Boolean \(\#\)CSP	2013-01-17	Paper
The complexity of weighted and unweighted \(\#\)CSP	2012-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q3113690	2012-01-23	Paper
The Complexity of Approximating Bounded-Degree Boolean #CSP	2012-01-23	Paper
Searching for a Visible, Lazy Fugitive	2011-10-27	Paper
Graph Searching in a Crime Wave	2010-03-17	Paper
The complexity of weighted Boolean \#CSP with mixed signs	2009-09-10	Paper
Interval bigraphs are unit grid intersection graphs	2009-06-17	Paper
The Power of Counting Logics on Restricted Classes of Finite Structures	2009-03-05	Paper
Searching for a Visible, Lazy Fugitive	2009-01-20	Paper
Graph Searching in a Crime Wave	2008-07-01	Paper
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs	2008-03-28	Paper
Computer Science Logic	2007-06-21	Paper
Computer Science Logic	2005-08-22	Paper
Fixed-point Logics with Nondeterministic Choice	2003-11-10	Paper

Research outcomes over time

This page was built for person: David Richerby