ACM Journal on Experimental Algorithmics.

Algorithms         Data Structures         Experiments         Analysis

 


About JEA

The Journal of Experimental Algorithmics (ISSN 1084-6654) is published by The Association for Computing Machinery. The journal is entirely paperless. It contains refereed articles organized by volume and article number, together with software and data files that accompany most articles.

These articles and files are accessible via the Internet as part of the ACM Digital Library (which holds online versions of every ACM publication). Access to the text of the articles requires a subscription. Access to the software and data, to the ACM Digital Library's browsing and searching facilities, and to information about articles (such as abstracts, bibliographies, and citation lists) is free.

Aim and Scope

The ACM JEA is a high-quality, refereed, archival journal devoted to the study of discrete algorithms and data structures through a combination of experimentation and classical analysis and design techniques. It focuses on the following areas in algorithms and data structures:
  • combinatorial optimization
  • computational biology
  • computational geometry
  • graph manipulation
  • graphics
  • heuristics
  • network design
  • parallel processing
  • routing and scheduling
  • searching and sorting
  • VLSI design

The ACM JEA was established to address the following issues:

  • The empirical study of combinatorial algorithms is a rapidly growing research area, with no proper outlet for publication.
  • Communication among researchers in this area must include more than a summary of results or a discussion of methods; the actual programs and data used are of critical importance.
  • Many published algorithms and data structures have never been implemented by anyone and are at risk of remaining theoretical ``curiosities.'' To bring such algorithms and data structures into the practical realm often requires considerable sophistication; researchers need to be encouraged to turn their talents in that direction.
  • Most researchers find that they must program their own version of this or that well-known algorithm or data structure, because repositories for these are not available.
  • The two preceding reasons also explain why practitioners only rarely use state-of-the-art algorithms and data structures; a repository of routines, most with well documented behavior on realistic test cases, will encourage practitioners to use more recent results.

Therefore, the ACM JEA has two principal aims:

  • To stimulate research in algorithms based upon implementation and experimentation; in particular, to encourage testing, evaluation and reuse of complex theoretical algorithms and data structures.

  • To distribute programs and testbeds throughout the research community and to provide a repository of useful programs and packages to both researchers and practitioners.

For more information about scope and content of the ACM JEA, consult the Call for Papers.

Submitting to the ACM JEA

Submissions, refereeing, and all correspondence are conducted through the Internet at www.jea.acm.org.

Submissions to JEA typically include an article, a suite of programs, and a collection of test data and computational results. Accepted submissions are placed on-line, with all code and data made public, so that accumulated contributions build a well tested and well documented library of discrete algorithms and data structures (as well as test cases and application examples), for use by researchers and practitioners alike.

For more information about submitting to the ACM JEA, read the instructions for authors at the journal website. Inquiries may be sent to any member of the editorial board, or to the Editor in Chief at italiano@disp.uniroma2.it .