CACM - volume 10 - 1967 论文列表 |
| 点击这里查看 Communications of the ACM 的JCR分区、影响因子等信息 |
Volume 10, Number 12, December 1967
E. V. Krishnamurthy Salil K. Nandi
The ALCOR Illinois 7090/7094 post mortem dump.Rudolf Bayer David Gries Manfred Paul Hans-Rüdiger Wiehle
Algorithm 318: Chebyschev curve-fit. Eigenvectors of a 2n×2n matrix. An online editor.L. Peter Deutsch Butler W. Lampson
A SIMSCRIPT-FORTRAN case study. Algorithms for finding a fundamental set of cycles for an undirected linear graph.C. C. Gotlieb Derek G. Corneil
A system organization for resource allocation.David M. Dahm T. H. Gerbstadt M. M. Pacelli
The LACONIQ monitor: time sharing for online dialogues. A multiprogramming environment for online data acquisition and analysis. Re family membership in ACM. Use Chinese for zero and oh? In memory of Richard Goodman. Phas-structure productions in PL/I: Phas-structure productions in PL/I0.Volume 10, Number 11, November 1967
D. B. Dulley Michael L. V. Pitteway
On the expected gain from adjusting matched term retrieval systems. A computer system for inference execution and data retrieval. Automatic data compression.B. A. Marron Paul A. D. de Maine
Methods for analyzing data from computer simulation experiments.Thomas H. Naylor Kenneth Wertz Thomas H. Wonnacott
An experimental model of system/360. GEORGE 3 - A general purpose time sharing and operating system. Character coding for information processing interchange. M in Z: a game for man-machine studies. Remark on Langdon's algorithm. A rational approximation optimal by Moursund's criterion. Improvements based on computed errors.Volume 10, Number 10, October 1967
Malcolm C. Harrison J. T. Schwartz
A stopping criterion for polynomial root finding. On computing the fast Fourier transform. Microprogramming under a page on demand strategy. A grammar base question-answering procedure. Three fonts of computer drawn letters. Decomposition programming: an analysis of matrix substructure. The ML/I macro processor. The remaining trouble spots in ALGOL 60. On "numerical integration of a function that has a pole". What are the most promising avenues of approach to attaining MT? Further clarification of dates. Pinpointing the dates of data examined by the ALPAC. The hardware-software complementarity.Volume 10, Number 9, September 1967
B. J. Austin T. S. Holden R. H. Hudson
A comment on index register allocation. Dynamic computation of derivatives. Algorithm 311: Prime number generator 2. Algorithm 310: Prime number generator 1. An algorithm for class scheduling with section preference. A language for modeling and simulating dynamic systems.R. J. Parente Howard S. Krasnow
A microprogrammed implementation of EULER on IBM system/360 model 30. Computer formulation of the equations of motion using tensor notation. Tele-CUPL: a telephone time sharing system. Precision calculations of e and constants. Special report: legal safeguards to insure privacy in a computer society. Another aspect of economical polynomials. Comments on time sharing. Change CACM and journal format?Volume 10, Number 8, August 1967
Antonino Machado Souza Filho Georges Schwachheim
Parsing of decision tables. An efficient machine-independent procedure for garbage collection in various list structures. A comparison of batch processing and instant turnaround. On compiling algorithms for arithmetic expressions. The AED free storage package. Contextual understanding by computers. A comment on Galler's letter. A computer technique for displaying n-dimensional hyperobjects. President's letter to the ACM membership. Böhm and Jacopini's reduction of flow charts. Thoughts on continuous change simulation languages.Volume 10, Number 7, July 1967
Volume 10, Number 6, June 1967
Volume 10, Number 5, May 1967
Salil K. Nandi E. V. Krishnamurthy
An algorithm for generating permutations. On the computer enumeration of finite topologies.J. W. Evans Frank Harary M. Stuart Lynn
Certification of Algorithm 279: Chebyshev quadrature. Certification of Algorithm 30: Numerical solution of the polynomial equation. Remark on Algorithm 28: Least squares fit by orthogonal polynomials. Algorithm 302: Transpose vector stored array. Algorithm 301: Airy function.Gillian Bond Michael L. V. Pitteway
Parallel numerical methods for the solution of equations. POSE: a language for posing problems to a computer. A multiprogramming monitor for small machines. Further analysis of a computing center environment.Edward S. Walter Victor L. Wallace
An experimental comparison of time sharing and batch processing.Martin Schatzoff R. Tsao R. Wing
FORTRAN subroutines for scalar products. Comments on "levels of computer systems". What is the true value of conferences? Letter to the Editor: The President's letter.What level for ACM publications?
Volume 10, Number 4, April 1967
Andrew D. Hall Forman S. Action
A method for the solution of transportation problems with tall matrices.Paul S. Dwyer Bernard A. Galler
Scheduling project networks. Corrigenda: computer systems. Corrigenda: numerical analysis. A note: Top-to-bottom parsing rehabilitated?. One-Pass compilation of arithmetic expressions for a parallel processor. A proposal for definitions in ALGOL. The European computer gap. ESC facility in USASCII. Mr. Roberts and Mr. Flores reply. On "systematic generation of Hamiltonian circuits".Volume 10, Number 3, March 1967
Daniel G. Bobrow Daniel L. Murphy
Application of level changing to a multilevel storage organization. A reply to Fulkerson's comments. Should there be a CS undergraduate program? The emergence of a profession. President's letter to the ACM membership. More on processing 64-channel cards. Aesop and the referee: a fable. Call for information: law and data processing. Additional comments on a problem in concurrent programming control. "Panini-Backus Form" suggested. Format effectors in ISO7 and ASCII.Volume 10, Number 2, February 1967
Stan Shannon Claudia I. Henschke
Computer representation of planar regions by their skeletons.John L. Pfaltz Azriel Rosenfeld
Testing a random number generator. Programming the tabular method of analysis of variance for factorial experiments. A modified Newton method for polynomials. 27 bits are not enough for 8-digit accuracy. Parameters for pseudo Runge-Kutta methods. Invariant imbedding and the numerical integration of boundary-value problems for unstable linear systems of ordinary differential equations. Problems in the statistical analysis of simulation experiments: the comparision of means and the length of sample records. Sorting by replacement selecting. Algorithm 296: Generalized least squares fit by orthogonal polynomials. Algorithm 295: Exponential curve fit. Abacus computation in number systems of bases other than ten. A use of fast and slow memories in list-processing languages. Time sharing on a computer with a small memory.Volume 10, Number 1, January 1967
William J. Cody Anthony Ralston
DITRAN - a compiler emphasizing diagnostics. WATFOR - The University of Waterloo FORTRAN IV compiler.Peter W. Shantz R. A. German J. G. Mitchell R. S. K. Shirley C. Robert Zarnke
Uniform random. Data directed input-output in FORTRAN. A unifying computational method for the analysis of complete factorial experiments. Letters to the editor: An interpretive input routine for linear programming. A code for non-numeric information processing applications in online systems. System performance evaluation: survey and appraisal. A university's educational program in computer science. Covering the computer field. ACM has a crisis of identity?