>
home

Latest Post

8 PhD Positions in Algorithms at The University of Sydney

Posted by ⋅

Eight PhD scholarships are available at the Sydney Algorithms and Computing Theory group (SACT), School of Computer Science, University of Sydney, Australia. The scholarships are in the following areas: computational geometry  computational logic and automata theory sublinear algorithms and computational learning The PhD scholarships include: tuition fee waiver living allowance AUD 35k/year funding to present … Continue reading →

2 Comments 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 97 other subscribers