ACM Transactions on Algorithms welcomes submissions of original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis. Most welcome are new algorithms and data structures, new and improved analyses, and complexity results. The Empirical Track of TALG is devoted to the study of discrete algorithms and data structures from an empirical perspective. We welcome original submissions of the highest quality that focus on design, implementation, and performance evaluation through a combination of experimentation and classical techniques.

Specific areas of computation covered by the journal include:

combinatorial searches and objects;
counting;
discrete optimization and approximation;
randomization and quantum computation;
parallel and distributed computation;
algorithms and data structures for graphs, geometry, arithmetic, number theory, strings
on-line analysis;
cryptography;
coding;
data compression;
learning algorithms;
methods of algorithmic analysis;
discrete algorithms for application areas such as biology, economics, game theory, communication