Please fill in the sections below, some fields are required*, to continue. Using the Quick Form to subscribe to an ACM Publication will take you less than 5 minutes.
ACM Online TALG – ACM Transactions on Algorithms deal with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis; in particular 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.
