Conference held January 2004, New Orleans, Louisiana

The aim of the annual ALENEX workshop is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures.

The ANALCO workshop presents a collection of original research in the analysis of algorithms and associated combinatorial structures. The papers study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and address the precise analysis of algorithms for processing such structures, including average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms.

This proceedings collects extended versions of the 14 papers that were selected for presentation from the ALENEX workshop and 10 papers selected for presentation from the ANALCO workshop.