The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1979, volume: 26, number: 1

  1. Rainer Parchmann
    Control System Model for Critically Timed Sources. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:1-5 [Journal]
  2. Alan Jay Smith
    Characterizing the Storage Process and Its Effect on the Update of Main Memory by Write Through. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:6-27 [Journal]
  3. Udaiprakash Gupta
    Bounds on Storage for Consecutive Retrieval. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:28-36 [Journal]
  4. Alberto O. Mendelzon
    On Axiomatizing Multivalued Dependencies in Relational Databases. [Citation Graph (5, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:37-44 [Journal]
  5. Steven P. Reiss
    Security in Databases: A Combinatorial Study. [Citation Graph (6, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:45-57 [Journal]
  6. Zvi Galil, Nimrod Megiddo
    A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:58-64 [Journal]
  7. James M. Lemme, John R. Rice
    Speedup in Parallel Algorithms for Adaptive Quadrature. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:65-71 [Journal]
  8. Garry H. Rodrigue, Niel K. Madsen, Jack I. Karush
    Odd-Even Reduction for Banded Linear Equations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:72-81 [Journal]
  9. George S. Fishman, Louis R. Moore
    Estimating the Mean of a Correlated Binary Sequence with an Application to Discrete Event Simulation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:82-94 [Journal]
  10. Christos H. Papadimitriou
    Optimality of the Fast Fourier transform. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:95-102 [Journal]
  11. Walter J. Savitch, Michael J. Stimson
    Time Bounded Random Access Machines with Parallel Processing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:103-118 [Journal]
  12. John C. Cherniavsky, Samuel N. Kamin
    A Complete and Consistent Hoare Axiomatics for a Simple Programming Language. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:119-128 [Journal]
  13. Edmund M. Clarke
    Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:129-147 [Journal]
  14. Gérard Berry, Jean-Jacques Lévy
    Minimal and Optimal Computations of Recursive Programs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:148-175 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002