default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Richerby
Person information
- affiliation: University of Essex, UK
- affiliation (former): University of Oxford, UK
- affiliation (PhD 2004): University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i22]Jonatan Frank, Andor Diera, David Richerby, Ansgar Scherp:
Multi-View Structural Graph Summaries. CoRR abs/2407.18036 (2024)- [i21]Jonatan Frank, Marcel Hoffmann, Nicolas Lell
, David Richerby, Ansgar Scherp:
Lifelong Graph Summarization with Neural Networks: 2012, 2022, and a Time Warp. CoRR abs/2407.18042 (2024) - 2023
- [j22]Ansgar Scherp, David Richerby, Till Blume, Michael Cochez, Jannik Rau:
Structural Summarization of Semantic Graphs Using Quotients. TGDK 1(1): 12:1-12:25 (2023) - [c19]Jannik Rau, David Richerby, Ansgar Scherp:
Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis. ICGT 2023: 223-242 - 2022
- [c18]Maximilian Blasi, Manuel Freudenreich, Johannes Horvath, David Richerby, Ansgar Scherp:
Graph Summarization as Vertex Classification Task using Graph Neural Networks vs. Bloom Filter. DSAA 2022: 1-10 - [i20]Maximilian Blasi, Manuel Freudenreich, Johannes Horvath, David Richerby, Ansgar Scherp:
Graph Summarization with Graph Neural Networks. CoRR abs/2203.05919 (2022) - [i19]Jannik Rau, David Richerby, Ansgar Scherp:
Single-Purpose Algorithms vs. a Generic Graph Summarizer for Computing k-Bisimulations on Large Graphs. CoRR abs/2204.05821 (2022) - 2021
- [j21]Till Blume, David Richerby, Ansgar Scherp:
FLUID: A common model for semantic structural graph summaries based on equivalence relations. Theor. Comput. Sci. 854: 136-158 (2021) - [j20]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster exponential-time algorithms for approximately counting independent sets. Theor. Comput. Sci. 892: 48-84 (2021) - [i18]Till Blume, David Richerby, Ansgar Scherp:
Time and Memory Efficient Algorithm for Structural Graph Summaries over Evolving Graphs. CoRR abs/2111.12493 (2021) - 2020
- [j19]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase transitions of the Moran process and algorithmic consequences. Random Struct. Algorithms 56(3): 597-647 (2020) - [c17]Till Blume, David Richerby, Ansgar Scherp:
Incremental and Parallel Computation of Structural Graph Summaries for Evolving Graphs. CIKM 2020: 75-84 - [i17]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Faster Exponential-time Algorithms for Approximately Counting Independent Sets. CoRR abs/2005.05070 (2020)
2010 – 2019
- 2018
- [i16]Leslie Ann Goldberg, John Lapinskas, David Richerby:
Phase Transitions of the Moran Process and Algorithmic Consequences. CoRR abs/1804.02293 (2018) - 2017
- [j18]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. J. ACM 64(1): 5:1-5:90 (2017) - [j17]Andrei Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný:
Functional clones and expressibility of partition functions. Theor. Comput. Sci. 687: 11-39 (2017) - 2016
- [j16]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 matrix partitions of graphs. Discret. Appl. Math. 213: 76-92 (2016) - [j15]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption time of the Moran process. Random Struct. Algorithms 49(1): 137-159 (2016) - [j14]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput. Theory 8(3): 12:1-12:29 (2016) - [c16]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. ICALP 2016: 62:1-62:13 - [i15]Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivný:
Functional Clones and Expressibility of Partition Functions. CoRR abs/1609.07377 (2016) - 2015
- [j13]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81(1): 311-329 (2015) - [j12]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. SIAM J. Comput. 44(4): 1089-1118 (2015) - [c15]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ICALP (1) 2015: 642-653 - [i14]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Square-Free Graphs, Modulo 2. CoRR abs/1501.07539 (2015) - [i13]Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
Amplifiers for the Moran Process. CoRR abs/1512.05632 (2015) - 2014
- [j11]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica 69(1): 78-91 (2014) - [j10]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The complexity of counting homomorphisms to cactus graphs modulo 2. ACM Trans. Comput. Theory 6(4): 17:1-17:29 (2014) - [c14]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. APPROX-RANDOM 2014: 630-642 - [c13]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting List Matrix Partitions of Graphs. CCC 2014: 56-65 - [c12]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Cactus Graphs Modulo 2. STACS 2014: 350-361 - [i12]Martin E. Dyer, Leslie Ann Goldberg, David Richerby:
Counting 4×4 Matrix Partitions of Graphs. CoRR abs/1407.7799 (2014) - 2013
- [j9]Martin E. Dyer, David Richerby:
An Effective Dichotomy for the Counting Constraint Satisfaction Problem. SIAM J. Comput. 42(3): 1245-1274 (2013) - [c11]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - [i11]Andreas Göbel, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami:
Counting list matrix partitions of graphs. CoRR abs/1306.5176 (2013) - [i10]Andreas Göbel, Leslie Ann Goldberg, David Richerby:
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2. CoRR abs/1307.0556 (2013) - [i9]Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna:
Absorption Time of the Moran Process. CoRR abs/1311.7631 (2013) - 2012
- [j8]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012) - [j7]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2): 681-688 (2012) - [c10]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating fixation probabilities in the generalized Moran process. SODA 2012: 954-960 - [i8]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Can Fixation be Guaranteed in the Generalized Moran Process? CoRR abs/1202.0436 (2012) - [i7]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) - 2011
- [j6]David Richerby, Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive. SIAM J. Discret. Math. 25(2): 497-513 (2011) - [c9]Martin E. Dyer, David Richerby:
The #CSP Dichotomy is Decidable. STACS 2011: 261-272 - [i6]Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis:
Approximating Fixation Probabilities in the Generalized Moran Process. CoRR abs/1111.3321 (2011) - 2010
- [c8]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334 - [c7]Martin E. Dyer, David Richerby:
On the complexity of #CSP. STOC 2010: 725-734 - [i5]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract). CoRR abs/1001.4987 (2010) - [i4]Martin E. Dyer, David Richerby:
The Complexity of #CSP. CoRR abs/1003.3879 (2010) - [i3]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. CoRR abs/1005.2678 (2010)
2000 – 2009
- 2009
- [j5]David Richerby:
Interval bigraphs are unit grid intersection graphs. Discret. Math. 309(6): 1718-1719 (2009) - [j4]David Richerby, Dimitrios M. Thilikos:
Graph Searching in a Crime Wave. SIAM J. Discret. Math. 23(1): 349-368 (2009) - [j3]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38-40): 3949-3961 (2009) - [i2]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. CoRR abs/0907.2663 (2009) - 2008
- [j2]Anuj Dawar, David Richerby, Benjamin Rossman:
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Ann. Pure Appl. Log. 152(1-3): 31-50 (2008) - [c6]David Richerby, Dimitrios M. Thilikos:
Searching for a Visible, Lazy Fugitive. WG 2008: 348-359 - [i1]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Weighted Boolean #CSP with Mixed Signs. CoRR abs/0812.4171 (2008) - 2007
- [c5]Anuj Dawar, David Richerby:
The Power of Counting Logics on Restricted Classes of Finite Structures. CSL 2007: 84-98 - [c4]David Richerby, Dimitrios M. Thilikos:
Graph Searching in a Crime Wave. WG 2007: 21-32 - 2005
- [c3]Anuj Dawar, David Richerby, Benjamin Rossman:
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). WoLLIC 2005: 13-26 - 2004
- [b1]David Richerby:
Fixed-point logics with choice. University of Cambridge, UK, 2004 - [c2]David Richerby:
Logical Characterizations of PSPACE. CSL 2004: 370-384 - 2003
- [j1]Anuj Dawar, David Richerby:
Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. 13(4): 503-530 (2003) - [c1]Anuj Dawar, David Richerby:
A Fixed-Point Logic with Symmetric Choice. CSL 2003: 169-182
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
