The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1983, volume: 30, number: 1

  1. A. Bagchi, A. Mahanti
    Search Algorithms Under Different Kinds of Heuristics-A Comparative Study [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:1-21 [Journal]
  2. Dennis de Champeaux
    Bidirectional Heuristic Search Again [Citation Graph (1, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:22-32 [Journal]
  3. Dilip V. Sarwate
    A Note on ``A Note on Multiple Error Detection in ASCII Numeric Data Communication'' [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:33-35 [Journal]
  4. Anthony C. Klug
    Locking Expressions for Increased Database Concurrency [Citation Graph (6, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:36-54 [Journal]
  5. Henry F. Korth
    Locking Primitives in a Database System [Citation Graph (46, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:55-79 [Journal]
  6. Greg N. Frederickson
    Implicit Data Structures for the Dictionary Problem [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:80-94 [Journal]
  7. Hermann A. Maurer, Arto Salomaa, Derick Wood
    A Supernormal-Form Theorem for Context-Free Grammars [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:95-102 [Journal]
  8. R. E. Lord, J. S. Kowalik, S. P. Kumar
    Solving Linear Algebraic Equations on an MIMD Computer [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:103-117 [Journal]
  9. Bezalel Gavish
    Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:118-132 [Journal]
  10. Ravindran Kannan
    Polynomial-Time Aggregation of Integer Programming Problems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:133-145 [Journal]
  11. Rolf Schassberger, Hans Daduna
    The Time for a Round Trip in a Cycle of Exponential Queues [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:146-150 [Journal]
  12. Steven Fortune, Daniel Leivant, Michael O'Donnell
    The Expressiveness of Simple and Second-Order Type Structures [Citation Graph (1, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:151-185 [Journal]
  13. H. Raymond Strong
    Vector Execution of Flow Graphs [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:186-196 [Journal]
  14. Krzysztof R. Apt
    Formal Justification of a Proof System for Communicating Sequential Processes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:197-216 [Journal]
  15. Oscar H. Ibarra, Shlomo Moran
    Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:1, pp:217-228 [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