Journals in DBLP

Algorithmica
1999, volume: 23, number: 2

1. Luc Devroye
   A Note on the Expected Time for Finding Maxima by List Algorithms. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1999, v:23, n:2, pp:97-108 [Journal]
   
2. S. Nicoloso, Majid Sarrafzadeh, X. Song
   On the Sum Coloring Problem on Interval Graphs. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1999, v:23, n:2, pp:109-126 [Journal]
   
3. Ricardo A. Baeza-Yates, Gonzalo Navarro
   Faster Approximate String Matching. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1999, v:23, n:2, pp:127-158 [Journal]
   
4. Konstantinos Kalpakis, Yaacov Yesha
   Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1999, v:23, n:2, pp:159-179 [Journal]
   
5. Marek Chrobak, John Noga
   LRU Is Better than FIFO. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 1999, v:23, n:2, pp:180-185 [Journal]