Spectral Algorithms at the University of Edinburgh.
The position is funded by the £1.5M EPSRC Fellowship of He Sun on
"Efficient Spectral Algorithms for Massive and Dynamic Graphs". This
fellowship aims at advancing our understanding of fundamental spectral
techniques, investigating new spectral algorithms for fundamental
graph problems, as well as implementing and evaluating these
algorithms on large-scale data sets.
This post will involve working on graph sparsification and its
applications, and will be a member of the Laboratory for Foundations
of Computer Science (LFCS) at Edinburgh. There will be opportunities
to take responsibility for supervising PhD students and collaborating
with the project partners on related research problems, all within the
freedom of an academic research environment. In addition, the post
will receive support for travel and collaborating with other
researchers.
For informal queries, please contact He Sun at h.sun@ed.ac.uk
Deadline for application: 9 December 2019.
Shortlisted candidates will be contacted in December or January for an
interview.
For more information and the application procedure, please see the link below:
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=050307
**********************************************************
*
* 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
