The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1982, volume: 29, number: 2

  1. Steve Winker
    Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:273-284 [Journal]
  2. Christos H. Papadimitriou, Mihalis Yannakakis
    The complexity of restricted spanning tree problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:285-309 [Journal]
  3. Barry E. Jacobs
    On Database Logic. [Citation Graph (35, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:310-332 [Journal]
  4. Y. Edmund Lien
    On the Equivalence of Database Models. [Citation Graph (48, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:333-362 [Journal]
  5. Fereidoon Sadri, Jeffrey D. Ullman
    Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization. [Citation Graph (9, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:363-372 [Journal]
  6. Edward Sciore
    A Complete Axiomatization of Full Join Dependencies. [Citation Graph (10, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:373-393 [Journal]
  7. Ravi Sethi
    Useless Actions Make a Difference: Strict Serializability of Database Updates. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:394-403 [Journal]
  8. Christopher Bader, Arnaldo Moura
    A Generalization of Ogden's Lemma. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:404-407 [Journal]
  9. Jacques Cohen, Timothy J. Hickey, Joel Katcoff
    Upper Bounds for Speedup in Parallel Parsing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:408-428 [Journal]
  10. Harry B. Hunt III
    On the Decidability of Grammar Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:429-447 [Journal]
  11. Theodore Brown
    Determination of the conditional response for quantum allocation algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:448-460 [Journal]
  12. R. M. Bryant
    Maximum Processing Rates of Memory Bound Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:461-477 [Journal]
  13. Hisao Kameda
    A Finite-Source Queue with Different Customers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:478-491 [Journal]
  14. Simon S. Lam
    Dynamic Scaling and Growth Behavior of Queuing Network Normalization Constants. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:492-513 [Journal]
  15. Manfred Ruschitzka
    The Performance of Job Classes with Distinct Policy Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:514-526 [Journal]
  16. Percy Tzelnic, Izidor Gertner
    An Approach to Program Behavior Modeling and Optimal Memory Control. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:527-554 [Journal]
  17. Albert R. Meyer, Joseph Y. Halpern
    Axiomatic Definitions of Programming Languages: A Theoretical Assessment. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:555-576 [Journal]
  18. Michael A. Arbib, Ernest G. Manes
    The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:577-602 [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