Dear all,
We are looking for a highly motivated student interested in distributed algorithms and theoretical computer science.
The research will focus on the theoretical foundations of distributed computing with the overarching goal of designing algorithms that are communication- and time-efficient. Obtaining such algorithms is important for several application domains, and the trajectory of the research will be shaped by the interests of the successful candidate. One possible direction is to come up with new distributed algorithms that solve fundamental graph problems that scale to massive graph data sets. A different possible direction is to devise algorithmic techniques for achieving robustness in networks against adversarial attacks.
A crucial part of the project is to mathematically prove the correctness and complexity bounds of the obtained algorithms. To understand whether the obtained algorithms are close to being optimal, part of this project may also focus on discovering new lower bounds.
Having a strong interest and background in algorithms and theoretical computer science is essential. Being familiar with distributed computing is helpful but not required. This is a theory-focused project, and hence programming skills are not required.
The successful candidate will work in the Computer Science Department at the City University of Hong Kong.
For more concrete examples about this type of research, please take a look at the publications by following this link:
https://scholars.cityu.edu.hk/en/persons/peter-robinson(88933406-00e9-4377-9e3c-73af835ca457).html
Interested? Applications for the PhD program can be submitted here:
https://www.cityu.edu.hk/pg/research-degree-programmes
Once you have applied, please get in touch with me to further discuss your application.
Best,
Peter
**********************************************************
*
* 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/
*
**********************************************************