Journal: Journal of the ACM

Volume 21, Issue 4

525 -- 548Michael A. Harrison, Ivan M. Havel. On the Parsing of Deterministic Languages
549 -- 568John E. Hopcroft, Robert Endre Tarjan. Efficient Planarity Testing
569 -- 575Philippe G. H. Lehot. An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
576 -- 580Frank Rubin. A Search Procedure for Hamilton Paths and Circuits
581 -- 585Robert J. Plemmons. Linear Least Squares by Elimination and MGS
586 -- 589Paul S. Wang. The Undecidability of the Existence of Zeros of Real Elementary Functions
590 -- 605Lawrence J. Henschen, Larry Wos. Unit Refutations and Horn Sets
606 -- 621Arthur J. Nevins. A Human Oriented Logic for Automatic Theorem-Proving
622 -- 642James R. Slagle. Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
643 -- 651H. T. Kung, J. F. Traub. Optimal Order of One-Point and Multipoint Iteration
652 -- 670Arnold L. Rosenberg. Allocating Storage for Extendible Arrays
671 -- 679Ravi Sethi. Testing for the Church-Rosser Property
680 -- 696Anthony S. Wojcik, Gernot Metze. An Analysis of Some Relationships Between Post and Boolean Algebras

Volume 21, Issue 3

351 -- 355Ramachendra P. Batni, Jeffrey D. Russell, Charles R. Kime. An Efficient Algorithm for Finding an Irredundant Set Cover
356 -- 366Robert M. Haralick. The Diclique Representation and Decomposition of Binary Relations
367 -- 375Matthew S. Hecht, Jeffrey D. Ullman. Characterizations of Reducible Flow Graphs
376 -- 384Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson. Efficiency of a Binary Comparison Storage Technique
385 -- 391Chung C. Wang. An Algorithm for the Chromatic Number of a Graph
392 -- 402C. K. Wong, Don Coppersmith. A Combinatorial Problem Related to Multimodule Memory Organizations
403 -- 424Gregory J. Chaitin. Information-Theoretic Limitations of Formal Systems
425 -- 435John Gill, Manuel Blum. On Almost Everywhere Complex Recursive Functions
436 -- 445Lenhart K. Schubert. Iterated Limiting Recursion and the Program Minimization Problem
446 -- 453Thomas N. Hibbard. Context-Limited Grammars
454 -- 458Paul L. Richman. Computing a Subinterval of the Image
459 -- 469Hisashi Kobayashi. Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling
470 -- 490Alan G. Konheim, Bernd Meister. Waiting Lines and Times in a System with Polling
491 -- 499John Michael Robson. Bounds for Some Functions Concerning Dynamic Storage Allocation
500 -- 504Mandell Bellmore, Saman Hong. Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
505 -- 513Leslie E. Trotter Jr., C. M. Shetty. An Algorithm for the Bounded Variable Integer Programming Problem
514 -- 524Trevor I. Fenner, George Loizou. Some New Bounds on the Condition Numbers of Optimally Scaled Matrices

Volume 21, Issue 2

175 -- 190Donald Michie, E. E. Sibert. Some Binary Derivation Systems
191 -- 200Ross A. Overbeek. A New Class of Automated Theorem-Proving Algorithms
201 -- 206Richard P. Brent. The Parallel Evaluation of General Arithmetic Expressions
207 -- 212David Pager. Further Results on the Problem of Finding Minimal Length Programs for Decision Tables
213 -- 226Armen Gabrielian, Seymour Ginsburg. Grammar Schemata
227 -- 232G. Berman, A. W. Colijn. A Modified List Technique Allowing Binary Search
233 -- 245Robert T. Chien, E. A. Mark. A Document Storage Method Based on Polarized Distance
246 -- 260Peter Elias. Efficient Storage and Retrieval by Content and Address of Static Files
261 -- 271M. M. Blevins, G. W. Stewart. Calculating the Eigenvectors of Diagonally Dominant Matrices
272 -- 276Shalhav Zohar. The Solution of a Toeplitz Set of Linear Equations
277 -- 292Ellis Horowitz, Sartaj Sahni. Computing Partitions with Applications to the Knapsack Problem
293 -- 310William J. Gordon, Richard F. Riesenfeld. Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces
311 -- 313Charles B. Dunham. Efficiency of Chebyshev Approximation on Finite Subsets
314 -- 315E. Balkovich, W. Chiu, Leon Presser, R. Wood. Comments on a Paper by Gaver
316 -- 328Hisashi Kobayashi. Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
329 -- 339J. A. Michel, Edward G. Coffman Jr.. Synthesis of a Feedback Queueing Discipline for Computer Operation
340 -- 349Steven Katz, Alan G. Konheim. Priority Disciplines in a Loop System
350 -- 0Manfred H. Hueckel. Erratum: A Local Visual Operator Which Recognizes Edges and Lines
350 -- 0Christopher Earnest. Corrigendum: Some Topics in Code Optimization

Volume 21, Issue 1

1 -- 5David G. Herr. On a Statistical Model of Strand and Westwater for the Numerical Solution of a Fredholm Integral Equation of the First Kind
6 -- 17Nai-Kuan Tsao. Some a Posteriori Error Bounds in Floating-Point Computations
18 -- 30L. W. Cotten, A. M. Abd-Alla. Processing Times for Segmented Jobs with I/O Compute Overlap
31 -- 39Peter A. Franaszek, T. J. Wagner. Some Distribution-Free Aspects of Paging Algorithm Performance
40 -- 53Giorgio P. Ingargiola, James F. Korsh. Finding Optimal Demand Paging Algorithms
54 -- 65Debasis Mitra. Some Aspects of Hierarchical Memory Systems
66 -- 75Kenneth C. Sevcik. Scheduling for Minimum Total Loss Using Service Time Distributions
76 -- 102Christopher Earnest. Some Topics in Code Optimization
103 -- 113Michael A. Crane, Donald L. Iglehart. Simulating Stable Stochastic Systems, I: General Multiserver Queues
114 -- 123Michael A. Crane, Donald L. Iglehart. Simulating Stable Stochastic Systems, II: Markov Chains
124 -- 139S. Fleisig, Donald W. Loveland, A. K. Smiley III, D. L. Yarmush. An Implementation of the Model Elimination Proof Procedure
140 -- 156Walter H. Kohler, Kenneth Steiglitz. Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
157 -- 160Pieter S. Kritzinger, J. W. Graham. A Theorem in the Theory of Compromise Merge Methods
161 -- 167Mary Shaw, J. F. Traub. On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
168 -- 173Robert A. Wagner, Michael J. Fischer. The String-to-String Correction Problem