Volume 23, Issue 2 | Algorithmica

Search all Algorithmica articles

Volume 23, Issue 2

February 1999

Filter by

Volume:

Sort by

Date published:

New to old Old to new

5 articles in this issue

A Note on the Expected Time for Finding Maxima by List Algorithms
L. Devroye
Pages: 97 - 108
On the Sum Coloring Problem on Interval Graphs
S. Nicoloso
M. Sarrafzadeh
X. Song
Pages: 109 - 126
Faster Approximate String Matching
R. Baeza-Yates and G. Navarro
Pages: 127 - 158
Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays
K. Kalpakis
Y. Yesha
Pages: 159 - 179
LRU Is Better than FIFO
M. Chrobak
J. Noga
Pages: 180 - 185