1. Approximate string matching with suffix automata

   • Esko Ukkonen
   • Derick Wood

   OriginalPaper Pages: 353 - 364

2. A Long-step barrier method for convex quadratic programming

   • K. M. Anstreicher
   • D. den Hertog
   • T. Terlaky

   OriginalPaper Pages: 365 - 382

3. A lower bound on the period length of a distributed scheduler

   • Yossi Malka
   • Shlomo Moran
   • Shmuel Zaks

   OriginalPaper Pages: 383 - 398

4. Geometric knapsack problems

   • Esther M. Arkin
   • Samir Khuller
   • Joseph S. B. Mitchell

   OriginalPaper Pages: 399 - 427