![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of the ACM, Volume 12, 1965
Volume 12, Number 1, January 1965
- M. W. Curtis:
A Turing Machine Simulator. 1-13 - Robert M. McClure:
A Programming Language for Simulating Digital Systems. 14-22 - John Alan Robinson:
A Machine-Oriented Logic Based on the Resolution Principle. 23-41 - Sheila A. Greibach:
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. 42-52 - Eric Wolman:
A Fixed Optimum Cell-Size for Records of Various Lengths. 53-70 - H. Glass, Leon Cooper:
Sequential Search: A Method for Solving Constrained Optimization Problems. 71-82 - M. Donald MacLaren, George Marsaglia:
Uniform Random Number Generators. 83-89 - Aaron Booker:
Numerical Evaluation of Symmetric Polynomials. 90-94 - Roger W. Hockney:
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis. 95-113 - J. H. Bramble, B. E. Hubbard:
Approximation of Solutions of Mixed Boundary Value Problems for Poisson's Equation by Finite Differences. 114-123 - John C. Butcher:
A Modified Multistep Method for the Numerical Integration of Ordinary Differential Equations. 124-135 - Edward B. Anders:
An Error Bound for a Numerical Filtering Technique. 136-140 - Arthur Gill:
Analysis and Synthesis of Stable Linear Sequential Circuits. 141-149
Volume 12, Number 2, April 1965
- Paul W. Broome:
Discrete Orthonormal Sequences. 151-168 - David G. Moursund:
Examination of Multiple Roots and Root Clusters of a Polynomial Using the Bernoulli Procedure. 169-174 - R. D. Glauz:
On the Numerical Solution of Ordinary and Partial Differential Equations Using Integral Relations. 175-180 - Charles B. Dunham:
Convergence Problems in Maehly's Second Method. 181-186 - Gerard P. Weeg:
The Automorphism Group of the Direct Product of Strongly Related Automata. 187-195 - Shen Lin, Tibor Rado:
Computer Studies of Turing Machine Problems. 196-212 - John T. Chu:
Optimal Decision Functions for Computer Character Recognition. 213-226 - R. L. Crane, R. W. Klopfenstein:
A Predictor-Corrector Algorithm with an Increased Range of Absolute Stability. 227-241 - Herbert Kanner:
Number Base Conversion in a Significant Digit Arithmetic. 242-246 - Walter Penney:
A "Binary" System for Complex Numbers. 247-248 - Jerry Sanders:
Document Association and Classification Based on L-Languages. 249-253 - Stephen Glicksman:
Concerning the Merging of Equal Length Tape Files. 254-258 - W. J. Dixon, Richard A. Kronmal:
The Choice of Origin and Scale for Graphs. 259-261 - C. L. Sheng:
Threshold Logic Elements Used as a Probability Transformer. 262-276 - Shmuel Winograd:
On the Time Required to Perform Addition. 277-285 - Russell W. Stineman:
Digital Time-Domain Analysis of Systems with Widely Separated Poles. 286-293
Volume 12, Number 3, July 1965
- W. Fraser:
A Survey of Methods of Computing Minimax and Near-Minimax Polynomial Approximations for Functions of a Single Independent Variable. 295-314 - A. P. Yershóv:
One View of Man-Machine Interaction. 315-325 - Richard W. Conn, Richard E. von Holdt:
An Online Display for the Study of Approximating Functions. 326-349 - M. V. Menon:
On a Problem Concerning a Central Storage Device Served by Multiple Terminals. 350-355 - William K. Winters:
A Modified Method of Latent Class Analysis for File Organization in Information Retrieval. 356-363 - Franco Mileto, Gianfranco R. Putzolu:
Statistical Complexity of Algorithms for Boolean Function Minimization. 364-375 - J. M. S. Simões-Pereira:
On the Boolean Matrix Equation M.... 376-382 - David G. Moursund:
Chebyshev Solution of n+1 Linear Equations in n Unknowns. 383-387 - Patrick C. Fischer:
Generation of Primes by a One-Dimensional Real-Time Iterative Array. 388-394 - D. J. Newman:
Location of the Maximum on Unimodal Surfaces. 395-398 - Azaria Paz, Bezalel Peleg:
Ultimate-Definite and Symmetric-Definite Events and Automata. 399-410 - Michael Yoeli:
Generalized Cascade Decompositions of Automata. 411-422 - Seymour Ginsburg, Edwin H. Spanier:
Mappings of languages by two-tape devices. 423-434 - C. L. Sheng:
Correction. 435
Volume 12, Number 4, October 1965
- Leroy F. Meyers:
Morphological Classification in the National Bureau of Standards Mechanical Translation System. 437-472 - Lauren B. Doyle:
Is Automatic Classification a Reasonable Application of Statistical Analysis of Text? 473-489 - John O'Connor:
Automatic Subject Recognition in Scientific Papers: An Empirical Study. 490-515 - Solomon W. Golomb, Leonard D. Baumert:
Backtrack Programming. 516-524 - A. V. Srinivasan:
An Investigation of Some Computational Aspects of Integer Programming. 525-535 - Larry Wos, George A. Robinson, Daniel F. Carson:
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. 536-541 - T. R. N. Rao, Neal Zierler:
On Mappings for Modular Arithmetic, I. 542-544 - S. Berkovits, M. Schlessinger, Neal Zierler:
On Mappings for Modular Arithmetic, II. 545-546 - Donald G. M. Anderson:
Iterative Procedures for Nonlinear Integral Equations. 547-560 - Bruce H. Barnes:
Groups of Automorphisms and Sets of Equivalence Classes of Input for Automata. 561-565 - Arthur C. Fleck:
On the Automorphism Group of an Automaton. 566-569 - Patrick C. Fischer:
On Formalisms for Turing Machines. 570-580 - Wei Chang, Donald J. Wong:
Analysis of Real Time Multiprogramming. 581-588 - Jack B. Dennis:
Segmentation and the Design of Multiprogrammed Computer Systems. 589-602 - George B. Dantzig, R. P. Harvey, R. D. McKnight:
Updating the Product Form of the Inverse for the Revised Simplex Method. 603
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.