Randomized algorithms for computer networks
Lead Research Organisation:
University of Leeds
Department Name: Sch of Computing
Abstract
Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.
Organisations
People |
ORCID iD |
| Martin Edward Dyer (Principal Investigator) |
Publications
Dyer M
(2016)
Graph classes and the switch Markov chain for matchings
in Annales de la Faculté des sciences de Toulouse : Mathématiques
Dyer Martin
(2015)
On the switch Markov chain for perfect matchings
in arXiv e-prints
Dyer M
(2019)
Quasimonotone graphs
in Discrete Applied Mathematics
Cooper C
(2019)
The flip Markov chain for connected regular graphs
in Discrete Applied Mathematics
Dyer J
(2019)
Practical homomorphic encryption over the integers for secure computation in the cloud
in International Journal of Information Security
Dyer M
(2015)
On the chromatic number of a random hypergraph
in Journal of Combinatorial Theory, Series B
Dyer M
(2014)
Structure and eigenvalues of heat-bath Markov chains
in Linear Algebra and its Applications
Dyer M
(2013)
A simple randomised algorithm for convex optimisation Application to two-stage stochastic programming
in Mathematical Programming
Dyer M
(2019)
Counting Perfect Matchings and the Switch Chain
in SIAM Journal on Discrete Mathematics
Cooper C
(2018)
Discordant Voting Processes on Finite Graphs
in SIAM Journal on Discrete Mathematics
| Description | Please see the submission of Prof. Colin Cooper, the PI on the grant. |
| Sector | Digital/Communication/Information Technologies (including Software) |
| Impact Types | Economic |