The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Robert W. Floyd, Jeffrey D. Ullman
    The Compilation of Regular Expressions into Integrated Circuits. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:603-622 [Journal]
  2. K. Takamizawa, Takao Nishizeki, Nobuji Saito
    Linear-time computability of combinatorial problems on series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:623-641 [Journal]
  3. David Nassimi, Sartaj Sahni
    Parallel permutation and sorting algorithms and a new generalized connection network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:642-667 [Journal]
  4. Peter Honeyman
    Testing satisfaction of functional dependencies. [Citation Graph (50, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:668-677 [Journal]
  5. Seymour Ginsburg, Sami Mohammed Zaiddan
    Properties of functional-dependency families. [Citation Graph (8, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:678-698 [Journal]
  6. Anthony C. Klug
    Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. [Citation Graph (79, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:699-717 [Journal]
  7. Mihalis Yannakakis
    A Theory of Safe Locking Policies in Database Systems. [Citation Graph (22, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:718-740 [Journal]
  8. Dana Angluin
    Inference of Reversible Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:741-765 [Journal]
  9. Harold N. Gabow
    An Almost-Linear Algorithm for Two-Processor Scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:766-780 [Journal]
  10. Errol L. Lloyd
    Critical Path Scheduling with Resource and Processor Constraints. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:781-811 [Journal]
  11. Charles U. Martel
    Preemptive Scheduling with Release Times, Deadlines, and Due Times. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:812-829 [Journal]
  12. Christopher L. Samelson, William G. Bulgren
    A Note on Product-Form Solution for Queuing Networks with Poisson Arrivals and General Service-Time Distributions with Finite Means. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:830-840 [Journal]
  13. Krzysztof R. Apt, Maarten H. van Emden
    Contributions to the Theory of Logic Programming. [Citation Graph (34, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:841-862 [Journal]
  14. Eitan M. Gurari, Oscar H. Ibarra
    Two-Way Counter Machines and Diophantine Equations. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:863-873 [Journal]
  15. Mark Jerrum, Marc Snir
    Some Exact Complexity Results for Straight-Line Computations over Semirings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:874-897 [Journal]
  16. Andrew Chi-Chih Yao
    On Parallel Computation for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:898-903 [Journal]
  17. Richard P. Brent, H. T. Kung
    Corrigendum: ``The Area-Time Complexity of Binary Multiplication''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:904- [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