The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1981, volume: 28, number: 4

  1. Wolfgang Bibel
    On Matrices with Connections. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:633-645 [Journal]
  2. Donald W. Loveland, C. R. Reddy
    Deleting Repeated Goals in the Problem Reduction Format. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:646-661 [Journal]
  3. Guy Latouche
    Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:662-679 [Journal]
  4. David Maier, Yehoshua Sagiv, Mihalis Yannakakis
    On the Complexity of Testing Implications of Functional and Join Dependencies. [Citation Graph (13, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:680-695 [Journal]
  5. Michael L. Fredman
    A Lower Bound on the Complexity of Orthogonal Range Queries. [Citation Graph (3, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:696-705 [Journal]
  6. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen
    A Morphic Representation of Complements of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:706-714 [Journal]
  7. Mehdi Jazayeri
    A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:715-720 [Journal]
  8. Ernest Davis, Jeffrey M. Jaffe
    Algorithms for Scheduling Tasks on Unrelated Processors. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:721-736 [Journal]
  9. Stefania Gnesi, Ugo Montanari, Alberto Martelli
    Dynamic Programming as Graph Searching: An Algebraic Approach. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:737-751 [Journal]
  10. Naoki Katoh, Toshihide Ibaraki, H. Mine
    An Algorithm for the K Best Solutions of the Resource Allocation Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:752-764 [Journal]
  11. Christos H. Papadimitriou
    On the complexity of integer programming. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:765-768 [Journal]
  12. Robert E. Shostak
    Deciding Linear Inequalities by Computing Loop Residues. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:769-779 [Journal]
  13. Andrew Chi-Chih Yao
    A Lower Bound to Finding Convex Hulls. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:780-787 [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