Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 24.

Article

Dyer, J orcid.org/0000-0001-5811-5263, Dyer, M and Djemame, K (2019) Order-Preserving Encryption Using Approximate Common Divisors. Journal of Information Security and Applications, 49. ARTN: 102391. ISSN 2214-2126

Dyer, J, Dyer, M and Xu, J orcid.org/0000-0002-4598-167X (2019) Practical homomorphic encryption over the integers for secure computation in the cloud. International Journal of Information Security, 18 (5). pp. 549-579. ISSN 1615-5262

Dyer, M and Muller, H (2019) Quasimonotone graphs. Discrete Applied Mathematics. ISSN 0166-218X

Dyer, M and Muller, H (2019) Counting Perfect Matchings and the Switch Chain. SIAM Journal on Discrete Mathematics, 33 (3). pp. 1146-1174. ISSN 0895-4801

Dyer, M and Müller, H (2019) Counting Independent Sets in Cocomparability Graphs. Information Processing Letters, 144. pp. 31-36. ISSN 0020-0190

Cooper, C, Dyer, M, Greenhill, C et al. (1 more author) (2019) The flip Markov chain for connected regular graphs. Discrete Applied Mathematics, 254. pp. 56-79. ISSN 0166-218X

Cooper, C, Dyer, M, Frieze, A et al. (1 more author) (2018) Discordant Voting Processes on Finite Graphs. SIAM Journal on Discrete Mathematics, 32 (4). pp. 2398-2420. ISSN 0895-4801

Dyer, M, Jerrum, M and Muller, H (2017) On the switch Markov chain for perfect matchings. Journal of the ACM, 64 (2). 12. ISSN 0004-5411

Dyer, M, Goldberg, LA and Richerby, D (2016) Counting 4×4 matrix partitions of graphs. Discrete Applied Mathematics, 213. pp. 76-92. ISSN 0166-218X

Dyer, M and Stougie, L (2015) Erratum to: Computational complexity of stochastic programming problems. Mathematical Programming. ISSN 0025-5610

Dyer, M, Frieze, A and Greenhill, C (2015) On the chromatic number of a random hypergraph. Journal of Combinatorial Theory, Series B, 113. pp. 68-122. ISSN 0095-8956

Chen, X, Dyer, M, Goldberg, LA et al. (4 more authors) (2015) The complexity of approximating conservative counting CSPs. Journal of Computer and System Sciences, 81 (1). 311 - 329. ISSN 0022-0000

Dyer, M, Kannan, R and Stougie, L (2014) A simple randomised algorithm for convex optimisation: Application to two-stage stochastic programming. Mathematical Programming, 147 (1-2). pp. 207-229. ISSN 0025-5610

Dyer, M, Greenhill, C and Ullrich, M (2014) Structure and eigenvalues of heat-bath Markov chains. Linear Algebra and Its Applications, 454. 57 - 71. ISSN 0024-3795

Bulaov, AA, Dyer, M, Goldberg, LA et al. (2 more authors) (2013) The Expressibility of Functions on the Boolean Domain, with Applications to Counting CSPs. Journal of the ACM, 60 (5). 32. ISSN 1535-9921

Dyer, M, Frieze, A, Hayes, TP et al. (1 more author) (2013) Randomly Coloring Constant Degree Graphs. Random Structures and Algorithms, 43 (2). 181 - 200. ISSN 1042-9832

Dyer, M and Richerby, D (2013) An effective dichotomy for the counting constraint satisfaction problem. SIAM Journal on Computing, 42 (3). 1245 - 1274. ISSN 0097-5397

Book Section

Dyer, M, Gärtner, B, Megiddo, N et al. (1 more author) (2017) Linear Programming. In: Handbook of Discrete and Computational Geometry, 3rd Edition. , pp. 1291-1309. ISBN 9781498711395

Proceedings Paper

Dyer, M, Greenhill, C and Müller, H (2019) Counting independent sets in graphs with bounded bipartite pathwidth. In: Sau, I and Thilikos, D, (eds.) 45th International Workshop on Graph-Theoretic Concepts in Computer Science. WG 2019, 19-21 Jun 2019, Vall de Nuria, Catalonia, Spain. Springer Verlag . (In Press)

Dyer, M and Muller, H (2018) Quasimonotone Graphs. In: Graph-Theoretic Concepts in Computer Science. 44th International Workshop on Graph-Theoretic Concepts in Computer Science, 27-29 Jun 2018, Cottbus, Germany. Springer , pp. 190-202.

Dyer, J, Dyer, M and Xu, J (2017) Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud. In: Lecture Notes in Computer Science. 16th IMA International Conference on Cryptography and Coding (IMACC 2017), 12-14 Dec 2017, Oxford, UK. Springer, Cham , pp. 44-76. ISBN 9783319710440

Dyer, J, Dyer, M and Xu, J (2017) Order-preserving encryption using approximate integer common divisors. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ESORICS 2017 International Workshops, DPM 2017 and CBT 2017, 14-15 Sep 2017, Oslo, Norway. Springer International Publishing , pp. 257-274. ISBN 978-3-319-67816-0

Cooper, C, Dyer, M, Frieze, A et al. (1 more author) (2016) Discordant voting processes on finite graphs. In: Leibniz International Proceedings in Informatics, LIPIcs. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 11-15 Jul 2016, Rome, Italy. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 9783959770132

Chen, X, Dyer, M, Goldberg, LA et al. (4 more authors) (2013) The complexity of approximating conservative counting CSPs. In: Portier, N and Wilke, T, (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 30th Symposium on Theoretical Aspects of Computer Science (STACS’13), 27 Feb - 02 Mar 2013, Kiel, Germany. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, Dagstuhl Publishing , pp. 148-159.

This list was generated on Sun Oct 13 18:29:36 2019 BST.