Journals in DBLP

J. ACM
1974, volume: 21, number: 1

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