The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1989, volume: 36, number: 1

  1. John H. Muller, Jeremy Spinrad
    Incremental modular decomposition. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:1-19 [Journal]
  2. Janusz A. Brzozowski, Carl-Johan H. Seger
    A unified framework for race analysis of asynchronous networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:20-45 [Journal]
  3. William McCune, Lawrence J. Henschen
    Maintaining state constraints in relational databases: a proof theoretic basis. [Citation Graph (9, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:46-68 [Journal]
  4. Jeffrey F. Naughton
    Minimizing function-free recursive inference rules. [Citation Graph (6, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:69-91 [Journal]
  5. Jens M. Dill
    A counter-example for ``A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:92-96 [Journal]
  6. Paul Helman
    A common schema for dynamic programming and branch and bound algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:97-128 [Journal]
  7. Joan Boyar
    Inferring sequences produced by pseudo-random number generators. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:129-141 [Journal]
  8. Michael Kaminski
    A note on probabilistically verifying integer and polynomial products. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:142-149 [Journal]
  9. Michael Kaminski, Nader H. Bshouty
    Multiplicative complexity of polynomial multiplication over finite fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:150-170 [Journal]
  10. Edmundo de Souza e Silva, H. Richard Gail
    Calculating availability and performability measures of repairable computer systems using randomization. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:171-193 [Journal]
  11. Edmundo de Souza e Silva, Stephen S. Lavenberg
    Calculating joint queue-length distributions in product-form queuing networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:194-207 [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