The ACM Journal of Experimental Algorithmics

VOLUME 8, 2003

Special Issue Articles

Dedicated to selected papers from the Fourth Workshop on Algorithms and Engineering, held in January 2003, with guest co-editors Erik Demaine and Richard Ladner.

Article 1:
Approximate Minimum Enclosing Balls in High Dimensions Using Core-Sets , by Piyush Kumar, Joseph S. B. Mitchell and Alper Yildirim.

Article 2:
I/O-Efficient Point Location Using Persistent B-Trees, by Lars Arge, Andrew Danner, and Sha-Mayn Teh.

Article 3:
Fast Prefix Matching of Bounded Strings, by Adam L. Buchsbaum, Glenn S. Fowlder, Balachander Kirishnamurthy, Kiem-Phong Vo and Jia Wang.

Regular Articles:

Article 4:
A Learning Algorithm for the Longest Common Subsequence Problem, by Eric Breimer, Darren Lim, and Mark Goldberg.

Article 5:
A Blocked All-Pairs Shortest-Paths Algorithm, by Gayathri Venkataraman, Sartaj Sahni, and Srabani Mukhopadhyaya.

Article 6:
Experiments on the Minimum Linear Arrangement Problem, by Jordi Petit.