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. 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 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,

computer systems and architecture,

hardware design,

scientific computing