ACM Transactions on Algorithms (TALG)


ACM Transactions on Algorithms (TALG)

Publisher: Association for Computing Machinery

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; parallel and distributed
computation; algorithms for graphs, geometry, arithmetic, algebra,
number theory, strings; on-line analysis; cryptography; coding; data
compression; learning algorithms; methods of algorithmic analysis;
and discrete algorithms for application areas such as biology,
economics, game theory, communication, computer systems and
architecture, hardware design, and scientific computing. This area
list will evolve as the research community explores new areas.

In addition to original research articles TALG will include special
features appearing from time to time such as invited columns and a
problems section.


Submissions to the TALG is done electronically through

Managing Editor:

Roma Simon

Content available through ACM Digital Library:

Content available by subscription. Abstracts available online.
Articles available in PDF format.

Current Issue: Volume 1 Issue 1 (July 2005)

Date: 19 August 2005

Original posting date: 
Friday, August 19, 2005
©1995 - 2014 Georgetown University Library
37th & O Streets NW Washington DC 20057-1174   •   202.687.7607