Journal of the ACM, Volume 21, 1974
Volume 21, Number 1, January 1974
David G. Herr: On a Statistical Model of Strand and Westwater for the Numerical Solution of a Fredholm Integral Equation of the First Kind. 1-5- Nai-Kuan Tsao: Some a Posteriori Error Bounds in Floating-Point Computations. 6-17
- Peter A. Franaszek, T. J. Wagner: Some Distribution-Free Aspects of Paging Algorithm Performance. 31-39
- Debasis Mitra: Some Aspects of Hierarchical Memory Systems. 54-65
- Kenneth C. Sevcik: Scheduling for Minimum Total Loss Using Service Time Distributions. 66-75
- Christopher Earnest: Some Topics in Code Optimization. 76-102
- Michael A. Crane, Donald L. Iglehart: Simulating Stable Stochastic Systems, I: General Multiserver Queues. 103-113
- Michael A. Crane, Donald L. Iglehart: Simulating Stable Stochastic Systems, II: Markov Chains. 114-123
- S. Fleisig, Donald W. Loveland, A. K. Smiley III, D. L. Yarmush: An Implementation of the Model Elimination Proof Procedure. 124-139
- Walter H. Kohler, Kenneth Steiglitz: Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems. 140-156
- Mary Shaw, J. F. Traub: On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives. 161-167
Volume 21, Number 2, April 1974
- Ross A. Overbeek: A New Class of Automated Theorem-Proving Algorithms. 191-200
- Richard P. Brent: The Parallel Evaluation of General Arithmetic Expressions. 201-206
- David Pager: Further Results on the Problem of Finding Minimal Length Programs for Decision Tables. 207-212
- Peter Elias: Efficient Storage and Retrieval by Content and Address of Static Files. 246-260
- Shalhav Zohar: The Solution of a Toeplitz Set of Linear Equations. 272-276
- Ellis Horowitz, Sartaj Sahni: Computing Partitions with Applications to the Knapsack Problem. 277-292
- William J. Gordon, Richard F. Riesenfeld: Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces. 293-310
- Charles B. Dunham: Efficiency of Chebyshev Approximation on Finite Subsets. 311-313
- Hisashi Kobayashi: Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions. 316-328
- J. A. Michel, Edward G. Coffman Jr.: Synthesis of a Feedback Queueing Discipline for Computer Operation. 329-339
- Manfred H. Hueckel: Erratum: ``A Local Visual Operator Which Recognizes Edges and Lines''. 350
- Christopher Earnest: Corrigendum: ``Some Topics in Code Optimization''. 350
Volume 21, Number 3, July 1974
- Ramachendra P. Batni, Jeffrey D. Russell, Charles R. Kime: An Efficient Algorithm for Finding an Irredundant Set Cover. 351-355
- Robert M. Haralick: The Diclique Representation and Decomposition of Binary Relations. 356-366
- Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson: Efficiency of a Binary Comparison Storage Technique. 376-384
- Chung C. Wang: An Algorithm for the Chromatic Number of a Graph. 385-391
- C. K. Wong, Don Coppersmith: A Combinatorial Problem Related to Multimodule Memory Organizations. 392-402
- Gregory J. Chaitin: Information-Theoretic Limitations of Formal Systems. 403-424
- Lenhart K. Schubert: Iterated Limiting Recursion and the Program Minimization Problem. 436-445
- Thomas N. Hibbard: Context-Limited Grammars. 446-453
- Paul L. Richman: Computing a Subinterval of the Image. 454-458
- Hisashi Kobayashi: Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling. 459-469
- John Michael Robson: Bounds for Some Functions Concerning Dynamic Storage Allocation. 491-499
- Mandell Bellmore, Saman Hong: Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem. 500-504
- Leslie E. Trotter Jr., C. M. Shetty: An Algorithm for the Bounded Variable Integer Programming Problem. 505-513
- Trevor I. Fenner, George Loizou: Some New Bounds on the Condition Numbers of Optimally Scaled Matrices. 514-524
Volume 21, Number 4, October 1974
- Philippe G. H. Lehot: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph. 569-575
- Frank Rubin: A Search Procedure for Hamilton Paths and Circuits. 576-580
- Robert J. Plemmons: Linear Least Squares by Elimination and MGS. 581-585
- Paul S. Wang: The Undecidability of the Existence of Zeros of Real Elementary Functions. 586-589
- Arthur J. Nevins: A Human Oriented Logic for Automatic Theorem-Proving. 606-621
- James R. Slagle: Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity. 622-642
- Arnold L. Rosenberg: Allocating Storage for Extendible Arrays. 652-670
- Ravi Sethi: Testing for the Church-Rosser Property. 671-679
- Anthony S. Wojcik, Gernot Metze: An Analysis of Some Relationships Between Post and Boolean Algebras. 680-696
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team