Serge Gaspers

My research is about the study of intractable computational problems. I design new algorithms for these NP-hard problems, analyse their running time, and make fine-grained complexity classifications. I am interested in deterministic, randomized, and quantum algorithms. I consider simple-to-state, fundamental computational problems with applications in diverse areas and I have mainly looked at problems from Boolean satisfiability and constraint satisfaction, networks and graphs, and algorithmic decision theory.

UNSW Algorithms group

The UNSW algorithms group brings together academics at UNSW with research interests in algorithms and complexity. It is hosted by the school of computer science and engineering and includes external members from the school of mathematics and statistics.

Algorithms are at the heart of all information processing. We design and analyse algorithms in terms of resource requirements (time, space, randomness) and we study their limitations. Research in this field emphasises mathematical technique and rigour.