Journal of the ACM (JACM)


Search Issue
enter search term and/or author name


Journal of the ACM (JACM), Volume 15 Issue 1, Jan. 1968

Computers Then and Now
Maurice V. Wilkes
Pages: 1-7
DOI: 10.1145/321439.321440
Reminiscences on the early developments leading to large scale electronic computers show that it took much longer than was expected for the first of the more ambitious and fully engineered computers to be completed and prove themselves in...

Computer Evaluation of Indexing and Text Processing
G. Salton, M. E. Lesk
Pages: 8-36
DOI: 10.1145/321439.321441
Automatic indexing methods are evaluated and design criteria for modern information systems are derived....

PL360, a Programming Language for the 360 Computers
Niklaus Wirth
Pages: 37-74
DOI: 10.1145/321439.321442
A programming language for the IBM 360 computers and aspects of its implementation are described. The language, called PL360, provides the facilities of a symbolic machine language, but displays a structure defined by a recursive syntax. PL360...

Solution of Integer Linear Programming Problems by Direct Search
Robert E. Echols, Leon Cooper
Pages: 75-84
DOI: 10.1145/321439.321443
An approximate but fairly rapid method for solving integer linear programming problems is presented, which utilizes, in part, some of the philosophy of “direct search” methods. The method is divided into phases which can be applied...

Experiments With a Multipurpose, Theorem-Proving Heuristic Program
James R. Slagle, Philip Bursky
Pages: 85-99
DOI: 10.1145/321439.321444
The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the...

Statistical Estimation of the Numerical Solution of a Fredholm Integral Equation of the First Kind
Otto Neall Strand, Ed. R. Westwater
Pages: 100-114
DOI: 10.1145/321439.321445
A method for the numerical solution of a Fredholm integral equation of the first kind is derived and illustrated. The method employs an a priori constraint vector together with covariances of both the constraint vector and the measurement...

Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
H. Dubner, J. Abate
Pages: 115-123
DOI: 10.1145/321439.321446
In this paper the problem of readily determining the inverse Laplace transform numerically by a method which meets the efficiency requirements of automatic digital computation is discussed. Because the result inverse function is given as a...

Some Completeness Results in the Mathematical Theory of Computation
Donald M. Kaplan
Pages: 124-134
DOI: 10.1145/321439.321447
A formal theory is described which incorporates the “assignment” function a(i, k, &xgr;) and the “contents” function...

Structure and Transition-Preserving Functions of Finite Automata
Zamir Bavel
Pages: 135-158
DOI: 10.1145/321439.321448
Arbitrary finite automata are decomposed into their major substructures, the primaries. Several characterizations of homomorphisms, endomorphisms, isomorphisms, and automorphisms of arbitrary finite automata are presented via reduction to the...

A Permutation Network
Abraham Waksman
Pages: 159-163
DOI: 10.1145/321439.321449
In this paper the construction of a switching network capable of n!-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary...