Designing Efficient Distributed Graph Algorithms
This project seeks to design and mathematically analyse distributed graph algorithms. Distributed graph algorithms allow us to model, explore and design solutions for all kinds of networks (computers/human/social).
Networks are pervasive and diverse and deeply integrated into our society. Networks often rely upon distributed protocols for their functioning. Failure of components and security also makes resilience a critical issue. Reseach will focus upon theoretical and mathematical algorithm design and analysis of algorithms on graphs (which are a good abstraction for networks).
We seek candidates who have strong interest in the following:
i) Self-healing, byzantine and other forms of resilient algorithms
ii) Compact routing and memory limited algorithms (ref: https://arxiv.org/abs/1803.03042)
iii) Static and dynamic Leader election and consensus
iv) Techniques such as topology, spectral and algebraic tools and communication complexity
v) Game theory applied to distributed algorithms and decision making
vi) Modelling and application to modern networks such as IOT and SDN.
Links to find out more:
Entry requirements Applicants should have, or expect to achieve, at least a 2:1 Honours degree (or equivalent) in Computer Science/Mathematics
How to apply All applications are made online, please select the school/department name under the programme name section and include the quote reference number: CO/AT-Un1/2019
This is an open call for candidates who are sponsored or who have their own funding. If you do not have funding, you may still apply, however Institutional funding is not guaranteed. Outstanding candidates (UK/EU/International) without funding will be considered for funding opportunities which may become available in the School.