1. A Note on the Expected Time for Finding Maxima by List Algorithms

   • L. Devroye

   Pages: 97 - 108

2. On the Sum Coloring Problem on Interval Graphs

   • S. Nicoloso
   • M. Sarrafzadeh
   • X. Song

   Pages: 109 - 126

3. Faster Approximate String Matching

   • R. Baeza-Yates and G. Navarro

   Pages: 127 - 158

4. Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays

   • K. Kalpakis
   • Y. Yesha

   Pages: 159 - 179

5. LRU Is Better than FIFO

   • M. Chrobak
   • J. Noga

   Pages: 180 - 185