The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
2005, volume: 52, number: 2

  1. Camil Demetrescu, Giuseppe F. Italiano
    Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:147-156 [Journal]
  2. Nir Ailon, Bernard Chazelle
    Lower bounds for linear degeneracy testing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:157-171 [Journal]
  3. Ronen Shaltiel, Christopher Umans
    Simple extractors for all min-entropies and a new pseudorandom generator. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:172-216 [Journal]
  4. Micah Adler
    Trade-offs in probabilistic packet marking for IP traceback. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:217-244 [Journal]
  5. Tova Milo, Victor Vianu
    Introduction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:245- [Journal]
  6. Marcelo Arenas, Leonid Libkin
    An information-theoretic approach to normal forms for relational and XML data. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:246-283 [Journal]
  7. Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
    The complexity of XPath query evaluation and XML typing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:2, pp:284-335 [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