European Symposium on Algorithms: Difference between revisions

Revision as of 05:42, 9 September 2023

Revision as of 09:57, 20 September 2023

Line 14:

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]] and [[discrete mathematics]]. An explicit aim was to intensify the exchange between these two research communities.

=== '''Workshop on Algorithms Engineering''' ===

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]], and a track on engineering and applications, together accepting around 70 contributions.

Line 20:

=== ESA Test-of-Time Award ===

The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding papers in algorithms research that were published in the ESA proceedings 19-2119–21 years ago and which are still influential and stimulating for the field today.<ref>{{Cite web |title=Test-of-Time Award – ESA |url=https://algo-conference.org/esa/test-of-time-award/ |access-date=2023-08-29 |language=en-US}}</ref> Because the [[#History|'''Workshop on Algorithms Engineering''' ('''WAE''')]] merged in with ESA, the Steering Committee decided that the papers from WAE 1999 to WAE 2001 were also to be considered.

{| class="wikitable"

|+ESA Test-of-Time Award

Line 33:

|-

|2021

|Andrew Goldberg, Jason Hartline: Competitive Auctions for Multiple Digital Goods. In ESA 2001

Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, and Russell Schwartz: SNPs Problems, Complexity, and Algorithms. In ESA 2001

Line 140:

KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation

|}

Since 2022, ESA also awards the best paper for the Simplicity Track:

* 2022. Alejandro Flores-Velazco: Improved Search of Relevant Points for Nearest-Neighbor Classification.