Journals in DBLP

J. ACM
2002, volume: 49, number: 1

1. Lillian Lee
   Fast context-free grammar parsing requires fast boolean matrix multiplication. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:1, pp:1-15 [Journal]
   
2. Seth Pettie, Vijaya Ramachandran
   An optimal minimum spanning tree algorithm. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:1, pp:16-34 [Journal]
   
3. Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas
   On a model of indexability and its bounds for range queries. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:1, pp:35-55 [Journal]
   
4. Frank Neven, Jan Van den Bussche
   Expressiveness of structured document query languages based on attribute grammars. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:1, pp:56-100 [Journal]
   
5. Sibsankar Haldar, Paul M. B. Vitányi
   Bounded concurrent timestamp systems using vector clocks. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2002, v:49, n:1, pp:101-126 [Journal]