Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: Martin E.
    Last name: Dyer
    DBLP: 82/6798
    Rating: (not rated yet)
    Bookmark:

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

    Show item 1 to 25 of 161  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Colin Cooper, Martin E. Dyer, Catherine S. Greenhill, Andrew J. Handley.
    The flip Markov chain for connected regular graphs.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin E. Dyer, Haiko Müller.
    Counting perfect matchings and the switch chain.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the Switch Markov Chain for Perfect Matchings.
    J. ACM 2017, Volume 64 (0) 2017
    Conference paper
    Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda.
    Random Walks on Small World Networks.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the switch Markov chain for perfect matchings.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera.
    Discordant voting processes on finite graphs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Colin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera.
    Discordant Voting Processes on Finite Graphs.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (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
    Journal article
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the switch Markov chain for perfect matchings.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill.
    On the chromatic number of a random hypergraph.
    J. Comb. Theory, Ser. B 2015, Volume 113 (0) 2015
    Conference paper
    Martin E. Dyer, Leen Stougie.
    Erratum to: Computational complexity of stochastic programming problems.
    Math. Program. 2015, Volume 153 (0) 2015
    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
    Martin E. Dyer, R. Kannan, Leen Stougie.
    A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming.
    Math. Program. 2014, Volume 147 (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
    Martin E. Dyer, David Richerby.
    An Effective Dichotomy for the Counting Constraint Satisfaction Problem.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Conference paper
    Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda.
    Randomly coloring constant degree graphs.
    Random Struct. Algorithms 2013, Volume 43 (0) 2013
    Conference paper
    Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan.
    The expressibility of functions on the boolean domain, with applications to counting CSPs.
    J. ACM 2013, Volume 60 (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
    Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Log-supermodular functions, functional clones and counting CSPs.
    29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France 2012 (0) 2012
    Conference paper
    Martin E. Dyer, Alan M. Frieze, Catherine S. Greenhill.
    On the chromatic number of a random hypergraph
    CoRR 2012, Volume 0 (0) 2012
    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
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The complexity of approximating bounded-degree Boolean #CSP.
    Inf. Comput. 2012, Volume 220 (0) 2012
    Conference paper
    Martin E. Dyer, David Richerby.
    The #CSP Dichotomy is Decidable.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2011
    Conference paper
    Colin Cooper, Martin E. Dyer, Andrew J. Handley.
    Networks of random cycles.
    Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011 (0) 2011
    Show item 1 to 25 of 161  

    Your query returned 161 matches in the database.