ACM Journal of Experimental Algorithmics, Volume 8

Volume 8, 2003

• Piyush Kumar, Joseph S. B. Mitchell, E. Alper Yildirim:
  Approximate minimum enclosing balls in high dimensions using core-sets.
  Electronic Edition (ACM DL) BibTeX
• Lars Arge, Andrew Danner, Sha-Mayn Teh:
  I/O-efficient point location using persistent B-trees.
  Electronic Edition (ACM DL) BibTeX
• Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang:
  Fast prefix matching of bounded strings.
  Electronic Edition (ACM DL) BibTeX

• Eric Breimer, Mark K. Goldberg, Darren T. Lim:
  A learning algorithm for the longest common subsequence problem.
  Electronic Edition (ACM DL) BibTeX
• Gayathri Venkataraman, Sartaj Sahni, Srabani Mukhopadhyaya:
  A blocked all-pairs shortest-paths algorithm.
  Electronic Edition (ACM DL) BibTeX
• Jordi Petit:
  Experiments on the minimum linear arrangement problem.
  Electronic Edition (ACM DL) BibTeX