Volume 35, Issue 1 | Algorithmica

Search all Algorithmica articles

Volume 35, Issue 1

January 2003

Filter by

Volume:

Sort by

Date published:

New to old Old to new

4 articles in this issue

Reporting Red—Blue Intersections between Two Sets of Connected Line Segments
Julien Basch
Leonidas J. Guibas
Ramkumar
Pages: 1 - 20
Fast Concurrent Access to Parallel Disks
Sanders
Egner
Korst
Pages: 21 - 55
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast
Nardelli
Proietti
Widmayer
Pages: 56 - 74
Scanning Multiple Sequences via Cache Memory
Mehlhorn
Sanders
Pages: 75 - 93