Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Richerby, David
69  Ergebnisse:
Personensuche X
?
1

Computing k-Bisimulations for Large Graphs: A Comparison an..:

, In: Graph Transformation; Lecture Notes in Computer Science,
Rau, Jannik ; Richerby, David ; Scherp, Ansgar - p. 223-242 , 2023
Link: https://doi.org/10.1007/..
 
?
2

FLUID: A common model for semantic structural graph summari..:

Blume, Till ; Richerby, David ; Scherp, Ansgar
Theoretical Computer Science.  854 (2021)  - p. 136-158 , 2021
Link: https://doi.org/10.1016/..
 
?
3

Faster exponential-time algorithms for approximately counti..:

Goldberg, Leslie Ann ; Lapinskas, John ; Richerby, David
Theoretical Computer Science.  892 (2021)  - p. 48-84 , 2021
Link: https://doi.org/10.1016/..
 
?
4

Incremental and Parallel Computation of Structural Graph Su..:

, In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management,
Blume, Till ; Richerby, David ; Scherp, Ansgar - p. 75-84 , 2020
Link: https://dl.acm.org/doi/1..
 
?
5

Phase transitions of the Moran process and algorithmic cons..:

Ann Goldberg, Leslie ; Lapinskas, John ; Richerby, David
Random Structures & Algorithms.  56 (2019)  3 - p. 597-647 , 2019
Link: https://doi.org/10.1002/..
 
?
6

Amplifiers for the Moran Process:

Galanis, Andreas ; Göbel, Andreas ; Goldberg, Leslie Ann..
Journal of the ACM.  64 (2017)  1 - p. 1-90 , 2017
Link: https://doi.org/10.1145/..
 
?
7

Amplifiers for the Moran Process:

Galanis, Andreas ; Göbel, Andreas ; Goldberg, Leslie Ann..
Journal of the ACM (JACM).  64 (2017)  1 - p. 1-90 , 2017
Link: https://dl.acm.org/doi/1..
 
?
8

Functional clones and expressibility of partition functions:

Bulatov, Andrei ; Goldberg, Leslie Ann ; Jerrum, Mark..
Theoretical Computer Science.  687 (2017)  - p. 11-39 , 2017
Link: https://doi.org/10.1016/..
 
?
9

Counting Homomorphisms to Square-Free Graphs, Modulo 2:

Göbel, Andreas ; Goldberg, Leslie Ann ; Richerby, David
ACM Transactions on Computation Theory.  8 (2016)  3 - p. 1-29 , 2016
Link: https://doi.org/10.1145/..
 
?
10

Counting 4×4 matrix partitions of graphs:

Dyer, Martin ; Goldberg, Leslie Ann ; Richerby, David
Discrete Applied Mathematics.  213 (2016)  - p. 76-92 , 2016
Link: https://doi.org/10.1016/..
 
?
11

Counting Homomorphisms to Square-Free Graphs, Modulo 2:

Göbel, Andreas ; Goldberg, Leslie Ann ; Richerby, David
ACM Transactions on Computation Theory (TOCT).  8 (2016)  3 - p. 1-29 , 2016
Link: https://dl.acm.org/doi/1..
 
?
12

Absorption time of the Moran process:

Díaz, Josep ; Goldberg, Leslie Ann ; Richerby, David.
Random Structures & Algorithms.  49 (2016)  1 - p. 137-159 , 2016
Link: https://doi.org/10.1002/..
 
?
13

Counting List Matrix Partitions of Graphs:

Göbel, Andreas ; Goldberg, Leslie Ann ; McQuillan, Colin..
SIAM Journal on Computing.  44 (2015)  4 - p. 1089-1118 , 2015
Link: https://doi.org/10.1137/..
 
?
14

The complexity of approximating conservative counting CSPs:

Chen, Xi ; Dyer, Martin ; Goldberg, Leslie Ann...
Journal of Computer and System Sciences.  81 (2015)  1 - p. 311-329 , 2015
Link: https://doi.org/10.1016/..
 
?
15

The complexity of counting homomorphisms to cactus graphs m..:

Göbel, Andreas ; Goldberg, Leslie Ann ; Richerby, David
ACM Transactions on Computation Theory (TOCT).  6 (2014)  4 - p. 1-29 , 2014
Link: https://dl.acm.org/doi/1..
 
1-15