Volume 13,
Number 1,
January 1970
- Ugo Montanari:
A Note on Minimal Length Polygongal Approximation to a Digitized Contour.
41-47
Volume 13,
Number 2,
February 1970
- Jay Earley:
An Efficient Context-Free Parsing Algorithm.
94-102
- James R. Bell:
The Quadratic Quotient Method: a Hash Code Eliminating Secondary Clustering.
107-109
Volume 13,
Number 6,
June 1970
- Howard A. Elder:
On the feasibility of voice input to an on-line computer processing system.
339-346
- C. R. Muthukrishnan, V. Rajaraman:
On the conversion of decision tables to computer programs.
347-351
- Joseph E. Grimes:
Scheduling to reduce conflict in meetings.
351-352
- Donald G. Frantz:
A PL/1 program to assist the comparative linguist.
353-356
- Fred Damerau:
Automatic parsing for content analysis.
356-360
- Peter Linz:
Accurate floating-point summation.
361-362
- Kenneth E. Hillstrom:
Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands.
362-365
- G. W. Stewart:
Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices.
365-367
- Phillip J. Chase:
Algorithm 382: combinations of M out of N objects [G6].
368
- Phillip J. Chase:
Algorithm 383: permutations of a set with repetitions [G6].
368-369
- G. W. Stewart:
Algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix.
369-371
- Ralph L. London:
Certification of algorithm 245 [M1]: treesort 3: proof of algorithms - a new kind of certification.
371-373
- J. P. Chandler, W. C. Harrison:
Remark on algorithm 201 [M1]: shellsort.
373-374
- George C. Wallick:
Remark on algorithm 351 [D1]: modified Romberg quadrature.
374-376
- Bruce Shriver, Patricia J. Eberlein, R. D. Dixon:
Remark on algorithm 361 [G6]: permanent function of a square matrix I and II.
376
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
377-387
Volume 13,
Number 7,
July 1970
- Burton H. Bloom:
Space/Time Trade-offs in Hash Coding with Allowable Errors.
422-426
Volume 13,
Number 10,
October 1970
Volume 13,
Number 11,
November 1970
- Walter M. Carlson:
ACM President's Letter: The fourth estate - the computer revolution.
649
- Paul S. LaFata, J. Ben Rosen:
An interactive display for approximation by linear programming.
651-659
- Vincent Y. Lum:
Multi-Attribute Retrieval with Combined Indexes.
660-665
- Charles J. Mifsud:
A multiple-precision division algorithm.
666-668
- Kenneth Conrow, Ronald G. Smith:
NEATER2: a PL/I source statement reformatter.
669-675
- James R. Bell, Charles H. Kaman:
The linear quotient hash code.
675-676
- C. J. Cheney:
A Nonrecursive List Compacting Algorithm.
677-678
- C. Kerpelman:
Recorded magnetic tape for information interchange (1600 CPI, phase encoded).
679-685
- M. Stuart Lynn:
Unrecorded magnetic tape for information interchange (9 track-200 and 800 CPI, NRZI and 1600 CPI, P.E.).
686-692
- Paul Bratley:
Algorithms 401: an improved algorithm to produce complex primes.
693
- Maarten H. van Emden:
Algorithms 402: Increasing the efficiency of quicksort.
693-694
- William Knight:
Remark on algorithm 343: Eigenvalues and eigenvectors of a real general matrix.
694-695
- Paul Bratley:
Remarks on algorithms 372: Algorithm 401: An algorithm to produce complex primes, csieve: an improved algorithm to produce complex primes.
695
- William J. Wilson:
A generalized method for generating argument/function values.
696-697
- John R. Ehrman:
Correction to ``logical'' arithmetric on computers with two's complement binary arithmetic.
697-698
- Arthur J. Bernstein:
Comment on the working set model for program behavior.
698-699
- Jon G. Rokne:
Condition numbers of Pei matrices.
699
Volume 13,
Number 12,
December 1970
Copyright © Fri Mar 12 17:24:52 2010
by Michael Ley (ley@uni-trier.de)
