The European Symposium on Algorithms (ESA) is an international conference covering the field of
algorithms
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing c ...
. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in
Springer Lecture Notes in Computer Science
''Lecture Notes in Computer Science'' is a series of computer science books published by Springer Science+Business Media since 1973.
Overview
The series contains proceedings, post-proceedings, monographs, and Festschrifts. In addition, tutorials, ...
. Acceptance rate of ESA is 24% in 2012 in both ''Design and Analysis'' and ''Engineering and Applications'' tracks.
History
The first ESA was held in 1993 and contained 35 papers. The intended scope was all research in algorithms, theoretical as well as applied, carried out in the fields of
computer science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...
and
discrete mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous f ...
. An explicit aim was to intensify the exchange between these two research communities.
In 2002, ESA incorporated the conference Workshop on Algorithms Engineering (WAE). In its current format, ESA contains two distinct tracks with their own programme committees: a track on the design an
analysis of algorithms
In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute them. Usually, this involves determining a function that re ...
, and a track on engineering and applications, together accepting around 70 contributions.
ALGO conferences
Since 2001, ESA is co-located with other algorithms conferences and workshops in a combined meeting called ALGO. This is the largest European event devoted to algorithms, attracting hundreds of researchers.
Other events in the ALGO conferences include the following.
* WABI, the
Workshop on Algorithms in Bioinformatics
The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer ...
, is part of ALGO in most years.
* WAOA, the Workshop on Approximation and Online Algorithms, has been part of ALGO since 2003.
* ATMOS, the Workshop on Algorithmic Approaches for Transportation Modeling, Optimization and Systems, formerly the ''Workshop on Algorithmic Methods and Models for Optimization of Railways'', has been part of ALGO in 2003–2006 and 2008–2009.
* IPEC, the International Symposium on Parameterized and Exact Computation, founded in 2004 and formerly the International Workshop on Parameterized and Exact Computation (IWPEC), is part of ALGO since 2011
ATMOS was co-located with the
International Colloquium on Automata, Languages and Programming (ICALP) in 2001–2002.
References
External links
*
Index of ESA proceedingsat
DBLPList of ESA proceedingsat
SpringerLinkALGO History
{{Authority control
Theoretical computer science conferences