Announcements
ScopeThe Symposium covers research in the use, design, and analysis of efficient algorithms and data structures in computer science, discrete applied mathematics and mathematical programming. ESA 2001 is sponsored by BRICS and EATCS (the European Association for Theoretical Computer Science) and jointly organized with WAE 2001 and WABI 2001 in the context of ALGO 2001. TopicsPapers presenting original research in all areas of algorithmic research are sought, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Computational Biology; Computational Geometry; Databases and Information Retrieval; External-memory Algorithms; Graph and Network Algorithms; Machine Learning; On-line Algorithms; Parallel and Distributed Computing; Pattern Matching and Data Compression; Randomized Algorithms; Symbolic Computation. The algorithms may be sequential, distributed or parallel, and they should be analyzed either mathematically or by rigorous computational experiments. Submissions that report on experimental and applied research are especially encouraged. Program Committee
ProceedingsThe proceedings of the workshop will be published by Springer-Verlag in the series Lecture Notes in Computer Science as Volume 2161.
Previous ESA symposiumsThe proceedings of previous ESA symposiums appear in the series Lecture Notes in Computer Science (LNCS), Springer-Verlag Heidelberg.
|