The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1978, volume: 25, number: 3

  1. Malcolm C. Harrison, Norman Rubin
    Another Generalization of Resolution. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:341-351 [Journal]
  2. Lawrence H. Landweber, Edward L. Robertson
    Properties of Conflict-Free and Persistent Petri Nets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:352-364 [Journal]
  3. Dennis G. Kafura, V. Y. Shen
    An Algorithm to Design the Memory Configuration of a Computer Network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:365-377 [Journal]
  4. Gururaj S. Rao
    Performance Analysis of Cache Memories. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:378-395 [Journal]
  5. Doron Rotem, Yaakov L. Varol
    Generation of Binary Trees from Ballot Sequences. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:396-404 [Journal]
  6. Ivan Hal Sudborough
    On the Tape Complexity of Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:405-414 [Journal]
  7. Herbert S. Wilf
    A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:415-420 [Journal]
  8. A. C. McKellar, C. K. Wong
    Dynamic Placement of Records in Linear Storage. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:421-434 [Journal]
  9. Robert S. Garfinkel, K. C. Gilbert
    The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:435-448 [Journal]
  10. Donald L. Iglehart, Gerald S. Shedler
    Regenerative Simulation of Response Times in Networks of Queues. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:449-460 [Journal]
  11. C. A. R. Hoare
    Some Properties of Predicate Transformers. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:461-480 [Journal]
  12. Jon T. Butler
    Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:481-498 [Journal]
  13. M. R. Garey, David S. Johnson
    ``Strong'' NP-Completeness Results: Motivation, Examples, and Implications. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:499-508 [Journal]
  14. Nicholas Pippenger
    A Time-Space Trade-Off. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:509-515 [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