European Symposia on Algorithms

General information

The Symposium covers research in efficient algorithms and data structures in computer science, discrete applied mathematics, operations research and mathematical programming. Starting from 2002, the symposium has two tracks:

  • Design and Analysis Track

    Design and mathematical analysis of algorithms
  • Engineering and Application Track

    Real-world applications, engineering and experimental analysis of algorithms
  • New in 2022: Simplicity Track

    Proofs or algorithms that show already known results in a much more simple and elegant way

Each track has its own program committee. Papers are submitted to a particular track, but the committees have the right to move papers between tracks.

In 2014, the ESA community decided to start an ESA Test-of-Time Award to recognize paper(s) from ESA Proceedings from 19-21 years ago which are still influential and stimulating for the field today.


  • New Simplicity Track (S)

    This year, the European Symposium on Algorithms ESA’22 will have a Track S (for Simplicity) inviting contributions that simplify algorithmic results. We would like to expand the community around simplification of algorithmic results, encourage and reward research towards simplification and clarity. We find that simpler algorithms are easier to implement, bridging the gap between theory and practice, and we find that new simple or elegant proofs are easier to understand and to teach, and may contain interesting new insights whose relevance only the future will reveal. Track S submissions will primarily be judged on the simplicity and elegance of their proofs or algorithms, and the clarity of their presentation. Submissions that improve on the state of the art from a theoretical or practical viewpoint should instead be submitted to tracks A or B. Track S runs as an experiment for the 2022 ESA in Potsdam, Germany, and the submission/acceptance deadlines follow the schedule for tracks A and B.

  • The ESA Test-of-Time Award 2020 goes to

    Rasmus Pagh, Flemming Friche Rodler
    Cuckoo Hashing
    Proceedings of ESA 2001, pp. 121-133
    Appeared also in J. Algorithms 41(2): 122-144 (2004)

    The paper on Cuckoo Hashing by Rasmus Pagh and Flemming Friche Rodler addresses the fundamental problem of designing an efficient data structure that supports key lookups under insertions and deletions. The Cuckoo Hashing design facilitates lookup and deletion of keys in worst-case constant time and insertions of keys in expected constant time. With its rare combination of simplicity and elegance, the work has been highly influential both in theory and in practice. In the two decades since its introduction in ESA 2001, the data structure has become a textbook classic and initiated significant followup work with well over a thousand citations. Cuckoo hashing and its variations are broadly implemented and used in critical applications that require small worst-case lookup times, such as computation on Graphic Processing Units (GPUs) or internet routing.

    more information

ESA Locations and Links