Journals in DBLP

ACM Journal of Experimental Algorithms
2003, volume: 8, number:

1. Lars Arge, Andrew Danner, Sha-Mayn Teh
   I/O-efficient point location using persistent B-trees. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
   
2. Eric Breimer, Mark K. Goldberg, Darren T. Lim
   A learning algorithm for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
   
3. Jordi Petit
   Experiments on the minimum linear arrangement problem. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
   
4. Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang
   Fast prefix matching of bounded strings. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
   
5. Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim
   Approximate minimum enclosing balls in high dimensions using core-sets. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
   
6. Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya
   A blocked all-pairs shortest-paths algorithm. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]