Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: David
    Last name: Richerby
    DBLP: r/DavidRicherby
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 49  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby.
    Amplifiers for the Moran Process.
    J. ACM 2017, Volume 64 (0) 2017
    Journal article
    Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny.
    Functional clones and expressibility of partition functions.
    Theor. Comput. Sci. 2017, Volume 687 (0) 2017
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby.
    Counting Homomorphisms to Square-Free Graphs, Modulo 2.
    TOCT 2016, Volume 8 (0) 2016
    Journal article
    Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna.
    Absorption time of the Moran process.
    Random Struct. Algorithms 2016, Volume 49 (0) 2016
    Conference paper
    Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby.
    Amplifiers for the Moran Process.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny.
    Functional Clones and Expressibility of Partition Functions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, David Richerby.
    Counting 4×4 matrix partitions of graphs.
    Discrete Applied Mathematics 2016, Volume 213 (0) 2016
    Journal article
    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. 2015, Volume 81 (0) 2015
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby.
    Counting Homomorphisms to Square-Free Graphs, Modulo 2.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby.
    Counting Homomorphisms to Square-Free Graphs, Modulo 2.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami.
    Counting List Matrix Partitions of Graphs.
    SIAM J. Comput. 2015, Volume 44 (0) 2015
    Conference paper
    Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby.
    Amplifiers for the Moran Process.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby.
    Counting Homomorphisms to Cactus Graphs Modulo 2.
    31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France 2014 (0) 2014
    Journal article
    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 2014, Volume 69 (0) 2014
    Journal article
    Martin E. Dyer, Leslie Ann Goldberg, David Richerby.
    Counting $4\times 4$ Matrix Partitions of Graphs.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna.
    Absorption Time of the Moran Process.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby.
    The complexity of counting homomorphisms to cactus graphs modulo 2.
    TOCT 2014, Volume 6 (0) 2014
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami.
    Counting List Matrix Partitions of Graphs.
    IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014 2014 (0) 2014
    Conference paper
    Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby.
    The complexity of approximating conservative counting CSPs.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Andreas Göbel 0001, Leslie Ann Goldberg, Colin McQuillan, David Richerby, Tomoyuki Yamakami.
    Counting list matrix partitions of graphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Martin E. Dyer, David Richerby.
    An Effective Dichotomy for the Counting Constraint Satisfaction Problem.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Journal article
    Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby.
    The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Josep Díaz, Leslie Ann Goldberg, David Richerby, Maria J. Serna.
    Absorption Time of the Moran Process.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    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. 2012, Volume 78 (0) 2012
    Conference paper
    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 2012, Volume 0 (0) 2012
    Show item 1 to 25 of 49  

    Your query returned 49 matches in the database.