Martin E. Dyer
Affiliations: University of Leeds, UK
According to our database^{1},
Martin E. Dyer
authored at least 141 papers
between 1977 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org

on dnb.info

on dl.acm.org
On csauthors.net:
Bibliography
2021
SIAM J. Discret. Math., 2021
Random Struct. Algorithms, 2021
Discret. Math., 2021
Polynomialtime approximation algorithms for the antiferromagnetic Ising model on line graphs.
Comb. Probab. Comput., 2021
Proceedings of the Combinatorial Algorithms  32nd International Workshop, 2021
2020
ACM Trans. Algorithms, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
SIAM J. Discret. Math., 2019
J. Inf. Secur. Appl., 2019
Inf. Process. Lett., 2019
Practical homomorphic encryption over the integers for secure computation in the cloud.
Int. J. Inf. Sec., 2019
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
CoRR, 2019
2018
SIAM J. Discret. Math., 2018
2017
J. ACM, 2017
CoRR, 2017
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2017
2016
Discret. Appl. Math., 2016
2015
Math. Program., 2015
J. Comb. Theory, Ser. B, 2015
J. Comput. Syst. Sci., 2015
2014
A simple randomised algorithm for convex optimisation  Application to twostage stochastic programming.
Math. Program., 2014
2013
SIAM J. Comput., 2013
The expressibility of functions on the boolean domain, with applications to counting CSPs.
J. ACM, 2013
2012
J. Comput. Syst. Sci., 2012
Inf. Comput., 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
2011
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241).
Dagstuhl Reports, 2011
CoRR, 2011
CoRR, 2011
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Automata, Languages and Programming  38th International Colloquium, 2011
2010
SIAM J. Comput., 2010
Random Struct. Algorithms, 2010
J. Comput. Syst. Sci., 2010
CoRR, 2010
Comput. Complex., 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
2009
Theor. Comput. Sci., 2009
SIAM J. Comput., 2009
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009
2008
Random walks on the vertices of transportation polytopes with constant number of sources.
Random Struct. Algorithms, 2008
Path coupling using stopping times and counting independent sets and colorings in hypergraphs.
Random Struct. Algorithms, 2008
Comb. Probab. Comput., 2008
08201 Abstracts Collection  Design and Analysis of Randomized and Approximation Algorithms.
Proceedings of the Design and Analysis of Randomized and Approximation Algorithms, 11.05., 2008
2007
J. Discrete Algorithms, 2007
J. ACM, 2007
Comb. Probab. Comput., 2007
CoRR, 2007
2006
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.
SIAM J. Comput., 2006
Random Struct. Algorithms, 2006
Math. Program., 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
Electron. Colloquium Comput. Complex., 2005
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
Electron. Colloquium Comput. Complex., 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
05201 Abstracts Collection  Design and Analysis of Randomized and Approximation Algorithms.
Proceedings of the Design and Analysis of Randomized and Approximation Algorithms, 15.05., 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Random Struct. Algorithms, 2004
Random Struct. Algorithms, 2004
Inf. Comput., 2004
Electron. Colloquium Comput. Complex., 2004
Algorithmica, 2004
2003
A probabilistic analysis of randomly generated binary constraint satisfaction problems.
Theor. Comput. Sci., 2003
Random Struct. Algorithms, 2003
A polynomialtime algorithm to approximately count contingency tables when the number of rows is constant.
J. Comput. Syst. Sci., 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003
2002
SIAM J. Comput., 2002
Very rapid mixing of the Glauber dynamics for proper colorings on boundeddegree graphs.
Random Struct. Algorithms, 2002
Comb. Probab. Comput., 2002
2001
J. Algorithms, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
Proceedings of the Graphs, 2001
Proceedings of the Graphs, 2001
2000
Theor. Comput. Sci., 2000
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems.
SIAM J. Comput., 2000
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings.
SIAM J. Comput., 2000
Random Struct. Algorithms, 2000
J. Algorithms, 2000
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms, 2000
1999
SIAM J. Comput., 1999
Discret. Math., 1999
1998
SIAM J. Comput., 1998
SIAM J. Comput., 1998
Random Struct. Algorithms, 1998
Random Struct. Algorithms, 1998
Beating the 2 Delta Bound for Approximately Counting Colourings: A ComputerAssisted Proof of Rapid Mixing.
Proceedings of the Ninth Annual ACMSIAM Symposium on Discrete Algorithms, 1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
1997
Random Struct. Algorithms, 1997
Math. Oper. Res., 1997
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Comput. J., 1996
Artif. Intell., 1996
Proceedings of the EuroPar '96 Parallel Processing, 1996
1995
Random Struct. Algorithms, 1995
J. Cryptol., 1995
J. Comput. Biol., 1995
The WorstCase Running Time of the Random Simplex Algorithm is Exponential in the Height.
Inf. Process. Lett., 1995
An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
1994
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm.
Math. Program., 1994
J. Comput. Biol., 1994
Discret. Appl. Math., 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
1993
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.
Comb. Probab. Comput., 1993
1992
Random Struct. Algorithms, 1992
Math. Program., 1992
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992
1991
SIAM J. Comput., 1991
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph.
Random Struct. Algorithms, 1991
Random Struct. Algorithms, 1991
J. ACM, 1991
1990
Math. Program., 1990
Formulating the single machine sequencing problem with release dates as a mixed integer program.
Discret. Appl. Math., 1990
Discret. Appl. Math., 1990
Proceedings of the Polyhedral Combinatorics, 1990
1989
Math. Program., 1989
Math. Oper. Res., 1989
J. Algorithms, 1989
1988
SIAM J. Comput., 1988
1987
An algorithm for a separable integer programming problem with cumulatively bounded variables.
Discret. Appl. Math., 1987
1986
On a Multidimensional Search Technique and its Application to the Euclidean OneCentre Problem.
SIAM J. Comput., 1986
Math. Program., 1986
J. Algorithms, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Discret. Appl. Math., 1985
1984
SIAM J. Comput., 1984
Math. Program., 1984
Inf. Process. Lett., 1984
1983
Math. Program., 1983
Math. Oper. Res., 1983
1982
Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints.
Math. Program., 1982
1980
Math. Program., 1980
Math. Program., 1980
1977
Math. Program., 1977