The 21st Meeting on Algorithm Engineering and Experiments (ALENEX) will take place in San Diego, CA on January 7-8, 2019. The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures.
Relevant areas of applied algorithmic research include but are not limited to: databases; geometry; graphs and networks, including web applications; operations research; combinatorial aspects of scientific computing; and computational problems in the natural sciences or engineering.
Also encouraged are submissions that address algorithms and data structures for advanced models of computing, including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to high-performance and cloud computing.
ALENEX is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA19), Analytic Algorithmics and Combinatorics (ANALCO19) and Symposium on Simplicity in Algorithms. Since researchers in all fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop.
Proceedings of ALENEX and ANALCO will be published openly and electronically in January 2019 as SIAM ePubs. A special section of the ACM Journal of Experimental Algorithmics will be dedicated to selected papers from ALENEX19.
ALENEX is supported by SIAM (Society for Industrial and Applied Mathematics).
For detailed information about ALENEX19 submissions, please see the Submissions page.