David Richerby

Orcid: 0000-0003-1062-8451

Affiliations:
  • University of Essex, UK
  • University of Oxford, UK (former)
  • University of Cambridge, UK (PhD 2004)


According to our database1, David Richerby authored at least 40 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lifelong Graph Summarization with Neural Networks: 2012, 2022, and a Time Warp.
CoRR, 2024

Multi-View Structural Graph Summaries.
CoRR, 2024

2023
Structural Summarization of Semantic Graphs Using Quotients.
TGDK, 2023

Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis.
Proceedings of the Graph Transformation - 16th International Conference, 2023

2022
Single-Purpose Algorithms vs. a Generic Graph Summarizer for Computing k-Bisimulations on Large Graphs.
CoRR, 2022

Graph Summarization with Graph Neural Networks.
CoRR, 2022

Graph Summarization as Vertex Classification Task using Graph Neural Networks vs. Bloom Filter.
Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

2021
Faster exponential-time algorithms for approximately counting independent sets.
Theor. Comput. Sci., 2021

FLUID: A common model for semantic structural graph summaries based on equivalence relations.
Theor. Comput. Sci., 2021

Time and Memory Efficient Algorithm for Structural Graph Summaries over Evolving Graphs.
CoRR, 2021

2020
Phase transitions of the Moran process and algorithmic consequences.
Random Struct. Algorithms, 2020

Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2017
Functional clones and expressibility of partition functions.
Theor. Comput. Sci., 2017

Amplifiers for the Moran Process.
J. ACM, 2017

2016
Counting Homomorphisms to Square-Free Graphs, Modulo 2.
ACM Trans. Comput. Theory, 2016

Absorption time of the Moran process.
Random Struct. Algorithms, 2016

Counting 4×4 matrix partitions of graphs.
Discret. Appl. Math., 2016

2015
Counting List Matrix Partitions of Graphs.
SIAM J. Comput., 2015

The complexity of approximating conservative counting CSPs.
J. Comput. Syst. Sci., 2015

2014
The complexity of counting homomorphisms to cactus graphs modulo 2.
ACM Trans. Comput. Theory, 2014

Approximating Fixation Probabilities in the Generalized Moran Process.
Algorithmica, 2014

Counting Homomorphisms to Cactus Graphs Modulo 2.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

2013
An Effective Dichotomy for the Counting Constraint Satisfaction Problem.
SIAM J. Comput., 2013

2012
The complexity of weighted and unweighted #CSP.
J. Comput. Syst. Sci., 2012

The complexity of approximating bounded-degree Boolean #CSP.
Inf. Comput., 2012

Can Fixation be Guaranteed in the Generalized Moran Process?
CoRR, 2012

2011
Searching for a Visible, Lazy Fugitive.
SIAM J. Discret. Math., 2011

The #CSP Dichotomy is Decidable.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)
CoRR, 2010

On the complexity of #CSP.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009
The complexity of weighted Boolean #CSP with mixed signs.
Theor. Comput. Sci., 2009

Graph Searching in a Crime Wave.
SIAM J. Discret. Math., 2009

Interval bigraphs are unit grid intersection graphs.
Discret. Math., 2009

2008
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs.
Ann. Pure Appl. Log., 2008

2007
The Power of Counting Logics on Restricted Classes of Finite Structures.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2005
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

2004
Fixed-point logics with choice.
PhD thesis, 2004

Logical Characterizations of PSPACE.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
Fixed-point Logics with Nondeterministic Choice.
J. Log. Comput., 2003

A Fixed-Point Logic with Symmetric Choice.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003


  Loading...