ESA 2024 – ALGO2024
The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms and is a part of ALGO 2024, to be held at Royal Holloway, University of London in Egham, United Kingdom. The symposium seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications. Papers with a strong emphasis on the theoretical analysis of algorithms should be submitted to Track A, while papers reporting on the results of extensive experimental evaluations and/or providing original contributions to the engineering of algorithms for practical applications should be submitted to Track B. Submissions that prove or explain results, possibly already known, in a particularly clear, simple or elegant way should be submitted to Track S. There will be a Best Student Paper Award as well as a Best Paper Award, both sponsored by EATCS. In order for a paper to be considered for the Best Student Paper Award, all of its authors are required to be students at th
ESA 2024 – ALGO2024 Skip to content ESA 2024 Scope The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms and is a part of ALGO 2024 , to be held at Royal Holloway, University of London in Egham, United Kingdom. Important Dates (all tracks) Paper submission deadline: 22 April, 23:59 AoE ( EasyChair submission system ) Notification: 23 June Camera ready: 30 June Conference: 2-4 September Call for Papers The symposium seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications. Papers with a strong emphas
Explore this link on the map →related reading
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- ITCS 2024 - Program and Scheduleitcs-conf.org
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- Tim Roughgarden's Lecture Notestimroughgarden.org
- Easy Peasy at EC'26 — Rome, July 6, 2026tlundy832.github.io
- cs.cmu.edu/~yangp/cs.cmu.edu
- Computational Complexityblog.computationalcomplexity.org
- Cover times - spectralarxiv.org
- Algorithmic Game Theory (CS364A), Fall 2013timroughgarden.org
- Call for Papersconferences.au.dk
- Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazinequantamagazine.org