University is one of the best known universities in the UK. It is a
top-ten rated university in England for research intensity (REF2014) and
presents an outstanding student life having been consistently ranked as
a top UK university for student satisfaction. It has one of the largest
closed university campuses in the UK and is internationally renowned
for its sports (World #1 in QS rankings). Computer Science
is a vibrant department in the school of Science
with a cohesive community of researchers and outstanding research: http://www.lboro.ac.uk/departments/compsci/
student will also benefit from the active national and international
collaboration of the supervisor and his colleagues with institutes
across the UK, USA, mainland Europe, Israel, Mexico and India.
---------------------------Outline of possible research avenues:
This studentship seeks to design and mathematically analyse algorithms
and build foundational theory motivated by present day and futuristic
networks (particularly graph based algorithms with tools from areas such
as graph theory, algorithm analysis, probability, game theory etc).
Networks are pervasive and diverse and, with social networks and the
upcoming Internet of Things (IOT), likely to be deeply integrated into
our society. Networks often rely upon distributed protocols for their
functioning. Failure of components and security also make resilience a
critical issue. Distributed graph algorithms allow us to model, explore
and design solutions for all kinds of networks. This project seeks to
emphasize these scenarios and explore questions about decentralisation.
We seek candidates with strong interest in and willing to explore
topics from, but not restricted to the following: i) Graph algorithms
and theory, ii) Self-healing, byzantine and other forms of resilient
algorithms, iii) Compact routing and memory limited algorithms, iv)
Static and dynamic Leader election and consensus, v) Connections between
distributed algorithms and research areas such as parameterised
complexity, topology, combinatorics, communication complexity, spectral,
algebraic tools, vi) Algorithmic game theory and decision making, vi)
Modelling and application to modern networks such as IOT and SDN.
The successful candidate will work closely with active research
groups centred around both CS theory and networks. In particular, the
candidate can benefit from interaction with upcoming research on compact
self-healing routing algorithms supported by EPSRC (EPSRC research grant EP/P021247/1).