default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 16, 1969
Volume 16, Number 1, January 1969
- Gerard Salton:
A Policy for JACM. 1 - Richard Wesley Hamming:
One Man's View of Computer Science. 3-12 - W. S. Brown, Joseph F. Traub:
MERCURY: H system for the computer-aided distribution of technical reports. 13-25 - Manfred Kochen:
Automatic Question-Answering of English-Like Questions About Simple Diagrams. 26-48 - J. R. Guard, F. C. Oglesby, J. H. Bennett, L. G. Settle:
Semi-Automated Mathematics. 49-62 - Heinz H. Trauboth:
Recursive Formulas for the Evaluation of the Convolutions Integral. 63-72 - Edward G. Coffman Jr.:
Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System. 73-90 - Sheila A. Greibach:
An Infinite Hierarchy of Context-Free Languages. 91-106 - Daniel J. Rosenkrantz:
Programmed Grammars and Classes of Formal Languages. 107-131 - Janusz A. Brzozowski, Rina S. Cohen:
On Decompositions of Regular Events. 132-144 - Gregory J. Chaitin:
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations. 145-159 - Juris Hartmanis:
On the Complexity of Undecidable Problems in Automata Theory. 160-167 - John E. Hopcroft, Jeffrey D. Ullman:
Some Results on Tape-Bounded Turing Machines. 168-177 - Abraham Waksman:
A Model of Replication. 178-188
Volume 16, Number 2, April 1969
- James R. Slagle, John K. Dixon:
Experiments With Some Programs That Search Game Trees. 189-207 - Jerzy W. Grzymala-Busse:
Automorphisms of Polyadic Automata. 208-219 - Albert R. Meyer:
A Note on Star-Free Events. 220-225 - R. G. Reynolds, W. F. Cutlip:
Synchronizations and General Repetitive Machines, with Applications to Ultimate Definite Automata. 226-234 - Philip M. Spira:
The Time Required for Group Multiplication. 235-243 - Zohar Manna:
Properties of Programs and the First-Order Predicate Calculus. 244-255 - Hermann A. Maurer:
A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language. 256-260 - Peter Wegner:
Translation Networks and Function Composition. 261-263 - H. P. Edmundson:
New Methods in Automatic Extracting. 264-285 - Gerald Berman:
Lattice Approximations to the Minima of Functions of Several Variables. 286-294 - Peter Linz:
Linear Multistep Methods for Volterra Integro-Differential Equations. 295-301 - Marshall C. Pease:
Inversion of Matrices by Partitioning. 302-314 - Igal Adiri, Benjamin Avi-Itzhak:
A Time-Sharing Queue with a Finite Number of Customers. 315-323 - Robert A. Di Paola:
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas. 324-327 - Paul R. Young:
Toward a Theory of Enumerations. 328-348
Volume 16, Number 3, July 1969
- Donald W. Loveland:
A Simplified Format for the Model Elimination Theorem-Proving Procedure. 349-363 - Erik Sandewall:
A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees. 364-382 - Alfred V. Aho:
Nested Stack Automata. 383-406 - Gregory J. Chaitin:
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers. 407-422 - Tadao Kasami, Koji Torii:
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars. 423-431 - Jerzy W. Grzymala-Busse:
On the Periodic Representations and the Reducibility of Periodic Automata. 432-441 - C. L. Liu:
Lattice Functions, Pair Algebras, and Finite-State Machines. 442-454 - Dennis M. Moyles, Gerald L. Thompson:
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph. 455-460 - Irving S. Reed, Rein Turn:
A Generalization of Shift-Register Sequence Generators. 461-473 - Marshall C. Pease:
Organization of Large Scale Fourier Processors. 474-482 - James N. Lyness:
Notes on the Adaptive Simpson Quadrature Routine. 483-495 - H. S. Rahme:
A New Look at the Numerical Integration of Ordinary Differential Equations. 496-506 - A. Tal:
On Monotone Decomposable Operators. 507-510 - Tamio Shimizu:
A Stochastic Approximation Method for Optimization Problems. 511-516
Volume 16, Number 1, October 1969
- George W. Ernst:
Sufficient Conditions for the Success of GPS. 517-533 - Ugo Montanari:
Continuous Skeletons from Digitized Images. 534-549 - Jeffrey D. Ullman:
Halting Stack Automata. 550-563 - Norman E. Gibbs:
A Cycle Generation Algorithm for Finite Undirected Linear Graphs. 564-568 - Sakti P. Ghosh, Michael E. Senko:
File Organization: On the Selection of Random Access Index Points for Sequential Files. 569-579 - George Loizou:
Nonnormality and Jordan Condition Numbers of Matrices. 580-584 - A. Zafarullah:
Finite Difference Scheme for a Third Boundary Value Problem. 585-591 - Shalhav Zohar:
Toeplitz Matrix Inversion: The Algorithm of W. F. Trench. 592-601 - Howard Frank:
Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems. 602-620 - Robert A. Di Paola:
Random Sets in Subrecursive Hierarchies. 621-630 - Igal Adiri:
Computer Time-Sharing Queues with Priorities. 631-645 - Edward G. Coffman Jr.:
Erratum: "Analysis of a Drum Input/Output Queue Under Scheduled Operation in a Paged Computer System". 646 - Jerzy W. Grzymala-Busse:
Erratum: "Automorphisms of polyadic automata". 646 - Donald W. Loveland:
Erratum: "Mechanical Theorem-Proving by Model Elimination". 646
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.
last updated on 2024-11-11 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
