Compressing Two-Dimensional Routing Tables Subhash SuriTuomas SandholmPriyank Warkhede OriginalPaper Pages: 287 - 300
An Explicit Lower Bound for TSP with Distances One and Two Engebretsen OriginalPaper Pages: 301 - 319
Detecting Race Conditions in Parallel Programs that Use Semaphores KleinNetzerLu OriginalPaper Pages: 321 - 345
Approximate Matching of Run-Length Compressed Strings MäkinenUkkonenNavarro OriginalPaper Pages: 347 - 369