We are advertising three 3-year PhD scholarships in algorithms at
The University of Sydney, Australia.
The successful applicant will conduct research with Joachim Gudmundsson,
William Umboh, and André van Renssen in the Sydney Algorithms and
Computing Theory (SACT) group.
The specific topic will depend on the skills and interests of the student and
could include for example computational geometry, network design, routing,
trajectory analysis, approximation algorithms, and online algorithms.
The Full Scholarship will provide tuition fees and annual stipend
allowance for up to three years, subject to satisfactory academic performance.
The recipient may apply for an extension of up to 6 months.
For more details about the positions and on how to apply:
Application date: 27 February 2020 (Sydney time).
Please forward to anyone who might be interested.
If you have any questions, you are welcome to mail us directly