>
home

Latest Post

3 PhD Position in Algorithms at The University of Sydney

Posted by ⋅

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 … Continue reading →

Leave a comment Announcements

Updates

  • Together with UNSW's algorithms group the SACT group will organise a pre-ISAAC algorithms workshop.  The focus of the workshop will be Fixed Parameter Computational Geometry. (more…)

About the group

The Sydney Algorithms and Computing Theory group nucleates researchers from the University of Sydney interested in foundational aspects of computer science. Our research interests include algorithmic game theory, combinatorial optimization, computational complexity, computational geometry, graph drawing, and machine learning. The unifying theme running through our research is the inquiry into the nature of efficient computation.

Here you will find information about our people, our seminar, and the courses we offer.

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 73 other followers