Items where Author is "Richerby, David"
 | Up a level |
Article
Scherp, Ansgar and Richerby, David and Blume, Till and Cochez, Michael and Rau, Jannik (2023) Structural Summarization of Semantic Graphs Using Quotients. Transactions on Graph Data and Knowledge, 1 (1). 12:1-12:25. DOI https://doi.org/10.4230/TGDK.1.1.12
Goldberg, Leslie Ann and Lapinskas, John and Richerby, David (2021) Faster Exponential-time Algorithms for Approximately Counting Independent Sets. Theoretical Computer Science, 892. pp. 48-84. DOI https://doi.org/10.1016/j.tcs.2021.09.009
Blume, Till and Richerby, David and Scherp, Ansgar (2021) FLUID: A common model for semantic structural graph summaries based on equivalence relations. Theoretical Computer Science, 854. pp. 136-158. DOI https://doi.org/10.1016/j.tcs.2020.12.019
Goldberg, Leslie and Lapinskas, John and Richerby, David (2020) Phase transitions of the Moran process and algorithmic consequences. Random Structures and Algorithms, 56 (3). pp. 597-647. DOI https://doi.org/10.1002/rsa.20890
Bulatov, Andrei and Goldberg, Leslie Ann and Jerrum, Mark and Richerby, David and Živný, Stanislav (2017) Functional clones and expressibility of partition functions. Theoretical Computer Science, 687. pp. 11-39. DOI https://doi.org/10.1016/j.tcs.2017.05.001
Galanis, Andreas and Göbel, Andreas and Goldberg, Leslie Ann and Lapinskas, John and Richerby, David (2017) Amplifiers for the Moran Process. Journal of the ACM, 64 (1). pp. 1-90. DOI https://doi.org/10.1145/3019609
Dyer, Martin and Goldberg, Leslie Ann and Richerby, David (2016) Counting 4x4 matrix partitions of graphs. Discrete Applied Mathematics, 213. pp. 76-92. DOI https://doi.org/10.1016/j.dam.2016.05.001
DÃaz, Josep and Goldberg, Leslie Ann and Richerby, David and Serna, Maria (2016) Absorption time of the Moran process. Random Structures and Algorithms, 49 (1). pp. 137-159. DOI https://doi.org/10.1002/rsa.20617
Göbel, Andreas and Goldberg, Leslie Ann and Richerby, David (2016) Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Transactions on Computation Theory, 8 (3). pp. 1-29. DOI https://doi.org/10.1145/2898441
Conference or Workshop Item
Rau, Jannik and Richerby, David and Scherp, Ansgar (2023) Computing k-Bisimulations for Large Graphs: A Comparison and Efficiency Analysis. In: ICGT: International Conference on Graph Transformation, 2023-07-19 - 2023-07-20, Leicester.