offering a fully funded 3 year PhD studentship on Algorithms for Large
Graphs
Project Description
Graphs or networks are a natural way to describe structural information.
For example, users of Facebook and the acquaintance relations among them
form a social network, the proteins together with interactions between
them define a biological network, and web-pages and hyperlinks give rise
to a huge web graph. Due to the rapid development of information
technology, many such graphs become extremely large, and are constantly
changing, which poses great challenges for efficiently analysing their
structures. This project aims to tackle these challenges through the
design and analysis of graph algorithms in the modern computational
models, including sublinear algorithms (e.g., property testing,
streaming algorithms) that only read a small portion or store a small
sketch of the large input while still have provable performance
guarantees, and dynamic algorithms that update efficiently the solution
of a problem after dynamic changes over the graph. Practical
applications of these theoretical studies will also be considered.
This project will be supervised by Dr Pan Peng, and commences in October or
November 2019.
Prospective candidates should have excellent academic degree in computer
science, mathematics or a related area. The studentship requires good
background knowledge in Theoretical Computer Science, discrete
mathematics related to computer science and algorithm design.
Applications should include a detailed CV, proof of diplomas and
transcripts of records (BSc and MSc), and a cover letter detailing the
motivation and background. The application (or informal enquiries), in
English, must be send to Dr Pan Peng at p.peng@sheffield.ac.uk.
Funding Notes
This fully funded studentship is open to UK or EU students, and provides
a tax-free living allowance at the standard Research Council rate
(estimated £15,099 p.a. for 2019/20) and full student tuition fees for
three years.
We are also accepting applications from self-funded students and we
particularly welcome applicants through the China Scholarship Council
Scheme .
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
