The area of the research is primarily distributed graph algorithms in modern computational models. The successful candidate should have a background in graph optimisation problems, graph algorithm design and/or complexity theory (especially communication and query complexity). In addition, experience in complementary research areas such as dynamic algorithms, sublinear algorithms, quantum computation, and/or spectral graph theory will be of great advantage. Previous track-record in publishing high-quality research in flagship conferences is desirable.
The position comes with generous travel funding. Informal questions can be sent to s.mukhopadhyay@sheffield.ac.uk
The Department of Computer Science of the University of Sheffield (a Russell Group university) is a leading research body in computer science with 99% of its research output evaluated as world-leading and internationally excellent in the REF2021 exercise. The department also ranked eighth in research environment out of all UK computer science departments in REF2021. You will work in a well-connected team with world-leading reputations in research in algorithms and complexity. We are well known internationally for our research and are one of the largest research groups in the UK. Collaboration within the department is encouraged and supported.
Deadline: Nov 30, 2023.
**********************************************************
*
* 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
