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. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged 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 exascale and cloud computing.
ALENEX is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA18), and Analytic Algorithmics and Combinatorics (ANALCO18). 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 2018. A special section of the ACM Journal of Experimental Algorithmics will be dedicated to selected papers from ALENEX18.
ALENEX is supported by SIAM (Society for Industrial and Applied Mathematics).