Latest Post

SACT Seminar

Time: 1:00 pm Tuesday, 15th August 2017. Location: SIT 459 Speaker: Hubert Chan, The University of Hong Kong Title: Revisiting Diffusion Process for Hypergraph Laplacian Abstract: Hypergraph Laplacian has been defined via a diffusion process [Louis STOC 2015].  The spectral properties of the Laplacian is used to achieve a variant of the Cheeger’s inequality for hyperedge expansion and … Continue reading


  • 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.

Event calendar

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

Join 60 other followers