Research and Advances – Page 316 – Communications of the ACM

Even slowly convergent power series can be rearranged as series in Chebyshev polynomials if appropriate sequence transformations are used in evaluating the coefficients. The method is illustrated by computing the coefficients for the expansion of the logarithm and dilogarithm.

Henry C. Thacher

Theory

Mar 1 1964

Generating a canonical prefix encoding

Computer programs for generating a minimum-redundancy exhaustive prefix encoding are described. One program generates a Huffman frequency tree, another determines the structure functions of an encoding, and a third program assigns codes.

Eugene S. Schwartz and Bruce Kallick

Computing Applications

Mar 1 1964

Certification of algorithm 122: Tridiagonal matrix

Peter Naur

Computing Applications

Mar 1 1964

Certification of algorithm 150: SYMINV2

Peter Naur

Artificial Intelligence and Machine Learning

Mar 1 1964

The dangling “else”

John H. Matthewman

Computing Applications

Mar 1 1964

Comments on “a continued operation notation”

This note is intended to clarify and correct several points in a recent paper describing some notations for symbol manipulation by M. P. Barnett [Comm. ACM 6(August, 1963)].

M. P. Barnett, J. M. Gerard, and A. W. Sambles

Computing Applications

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More