Home
Parameterized Complexity for Practical Computing

The Parameterized Algorithms and Computational Experiments Challenge

PACE - uniting FPT and practice!

PACE turtle
Coached by the FPT platypus, the PACE turtle succeeds.
Photo:
Felix Reidl

Main content

Check out the PACE 2019 call for participation!

PACE is an annual challenge which aims to increase awareness of the relevance of algorithm engineering, in addition to help deepen the relationship between parameterized algorithmics and practice. The PACE steering committee have defined five main aims of the challenge:

  1. Provide a bridge between the theory of design and analysis of algorithms and the algorithm engineering practice
  2. Inspire new theoretical developments
  3. Investigate the competitiveness of analytical and design frameworks developed in the communities
  4. Produce universally accessible libraries of implementations and repositories of benchmark instances
  5. Encourage the dissemination of these findings in scientific papers

Who is it for, and how does it work?

The challenge is aimed for the young computer scientists which can participate alone or in teams. For each challenge, you will be presented with 2 – 3 tracks, and you can choose how many tracks, and which track you want to participate on. As the submission is online, you can participate from anywhere in the world. 

How did it start? 

Our own professor in computer science, Frances Rosamond, was deeply involved in starting up the PACE programming challenge (Parameterized Algorithms and Computational Experiments). The first PACE challenge was held in 2016, and within the completion of the second challenge in 2017, about 25 teams had participated, with approximately 80 participants from more than 30 countries.